Copertina

Agnostic learning in (almost) optimal time via Gaussian surface area

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Pesenti, Lucas, Slot, Lucas, Wiedmer, Manuel
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Testably Learning Polynomial Threshold Functions
di: Slot, Lucas, et al.
Pubblicazione: (2024)

Universality of first-order methods on random and deterministic matrices
di: Gorini, Nicola, et al.
Pubblicazione: (2026)

Discrepancy Minimization via Regularization
di: Pesenti, Lucas, et al.
Pubblicazione: (2022)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
di: Gayen, Sutanu, et al.
Pubblicazione: (2024)

Agnostic Learning of Arbitrary ReLU Activation under Gaussian Marginals
di: Guo, Anxin, et al.
Pubblicazione: (2024)

Fourier Analysis of Iterative Algorithms
di: Jones, Chris, et al.
Pubblicazione: (2024)

Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints
di: Laber, Eduardo S., et al.
Pubblicazione: (2024)

Unrolled denoising networks provably learn optimal Bayesian inference
di: Karan, Aayush, et al.
Pubblicazione: (2024)

A Competitive Algorithm for Agnostic Active Learning
di: Price, Eric, et al.
Pubblicazione: (2023)

Faster Algorithms for Agnostically Learning Disjunctions and their Implications
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2025)

Statistical Query Lower Bounds for Smoothed Agnostic Learning
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2026)

Agnostic Learning of General ReLU Activation Using Gradient Descent
di: Awasthi, Pranjal, et al.
Pubblicazione: (2022)

Sharper Bounds for Chebyshev Moment Matching, with Applications
di: Musco, Cameron, et al.
Pubblicazione: (2024)

Polynomial-time derivation of optimal k-tree topology from Markov networks
di: Dastjerdi, Fereshteh R., et al.
Pubblicazione: (2024)

Hesse's Redemption: Efficient Convex Polynomial Programming
di: Slot, Lucas, et al.
Pubblicazione: (2025)

Efficient learning of bosonic Gaussian unitaries
di: Fanizza, Marco, et al.
Pubblicazione: (2025)

Approximation Algorithms for D-optimal Design
di: Singh, Mohit, et al.
Pubblicazione: (2018)

Fast Agnostic Learners in the Plane
di: Eden, Talya, et al.
Pubblicazione: (2025)

Revisiting Agnostic PAC Learning
di: Hanneke, Steve, et al.
Pubblicazione: (2024)

The SMART approach to instance-optimal online learning
di: Banerjee, Siddhartha, et al.
Pubblicazione: (2024)

OPTWIN: Drift identification with optimal sub-windows
di: Tosi, Mauro Dalle Lucca, et al.
Pubblicazione: (2023)

Efficient Certificates of Anti-Concentration Beyond Gaussians
di: Bakshi, Ainesh, et al.
Pubblicazione: (2024)

Reliable Learning of Halfspaces under Gaussian Marginals
di: Diakonikolas, Ilias, et al.
Pubblicazione: (2024)

Near-optimal Swap Regret Minimization for Convex Losses
di: Hu, Lunjia, et al.
Pubblicazione: (2026)

MNL-Bandit with Knapsacks: a near-optimal algorithm
di: Aznag, Abdellah, et al.
Pubblicazione: (2021)

Near-optimal Active Regression of Single-Index Models
di: Li, Yi, et al.
Pubblicazione: (2025)

Learning general Gaussian mixtures with efficient score matching
di: Chen, Sitan, et al.
Pubblicazione: (2024)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
di: He, Xi, et al.
Pubblicazione: (2023)

Online Search with Predictions: Pareto-optimal Algorithm and its Applications in Energy Markets
di: Lee, Russell, et al.
Pubblicazione: (2022)

Provably learning a multi-head attention layer
di: Chen, Sitan, et al.
Pubblicazione: (2024)

Robust learning of halfspaces under log-concave marginals
di: Lange, Jane, et al.
Pubblicazione: (2025)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
di: Amanatidis, Georgios, et al.
Pubblicazione: (2021)

Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling
di: Qin, Hao, et al.
Pubblicazione: (2025)

On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
di: Kurpisz, Adam, et al.
Pubblicazione: (2026)

Proper decision trees: An axiomatic framework for solving optimal decision tree problems with arbitrary splitting rules
di: He, Xi, et al.
Pubblicazione: (2025)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
di: Assadi, Sepehr, et al.
Pubblicazione: (2023)

Efficient distributional regression trees learning algorithms for calibrated non-parametric probabilistic forecasts
di: Duchemin, Quentin, et al.
Pubblicazione: (2025)

Combinatorial optimization of the coefficient of determination
di: Harary, Marc
Pubblicazione: (2024)

Learning Mixtures of Spherical Gaussians via Fourier Analysis
di: Chakraborty, Somnath, et al.
Pubblicazione: (2020)

Structure learning of Hamiltonians from real-time evolution
di: Bakshi, Ainesh, et al.
Pubblicazione: (2024)