Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales

Terms and Conditions

Twitter GitHub LinkedIn Bluesky Youtube

© 2026 ResearchTrend.AI, All rights reserved.

Home
Papers
2008.10460
Cited By

Online Convex Optimization Perspective for Learning from Dynamically
Revealed Preferences

v1v2v3 (latest)

Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences

24 August 2020

Fatma Kılınç Karzan

ArXiv (abs)PDF HTML

Papers citing "Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences"

4 / 4 papers shown

Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis

Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel

-

Young Loss Perspective and Gap-Dependent Regret AnalysisInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2025

Shinsaku Sakaue

550

3

0

23 Jan 2025

A fast algorithm to minimize prediction loss of the optimal solution in inverse optimization problem of MILP

A fast algorithm to minimize prediction loss of the optimal solution in inverse optimization problem of MILP

293

1

0

23 May 2024

Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality
Loss, and Algorithms

Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and AlgorithmsOperational Research (OR), 2023

Pedro Zattoni Scroccaro

Peyman Mohajerin Esfahani

220

12

0

12 May 2023

Maximum Optimality Margin: A Unified Approach for Contextual Linear
Programming and Inverse Linear Programming

Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear ProgrammingInternational Conference on Machine Learning (ICML), 2023

Xiaocheng Li

226

11

0

26 Jan 2023

Page 1 of 1