Cover Image

How Hard Is Continuous Clustering? Lower Bounds from the Existential Theory of the Reals

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Majumdar, Angshul
Format:	Preprint
Published:	2026
Subjects:	Computational Complexity Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Universal NP-Hardness of Clustering under General Utilities
by: Majumdar, Angshul
Published: (2026)

Tensor Spectral Threshold is $\exists\mathbb{R}$-Hard
by: Majumdar, Angshul
Published: (2026)

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

$\exists\mathbb{R}$-Completeness of Tensor Degeneracy and a Derandomization Barrier for Hyperdeterminants
by: Majumdar, Angshul
Published: (2026)

Affine Rank Minimization is ER Complete
by: Majumdar, Angshul
Published: (2026)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
by: Majumdar, Angshul
Published: (2026)

The Existential Theory of Research: Why Discovery Is Hard
by: Majumdar, Angshul
Published: (2026)

Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
by: Li, Rupert, et al.
Published: (2025)

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

A Unified Matrix Factorization Framework for Classical and Robust Clustering
by: Majumdar, Angshul
Published: (2025)

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

The Existential Theory of the Reals with Summation Operators
by: Bläser, Markus, et al.
Published: (2024)

Diminishing Returns in Expanding Generative Models and Godel-Tarski-Lob Limits
by: Majumdar, Angshul
Published: (2026)

Ranking Vectors Clustering: Theory and Applications
by: Fattahi, Ali, et al.
Published: (2025)

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

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

Lower Bounds for Learning Quantum States with Single-Copy Measurements
by: Lowe, Angus, et al.
Published: (2022)

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

An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds
by: Chen, Siyu, et al.
Published: (2025)

Low Rank Matrix Rigidity: Tight Lower Bounds and Hardness Amplification
by: Alman, Josh, et al.
Published: (2025)

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

Generalized and Unified Equivalences between Hardness and Pseudoentropy
by: Hu, Lunjia, et al.
Published: (2025)

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

Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials
by: Luo, Yuetian, et al.
Published: (2023)

On the Hardness of Learning One Hidden Layer Neural Networks
by: Li, Shuchen, et al.
Published: (2024)

Hardness of Learning Boolean Functions from Label Proportions
by: Guruswami, Venkatesan, et al.
Published: (2024)

Dictionary-Transform Generative Adversarial Networks
by: Majumdar, Angshul
Published: (2025)

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

Query Lower Bounds for Correlation Clustering under Memory Constraints
by: Garg, Sumegha, et al.
Published: (2026)

On the Hardness of Approximation of the Fair k-Center Problem
by: Thejaswi, Suhas
Published: (2026)

Reinforced Generation of Combinatorial Structures: Hardness of Approximation
by: Nagda, Ansh, et al.
Published: (2025)

Subquadratic Algorithms and Hardness for Attention with Any Temperature
by: Gupta, Shreya, et al.
Published: (2025)

Beyond the Existential Theory of the Reals
by: Schaefer, Marcus, et al.
Published: (2022)

Cryptographic Hardness of Score Estimation
by: Song, Min Jae
Published: (2024)

AC^0[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard
by: Lu, Jiaqi, et al.
Published: (2025)

Generalization Error Bound for Quantum Machine Learning in NISQ Era -- A Survey
by: Khanal, Bikram, et al.
Published: (2024)

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
by: Li, Xiaoyu, et al.
Published: (2025)

Parameterized Hardness of Zonotope Containment and Neural Network Verification
by: Froese, Vincent, et al.
Published: (2025)

Modern Hopfield Networks Require Chain-of-Thought to Solve $\mathsf{NC}^1$-Hard Problems
by: Cao, Yang, et al.
Published: (2024)

A Theory of Learning with Autoregressive Chain of Thought
by: Joshi, Nirmit, et al.
Published: (2025)