:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Braverman, Mark, Livni, Roi, Mansour, Yishay, Moran, Shay, Nissim, Kobbi
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning Computational Complexity Information Theory
Acceso en línea:	https://arxiv.org/abs/2604.04535
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Credit Attribution and Stable Compression
por: Livni, Roi, et al.
Publicado: (2024)

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

A Theoretical Framework for Statistical Evaluability of Generative Models
por: Aiyer, Shashaank, et al.
Publicado: (2026)

Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale
por: Aiyer, Shashaank, et al.
Publicado: (2026)

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

Learnability Gaps of Strategic Classification
por: Cohen, Lee, et al.
Publicado: (2024)

Bayesian Perspective on Memorization and Reconstruction
por: Kaplan, Haim, et al.
Publicado: (2025)

Undirected Multicast Network Coding Gaps via Locally Decodable Codes
por: Braverman, Mark, et al.
Publicado: (2025)

Polynomial-Time Optimal Group Selection via the Double-Commutator Eigenvalue Problem
por: Thornton, Mitchell A.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

Adversarially robust quantum state learning and testing
por: Aliakbarpour, Maryam, et al.
Publicado: (2025)

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

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

On the Equivalence of Gaussian Graphical Models Defined on Complete Bipartite Graphs
por: Molkaraie, Mehdi
Publicado: (2025)

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

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

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

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

Online Set Learning from Precision and Recall Feedback
por: Cohen, Lee, et al.
Publicado: (2026)

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

We Should Separate Memorization from Copyright
por: Haviv, Adi, et al.
Publicado: (2026)

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

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

A $k^{\frac{q}{q-2}}$ Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs
por: Janzer, Oliver, et al.
Publicado: (2024)

Probably Approximately Precision and Recall Learning
por: Cohen, Lee, et al.
Publicado: (2024)

Complexity of Round-Robin Allocation with Potentially Noisy Queries
por: Li, Zihan, et al.
Publicado: (2024)

Can Copyright be Reduced to Privacy?
por: Elkin-Koren, Niva, et al.
Publicado: (2023)

Margin in Abstract Spaces
por: Ashlagi, Yair, et al.
Publicado: (2026)

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

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)