Cover Image

Variational Inference on the Boolean Hypercube with the Quantum Entropy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Beyler, Eliot, Bach, Francis
Format:	Preprint
Published:	2024
Subjects:	Information Theory Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Spectral Framework for Closed-Form Relative Density Estimation
by: Bach, Francis
Published: (2026)

Statistical Analysis of Conditional Group Distributionally Robust Optimization with Cross-Entropy Loss
by: Guo, Zijian, et al.
Published: (2025)

EVODiff: Entropy-aware Variance Optimized Diffusion Inference
by: Li, Shigui, et al.
Published: (2025)

Optimal Denoising in Score-Based Generative Models: The Role of Data Regularity
by: Beyler, Eliot, et al.
Published: (2025)

Convergence of Deterministic and Stochastic Diffusion-Model Samplers: A Simple Analysis in Wasserstein Distance
by: Beyler, Eliot, et al.
Published: (2025)

Ensemble-Conditional Gaussian Processes (Ens-CGP): Representation, Geometry, and Inference
by: Ravela, Sai, et al.
Published: (2026)

On the Effectiveness of the z-Transform Method in Quadratic Optimization
by: Bach, Francis
Published: (2025)

A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage
by: Bach, Francis
Published: (2025)

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
by: Cai, HanQin, et al.
Published: (2024)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
by: Yu, Qian, et al.
Published: (2024)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
by: Zurek, Matthew, et al.
Published: (2024)

Structured Sampling for Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2024)

Group Projected Subspace Pursuit for Block Sparse Signal Reconstruction: Convergence Analysis and Applications
by: He, Roy Y., et al.
Published: (2024)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
by: Cui, Chengyu, et al.
Published: (2026)

Linear regression with overparameterized linear neural networks: Tight upper and lower bounds for implicit $\ell^1$-regularization
by: Matt, Hannes, et al.
Published: (2025)

Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
by: Kümmerle, Christian, et al.
Published: (2023)

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
by: Ling, Shuyang
Published: (2021)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
Published: (2025)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
by: Zamir, Guy, et al.
Published: (2026)

A Neural Network Algorithm for KL Divergence Estimation with Quantitative Error Bounds
by: Foss, Mikil, et al.
Published: (2025)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
by: Shen, Wei, et al.
Published: (2023)

Tight Regret Bounds for Bayesian Optimization in One Dimension
by: Scarlett, Jonathan
Published: (2018)

Span-Based Optimal Sample Complexity for Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2023)

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2025)

The augmented NLP bound for maximum-entropy remote sampling
by: Ponte, Gabriel, et al.
Published: (2026)

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
by: Shen, Wei, et al.
Published: (2025)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
by: Zurek, Matthew, et al.
Published: (2025)

More is Less: Inducing Sparsity via Overparameterization
by: Chou, Hung-Hsu, et al.
Published: (2021)

On the Convergence Analysis of Muon
by: Shen, Wei, et al.
Published: (2025)

Adversarial Water-Filling: Theory, Algorithms and Foundation Model
by: Tong, Xindi, et al.
Published: (2026)

Geometry, Computation, and Optimality in Stochastic Optimization
by: Cheng, Chen, et al.
Published: (2019)

Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuning
by: Aolaritei, Liviu, et al.
Published: (2022)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
by: Zurek, Matthew, et al.
Published: (2025)

MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation
by: Shen, Wei, et al.
Published: (2025)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
by: Li, Gen, et al.
Published: (2023)

Theory and applications of the Sum-Of-Squares technique
by: Bach, Francis, et al.
Published: (2023)

Taming "data-hungry" reinforcement learning? Stability in continuous state-action spaces
by: Duan, Yaqi, et al.
Published: (2024)

Scaling Laws for Gradient Descent and Sign Descent for Linear Bigram Models under Zipf's Law
by: Kunstner, Frederik, et al.
Published: (2025)

Long-time dynamics and universality of nonconvex gradient descent
by: Han, Qiyang
Published: (2025)