Imagen de Portada

The Entropy and Crossentropy of Generalized Mallows Models

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Meilă, Marina
Formato:	Preprint
Publicado:	2025
Materias:	Statistics Theory Data Structures and Algorithms Computation
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Model-agnostic super-resolution in high dimensions
por: Chen, Xi, et al.
Publicado: (2025)

Sampling and Identity-Testing Without Approximate Tensorization of Entropy
por: Gay, William, et al.
Publicado: (2025)

Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph
por: Yu, Xifan, et al.
Publicado: (2024)

Stable Algorithms Lower Bounds for Estimation
por: Yu, Xifan, et al.
Publicado: (2026)

A Simple Geometric Proof of the Optimality of the Sequential Probability Ratio Test for Symmetric Bernoulli Hypotheses
por: Pabbaraju, Chirag, et al.
Publicado: (2025)

The Power of Two Matrices in Spectral Algorithms for Community Recovery
por: Dhara, Souvik, et al.
Publicado: (2022)

Minimax optimal testing by classification
por: Gerber, Patrik Róbert, et al.
Publicado: (2023)

Accurate Analysis of Sparse Random Projections
por: Skórski, Maciej
Publicado: (2024)

Detecting Correlation Efficiently in Stochastic Block Models: Breaking Otter's Threshold in the Entire Supercritical Regime
por: Chen, Guanyi, et al.
Publicado: (2025)

Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers
por: R., Abhishek Hegade K., et al.
Publicado: (2025)

Strong Low Degree Hardness for the Number Partitioning Problem
por: Mallarapu, Rushil, et al.
Publicado: (2025)

Sharp Phase Transitions in Estimation with Low-Degree Polynomials
por: Sohn, Youngtak, et al.
Publicado: (2025)

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
por: Lee, Jane H., et al.
Publicado: (2024)

Low-degree estimation thresholds in planted hypergraphs and tensor PCA
por: Fu, Daniel, et al.
Publicado: (2026)

Efficient Parameter Estimation of Truncated Boolean Product Distributions
por: Fotakis, Dimitris, et al.
Publicado: (2020)

Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
por: Srinivasan, Vishwak, et al.
Publicado: (2023)

What is Learnable in Valiant's Theory of the Learnable?
por: Hanneke, Steve, et al.
Publicado: (2026)

Testing Convex Truncation
por: De, Anindya, et al.
Publicado: (2023)

Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters
por: Harvey, Nicholas, et al.
Publicado: (2024)

Improved Margin Generalization Bounds for Voting Classifiers
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2025)

Universal entrywise eigenvector fluctuations in delocalized spiked matrix models and asymptotics of rounded spectral algorithms
por: Chen, Shujing, et al.
Publicado: (2025)

Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
por: Bandeira, Afonso S.
Publicado: (2025)

On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule
por: Chen, Zongchen, et al.
Publicado: (2024)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
por: Jaquard, Hugo, et al.
Publicado: (2024)

Finding planted cliques using gradient descent
por: Gheissari, Reza, et al.
Publicado: (2023)

On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem
por: Lovig, Maxwell, et al.
Publicado: (2024)

The Conflict Graph Design: Estimating Causal Effects under Arbitrary Neighborhood Interference
por: Kandiros, Vardis, et al.
Publicado: (2024)

Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
por: Fan, Zhou, et al.
Publicado: (2026)

Asymptotically Optimal Sequential Testing with Heterogeneous LLMs
por: Li, Guokai, et al.
Publicado: (2026)

Beyond Catoni: Sharper Rates for Heavy-Tailed and Robust Mean Estimation
por: Gupta, Shivam, et al.
Publicado: (2023)

Learning the Sherrington-Kirkpatrick Model Even at Low Temperature
por: Chandrasekaran, Gautam, et al.
Publicado: (2024)

Robust Learning of Multi-index Models via Iterative Subspace Approximation
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

Entropy Equivalence Testing
por: Canonne, Clément L., et al.
Publicado: (2026)

Generalized Top-k Mallows Model for Ranked Choices
por: Haddadan, Shahrzad, et al.
Publicado: (2025)

Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

A simple lower bound for the complexity of estimating partition functions on a quantum computer
por: Chen, Zherui, et al.
Publicado: (2024)

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

The stochastic block model has the overlap graph property for modularity
por: Bhamidi, Shankar, et al.
Publicado: (2026)

Derandomizing Multi-Distribution Learning
por: Larsen, Kasper Green, et al.
Publicado: (2024)

On Computationally Efficient Multi-Class Calibration
por: Gopalan, Parikshit, et al.
Publicado: (2024)