Mathematics & Optimization

Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspective ICML 2025 Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete UAI 2025 Linear Bandits on Ellipsoids: Minimax Optimal Algorithms COLT 2025 Linear Bandits with Partially Observable Features ICML 2025 Linear Contextual Bandits With Interference ICML 2025 Linear convergence of Sinkhorn’s algorithm for generalized static Schrödinger bridge ICML 2025 Linear Equations with Min and Max Operators: Computational Complexity AAAI 2025 Linearized Wasserstein Barycenters: Synthesis, Analysis, Representational Capacity, and Applications AISTATS 2025 Linear Mode Connectivity between Multiple Models modulo Permutation Symmetries ICML 2025 Linear Spherical Sliced Optimal Transport: A Fast Metric for Comparing Spherical Data ICLR 2025 Linear Streaming Bandit: Regret Minimization and Fixed-Budget Epsilon-Best Arm Identification AAAI 2025 Linear Submodular Maximization with Bandit Feedback AISTATS 2025 Linear Supervision for Nonlinear, High-Dimensional Neural Control and Differential Games L4DC 2025 Linear Trading Position with Sparse Spectrum IJCAI 2025 Lipschitz Bandits in Optimal Space ICLR 2025 List Update with Prediction AAAI 2025 LiteASR: Efficient Automatic Speech Recognition with Low-Rank Approximation EMNLP 2025 Local convergence of simultaneous min-max algorithms to differential equilibrium on Riemannian manifold ICLR 2025 Locally Private Sampling with Public Data AISTATS 2025 Local Stochastic Sensitivity Analysis For Dynamical Systems AISTATS 2025 LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression ICLR 2025 Logarithmic Approximations for Fair k-Set Selection IJCAI 2025 Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit ALT 2025 Logarithmic regret of exploration in average reward Markov decision processes COLT 2025 LookCloser: Frequency-aware Radiance Field for Tiny-Detail Scene CVPR 2025