:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Boutin, Mireille, Coupkova, Evzenie
Format:	Preprint
Published:	2021
Subjects:	Machine Learning Probability 68Q87, 68Q32, 41A10
Online Access:	https://arxiv.org/abs/2108.06339
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Rashomon ratio of infinite hypothesis sets
by: Coupkova, Evzenie, et al.
Published: (2024)

Private Evolution Converges
by: González, Tomás, et al.
Published: (2025)

Analysis of multivariate symbol statistics in primitive rational models
by: Goldwurm, Massimiliano, et al.
Published: (2026)

The Algorithmic Phase Transition in Correlated Spiked Models
by: Li, Zhangsong
Published: (2025)

The discrete Laplace asymptotic method and its application to the 3XOR satisfiability problem
by: Hughes, Jared A., et al.
Published: (2025)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
by: Li, Zhangsong
Published: (2025)

Teaching and Learning under Deductive Errors
by: Telle, Jan Arne, et al.
Published: (2026)

On Approximating the Potts Model with Contracting Glauber Dynamics
by: He, Roxanne, et al.
Published: (2024)

Neural Network Approximation: A View from Polytope Decomposition
by: Li, ZeYu, et al.
Published: (2026)

Autoencoded UMAP-Enhanced Clustering for Unsupervised Learning
by: Chavooshi, Malihehsadat, et al.
Published: (2025)

Beyond Universal Approximation Theorems: Algorithmic Uniform Approximation by Neural Networks Trained with Noisy Data
by: Kratsios, Anastasis, et al.
Published: (2025)

Planting and MCMC Sampling from the Potts model
by: Galanis, Andreas, et al.
Published: (2024)

Low-temperature Sampling on Sparse Random Graphs
by: Galanis, Andreas, et al.
Published: (2025)

Reduced Jeffries-Matusita distance: A Novel Loss Function to Improve Generalization Performance of Deep Classification Models
by: Lashkari, Mohammad, et al.
Published: (2024)

Improved Computational Lower Bound of Estimation for Multi-Frequency Group Synchronization
by: Li, Zhangsong
Published: (2026)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
by: Lin, Tianrong
Published: (2023)

A Refinement of Vapnik--Chervonenkis' Theorem
by: Iosevich, A., et al.
Published: (2026)

Agnostic Learning under Targeted Poisoning: Optimal Rates and the Role of Randomness
by: Chornomaz, Bogdan, et al.
Published: (2025)

A computational transition for detecting correlated stochastic block models by low-degree polynomials
by: Chen, Guanyi, et al.
Published: (2024)

A generalized Wasserstein-2 distance approach for efficient reconstruction of random field models using stochastic neural networks
by: Xia, Mingtao, et al.
Published: (2025)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
by: Chiarini, Alberto, et al.
Published: (2024)

Polynomial Identity Testing via Evaluation of Rational Functions
by: Hu, Ivan, et al.
Published: (2022)

Fractional signature: a generalisation of the signature inspired by fractional calculus
by: Corcuera, José Manuel, et al.
Published: (2024)

Sharp threshold for network recovery from voter model dynamics
by: Du, Hang, et al.
Published: (2025)

Tighter Learning Guarantees on Digital Computers via Concentration of Measure on Finite Spaces
by: Kratsios, Anastasis, et al.
Published: (2024)

Bounds on the Generalization Error in Active Learning
by: Menden, Vincent, et al.
Published: (2024)

Swap Agnostic Learning, or Characterizing Omniprediction via Multicalibration
by: Gopalan, Parikshit, et al.
Published: (2023)

The Price of Robustness: Stable Classifiers Need Overparameterization
by: von Berg, Jonas, et al.
Published: (2026)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
by: Petrov, Petar P.
Published: (2022)

Permutation recovery of spikes in noisy high-dimensional tensor estimation
by: Arous, Gérard Ben, et al.
Published: (2024)

Boosting Test Performance with Importance Sampling--a Subpopulation Perspective
by: Shen, Hongyu, et al.
Published: (2024)

A polynomial-time iterative algorithm for random graph matching with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2023)

Robust random graph matching in Gaussian models via vector approximate message passing
by: Li, Zhangsong
Published: (2024)

The random $k$-SAT Gibbs uniqueness threshold revisited
by: Chatterjee, Arnab, et al.
Published: (2025)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Realizable Learning is All You Need
by: Hopkins, Max, et al.
Published: (2021)

The Role of Randomness in Stability
by: Hopkins, Max, et al.
Published: (2025)

Do PAC-Learners Learn the Marginal Distribution?
by: Hopkins, Max, et al.
Published: (2023)

On Reductions and Representations of Learning Problems in Euclidean Spaces
by: Chornomaz, Bogdan, et al.
Published: (2024)

Parity Requires Unified Input Dependence and Negative Eigenvalues in SSMs
by: Khavari, Behnoush, et al.
Published: (2025)