Image de couverture de livre

Testably Learning Polynomial Threshold Functions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Slot, Lucas, Tiegel, Stefan, Wiedmer, Manuel
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Agnostic learning in (almost) optimal time via Gaussian surface area
par: Pesenti, Lucas, et autres
Publié: (2026)

Sample-Optimal Private Regression in Polynomial Time
par: Anderson, Prashanti, et autres
Publié: (2025)

Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
par: Chen, Hongjie, et autres
Publié: (2025)

Testable Learning with Distribution Shift
par: Klivans, Adam R., et autres
Publié: (2023)

Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise
par: Zeng, Shiwei, et autres
Publié: (2023)

SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Limitations of Membership Queries in Testable Learning
par: Lange, Jane, et autres
Publié: (2025)

Testable Learning of General Halfspaces under Massart Noise
par: Diakonikolas, Ilias, et autres
Publié: (2026)

Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Robust Mixture Learning when Outliers Overwhelm Small Groups
par: Dmitriev, Daniil, et autres
Publié: (2024)

SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
par: Diakonikolas, Ilias, et autres
Publié: (2024)

A Framework for Searching in Graphs in the Presence of Errors
par: Dereniowski, Dariusz, et autres
Publié: (2018)

Hesse's Redemption: Efficient Convex Polynomial Programming
par: Slot, Lucas, et autres
Publié: (2025)

Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time
par: McMahan, Jeremy
Publié: (2024)

Learned Static Function Data Structures
par: Hermann, Stefan, et autres
Publié: (2025)

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Outlier Robust Multivariate Polynomial Regression
par: Arora, Vipul, et autres
Publié: (2024)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
par: Pham, Ninh, et autres
Publié: (2025)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
par: Fahrbach, Matthew, et autres
Publié: (2024)

Learning and Testing Convex Functions
par: Pinto Jr., Renato Ferreira, et autres
Publié: (2025)

Collaborative Learning with Different Labeling Functions
par: Deng, Yuyang, et autres
Publié: (2024)

On Exact Learning of $d$-Monotone Functions
par: Bshouty, Nader H.
Publié: (2025)

Polynomial-time derivation of optimal k-tree topology from Markov networks
par: Dastjerdi, Fereshteh R., et autres
Publié: (2024)

Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform
par: Alman, Josh, et autres
Publié: (2025)

On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries
par: Joshi, Nirmit, et autres
Publié: (2024)

Experimental Design Using Interlacing Polynomials
par: Lau, Lap Chi, et autres
Publié: (2024)

Polynomial-Time Approximability of Constrained Reinforcement Learning
par: McMahan, Jeremy
Publié: (2025)

Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints
par: Laber, Eduardo S., et autres
Publié: (2024)

Chasing Convex Functions with Long-term Constraints
par: Lechowicz, Adam, et autres
Publié: (2024)

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
par: Epasto, Alessandro, et autres
Publié: (2020)

Sharper Bounds for Chebyshev Moment Matching, with Applications
par: Musco, Cameron, et autres
Publié: (2024)

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
par: Chen, Yixin, et autres
Publié: (2026)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
par: Esposito, Emmanuel, et autres
Publié: (2022)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
par: Oki, Taihei, et autres
Publié: (2024)

Learning-Augmented Algorithms for $k$-median via Online Learning
par: Hebbar, Anish, et autres
Publié: (2026)

Learned LSM-trees: Two Approaches Using Learned Bloom Filters
par: Fidalgo, Nicholas, et autres
Publié: (2025)

On Computing Optimal Tree Ensembles
par: Komusiewicz, Christian, et autres
Publié: (2023)

A Note on Non-Negative $L_1$-Approximating Polynomials
par: Lee, Jane H., et autres
Publié: (2026)

Active Learning with Simple Questions
par: Kontonis, Vasilis, et autres
Publié: (2024)