Paper corrects GIRP algorithm to ensure isotonic models.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
We consider the minimization of submodular functions subject to ordering constraints. We show that this optimization problem can be cast as a convex optimization problem on a space of uni-dimensional measures, with ordering constraints corresponding to first-order stochastic dominance. We propose new discretization sch…
Additive isotonic regression attempts to determine the relationship between a multi-dimensional observation variable and a response, under the constraint that the estimate is the additive sum of univariate component effects that are monotonically increasing. In this article, we present a new method for such regression …
Paper proposes a shape-constrained approach to distributionally robust learning.
Paper develops DP algorithms for isotonic regression over posets.
New method tackles adversarial sign-corrupted isotonic regression, estimating monotonic signals under heavy dependence.
iQRA improves probabilistic forecasts of electricity prices.
We consider the problem of nonparametric regression under shape constraints. The main examples include isotonic regression (with respect to any partial order), unimodal/convex regression, additive shape-restricted regression, and constrained single index model. We review some of the theoretical properties of the least …
This paper studies the addition of linear constraints to the Support Vector Regression (SVR) when the kernel is linear. Adding those constraints into the problem allows to add prior knowledge on the estimator obtained, such as finding probability vector or monotone data. We propose a generalization of the Sequential Mi…
Algorithm optimizes quantized isotonic regression with log-linear time updates.
Proposes isotonic recalibration for insurance pricing to ensure auto-calibration under low signal-to-noise ratio.
Proposes a tuning-free dynamic pricing method for linear valuation models.
Stacked regressions improve predictive accuracy by combining estimators.
Proposes stabilized weights for causal inference using isotonic calibration.
Proposes new method for calibrating treatment effect predictors.
Brenier isotonic regression extends multi-output isotonic regression using optimal transport.
ICP improves prediction intervals for continuous outcomes at lower computational cost.
Isotonic regression binning affects calibration statistics of machine learning models.
We consider the online version of the isotonic regression problem. Given a set of linearly ordered points (e.g., on the real line), the learner must predict labels sequentially at adversarially chosen positions and is evaluated by her total squared loss compared against the best isotonic (non-decreasing) function in hi…
The study establishes risk bounds for distributional regression estimators.
SISR improves feature attribution in complex payoff schemes.
Proposes isotonic regression for calibrating Deep Cox models' survival probabilities.
Estimates isotonic functions under unknown permutations, achieving optimal statistical and computational efficiency.
Learning accurate probabilistic models from data is crucial in many practical tasks in data mining. In this paper we present a new non-parametric calibration method called \textit{ensemble of near isotonic regression} (ENIR). The method can be considered as an extension of BBQ, a recently proposed calibration method, a…
In machine learning and data mining, linear models have been widely used to model the response as parametric linear functions of the predictors. To relax such stringent assumptions made by parametric linear models, additive models consider the response to be a summation of unknown transformations applied on the predict…
Calibrated Prediction-Powered Inference improves semisupervised mean estimation by calibrating prediction scores.
Experiment shows author rankings can improve peer review scores.
Boosted decision trees typically yield good accuracy, precision, and ROC area. However, because the outputs from boosting are not well calibrated posterior probabilities, boosting yields poor squared error and cross-entropy. We empirically demonstrate why AdaBoost predicts distorted probabilities and examine three cali…
Generalized Linear Models (GLMs) and Single Index Models (SIMs) provide powerful generalizations of linear regression, where the target variable is assumed to be a (possibly unknown) 1-dimensional function of a linear predictor. In general, these problems entail non-convex estimation procedures, and, in practice, itera…
Many applications, including rank aggregation, crowd-labeling, and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and/or columns. We consider the problem of estimating an unknown matrix in this class, based on noisy observations of (possibly, a su…
New method for robustly interpreting ML models using quantile constraints and Wasserstein projections.
We present a method for learning the parameters of a Bayesian network with prior knowledge about the signs of influences between variables. Our method accommodates not just the standard signs, but provides for context-specific signs as well. We show how the various signs translate into order constraints on the network …
Corrects mismatch in consistency of nuisance estimators for doubly robust methods.
Proposes differentiable and sparse top-k operators for neural networks.
Isotonic regression is a standard problem in shape-constrained estimation where the goal is to estimate an unknown nondecreasing regression function from independent pairs where . While this problem is well understood both statistically and computationally, much l…
Paper introduces Isotonic Mechanism for better item scoring.
New neural network with RePU activation approximates smooth functions and their derivatives.
Paper quantifies distortion risk measures' robustness to distributional uncertainty.
New method improves probabilistic electricity price predictions.
Binary classification is highly used in credit scoring in the estimation of probability of default. The validation of such predictive models is based both on rank ability, and also on calibration (i.e. how accurately the probabilities output by the model map to the observed probabilities). In this study we cover the cu…
The paper tackles ranking experts based on their answers to questions, considering statistical and computational challenges.
Study improves survival analysis for credit risk by accounting for data drift.
Paper introduces differentiable sorting and ranking with time complexity.
In many real-world applications of machine learning classifiers, it is essential to predict the probability of an example belonging to a particular class. This paper proposes a simple technique for predicting probabilities based on optimizing a ranking loss, followed by isotonic regression. This semi-parametric techniq…
We propose a new algorithm to learn a one-hidden-layer convolutional neural network where both the convolutional weights and the outputs weights are parameters to be learned. Our algorithm works for a general class of (potentially overlapping) patches, including commonly used structures for computer vision tasks. Our a…
This paper continues study, both theoretical and empirical, of the method of Venn prediction, concentrating on binary prediction problems. Venn predictors produce probability-type predictions for the labels of test objects which are guaranteed to be well calibrated under the standard assumption that the observations ar…
We consider the problem of nonparametric regression when the covariate is -dimensional, where . In this paper we introduce and study two nonparametric least squares estimators (LSEs) in this setting---the entirely monotonic LSE and the constrained Hardy-Krause variation LSE. We show that these two LSEs are…
Implied posterior probability of a given model (say, Support Vector Machines (SVM)) at a point is an estimate of the class posterior probability pertaining to the class of functions of the model applied to a given dataset. It can be regarded as a score (or estimate) for the true posterior probability, which ca…