Fetching the paper…
Reading the bibliography…
In this paper, we demonstrate how to learn the objective function of a decision-maker while only observing the problem input data and the decision-maker's corresponding decisions over multiple rounds.
Discrete-time inverse optimal control with partial-state information: A soft-optimality approach with constrained state estimation
Molloy, T. L., Tsai, D., Ford, J. J., and Perez, T. (2016) · 1932
Earlier work this paper cites.
Approximation to bayes risk in repeated play
Hannan, J. (1957) · 1957
Earlier work this paper cites.
Efficient methods for large-scale convex optimization problems
Nemirovski, A. (1979) · 1979
Earlier work this paper cites.
Aggregating strategies
Vovk, V. G. (1990) · 1990
Earlier work this paper cites.
On an instance of the inverse shortest paths problem
Burton, D. and Toint, P. L. (1992) · 1992
Earlier work this paper cites.
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
Burton, D. and Toint, P. L. (1994) · 1994
Earlier work this paper cites.
The weighted majority algorithm
Littlestone, N. and Warmuth, M. K. (1994) · 1994
Earlier work this paper cites.
Fast approximation algorithms for fractional packing and covering problems
Plotkin, S. A., Shmoys, D. B., and Éva Tardos (1995) · 1995
Earlier work this paper cites.
Network Optimization
D. Burton, W. R. Pulleyblank, P. L. T. (1997) · 1997
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Freund, Y. and Schapire, R. E. (1997) · 1997
Earlier work this paper cites.
Solving inverse spanning tree problems through network flow techniques
Sokkalingam, P. T., Ahuja, R. K., and Orlin, J. B. (1999) · 1999
Earlier work this paper cites.
A faster algorithm for the inverse spanning tree problem
Ahuja, R. K. and Orlin, J. B. (2000) · 2000
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Zinkevich, M. (2003) · 2003
Earlier work this paper cites.
Learning a decision makers’s utility function from (possibly) inconsistent behavior
Nielsen, T. D. and Jensen, F. V. (2004) · 2004
Earlier work this paper cites.
Inverse conic programming with applications
Iyengar, G. and Kang, W. (2005) · 2005
Earlier work this paper cites.
Efficient algorithms for online decision problems
Kalai, A. and Vempala, S. (2005) · 2005
Earlier work this paper cites.
Where are the hard knapsack problems?
Pisinger, D. (2005) · 2005
Earlier work this paper cites.
Linear programming system identification
Troutt, M. D., Tadisina, S. K., Sohn, C., and Brandyberry, A. A. (2005) · 2005
Earlier work this paper cites.
Prediction, learning, and games
Cesa-Bianchi, N. and Lugosi, G. (2006) · 2006
Earlier work this paper cites.
Behavioral estimation of mathematical programming objective function coefficients
Troutt, M. D., Pang, W.-K., and Hung-Huo, S. (2006) · 2006
Cited alongside, same era.
A game-theoretic approach to apprenticeship learning
Syed, U. and Schapire, R. E. (2007) · 2007
Cited alongside, same era.
Stochastic linear optimization under bandit feedback
Dani, V., Hayes, T. P., and Kakade, S. M. (2008) · 2008
Cited alongside, same era.
Inverse integer programming
Schaefer, A. (2009) · 2009
Cited alongside, same era.
Improved algorithms for linear stochastic bandits
Abbasi-Yadkori, Y., Pál, D., and Szepesvári, C. (2011) · 2011
Cited alongside, same era.
Imputing a convex objective function
Keshavarz, A., Wang, Y., and Boyd, S. (2011) · 2011
Cited alongside, same era.
Pricing from observational data
Bertsimas, D. and Kallus, N. (2016) · 2016
Later among the works it cites.
Bridging the gap between predictive and prescriptive analytics – new optimization methodology needed
den Hertog, D. and Postek, K. (2016) · 2016
Later among the works it cites.
Introduction to Online Convex Optimization
Hazan, E. (2016) · 2016
Later among the works it cites.
Dynamic assortment personalization in high dimensions
Kallus, N. and Udell, M. (2016) · 2016
Later among the works it cites.
Smart building energy efficiency via social game: A robust utility learning framework for closing-the-loop
Konstantakopoulos, I. C., Ratliff, L. J., Jin, M., Spanos, C., and Sastry, S. S. (2016) · 2016
Later among the works it cites.
Inverse optimization of convex risk functions
Li, J. Y.-M. (2016) · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Some experiments on subjective optimisation
Troutt, M. D., Gwebu, K. L., Wang, J., and Brandyberry, A. A. (2011) · 2011
Cited alongside, same era.
The multiplicative weights update method: A meta-algorithm and applications
Arora, S., Hazan, E., and Kale, S. (2012) · 2012
Cited alongside, same era.
On the performance of maximum likelihood inverse reinforcement learning
Ratia, H., Montesano, L., and Martinez-Cantin, R. (2012) · 2012
Cited alongside, same era.
Online learning and online convex optimization
Shalev-Shwartz, S. et al. (2012) · 2012
Cited alongside, same era.
Regret in online combinatorial optimization
Audibert, J.-Y., Bubeck, S., and Lugosi, G. (2013) · 2013
Cited alongside, same era.
Incentive design and utility learning via energy disaggregation
Ratliff, L. J., Dong, R., Ohlsson, H., and Sastry, S. S. (2014) · 2014
Cited alongside, same era.
Generation of human walking paths
Papadopoulos, A. V., Bascetta, L., and Ferretti, G. (2016) · 2016
Later among the works it cites.
Dynamic pricing with demand covariates
Qiang, S. and Bayati, M. (2016) · 2016
Later among the works it cites.
Emulating the expert: Inverse optimization through online learning
Bärmann, A., Pokutta, S., and Schneider, O. (2017) · 2017
Later among the works it cites.
Inverse optimization with noisy data
Aswani, A., Shen, Z.-J. M., and Siddiq, A. (2018) · 2018
Closest in time.
Generalized inverse optimization through online learning
Dong, C., Chen, Y., and Zeng, B. (2018) · 2018
Closest in time.
Data-driven inverse optimization with imperfect information
Esfahani, P. M., Shafieezadeh-Abadeh, S., Hanasusanto, G. A., and Kuhn, D. (2018) · 2018
Closest in time.
Gurobi optimizer reference manual
Gurobi Optimization, Inc. (2018) · 2018
Closest in time.
Transportation networks
Stabler, B. (2018) · 2018
Closest in time.
Imputing a variational inequality function or a convex objective function: A robust approach
Thai, J. and Bayen, A. M. (2018) · 2018
Closest in time.
Inverse optimization: Closed-form solutions, geometry, and goodness of fit
Chan, T. C. Y., Lee, T., and Terekhov, D. (2019) · 2019
Closest in time.
Learning to emulate an expert projective cone scheduler
Ward, A., Master, N., and Bambos, N. (2019) · 2019
Closest in time.
Supplementary materials: An online learning approach to inverse optimization
Bärmann, A., Martin, A., Pokutta, S., and Schneider, O. (2020) · 2020
Closest in time.
Mixed strategies for robust optimization of unknown objectives
Sessa, P. G., Bogunovic, I., Kamgarpour, M., and Krause, A. (2020) · 2020
Closest in time.