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.

169,051 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920182026
48 results for threshold levels

Modeling firm default with a variable threshold based on management decisions.

problem Estimating default probability with asymmetric information.
method Generalized structural model with a variable default threshold.
result The information level significantly impacts default probability and credit yield spread.

New insights into binary perceptron reveal phase transitions and algorithmic thresholds.

problem Understanding the statistical-computational gap in binary perceptron models.
method Application of fully lifted random duality theory (fl RDT) to uncover structural changes.
result Numerical estimates of constraint density thresholds align with theoretical predictions.

A new SSL method uses instance-dependent thresholds to improve accuracy.

problem Improving semi-supervised learning by better selecting confident unlabeled instances.
method Proposes instance-dependent thresholds that vary based on the ambiguity and error rates of pseudo-labels for each unlabeled instance.
result Demonstrates that instance-dependent thresholds provide a probabilistic guarantee for correct pseudo-labels.

Paper answers Jin and Rubinstein's question about Fano manifolds.

problem Determining the equality of specific invariants for Fano manifolds.
method Used advanced computational methods including Chatgpt 5.5 pro and Danus system.
result Proved the equality of fixed-level equivariant alpha invariant and global log canonical threshold for Fano manifolds.

The paper proposes a robust method for estimating super-level sets using Gaussian processes.

problem Determining a large region where a function exceeds a threshold with high probability.
method Maximizing the expected volume of the domain identified as above the threshold as predicted by a Gaussian process, robustified by a variance term.
result The proposed method outperforms existing techniques in practice and provides asymptotic guarantees.

High-dimensional models become unstable when sample size falls below a critical level, leading to a phase transition.

problem Instability in high-dimensional learning models when sample size is insufficient.
method Proved the necessity of a Fisher eigenvalue threshold for stability, introduced Fisher floor for verification.
result A sharp phase transition between reliable concentration and inevitable failure in high-dimensional learning.

Typically, operational risk losses are reported above a threshold. Fitting data reported above a constant threshold is a well known and studied problem. However, in practice, the losses are scaled for business and other factors before the fitting and thus the threshold is varying across the scaled data sample. A report…

2009-04-27abs ↗pdf ↗

We relax demographic parity in regression by enforcing parity at quantile levels and score thresholds.

problem Enforcing full distributional fairness in regression can lead to substantial accuracy loss.
method Introduce (\ell, Z)-fair predictor, derive closed-form solutions, and develop post-processing algorithm.
result The risk gap to the continuous optimum vanishes as the grid is refined, and we enable targeted fairness corrections.

The study finds that memorization is necessary or harmful depending on the prior distribution and noise level.

problem The impact of memorization on generalization in overparameterized models.
method An overparameterized linear model with general priors in a Bayesian setup.
result Explicit conditions for optimal generalization based on the prior distribution and noise level.

Time changes of noise level at Warsaw Stock Market are analyzed using a recently developed method basing on properties of the coarse grained entropy. The condition of the minimal noise level is used to build an efficient portfolio. Our noise level approach seems to be a much better tool for risk estimations than standa…

2005-03-31abs ↗pdf ↗

Bayesian Neural Networks improve high-dimensional level set estimation.

problem Scalability issue in existing LSE methods for high-dimensional inputs.
method Bayesian Neural Networks with information-based acquisition functions.
result Proposed method achieves better results than state-of-the-art approaches.

The paper discusses thresholds and bounds for accuracy in binary classification systems.

problem The accuracy of binary classification systems and its dependence on prevalence.
method Analyzing the precision-prevalence curve and negative predictive value-prevalence curve to find thresholds and bounds.
result Thresholds (φeφ_e and φnφ_n) bound various accuracy metrics (Fβ, F1, FM, MCC) and the ratio of maximum accuracy to prevalence.

FILTER model uses fusion penalized logistic threshold regression for high-dimensional data with unknown cut points.

problem Modeling high-dimensional data with unknown cut points and binary responses.
method Fusion penalized logistic threshold regression (FILTER) model with fused lasso penalty for variable selection.
result Established non-asymptotic error bounds for coefficient estimation and model selection consistency.

This paper introduces a more efficient method for estimating level sets with a stopping criterion.

problem Efficiently estimating regions where a function exceeds a threshold without exhaustive evaluations.
method Acquisition strategy with a stopping criterion for εε-accurate level set estimation.
result The method satisfies εε-accuracy with a confidence level of 1δ1 - δ and guarantees on lower bounds of performance metrics.

Optimizes portfolio with two controls to minimize trades and maintain signal integrity.

problem Optimizing a single-asset portfolio with transaction costs and signal autocorrelation.
method Formulated an optimization problem to minimize trades while maintaining signal integrity and achieving maximum return.
result Locally optimal solution minimizes trades and achieves maximum return, with a quantifiable improvement based on threshold and autocorrelation removed.

SpaRCe optimizes reservoir computing by learning neuron thresholds to improve performance and prevent forgetting.

problem Improving performance and preventing forgetting in reservoir computing networks.
method Integrates neuron-specific learnable thresholds to optimize sparsity without altering dynamics, learning read-out weights and thresholds via gradient rule.
result Threshold learning improves performance and alleviates catastrophic forgetting.

Efficient neural Bayes estimators for censored peaks-over-threshold models improve inference speed and accuracy.

problem Computational burden in inference with spatial extremal dependence models due to intractable or censored likelihoods.
method Developed neural Bayes estimators using data augmentation techniques to encode censoring information.
result Significant gains in computational and statistical efficiency compared to traditional methods.

We consider the problem of clustering noisy high-dimensional data points into a union of low-dimensional subspaces and a set of outliers. The number of subspaces, their dimensions, and their orientations are unknown. A probabilistic performance analysis of the thresholding-based subspace clustering (TSC) algorithm intr…

2013-05-15abs ↗pdf ↗

Paper proposes efficient AL algorithms for optimizing product performance under environmental variability.

problem Optimizing product performance under varying environmental conditions.
method Formulated as Bayesian Quadrature Optimization problems for probabilistic threshold robustness measure using Gaussian Process model.
result Proposed algorithms provide credible intervals for probabilistic threshold robustness measure and demonstrate efficiency in real-world applications.

Fewer degrees of freedom can train deep networks, showing a sharp phase transition.

problem Training deep networks with fewer degrees of freedom than parameters.
method Examined success probability of hitting training loss sub-level sets within random subspaces.
result Threshold training dimension increases as desired final loss decreases.

We win EVA2025 by estimating extreme precipitation events using Peaks Over Thresholds and martingale testing.

problem Estimating the probability of extreme precipitation events with limited data.
method Modeling Peaks Over Thresholds with an exponential distribution and using martingale testing for evaluation.
result Our method outperforms other approaches in estimating extreme precipitation events.

We study --both in theory and practice-- the use of momentum motions in classic iterative hard thresholding (IHT) methods. By simply modifying plain IHT, we investigate its convergence behavior on convex optimization criteria with non-convex constraints, under standard assumptions. In diverse scenaria, we observe that …

2017-12-26abs ↗pdf ↗

Study proposes active learning method for estimating robust regions in uncertain function evaluations.

problem Estimating robust regions for uncertain function evaluations with unknown distributions.
method Distributionally robust level-set estimation (DRPTR) with active learning.
result The proposed method efficiently identifies reliable regions with theoretical guarantees.

New diagnostics detect variability in individual risk estimates from machine learning models in healthcare.

problem Variability in individual risk estimates from machine learning models in healthcare, leading to unreliable treatment decisions.
method Proposed evaluation framework using empirical prediction interval width and empirical decision flip rate diagnostics.
result Randomness in optimization and initialization can lead to substantial individual-level variability in risk estimates, affecting clinical decisions.

This paper connects ultrametric overlap gap properties to parametric RDT for symmetric binary perceptrons.

problem Characterizing statistical computational gaps in symmetric binary perceptrons.
method Developed an analytical union-bounding program to rigorously upper-bound constraint densities of ultrametric overlap gap properties.
result Obtained tightest bounds at the first two levels of ultrametric overlap gap properties, closely approaching parametric RDT estimates.

Capsule models detect adversarial images by reconstructing from top-level capsules.

problem Detecting adversarial images that look like a typical member of the predicted class.
method Capsule models trained to reconstruct images from pose parameters and identity of the correct top-level capsule.
result Setting a threshold on reconstruction error effectively detects adversarial images.

Paper studies non-tight reconstruction threshold in a 4-state model with different in/out block mutations.

problem Non-tight reconstruction threshold in a 4-state symmetric model with different in-block and out-block mutations.
method Inspired by the q1+q2q_1+q_2 stochastic block model, rigorously analyzes conditions for non-tightness of the reconstruction threshold.
result Rigorously gives conditions for the non-tightness of the reconstruction threshold in a 4-state symmetric model.