Fetching the paper…
Reading the bibliography…
Exponential tilting is a technique commonly used in fields such as statistics, probability, information theory, and optimization to create parametric distribution shifts.
Das asymptotische verteilungsgesetz der eigenwerte linearer partieller differentialgleichungen (mit einer anwendung auf die theorie der hohlraumstrahlung)
Hermann Weyl · 1912
Earlier work this paper cites.
Probability inequalities for the sum of independent random variables
George Bennett · 1962
Earlier work this paper cites.
Robust estimation of a location parameter
Peter J Huber · 1964
Earlier work this paper cites.
Information theory and reliable communication
Robert G Gallager · 1968
Earlier work this paper cites.
Risk-sensitive markov decision processes
Ronald A Howard and James E Matheson · 1972
Earlier work this paper cites.
A new penalty function method for constrained minimization
Barry W Kort and Dimitri P Bertsekas · 1972
Earlier work this paper cites.
Importance sampling in the monte carlo study of sequential tests
David Siegmund · 1976
Earlier work this paper cites.
Information theory and statistics
Thomas M Cover and Joy A Thomas · 1991
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1994
Earlier work this paper cites.
Guessing and entropy
James L Massey · 1994
Earlier work this paper cites.
An inequality on guessing and its application to sequential decoding
Erdal Arıkan · 1996
Earlier work this paper cites.
Value at risk: a new benchmark for measuring derivatives risk
Philippe Jorion · 1996
Earlier work this paper cites.
Thinking coherently
Philippe Artzner · 1997
Earlier work this paper cites.
Nonlinear programming
Dimitri P Bertsekas · 1997
Earlier work this paper cites.
A Weak Convergence Approach to the Theory of Large Deviations
Paul Dupuis and Richard S Ellis · 1997
Earlier work this paper cites.
Sparse spatial autoregressions
R Kelley Pace and Ronald Barry · 1997
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner · 1998
Earlier work this paper cites.
Coherent measures of risk
Philippe Artzner, Freddy Delbaen, Jean-Marc Eber, and David Heath · 1999
Earlier work this paper cites.
Boosting algorithms as gradient descent
Llew Mason, Jonathan Baxter, Peter Bartlett, and Marcus Frean · 1999
Earlier work this paper cites.
Optimization of conditional value-at-risk
R Tyrrell Rockafellar, Stanislav Uryasev, et al · 2000
Earlier work this paper cites.
Q-learning for risk-sensitive control
Vivek S Borkar · 2002
Earlier work this paper cites.
Conditional value-at-risk for general loss distributions
R Tyrrell Rockafellar and Stanislav Uryasev · 2002
Earlier work this paper cites.
Vehicle classification in distributed sensor networks
Marco F Duarte and Yu Hen Hu · 2004
Earlier work this paper cites.
Stochastic finance: an introduction in discrete time
Hans Föllmer and Alexander Schied · 2004
Earlier work this paper cites.
A new class of upper bounds on the log partition function
Martin J Wainwright, Tommi S Jaakkola, and Alan S Willsky · 2005
Earlier work this paper cites.
A practical online method for distributionally deep robust optimization
Qi Qi, Zhishuai Guo, Yi Xu, Rong Jin, and Tianbao Yang · 2006
Earlier work this paper cites.
Saddlepoint approximations with applications
Ronald W Butler · 2007
Earlier work this paper cites.
Graphical models, exponential families, and variational inference
Martin J Wainwright and Michael I Jordan · 2008
Earlier work this paper cites.
Large deviations techniques and applications
A. Dembo and O. Zeitouni · 2009
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky, Geoffrey Hinton, et al · 2009
Earlier work this paper cites.
Empirical bernstein bounds and sample variance penalization
Andreas Maurer and Massimiliano Pontil · 2009
Earlier work this paper cites.
The comparisons of data mining techniques for the predictive accuracy of probability of default of credit card clients
I-Cheng Yeh and Che-hui Lien · 2009
Earlier work this paper cites.
Self-paced learning for latent variable models
M Pawan Kumar, Benjamin Packer, and Daphne Koller · 2010
Earlier work this paper cites.
On the dual formulation of boosting algorithms
Chunhua Shen and Hanxi Li · 2010
Earlier work this paper cites.
Relaxed clipping: A global training method for robust regression and classification
Min Yang, Linli Xu, Martha White, Dale Schuurmans, and Yao-liang Yu · 2010
Earlier work this paper cites.
Entropic risk measures: Coherence vs. convexity, model ambiguity and robust large deviations
Hans Föllmer and Thomas Knispel · 2011
Earlier work this paper cites.
Ensemble of exemplar-SVMs for object detection and beyond
Tomasz Malisiewicz, Abhinav Gupta, and Alexei A Efros · 2011
Earlier work this paper cites.
On solving large-scale finite minimax problems using exponential smoothing
EY Pee and Johannes O Royset · 2011
Earlier work this paper cites.
Entropic value-at-risk: A new coherent risk measure
Amir Ahmadi-Javid · 2012
Earlier work this paper cites.
Attentional biased stochastic gradient for imbalanced classification
Qi Qi, Yi Xu, Rong Jin, Wotao Yin, and Tianbao Yang · 2012
Earlier work this paper cites.
A polynomial-time form of robust regression
Yao-liang Yu, Özlem Aslan, and Dale Schuurmans · 2012
Earlier work this paper cites.
Concentration inequalities: A nonasymptotic theory of independence
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2013
Earlier work this paper cites.
UCI repository of machine learning databases
Thorsteinn Rögnvaldsson · 2013
Earlier work this paper cites.
Robust variable selection with exponential squared loss
Xueqin Wang, Yunlu Jiang, Mian Huang, and Heping Zhang · 2013
Earlier work this paper cites.
Optimization Models
Giuseppe C Calafiore and Laurent El Ghaoui · 2014
Cited alongside, same era.
Simnets: A generalization of convolutional networks
Nadav Cohen and Amnon Shashua · 2014
Cited alongside, same era.
List decoding—Random coding exponents and expurgated exponents
Neri Merhav · 2014
Cited alongside, same era.
Lectures on Stochastic Programming: Modeling and Theory
Alexander Shapiro, Darinka Dentcheva, and Andrzej Ruszczyński · 2014
Cited alongside, same era.
Robust regression via hard thresholding
Kush Bhatia, Prateek Jain, and Purushottam Kar · 2015
Cited alongside, same era.
Active sampler: Light-weight accelerator for complex data analytics at scale
Jinyang Gao, HV Jagadish, and Beng Chin Ooi · 2015
UCI machine learning repository [http://archive. ics. uci. edu/ml]. https://archive. ics. uci. edu/ml/datasets
D Dua and C Graff · 2019
Later among the works it cites.
Variance-based regularization with convex objectives
John Duchi and Hongseok Namkoong · 2019
Later among the works it cites.
Better generalization with less data using robust gradient descent
Matthew Holland and Kazushi Ikeda · 2019
Later among the works it cites.
Accelerating deep learning by focusing on the biggest losers
Angela H Jiang, Daniel L-K Wong, Giulio Zhou, David G Andersen, Jeffrey Dean, Gregory R Ganger, Gauri Joshi, Michael Kaminksy, Michael Kozuch, Zachary C Lipton, et al · 2019
Later among the works it cites.
An effective label noise model for dnn text classification
Ishan Jindal, Daniel Pressel, Brian Lester, and Matthew Nokleby · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Escaping from saddle points—online stochastic gradient for tensor decomposition
Rong Ge, Furong Huang, Chi Jin, and Yang Yuan · 2015
Cited alongside, same era.
Deep simnets
Nadav Cohen, Or Sharir, and Amnon Shashua · 2016
Cited alongside, same era.
Equality of opportunity in supervised learning
Moritz Hardt, Eric Price, and Nati Srebro · 2016
Cited alongside, same era.
Learning deep networks from noisy labels with dropout regularization
Ishan Jindal, Matthew Nokleby, and Xuewen Chen · 2016
Cited alongside, same era.
Linear convergence of gradient and proximal-gradient methods under the polyak-łojasiewicz condition
Hamed Karimi, Julie Nutini, and Mark Schmidt · 2016
Cited alongside, same era.
Training region-based object detectors with online hard example mining
Abhinav Shrivastava, Abhinav Gupta, and Ross Girshick · 2016
Cited alongside, same era.
Mohammad Mahdi Kamani, Farzin Haddadpour, Rana Forsati, and Mehrdad Mahdavi · 2019
Later among the works it cites.
On human-aligned risk minimization
Liu Leqi, Adarsh Prasad, and Pradeep K Ravikumar · 2019
Later among the works it cites.
Deep learning theory review: An optimal control and dynamical systems perspective
Guan-Horng Liu and Evangelos A Theodorou · 2019
Later among the works it cites.
Agnostic federated learning
Mehryar Mohri, Gary Sivek, and Ananda Theertha Suresh · 2019
Later among the works it cites.
Globally-convergent iteratively reweighted least squares for robust regression problems
Bhaskar Mukhoty, Govind Gopakumar, Prateek Jain, and Purushottam Kar · 2019
Later among the works it cites.
Solving a class of non-convex min-max games using iterative first order methods
Maher Nouiehed, Maziar Sanjabi, Tianjian Huang, Jason D Lee, and Meisam Razaviyayn · 2019
Later among the works it cites.
Toward a better trade-off between performance and fairness with kernel-based distribution matching
Flavien Prost, Hai Qian, Qiuwen Chen, Ed H Chi, Jilin Chen, and Alex Beutel · 2019
Later among the works it cites.
Salman Salamatian, Litian Liu, Ahmad Beirami, and Muriel Médard · 2019
Later among the works it cites.
PeerReview4All: Fair and accurate reviewer assignment in peer review
Ivan Stelmakh, Nihar B Shah, and Aarti Singh · 2019
Later among the works it cites.
A tunable loss function for robust classification: Calibration, landscape, and generalization
Tyler Sypherd, Mario Diaz, John Kevin Cava, Gautam Dasarathy, Peter Kairouz, and Lalitha Sankar · 2019
Later among the works it cites.
Multi-criteria dimensionality reduction with applications to fairness
Uthaipon Tantipongpipat, Samira Samadi, Mohit Singh, Jamie H Morgenstern, and Santosh Vempala · 2019
Later among the works it cites.
Fairness constraints: A flexible approach for fair classification
Muhammad Bilal Zafar, Isabel Valera, Manuel Gomez-Rodriguez, and Krishna P Gummadi · 2019
Later among the works it cites.
Long-tail visual relationship recognition with a visiolinguistic hubless loss
Sherif Abdelkarim, Panos Achlioptas, Jiaji Huang, Boyang Li, Kenneth Church, and Mohamed Elhoseiny · 2020
Later among the works it cites.
Model projection: Theory and applications to fair machine learning
Wael Alghamdi, Shahab Asoodeh, Hao Wang, Flavio P Calmon, Dennis Wei, and Karthikeyan Natesan Ramamurthy · 2020
Later among the works it cites.
Rényi fair inference
Sina Baharlouei, Maher Nouiehed, Ahmad Beirami, and Meisam Razaviyayn · 2020
Later among the works it cites.
Distributionally robust learning
Ruidi Chen and Ioannis Ch Paschalidis · 2020
Later among the works it cites.
Task-robust model-agnostic meta-learning
Liam Collins, Aryan Mokhtari, and Sanjay Shakkottai · 2020
Later among the works it cites.
Adaptive sampling for stochastic risk-averse learning
Sebastian Curi, Kfir Y Levy, Stefanie Jegelka, and Andreas Krause · 2020
Later among the works it cites.
A single timescale stochastic approximation method for nested stochastic optimization
Saeed Ghadimi, Andrzej Ruszczynski, and Mengdi Wang · 2020
Later among the works it cites.
What is local optimality in nonconvex-nonconcave minimax optimization?
Chi Jin, Praneeth Netrapalli, and Michael Jordan · 2020
Later among the works it cites.
Fairness without demographics through adversarially reweighted learning
Preethi Lahoti, Alex Beutel, Jilin Chen, Kang Lee, Flavien Prost, Nithum Thain, Xuezhi Wang, and Ed Chi · 2020
Later among the works it cites.
Large-scale methods for distributionally robust optimization
Daniel Levy, Yair Carmon, John C Duchi, and Aaron Sidford · 2020
Later among the works it cites.
Can gradient clipping mitigate label noise?
Aditya Krishna Menon, Ankit Singh Rawat, Sashank J Reddi, and Sanjiv Kumar · 2020
Later among the works it cites.
Efficient search of first-order nash equilibria in nonconvex-concave smooth min-max problems
Dmitrii M Ostrovskii, Andrew Lowy, and Meisam Razaviyayn · 2020
Later among the works it cites.
Fairness for robust log loss classification
Ashkan Rezaei, Rizal Fathony, Omid Memarrast, and Brian D Ziebart · 2020
Later among the works it cites.
Fr-train: A mutual information-based approach to fair and robust training
Yuji Roh, Kangwook Lee, Steven Euijong Whang, and Changho Suh · 2020
Later among the works it cites.
Statistical learning with conditional value at risk
Tasuku Soma and Yuichi Yoshida · 2020
Later among the works it cites.
Heteroskedastic and imbalanced deep learning with adaptive regularization
Kaidi Cao, Yining Chen, Junwei Lu, Nikos Arechiga, Adrien Gaidon, and Tengyu Ma · 2021
Closest in time.
A superquantile approach for federated learning with heterogeneous devices
Yassine Laguel, Krishna Pillutla, Jérôme Malick, and Zaid Harchaoui · 2021
Closest in time.
Tilted empirical risk minimization
Tian Li, Ahmad Beirami, Maziar Sanjabi, and Virginia Smith · 2021
Closest in time.
Andrew Lowy and Meisam Razaviyayn · 2021
Closest in time.
A stochastic optimization framework for fair risk minimization
Andrew Lowy, Sina Baharlouei, Rakesh Pavan, Meisam Razaviyayn, and Ahmad Beirami · 2021
Closest in time.
Tilted cross entropy (TCE): Promoting fairness in semantic segmentation
Attila Szabo, Hadi Jamali-Rad, and Siva-Datta Mannava · 2021
Closest in time.
Robust curriculum learning: from clean label detection to noisy label self-correction
Tianyi Zhou, Shengjie Wang, and Jeff Bilmes · 2021
Closest in time.
Active sampling for min-max fairness
Jacob Abernethy, Pranjal Awasthi, Matthäus Kleindessner, Jamie Morgenstern, Chris Russell, and Jie Zhang · 2022
Closest in time.
A stochastic subgradient method for distributionally robust non-convex and non-smooth learning
Mert Gürbüzbalaban, Andrzej Ruszczyński, and Landi Zhu · 2022
Closest in time.
On distributionally robust optimization and data rebalancing
Agnieszka Słowik and Léon Bottou · 2022
Closest in time.
Landi Zhu, Mert Gürbüzbalaban, and Andrzej Ruszczyński · 2023
Closest in time.