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

50100149199 · Jun 202019922001200920172026
48 results for interval-based metric

New method uses interval-based metric to validate prediction uncertainty in machine learning.

problem Validation of prediction uncertainty in machine learning regression tasks is unreliable due to heavy-tailed distributions.
method Shift from variance-based metrics to interval-based Prediction Interval Coverage Probability (PICP).
result PICP method more quickly and reliably tests prediction intervals than variance-based metrics.

Sequential pattern mining is an interesting research area with broad range of applications. Most prior research on sequential pattern mining has considered point-based data where events occur instantaneously. However, in many application domains, events persist over intervals of time of varying lengths. Furthermore, tr…

2019-12-24abs ↗pdf ↗

This paper completes a fundamental construction in Alexandrov geometry. Previously we gave a new construction of metric spaces with curvature bounds either above or below, namely warped products with intrinsic metric space base and fiber, and with possibly vanishing warping functions -- thereby extending the classical …

2015-09-01abs ↗pdf ↗

This paper addresses a gap in the classifcation of Codazzi tensors with exactly two eigenfunctions on a Riemannian manifold of dimension three or higher. Derdzinski proved that if the trace of such a tensor is constant and the dimension of one of the the eigenspaces is n1n-1, then the metric is a warped product where t…

2011-11-29abs ↗pdf ↗

This study revisits UQ validation methods based on consistency and adaptivity concepts.

problem Lack of comprehensive validation methods for UQ metrics across input feature ranges.
method Revisit and extend common validation methods for UQ metrics based on consistency and adaptivity concepts.
result Improved understanding and capabilities of UQ metrics validation methods.

Bounds on Gaussian approximation for neural networks with novel smoothing techniques.

problem Approximating the distribution of wide random neural networks.
method Stein's method, Gaussian smoothing, Laplacian operators, Cameron-Martin space.
result First bounds on Gaussian approximation of wide random neural networks.

We present differentially private algorithms for the stochastic Multi-Armed Bandit (MAB) problem. This is a problem for applications such as adaptive clinical trials, experiment design, and user-targeted advertising where private information is connected to individual rewards. Our major contribution is to show that the…

2015-11-27abs ↗pdf ↗

Estimators computed from adaptively collected data do not behave like their non-adaptive brethren. Rather, the sequential dependence of the collection policy can lead to severe distributional biases that persist even in the infinite data limit. We develop a general method -- W\mathbf{W}-decorrelation -- for transformi…

2017-12-18abs ↗pdf ↗

This paper develops a new method to model treatment effects that are heterogeneous across different quantiles.

problem Modeling treatment effects that vary across different quantiles of the outcome distribution.
method The paper combines quantile classification with local polynomial estimation to build a decision tree and forest.
result The proposed QLPRT and QLPRF methods provide a new way to estimate and infer heterogeneous treatment effects.

Paper presents robust confidence sequences for means with known moment bounds and arbitrary corruption.

problem Tackles robustness to outliers and adversarial corruptions in mean estimation.
method Designs new robust exponential supermartingales to create confidence sequences.
result Achieves optimal width and shows smaller margin of error compared to fixed-time robust methods.

Analysis of cross-validation for early-stopped gradient descent in high-dimensional regression.

problem Inconsistency of GCV for early-stopped GD in high-dimensional least squares regression.
method Theoretical analysis of GCV and LOOCV applied to early-stopped GD in high-dimensional least squares regression.
result LOOCV converges uniformly to the prediction risk of early-stopped GD, while GCV is generically inconsistent.

Guaranteed bounds for posterior inference in probabilistic programs.

problem Approximating the posterior distribution of probabilistic programs with provable correctness.
method Interval-based trace semantics, soundness and completeness proofs, weight-aware interval type system.
result Guaranteed bounds on the posterior distribution of probabilistic programs are computed and proven to be correct.

The statistical properties of the bid-ask spread of a frequently traded Chinese stock listed on the Shenzhen Stock Exchange are investigated using the limit-order book data. Three different definitions of spread are considered based on the time right before transactions, the time whenever the highest buying price or th…

2006-12-31abs ↗pdf ↗

This paper studies the geometry of minimum-volume confidence sets for multinomial parameters.

problem Determining if minimum-volume confidence sets for multinomial outcomes are disjoint.
method Enumerating and covering the continuous regions of the exact p-value function to study the geometry of minimum-volume confidence sets.
result The geometry of minimum-volume confidence sets for multinomial parameters is studied, providing insights into their structure and properties.

CTI produces efficient prediction intervals with guaranteed coverage.

problem Efficient and reliable uncertainty quantification in regression.
method CTI estimates conditional density for interval length, then thresholds intervals based on this density.
result CTI achieves smaller prediction sets with guaranteed coverage compared to existing methods.

EBLR improves time series forecasting with interpretable results.

problem Forecasting future events to reduce uncertainty.
method Iterative method starting with a base model, adding regression trees to explain errors at each iteration.
result EBLR substantially improves base model performance through extracted features and provides comparable performance to other methods.

This paper proposes a DGP approach with UCBs for point target tracking over WSNs.

problem Uncertainty quantification in distributed machine learning-based tracking over WSNs.
method Distributed Gaussian process (DGP) approach with upper confidence bounds (UCBs).
result UCBs provide 88% and 42% higher probability of encompassing true target states in X and Y coordinates, respectively.

We provide a pointwise confidence bound for non-linear least-squares with fixed design.

problem Confidence estimation in non-linear 2\ell^2-regularized least squares.
method Pointwise confidence bound for local minimizers, using weighted norm involving inverse-Hessian.
result The proposed confidence bound scales with the test input's similarity to the training data.

Develops a new inference method for split-sample estimators using multiple splits.

problem Statistical dependence and variability in split-sample estimators.
method Averaging across multiple splits, proving a central limit theorem, and developing new inference approaches.
result Valid confidence intervals and improved power in comparing model performance.

SIGTRON improves classification accuracy for imbalanced datasets.

problem Improving classification accuracy for imbalanced datasets.
method SIGTRON is a new sigmoid function with a convex loss function for imbalanced classification.
result SIGTRON models outperform existing methods in balanced and imbalanced datasets.

The probability that a user will click a search result depends both on its relevance and its position on the results page. The position based model explains this behavior by ascribing to every item an attraction probability, and to every position an examination probability. To be clicked, a result must be both attracti…

2017-03-19abs ↗pdf ↗

Study improves predictive performance testing for high-dimensional data using exhaustive nested cross-validation.

problem Reproducibility issues in KK-fold cross-validation for high-dimensional data.
method Proposes a novel predictive performance test based on exhaustive nested cross-validation, addressing computational complexity with a closed-form expression.
result Demonstrates the effectiveness of Ridge-based methods in high-dimensional predictive performance testing.

In this essay, we study the sufficient and necessary conditions for a Randers metrc to be of constant Ricci curvature without the restriction of strong convexity (regularity). The classification result for the case βα>1\|β\|_α>1 is provided, which is similar to the famous Bao-Robles-Shen's result for strongly convex Rand…

2017-05-31abs ↗pdf ↗

We prove the equivalences of several classical complete metrics on the Teichmüller and the moduli spaces of Riemann surfaces. We use as bridge two new Kähler metrics, the Ricci metric and the perturbed Ricci metric and prove that the perturbed Ricci metric is a complete Kähler metric with bounded negative holomorphic s…

2004-03-03abs ↗pdf ↗