From the 2 of 21 linked papers with an AI index.
21 papers
Online Convex Optimization with Dueling Feedback
Yiyang Lu, Hareshkumar Jadav, Mohammad Pedramfar +2
We study online convex optimization with dueling (pairwise comparison) feedback, where the learner observes only a binary preference between two queried points. While dueling feedb…
Sharp instability of planar isotropic--nematic interfaces in the Landau--de Gennes model
Wei Wang, Qin Wu
We study the stability of one-dimensional planar isotropic--nematic interfaces in the Landau--de Gennes model with anisotropic elastic constant . Earlier work proved the instabi…
Parameter-Free Dynamic Regret for Online Convex Optimization under Heavy-Tailed Noise
Vaneet Aggarwal
The paper introduces HT-PAder, a parameter‑free algorithm for online convex optimization that handles heavy‑tailed noise and achieves universal dynamic regret without prior knowled…
Non-Expansive Two-Time-Scale Stochastic Approximation: A Fixed-Schedule One-Quarter Barrier and Bias-Corrected Acceleration
Dhruv Sarkar, Vaneet Aggarwal
The paper analyzes two‑time‑scale stochastic approximation with a non‑expansive slow map, establishes sharp lower bounds on residual decay, and proposes bias‑corrected and single‑l…
Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
Yiyang Lu, Haresh Jadav, Mohammad Pedramfar +2
We study online maximization of non-monotone Diminishing-Return(DR)-submodular functions over down-closed convex sets, a regime where existing projection-free online methods suffer…
Distributionally Robust Listwise Preference Optimization
Xudong Wu, Jian Qian, Pangpang Liu +2
Existing robust preference optimization for language-model alignment mainly studies pairwise supervision and places robustness at the dataset, prompt, or preference-pair level. We…