Cover Image

Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Blondal, Ari, Hatami, Hamed, Hatami, Pooya, Lalov, Chavdar, Tretiak, Sivan
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simplicial covering dimension of extremal concept classes
by: Blondal, Ari, et al.
Published: (2025)

Stability and List-Replicability for Agnostic Learners
by: Blondal, Ari, et al.
Published: (2025)

Structure in Communication Complexity and Constant-Cost Complexity Classes
by: Hatami, Hamed, et al.
Published: (2024)

Replicable Learning of Large-Margin Halfspaces
by: Kalavasis, Alkis, et al.
Published: (2024)

Tight Generalization Bounds for Large-Margin Halfspaces
by: Larsen, Kasper Green, et al.
Published: (2025)

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

Learning Intersections of Two Margin Halfspaces under Factorizable Distributions
by: Diakonikolas, Ilias, et al.
Published: (2025)

Near-Optimal Cryptographic Hardness of Learning With Homogeneous Halfspaces Under Gaussian Marginals
by: Huang, Jizhou, et al.
Published: (2026)

ProductAE: Toward Deep Learning Driven Error-Correction Codes of Large Dimensions
by: Jamali, Mohammad Vahid, et al.
Published: (2023)

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
by: Chandrasekaran, Gautam, et al.
Published: (2025)

A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2025)

Constrained Entropic Unlearning: A Primal-Dual Framework for Large Language Models
by: Entesari, Taha, et al.
Published: (2025)

Class Unlearning via Depth-Aware Removal of Forget-Specific Directions
by: Hatami, Arman, et al.
Published: (2026)

Efficient Algorithms for Learning Monophonic Halfspaces in Graphs
by: Bressan, Marco, et al.
Published: (2024)

Persistent Patterns in Eye Movements: A Topological Approach to Emotion Recognition
by: Niksa, Arsha, et al.
Published: (2025)

Smoothed Agnostic Learning of Halfspaces over the Hypercube
by: Kou, Yiwen, et al.
Published: (2025)

Block structure in boolean matrices of bounded factorization norm
by: Goh, Marcel K., et al.
Published: (2025)

Block complexity and idempotent Schur multipliers
by: Goh, Marcel K., et al.
Published: (2025)

Actively Learning Halfspaces without Synthetic Data
by: Black, Hadley, et al.
Published: (2025)

Online Learning of Halfspaces with Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)

Pregnancy and pityriasis rosea: Current concepts
by: Parvaneh Hatami, et al.
Published: (2024)

Active Learning of General Halfspaces: Label Queries vs Membership Queries
by: Diakonikolas, Ilias, et al.
Published: (2024)

Improved Hardness Results for Learning Intersections of Halfspaces
by: Tiegel, Stefan
Published: (2024)

Energy Spectrum of Primary Knock-on Atoms and Atomic Displacement Calculations in Metallic Alloys Under Neutron Irradiation
by: Hatami, Faranak
Published: (2024)

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
by: Bressan, Marco, et al.
Published: (2025)

Testable Learning of General Halfspaces under Massart Noise
by: Diakonikolas, Ilias, et al.
Published: (2026)

Personalized Prediction By Learning Halfspace Reference Classes Under Well-Behaved Distribution
by: Huang, Jizhou, et al.
Published: (2025)

Attribute-Efficient PAC Learning of Sparse Halfspaces with Constant Malicious Noise Rate
by: Zeng, Shiwei, et al.
Published: (2025)

No Complete Problem for Constant-Cost Randomized Communication
by: Fang, Yuting, et al.
Published: (2024)

Constant-Cost Communication is not Reducible to k-Hamming Distance
by: Fang, Yuting, et al.
Published: (2024)

Explainable convolutional neural network model provides an alternative genome-wide association perspective on mutations in SARS-CoV-2
by: Hatami, Parisa, et al.
Published: (2024)

Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate
by: Shen, Jie
Published: (2024)

Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
by: Diakonikolas, Ilias, et al.
Published: (2024)

Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach
by: Li, Yinan, et al.
Published: (2023)

A Near-optimal SQ Lower Bound for Smoothed Agnostic Learning of Boolean Halfspaces
by: Sinen, Tim
Published: (2026)

Distribution-Specific Agnostic Conditional Classification With Halfspaces
by: Huang, Jizhou, et al.
Published: (2025)

Estimating Item Difficulty Using Large Language Models and Tree-Based Machine Learning Algorithms
by: Razavi, Pooya, et al.
Published: (2025)

Improving Deep Tabular Learning
by: Sarafian, Sivan, et al.
Published: (2025)

Covering and labeling generalizations of the Borsuk-Ulam theorem
by: Frick, Florian, et al.
Published: (2025)

Borsuk-Ulam type theorems for metric spaces
by: Akopyan, Arseniy, et al.
Published: (2012)