arXiv AI
Jul 28
Computational Experiments in Number Theory
arXiv:2504. 19451v4 Announce Type: replace-cross Abstract: This paper presents two concrete applications of Artificial Intelligence to algorithmic and analytic number theory.
Detecting Nonproperness of Likelihood Equations
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.
Related stories
arXiv Machine Learning
Jul 22
Algebraic Signatures for Structural Learning in Probability Tensors
arXiv:2607. 18817v1 Announce Type: cross Abstract: Algebraic statistics characterizes statistical models through polynomial constraints, but it has mainly been used for analytically specified model classes.
arXiv Machine Learning
Jul 20
Testing Distributions Against Bounded Distinguishers
arXiv:2607. 15645v1 Announce Type: cross Abstract: Motivated by the challenge of testing distributions over high-dimensional or continuous domains, we study distribution testing with respect to bounded classes of distinguishers.
arXiv Machine Learning
Jun 5
How abundant are good interpolators?
arXiv:2606. 06469v1 Announce Type: cross Abstract: Let $S$ be the set of unit norm linear classifiers $\theta \in \mathbb{R}^d$ which correctly classify every point of a labeled dataset $(X_i,y_i)_{i=1}^n$, $X_i \in \mathbb{R}^d$, $y_i \in \{-1,+1\}$, with a possibly negative margin $\kappa$ fixed in advance.
arXiv Machine Learning
Jul 21
Totally Positive Matrices and the Highest-Order Coefficients of the Characteristic Polynomial
arXiv:2607. 18148v1 Announce Type: new Abstract: We investigate the extent to which totally positive matrices can be distinguished through the highest-order coefficients of their characteristic polynomials.
arXiv Machine Learning
Jul 7
A Provably-Correct and Robust Convex Model for Smooth Separable NMF
arXiv:2511. 07109v2 Announce Type: replace-cross Abstract: Nonnegative matrix factorization (NMF) is a linear dimensionality reduction technique for nonnegative data, with applications such as hyperspectral unmixing and topic modeling.
arXiv Machine Learning
Jun 15
On Rate-Optimal Partitioning Classification from Observable and from Privatised Data
arXiv:2312. 14889v4 Announce Type: replace-cross Abstract: In this paper we revisit the classical method of partitioning classification and prove novel convergence rates under relaxed conditions, both for observable (non-privatised) and for privatised data.
arXiv Machine Learning
Aug 11
A Probabilistic Circuit-Induced Pseudo-Metric for Out-of-Distribution Detection
arXiv:2608. 09117v1 Announce Type: new Abstract: Probabilistic Circuits (PCs) are tractable generative models whose internal nodes encode a hierarchy of probabilistic sum- maries over different variable scopes.
arXiv Machine Learning
Jun 24
The Degeneracy Distillery
arXiv:2606. 23838v1 Announce Type: new Abstract: When two or more parameters or labels produce similar data, they are degenerate, or hard to distinguish.
arXiv Machine Learning
Jul 15
High-Dimensional Gaussian Mean Estimation under Realizable Contamination
arXiv:2603. 16798v2 Announce Type: replace Abstract: We study mean estimation for a Gaussian distribution with identity covariance in $\mathbb{R}^d$ under a missing data scheme termed realizable $\epsilon$-contamination model.
arXiv Machine Learning
Jun 18
Robust Detection of Planted Subgraphs in Semi-Random Models
arXiv:2508. 02158v2 Announce Type: replace-cross Abstract: Detection of planted subgraphs in Erd\"os-R\'enyi random graphs has been extensively studied, leading to a rich body of results characterizing both statistical and computational thresholds.
Hugging Face Trending Papers
Aug 3
Sharp Root Anti-Concentration via Projective Incidence and Ordered Root Laws
This paper answers the one-dimensional local root anti-concentration questions posed by Balcan, Pegden, and Sharma in the context of online optimization of piecewise-Lipschitz functions. For a homogeneous feature curve and coefficients whose density relative to the uniform law on a symmetric convex body $K$ is bounded by $A$, we show that the worst-case interval-hitting constant equals $A$ times a section-averaged projective incidence speed.