We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Classical supervised learning via empirical risk (or negative log-likelihood) minimization hinges upon the assumption that the testing distribution coincides with the training distribution. This assumption can be challenged in modern applications of machine learning in which learning machines may operate at prediction time with testing data whose distribution departs from the one of the training data. We revisit the superquantile regression method by proposing a first-order optimization algorithm to minimize a superquantile-based learning objective. The proposed algorithm is based on smoothing the superquantile function by infimal convolution. Promising numerical results illustrate the interest of the approach towards safer supervised learning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2009.14575")
get_code_for_paper("2009.14575")
have("2009.14575")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2009.14575.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2009.14575)
Connect an agent — have() is free.