Zobrazeno 1 - 10
of 2 680
pro vyhledávání: '"P A Bryon"'
We consider the problem of estimating a structured multivariate density, subject to Markov conditions implied by an undirected graph. In the worst case, without Markovian assumptions, this problem suffers from the curse of dimensionality. Our main re
Externí odkaz:
http://arxiv.org/abs/2410.07685
Existing approaches to differentiable structure learning of directed acyclic graphs (DAGs) rely on strong identifiability assumptions in order to guarantee that global minimizers of the acyclicity-constrained optimization problem identifies the true
Externí odkaz:
http://arxiv.org/abs/2410.06163
Quality Diversity (QD) has shown great success in discovering high-performing, diverse policies for robot skill learning. While current benchmarks have led to the development of powerful QD methods, we argue that new paradigms must be developed to fa
Externí odkaz:
http://arxiv.org/abs/2407.17515
Large Language Models (LLMs) have the capacity to store and recall facts. Through experimentation with open-source models, we observe that this ability to retrieve facts can be easily manipulated by changing contexts, even without altering their fact
Externí odkaz:
http://arxiv.org/abs/2406.18400
Autor:
Aragam, Bryon
One of the hallmark achievements of the theory of graphical models and Bayesian model selection is the celebrated greedy equivalence search (GES) algorithm due to Chickering and Meek. GES is known to consistently estimate the structure of directed ac
Externí odkaz:
http://arxiv.org/abs/2406.17228
Recent works have argued that high-level semantic concepts are encoded "linearly" in the representation space of large language models. In this work, we study the origins of such linear representations. To that end, we introduce a simple latent varia
Externí odkaz:
http://arxiv.org/abs/2403.03867
To build intelligent machine learning systems, there are two broad approaches. One approach is to build inherently interpretable models, as endeavored by the growing field of causal representation learning. The other approach is to build highly-perfo
Externí odkaz:
http://arxiv.org/abs/2402.09236
We develop optimal algorithms for learning undirected Gaussian trees and directed Gaussian polytrees from data. We consider both problems of distribution learning (i.e. in KL distance) and structure learning (i.e. exact recovery). The first approach
Externí odkaz:
http://arxiv.org/abs/2402.06380
Despite numerous years of research into the merits and trade-offs of various model selection criteria, obtaining robust results that elucidate the behavior of cross-validation remains a challenging endeavor. In this paper, we highlight the inherent l
Externí odkaz:
http://arxiv.org/abs/2312.17047
Autor:
Lee, David H., Palaparthi, Anishalakshmi V., Fontaine, Matthew C., Tjanaka, Bryon, Nikolaidis, Stefanos
Diversity optimization seeks to discover a set of solutions that elicit diverse features. Prior work has proposed Novelty Search (NS), which, given a current set of solutions, seeks to expand the set by finding points in areas of low density in the f
Externí odkaz:
http://arxiv.org/abs/2312.11331