Imagen de Portada

Distribution-Specific Agnostic Conditional Classification With Halfspaces

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Huang, Jizhou, Juba, Brendan
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Distribution-Specific Auditing For Subgroup Fairness
por: Hsu, Daniel, et al.
Publicado: (2024)

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

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

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

Hardness of Maximum Likelihood Learning of DPPs
por: Grigorescu, Elena, et al.
Publicado: (2022)

Improved Hardness Results for Learning Intersections of Halfspaces
por: Tiegel, Stefan
Publicado: (2024)

Learning Functions of Halfspaces
por: Alman, Josh, et al.
Publicado: (2026)

Halfspaces are hard to test with relative error
por: Chen, Xi, et al.
Publicado: (2025)

Lower Bounds for Chain-of-Thought Reasoning in Hard-Attention Transformers
por: Amiri, Alireza, et al.
Publicado: (2025)

Quantum Learning Theory Beyond Batch Binary Classification
por: Mohan, Preetham, et al.
Publicado: (2023)

Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation
por: Amir, Guy, et al.
Publicado: (2024)

A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
por: Ledaguenel, Arthur, et al.
Publicado: (2024)

On the Hardness of Learning Regular Expressions
por: Attias, Idan, et al.
Publicado: (2025)

A Little Depth Goes a Long Way: The Expressive Power of Log-Depth Transformers
por: Merrill, William, et al.
Publicado: (2025)

Low-Rank Matrix Approximation for Neural Network Compression
por: Cherukuri, Kalyan, et al.
Publicado: (2025)

Fundamental Limits of Crystalline Equivariant Graph Neural Networks: A Circuit Complexity Perspective
por: Cao, Yang, et al.
Publicado: (2025)

Necessary and Sufficient Oracles: Toward a Computational Taxonomy For Reinforcement Learning
por: Rohatgi, Dhruv, et al.
Publicado: (2025)

How Global Calibration Strengthens Multiaccuracy
por: Casacuberta, Sílvia, et al.
Publicado: (2025)

Diffusion Language Models are Provably Optimal Parallel Samplers
por: Jiang, Haozhe, et al.
Publicado: (2025)

Additive Models Explained: A Computational Complexity Approach
por: Bassan, Shahaf, et al.
Publicado: (2025)

Constant Bit-size Transformers Are Turing Complete
por: Li, Qian, et al.
Publicado: (2025)

New Hardness Results for Low-Rank Matrix Completion
por: Chawin, Dror, et al.
Publicado: (2025)

Deep Learning as a Convex Paradigm of Computation: Minimizing Circuit Size with ResNets
por: Jacot, Arthur
Publicado: (2025)

Learnability of Parameter-Bounded Bayes Nets
por: Bhattacharyya, Arnab, et al.
Publicado: (2024)

How Hard Is Continuous Clustering? Lower Bounds from the Existential Theory of the Reals
por: Majumdar, Angshul
Publicado: (2026)

Spiky Rank and Its Applications to Rigidity and Circuits
por: Hambardzumyan, Lianna, et al.
Publicado: (2026)

Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete
por: Li, Qian, et al.
Publicado: (2026)

Proximity to Losslessly Compressible Parameters
por: Farrugia-Roberts, Matthew
Publicado: (2023)

Decision Tree Learning on Product Spaces
por: Moakahr, Arshia Soltani, et al.
Publicado: (2026)

Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances
por: Wang, Jie, et al.
Publicado: (2024)

A Logic for Expressing Log-Precision Transformers
por: Merrill, William, et al.
Publicado: (2022)

Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
por: Chandrasekaran, Gautam, et al.
Publicado: (2024)

Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation
por: Jacobs, Peter Matthew, et al.
Publicado: (2026)

Chain of Thought Empowers Transformers to Solve Inherently Serial Problems
por: Li, Zhiyuan, et al.
Publicado: (2024)

From Pseudorandomness to Multi-Group Fairness and Back
por: Dwork, Cynthia, et al.
Publicado: (2023)

Ask, and it shall be given: On the Turing completeness of prompting
por: Qiu, Ruizhong, et al.
Publicado: (2024)

On the Computational Hardness of Transformers
por: Saha, Barna, et al.
Publicado: (2026)

Certifiable Boolean Reasoning Is Universal
por: Li, Wenhao, et al.
Publicado: (2026)

Large Language Models on Small Resource-Constrained Systems: Performance Characterization, Analysis and Trade-offs
por: Seymour, Liam, et al.
Publicado: (2024)

Data Debugging is NP-hard for Classifiers Trained with SGD
por: Guo, Zizheng, et al.
Publicado: (2024)