{"total":15,"rows":[{"id":"2302.12370","title":"Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds","created":"2023-02-24","cited_by_count":14,"area":null},{"id":"2405.17796","title":"Offline Oracle-Efficient Learning for Contextual MDPs via Layerwise Exploration-Exploitation Tradeoff","created":"2024-05-28","cited_by_count":8,"area":null},{"id":"2410.02476","title":"Online Convex Optimization with a Separation Oracle","created":"2024-10-03","cited_by_count":8,"area":null},{"id":"2303.00480","title":"Sampling with Barriers: Faster Mixing via Lewis Weights","created":"2023-03-01","cited_by_count":7,"area":null},{"id":"2408.06395","title":"Fast John Ellipsoid Computation with Differential Privacy Optimization","created":"2024-08-12","cited_by_count":7,"area":null},{"id":"2306.11121","title":"Projection-Free Online Convex Optimization via Efficient Newton Iterations","created":"2023-06-19","cited_by_count":4,"area":null},{"id":"2502.15765","title":"Generalized Attention Flow: Feature Attribution for Transformer Models via Maximum Flow","created":"2025-02-14","cited_by_count":4,"area":null},{"id":"2410.05700","title":"Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk","created":"2024-10-08","cited_by_count":2,"area":null},{"id":"2412.11303","title":"Regularized Dikin Walks for Sampling Truncated Logconcave Measures, Mixed Isoperimetry and Beyond Worst-Case Analysis","created":"2024-12-15","cited_by_count":2,"area":null},{"id":"2206.09384","title":"Sampling from Log-Concave Distributions over Polytopes via a Soft-Threshold Dikin Walk","created":"2022-06-19","cited_by_count":1,"area":null},{"id":"2307.12943","title":"Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling","created":"2023-07-24","cited_by_count":1,"area":null},{"id":"2506.20141","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","created":"2025-06-25","cited_by_count":1,"area":null},{"id":"2311.04158","title":"Computing Approximate $\\ell_p$ Sensitivities","created":"2023-11-07","cited_by_count":0,"area":null},{"id":"2312.03218","title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","created":"2023-12-06","cited_by_count":0,"area":null},{"id":"2608.25273","title":"A General Framework for Metropolis-Adjusted Dikin Walks: Dimension-Square Mixing on Polytopes and Log-Det Walks on Spectrahedra","created":"2026-08-26","cited_by_count":0,"area":null}],"next_cursor":null}