arXiv:2606. 19366v1 Announce Type: cross Abstract: Information lattice learning (ILL) learns interpretable rules of a signal by alternately projecting the signal onto a partition lattice that encodes a hierarchy of abstractions and lifting selected rules back to the signal domain.
By Haizi Yu, Lav R. Varshney
arXiv:2410. 06329v4 Announce Type: replace-cross Abstract: Obtaining a reliable estimate of the joint probability mass function (PMF) of a set of random variables from observed data is a significant objective in statistical signal processing and machine learning.
By Joseph K. Chege, Arie Yeredor, Martin Haardt
arXiv:2608. 08118v1 Announce Type: new Abstract: There are several methods for searching for graphs with prescribed properties, such as SAT solvers and specialized generators.
By David Seka, Stefan Szeider
arXiv:2607. 12443v1 Announce Type: cross Abstract: Motivated by the power of large language models, there has been renewed interest in the Gold-Angluin model of language identification in the limit, with an eye toward variants of the model that might overcome the negative results for its original formulation.
By Moses Charikar, Jon Kleinberg, Chirag Pabbaraju
arXiv:2606. 04176v1 Announce Type: new Abstract: We study a distributional generalization of the matrix completion problem in which each entry of the target matrix is a probability distribution rather than a scalar.
By Jiayi Wang, Raymond K. W. Wong
arXiv:2607. 18883v1 Announce Type: cross Abstract: A central aim of unsupervised learning is to uncover latent factors that explain dependencies among observations.
By Lior Fox, Kai Biegun, James Heald, Samo Hromadka, Arielle Rosinski, Maneesh Sahani
arXiv:2607. 15916v1 Announce Type: new Abstract: Central to machine learning and signal processing is the ability to perform universal function approximation and learn complex input-output relationships from limited numbers of observations.
By Niccol\`o Ciolli, Anders Vestergaard N{\o}rskov, Michael Kastoryano, Petr Taborsky, Morten M{\o}rup
arXiv:2605. 11644v2 Announce Type: replace-cross Abstract: We study positive-data learning of languages admitting reduced working binary linear nondeleting multiple context-free grammar presentations of bounded fan-out.
By Takayuki Kuriyama
arXiv:2607. 26357v1 Announce Type: new Abstract: The problem of learning the graphical Markov blanket (MB) of a variable from data has applications in many areas such as structure learning for Bayesian networks and Markov random fields, causal discovery, and feature selection.
By Loong Kuan Lee, Ragavi Krishnamoorthy, Nico Piatkowski
arXiv:2408. 01382v3 Announce Type: replace Abstract: Originating in game theory, Shapley values are widely used for explaining a machine learning model's prediction by quantifying the contribution of each feature's value to the prediction.
By Paul-Gauthier No\'e, Miquel Perell\'o-Nieto, Jean-Fran\c{c}ois Bonastre, Peter Flach
arXiv:2606. 01540v1 Announce Type: cross Abstract: Shapley values are a widely used tool for attributing importance and interactions among input variables in black-box models, but their computation involves a function defined over an exponentially large space of subsets.
By Farzaneh Heidari, Guillaume Rabusseau
arXiv:2608. 01976v1 Announce Type: cross Abstract: Given an algebraic statistical model, a challenging problem is classifying the data according to the number of positive critical points of the likelihood function.
By Xiaoxian Tang, Bican Xia, Tianqi Zhao