Co-occurring keywords · papers mentioning both
Papers
A Biconvex Method for Minimum-Time Motion Planning Through Sequences of Convex Sets
RSS 2025
Full Swap Regret and Discretized Calibration
ALT 2025
Regret Bounds for Robust Online Decision Making
COLT 2025
Superfast Configuration-Space Convex Set Computation on GPUs for Online Motion Planning
RSS 2025
Credal Learning Theory
NeurIPS 2024
The Geometry and Calculus of Losses
JMLR 2023
Universal Agent Mixtures and the Geometry of Intelligence
AISTATS 2023
Fast Projection Onto Convex Smooth Constraints
ICML 2021
Online Non-Monotone DR-Submodular Maximization
AAAI 2021
Weak learning convex sets under normal distributions
COLT 2021
Non-monotone DR-submodular Maximization over General Convex Sets
IJCAI 2020
Regret Circuits: Composability of Regret Minimizers
ICML 2019
Bounds on marginal probability distributions
NeurIPS 2008