Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

83165248330 · May 202619922001200920172026
48 results for minimax value interval

Unified minimax value interval for off-policy evaluation and optimization.

problem Overcoming the exponential variance in off-policy evaluation and policy optimization.
method Unified minimax value interval using marginalized importance weights.
result Unified value interval with double robustness, valid when either value-function or importance-weight class is well specified.

Study online learning with set-valued feedback, showing differences between deterministic and randomized approaches.

problem Online learning with set-valued feedback, where labels are sets rather than single labels.
method Introduced new combinatorial dimensions (Set Littlestone and Measure Shattering) to characterize learnability.
result Characterized deterministic and randomized online learnability, and established bounds for various learning settings.

Motivated by the growing popularity of variants of the Wasserstein distance in statistics and machine learning, we study statistical inference for the Sliced Wasserstein distance--an easily computable variant of the Wasserstein distance. Specifically, we construct confidence intervals for the Sliced Wasserstein distanc…

2019-09-17abs ↗pdf ↗

The paper develops adaptive confidence intervals for Efron's Gaussian two-groups model with unknown contamination.

problem Developing robust uncertainty quantification for Efron's Gaussian two-groups model with unknown contamination fraction.
method The approach involves Fourier-based certification procedures to find minimax-optimal adaptive confidence intervals.
result The minimax-optimal length of adaptive confidence intervals is polynomially worse than when contamination fraction is known.

Paper introduces a new method for classifying interval-valued time series.

problem Classification of interval-valued time series.
method Extends point-valued time series imaging methods to interval-valued scenarios using DKD_K-distance and employs deep learning for classification.
result Proposed method achieves superior classification performance compared to existing methods.

Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset's future market price. In short, an option has a particular payout that is based on the market price for an asset on a given date in the future. In 1973, Black and Scholes proposed a valuati…

2012-02-12abs ↗pdf ↗

Study optimality conditions for interval-valued optimization problems on Riemannian manifolds.

problem Optimizing interval-valued functions on Riemannian manifolds under a total order relation.
method Generalized Hukuhara directional differentiability to derive KKT-type optimality conditions.
result Derives optimality conditions for interval-valued optimization problems on Riemannian manifolds.

New methods for ordinal classification of interval-valued data and functional data.

problem Ordinal classification of interval-valued data and functional data.
method Six ordinal classifiers are proposed, including parametric, binary decomposition, logistic regression, distance-based, k-nearest-neighbor, kernel PCA, and random forest methods.
result Considering ordering and interval-valued information improves the accuracy of ordinal classification.

Extends Fisher's Discriminant Analysis for interval-valued data.

problem Classifying entities represented by intervals and histograms.
method Adapts Fisher's Discriminant Analysis using Moore's interval arithmetic and Mallows' distance.
result Discriminant directions for interval-valued data are numerically maximized.

Paper compares Bayesian and de-biased estimators for low-rank matrix completion.

problem Predict missing entries in partially observed matrices.
method Bayesian and de-biased estimators comparison.
result De-biased estimator performs similarly to Bayesian estimators but is more stable and can outperform in small samples.

New model uses interval-valued CVaR for better risk assessment in finance.

problem Measuring tail risk in rapidly changing financial markets.
method Employing random intervals to describe asset returns and using ICVaR as a risk measure.
result Optimal portfolio selection models show better risk assessment in real data.

We consider the estimation of two-sample integral functionals, of the type that occur naturally, for example, when the object of interest is a divergence between unknown probability densities. Our first main result is that, in wide generality, a weighted nearest neighbour estimator is efficient, in the sense of achievi…

2019-04-18abs ↗pdf ↗

The paper optimizes risk-sensitive RL with CVaR, achieving near-minimax-optimal results.

problem Optimizing risk-sensitive reinforcement learning with CVaR objective.
method Developed algorithms for multi-arm bandits and online RL in MDPs, achieving near-minimax-optimal regret.
result Achieved near-minimax-optimal regret of O(τ1SAK)O(τ^{-1}\sqrt{SAK}) for constant ττ.

Study KKT conditions for multi-objective optimization on Hadamard manifolds.

problem Optimizing multi-objective interval-valued functions on Hadamard manifolds.
method Developed KKT conditions for Pareto optimal solutions under different ordering and convexity notions.
result Results are more general than on Euclidean spaces.

Method constructs nonparametric prediction intervals with finite-sample guarantees.

problem Nonparametric instrumental variable regression with finite-sample coverage.
method Conformal inference framework applied to NPIV, combining with various estimators.
result Distribution-free, finite-sample coverage over chosen IV shifts.

Two algorithms for linear contextual bandits with rare updates achieve optimal regret and efficiency.

problem Linear contextual bandits with infrequent parameter updates.
method Two practical algorithms with O(loglogT)O(\log\log T) updates, BLCE-G and BLCE.
result Minimax-optimal regret with low computational complexity.

PIVEN predicts both specific values and prediction intervals.

problem Improving robustness of neural nets in regression tasks.
method PIVEN is a deep neural network that produces both a prediction interval and a specific value prediction.
result PIVEN produces tighter uncertainty bounds than state-of-the-art approaches for prediction intervals.

Pessimistic Minimax Value Iteration finds efficient NE policies from offline data.

problem Finding an approximate Nash equilibrium in offline Markov games with non-uniform coverage.
method Pessimistic Minimax Value Iteration (PMVI) constructs pessimistic value function estimates and solves NEs.
result Established a nearly minimax optimal result for offline Markov games with function approximation.

Paper tackles linear models with missing values, achieving minimax optimal results.

problem Missing values in real-world data complicate linear model learning.
method Proposes a rigorous setting and a new algorithm leveraging missing data distribution.
result Derives minimax optimal adaptive risk bounds for predictions with missing values.

New RL method nearly optimally learns policies with generative models.

problem Finding optimal policies in reinforcement learning with generative models.
method Mirror descent value iteration with KL divergence and entropy regularization.
result The method is nearly minimax-optimal for small ε\varepsilon-optimal policies.

Paper proposes a method to create more reliable confidence intervals for off-policy evaluations.

problem Creating reliable confidence intervals for off-policy evaluations.
method Proposes a deeply-debiasing procedure to construct efficient, robust, and flexible confidence intervals.
result Validated by theoretical results and numerical experiments, the method improves the reliability of off-policy evaluations.

Study compares imputation methods' effects on IML confidence intervals.

problem Missing data impacts IML interpretation and confidence intervals.
method Compared single vs multiple imputation methods on IML confidence intervals.
result Multiple imputation provides closer coverage to nominal than single imputation.

Paper discusses directional differentiability of interval-valued functions on Riemannian manifolds.

problem Equivalence of directional differentiability of interval-valued functions and their components.
method Analyzes directional differentiability of interval-valued functions on Riemannian manifolds.
result Directional differentiability of interval-valued functions is not equivalent to the directional differentiability of their components.

Proposes a deep learning framework for interval-censored survival data.

problem Lack of deep learning methods for interval-censored survival data.
method Partially linear transformation models with DNN approximations for nonlinear effects.
result DNN estimator achieves minimax-optimal convergence and superior performance.

This work uses statistical bootstrapping to provide accurate confidence intervals for policy value in reinforcement learning.

problem Bias in estimating policy value using empirical transitions and rewards.
method Statistical bootstrapping to produce calibrated confidence intervals for the true policy value.
result Statistical bootstrapping can yield correct confidence intervals under certain conditions, and mechanisms are proposed to mitigate these conditions.

Minimax linkage was first introduced by Ao et al. [3] in 2004, as an alternative to standard linkage methods used in hierarchical clustering. Minimax linkage relies on distances to a prototype for each cluster; this prototype can be thought of as a representative object in the cluster, hence improving the interpretabil…

2019-06-07abs ↗pdf ↗

Proposes a method for obtaining interval bounds in off-policy evaluation.

problem Provides provably correct upper and lower bounds for off-policy evaluation.
method Searches for the maximum and minimum values of the expected reward among Lipschitz Q-functions.
result Introduces a Lipschitz value iteration method to monotonically tighten interval bounds.

Learning a regression function using censored or interval-valued output data is an important problem in fields such as genomics and medicine. The goal is to learn a real-valued prediction function, and the training output labels indicate an interval of possible values. Whereas most existing algorithms for this task are…

2017-10-11abs ↗pdf ↗

We give a comprehensive theoretical characterization of a nonparametric estimator for the L22L_2^2 divergence between two continuous distributions. We first bound the rate of convergence of our estimator, showing that it is n\sqrt{n}-consistent provided the densities are sufficiently smooth. In this smooth regime, we t…

2014-10-30abs ↗pdf ↗

Paper extends Bayes Theorem for interval probability estimates.

problem Real-world input probabilities are often interval estimates, not precise.
method Developed IT2 version of Bayes Theorem and a novel algorithm for encoding intervals.
result Conservative method avoids invalid output results from inconsistent input.