Skip to content
conftrace_

Papers (including subtopics)

Online Learning in Risk Sensitive constrained MDP ICML 2025 Online Learning in the Random-Order Model ICML 2025 Online Learning of Coalition Structures by Selfish Agents AAAI 2025 Online Learning of Quantum States with Logarithmic Loss via VB-FTRL ALT 2025 Online Learning with Stochastically Partitioning Experts UAI 2025 Online Linear Classification with Massart Noise ICML 2025 Online MDP with Prototypes Information: A Robust Adaptive Approach AAAI 2025 Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting AAAI 2025 Online Quantile Regression JMLR 2025 Online Resource Sharing: Better Robust Guarantees via Randomized Strategies IJCAI 2025 Online Sparsification of Bipartite-Like Clusters in Graphs ICML 2025 On Mitigating Affinity Bias through Bandits with Evolving Biased Feedback ICML 2025 On Probabilistic Embeddings in Optimal Dimension Reduction JMLR 2025 On Shallow Planning Under Partial Observability AAAI 2025 On the Almost Sure Convergence of the Stochastic Three Points Algorithm ICLR 2025 On the Asymptotic Optimality of Confidence Interval Based Algorithms for Fixed Confidence MABs AAAI 2025 On the Benefits of Active Data Collection in Operator Learning ICML 2025 On the Convergence of Min-Max Langevin Dynamics and Algorithm COLT 2025 On the Convergence of No-Regret Dynamics in Information Retrieval Games with Proportional Ranking Functions ICLR 2025 On the Convergence of Tâtonnement for Linear Fisher Markets AAAI 2025 On the Design of a Robust Superdirective Beamformer and Topology Parameter Optimization with Frustum-Shaped Microphone Arrays Featuring Multiple Rings Interspeech 2025 On the Distortion of Committee Election with 1-Euclidean Preferences and Few Distance Queries AAAI 2025 On the Hardness of Bandit Learning COLT 2025 On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy COLT 2025 On the Modelling of Constraints with Tractable Logical Operators AAAI 2025