Imagen de Portada

Polynomial-Time Optimal Group Selection via the Double-Commutator Eigenvalue Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Thornton, Mitchell A.
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning Computational Complexity Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Optimal Approximation Factor in Density Estimation
por: Bousquet, Olivier, et al.
Publicado: (2019)

The Agent Capability Problem: Predicting Solvability Through Information-Theoretic Bounds
por: Lutati, Shahar
Publicado: (2025)

Submodular Information Selection for Hypothesis Testing with Misclassification Penalties
por: Bhargav, Jayanth, et al.
Publicado: (2024)

Learning from Equivalence Queries, Revisited
por: Braverman, Mark, et al.
Publicado: (2026)

The I/O Complexity of Attention, or How Optimal is Flash Attention?
por: Saha, Barna, et al.
Publicado: (2024)

Efficient reductions from a Gaussian source with applications to statistical-computational tradeoffs
por: Lou, Mengqi, et al.
Publicado: (2025)

Optimal lower bounds for Quantum Learning via Information Theory
por: Hadiashar, Shima Bab, et al.
Publicado: (2023)

Algebraic Diversity: Group-Theoretic Spectral Estimation from Single Observations
por: Thornton, Mitchell A.
Publicado: (2026)

Advances in List Decoding of Polynomial Codes
por: Kumar, Mrinal, et al.
Publicado: (2026)

High Rate Multivariate Polynomial Evaluation Codes
por: Kopparty, Swastik, et al.
Publicado: (2024)

Optimal certification of constant-local Hamiltonians
por: Lee, Junseo, et al.
Publicado: (2025)

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

Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility
por: Chen, Zhenyu, et al.
Publicado: (2025)

Algorithmic causal structure emerging through compression
por: Wendong, Liang, et al.
Publicado: (2025)

Noisy Quantum Learning Theory
por: Cotler, Jordan, et al.
Publicado: (2025)

Efficient Algorithm for Sparse Fourier Transform of Generalized $q$-ary Functions
por: Tsui, Darin, et al.
Publicado: (2025)

Information-theoretic generalization bounds for learning from quantum data
por: Caro, Matthias, et al.
Publicado: (2023)

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials
por: Wein, Alexander S.
Publicado: (2025)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
por: Jeronimo, Fernando Granha, et al.
Publicado: (2026)

Efficient Pauli channel estimation with logarithmic quantum memory
por: Chen, Sitan, et al.
Publicado: (2023)

Computation-Utility-Privacy Tradeoffs in Bayesian Estimation
por: Chen, Sitan, et al.
Publicado: (2026)

The Exact Replica Threshold for Nonlinear Moments of Quantum States
por: Zeng, Shuai
Publicado: (2026)

Privacy-aware Berrut Approximated Coded Computing for Federated Learning
por: Luaña, Xavier Martínez, et al.
Publicado: (2024)

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

Exponential quantum advantage in processing massive classical data
por: Zhao, Haimeng, et al.
Publicado: (2026)

Learning to erase quantum states: thermodynamic implications of quantum learning theory
por: Zhao, Haimeng, et al.
Publicado: (2025)

A learning theory for quantum photonic processors and beyond
por: Rosati, Matteo
Publicado: (2022)

Tight Quantum Time-Space Tradeoffs for Permutation Inversion
por: Akshima, et al.
Publicado: (2025)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
por: Doron, Dean, et al.
Publicado: (2024)

Simple algorithms to test and learn local Hamiltonians
por: Gutiérrez, Francisco Escudero
Publicado: (2024)

Hamiltonian Property Testing
por: Bluhm, Andreas, et al.
Publicado: (2024)

Sandwiching Polynomials for Geometric Concepts with Low Intrinsic Dimension
por: Klivans, Adam R., et al.
Publicado: (2026)

Near-Optimal Learning and Planning in Separated Latent MDPs
por: Chen, Fan, et al.
Publicado: (2024)

Approximate Computation via Le Cam Simulability
por: Akdemir, Deniz
Publicado: (2025)

Inference Scaling vs Reasoning: An Empirical Analysis of Compute-Optimal LLM Problem-Solving
por: AbdElhameed, Marwan, et al.
Publicado: (2024)

Quantum circuit complexity and unsupervised machine learning of topological order
por: Che, Yanming, et al.
Publicado: (2025)

Assembly Theory Reduced to Shannon Entropy and Rendered Redundant by Naive Statistical Algorithms
por: Ozelim, Luan, et al.
Publicado: (2024)

Optimality of Frequency Moment Estimation
por: Braverman, Mark, et al.
Publicado: (2024)

Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression
por: Buhai, Rares-Darius, et al.
Publicado: (2024)

Causal Discovery under Latent Class Confounding
por: Mazaheri, Bijan, et al.
Publicado: (2023)