:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Fannjiang, Albert, Li, Weilin
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control Information Theory
Accesso online:	https://arxiv.org/abs/2603.27379
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Optimality of Gradient-MUSIC for spectral estimation
di: Fannjiang, Albert, et al.
Pubblicazione: (2025)

Structured Approximation of Toeplitz Matrices and Subspaces
di: Fannjiang, Albert, et al.
Pubblicazione: (2025)

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

Nonconvex Factorization and Manifold Formulations are Almost Equivalent in Low-rank Matrix Optimization
di: Luo, Yuetian, et al.
Pubblicazione: (2021)

Strong Duality in Risk-Constrained Nonconvex Functional Programming
di: Kalogerias, Dionysis, et al.
Pubblicazione: (2022)

Nonconvex Deterministic Matrix Completion by Projected Gradient Descent Methods
di: Xu, Hang, et al.
Pubblicazione: (2024)

Distributed Nonconvex Optimization: Gradient-free Iterations and $ε$-Globally Optimal Solution
di: He, Zhiyu, et al.
Pubblicazione: (2020)

Separable Bregman Framework for Sparsity Constrained Nonlinear Optimization
di: Aktas, Fatih Selim, et al.
Pubblicazione: (2024)

Asymptotics of Proximity Operator for Squared Loss and Performance Prediction of Nonconvex Sparse Signal Recovery
di: Hayakawa, Ryo
Pubblicazione: (2021)

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

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

Beyond-Diagonal RIS For Enhanced Secrecy and Sensing Gains in Secure ISAC Networks: An Optimization Framework
di: Illi, Elmehdi, et al.
Pubblicazione: (2026)

Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
di: Cai, HanQin, et al.
Pubblicazione: (2022)

A Graphical Global Optimization Framework for Parameter Estimation of Statistical Models with Nonconvex Regularization Functions
di: Davarnia, Danial, et al.
Pubblicazione: (2025)

Optimal Denial-of-Service Attacks Against Status Updating
di: Kriouile, Saad, et al.
Pubblicazione: (2024)

Computing Augustin Information via Hybrid Geodesically Convex Optimization
di: Wang, Guan-Ren, et al.
Pubblicazione: (2024)

Delay-Optimal Transmission Scheduling Policies for Time-Correlated Fading Channels
di: Dutta, Manali, et al.
Pubblicazione: (2025)

Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources
di: Cregg, Liam, et al.
Pubblicazione: (2023)

Sliding Window Codes: Near-Optimality and Q-Learning for Zero-Delay Coding
di: Cregg, Liam, et al.
Pubblicazione: (2023)

An Adaptive Proximal Inexact Gradient Framework and Its Application to Per-Antenna Constrained Joint Beamforming and Compression Design
di: Fan, Xilai, et al.
Pubblicazione: (2025)

Optimal Denial-of-Service Attacks Against Partially-Observable Real-Time Monitoring Systems
di: Kriouile, Saad, et al.
Pubblicazione: (2024)

Optimal Gaussian Strategies for Vector-valued Witsenhausen Counterexample with Non-causal State Estimator
di: Zhao, Mengyuan, et al.
Pubblicazione: (2024)

Optimization of Beyond Diagonal RIS: A Universal Framework Applicable to Arbitrary Architectures
di: Wu, Zheyu, et al.
Pubblicazione: (2024)

Communication over LQG Control Systems: A Convex Optimization Approach to Capacity
di: Rips, Aharon, et al.
Pubblicazione: (2025)

Online Riemannian Gradient Descent for Quantum State Tomography with Matrix Product Operators
di: Cai, Jian-Feng, et al.
Pubblicazione: (2026)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
di: Li, Gen, et al.
Pubblicazione: (2021)

Local Geometry Determines Global Landscape in Low-rank Factorization for Synchronization
di: Ling, Shuyang
Pubblicazione: (2023)

Optimal transport natural gradient for statistical manifolds with continuous sample space
di: Chen, Yifan, et al.
Pubblicazione: (2018)

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

Optimality of spherical codes via exact semidefinite programming bounds
di: Cohn, Henry, et al.
Pubblicazione: (2024)

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

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

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing
di: Chen, Wei-Kun, et al.
Pubblicazione: (2023)

Gradient descent inference in empirical risk minimization
di: Han, Qiyang, et al.
Pubblicazione: (2024)

Radon random sampling and reconstruction in local shift-invariant signal space
di: Deng, Zhanpeng, et al.
Pubblicazione: (2025)

Waterfilling at the Edge: Optimal Percentile Resource Allocation via Risk-Averse Reduction
di: Yaylali, Gokberk, et al.
Pubblicazione: (2025)

Optimal Pilot and Payload Power Control in Single-Cell Massive MIMO Systems
di: Cheng, Hei Victor, et al.
Pubblicazione: (2016)

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

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

Separation is Optimal for LQR under Intermittent Feedback
di: Etcibasi, Abdullah Y., et al.
Pubblicazione: (2026)