Archives AI News

Bispectral OT: Dataset Comparison using Symmetry-Aware Optimal Transport

arXiv:2509.20678v1 Announce Type: cross Abstract: Optimal transport (OT) is a widely used technique in machine learning, graphics, and vision that aligns two distributions or datasets using their relative geometry. In symmetry-rich settings, however, OT alignments based solely on pairwise geometric…

Scaling Laws are Redundancy Laws

arXiv:2509.20721v1 Announce Type: cross Abstract: Scaling laws, a defining feature of deep learning, reveal a striking power-law improvement in model performance with increasing dataset and model size. Yet, their mathematical origins, especially the scaling exponent, have remained elusive. In this…

Rosenthal-type inequalities for linear statistics of Markov chains

arXiv:2303.05838v3 Announce Type: replace-cross Abstract: In this paper, we establish novel concentration inequalities for additive functionals of geometrically ergodic Markov chains similar to Rosenthal inequalities for sums of independent random variables. We pay special attention to the dependence of our…

Learning Ising Models under Hard Constraints using One Sample

arXiv:2509.20993v1 Announce Type: cross Abstract: We consider the problem of estimating inverse temperature parameter $beta$ of an $n$-dimensional truncated Ising model using a single sample. Given a graph $G = (V,E)$ with $n$ vertices, a truncated Ising model is a…

Counterfactual Cocycles: A Framework for Robust and Coherent Counterfactual Transports

arXiv:2405.13844v4 Announce Type: replace-cross Abstract: Estimating joint distributions (a.k.a. couplings) over counterfactual outcomes is central to personalized decision-making and treatment risk assessment. Two emergent frameworks with identifiability guarantees are: (i) bijective structural causal models (SCMs), which are flexible but brittle…

Efficient Ensemble Conditional Independence Test Framework for Causal Discovery

arXiv:2509.21021v1 Announce Type: cross Abstract: Constraint-based causal discovery relies on numerous conditional independence tests (CITs), but its practical applicability is severely constrained by the prohibitive computational cost, especially as CITs themselves have high time complexity with respect to the sample…

Inverse Reinforcement Learning Using Just Classification and a Few Regressions

arXiv:2509.21172v1 Announce Type: cross Abstract: Inverse reinforcement learning (IRL) aims to explain observed behavior by uncovering an underlying reward. In the maximum-entropy or Gumbel-shocks-to-reward frameworks, this amounts to fitting a reward function and a soft value function that together satisfy…