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

3567131,0691,425 · Jun 202019922001200920172026
48 results for threshold models

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.

Paper introduces threshold invariant fairness to ensure equitable predictions across different groups.

problem Machine learning models can be unfair to certain groups based on sensitive attributes.
method Proposes threshold invariant fairness and uses two approximation methods to equalize risk distributions.
result Demonstrates effectiveness in alleviating threshold sensitivity in fairness models.

Proposes a method to choose thresholds for LLM evaluation metrics.

problem Ensuring reliable large language models (LLMs) with correct threshold selection.
method Identify risks, stakeholders' risk tolerance, and use ground-truth data to determine thresholds.
result Demonstrates a concrete example with the Faithfulness metric and HaluBench dataset.

New algorithm for reinforcement learning in uncertain environments with unknown thresholds.

problem Safety in reinforcement learning in unknown and uncertain environments.
method Growing-Window estimator sampling and Stochastic Pessimistic-Optimistic Thresholding (SPOT) algorithm.
result Achieves sublinear regret and constraint violation of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}).

Study fairness in ordinal regression using threshold models.

problem Fairness in ordinal regression predictions.
method Adapted fairness notions from fair ranking; use threshold model with scoring function and thresholds; apply binary classification for scoring function and local search for thresholds.
result Generalization guarantees on predictor error and fairness violation; effectiveness demonstrated in experiments.

The paper sets thresholds for testing correlation in hypergraphs, distinguishing between independent and correlated states.

problem Testing correlation between two hypergraphs under different models.
method Derives sharp information-theoretic thresholds for distinguishing between null and alternative hypotheses.
result The testing threshold decreases as the hypergraph's uniformity (m) increases, making correlation testing easier for higher uniformity.

The paper considers an investment timing problem appearing in real options theory. Present values from an investment project are modeled by general diffusion process. We prove necessary and sufficient conditions under which an optimal investment time is induced by threshold strategy. We study also the conditions of opt…

2015-11-02abs ↗pdf ↗

The article examines different thresholding methods for improving PAM algorithm in cancer classification.

problem High-dimensional classification with too many features selected by PAM.
method Extends PAM with hard and order thresholding methods and a deep search algorithm.
result Improved cancer status prediction accuracy and smaller number of features.

Comparison of decision curve analysis and cost curves for model evaluation.

problem Evaluating classification performance across different operating contexts.
method Comparison of Decision Curve Analysis (DCA) and Cost Curves.
result DCA and Cost Curves are closely related, with Brier curves being more generally applicable.

New algorithm detects communities even with corrupted data, reaching Kesten-Stigum threshold.

problem Robust community detection in stochastic block model with node corruptions.
method Polynomial-time algorithm using Grothendieck norm of principal submatrices.
result First algorithm to achieve weak recovery at Kesten-Stigum threshold with node corruptions.

Study evaluates thresholds for removing noise from DNN weights using random matrix theory.

problem Removing noise from deep neural network weights for better approximation.
method Model weights as signal + noise, use random matrix theory to estimate thresholds, evaluate using cosine similarity.
result Proposed threshold estimation method improves approximation quality.

Sharp thresholds and contiguity for community detection in contextual SBM.

problem Community detection in graphs with high-dimensional node-covariates.
method Contextual Stochastic Block Model, non-rigorous cavity method, information theory.
result Established the sharp threshold for detection and weak recovery in the contextual SBM.

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 ↗

Bayesian framework forecasts financial tail risks using realized volatility and nonlinear thresholds.

problem Forecasting financial tail risks using realized volatility and nonlinear thresholds.
method Bayesian Markov Chain Monte Carlo method for model estimation; nonlinear threshold regression specification.
result The proposed framework produces competitive tail risk forecasts compared to GARCH and Realized-GARCH models.

A simple model explains phase transition in large language models.

problem Understanding the emergence of abilities in large language models.
method Modeling LLM as a sequence-to-sequence random function and using a list decoder.
result A critical threshold exists where the expected number of erroneous sequences grows exponentially.

Ridge regression is revisited with debiasing and thresholding, offering advantages over Lasso.

problem High-dimensional data challenges classical ridge regression's sparsity detection and bias issues.
method Debiasing and thresholding ridge regression, introducing a wild bootstrap for confidence regions and hypothesis testing, and a hybrid bootstrap for prediction intervals.
result Debiased and thresholded ridge regression can offer similar performance to thresholded Lasso and may be preferable in some settings.

This study optimizes multi-modal learning thresholds and algorithms in high dimensions.

problem Optimizing multi-modal learning performance in high-dimensional data.
method Analytical quantification and derivation of AMP algorithm with state evolution analysis.
result Bayes-optimal performance and recovery thresholds derived for multi-modal data.

This work interprets GELU and related activations via a first-order loss function.

problem Understanding and optimizing activation functions in neural networks.
method Complementary interpretation using the Gaussian first-order loss function.
result Calibrated or learned uniform-threshold gates are competitive and often outperform GELU, ReLU, and SiLU/Swish.

This paper considers the problem of estimating multiple related Gaussian graphical models from a pp-dimensional dataset consisting of different classes. Our work is based upon the formulation of this problem as group graphical lasso. This paper proposes a novel hybrid covariance thresholding algorithm that can effecti…

2015-03-07abs ↗pdf ↗

Azure (the cloud service provided by Microsoft) is composed of physical computing units which are called nodes. These nodes are controlled by a software component called Fabric Controller (FC), which can consider the nodes to be in one of many different states such as Ready, Unhealthy, Booting, etc. Some of these state…

2018-10-08abs ↗pdf ↗

Graphical lasso may fail to fit models when data points are insufficient.

problem When does graphical lasso fail to select and fit a graphical model?
method Computational experiments with graphical lasso.
result Graphical lasso may fail when the number of data points is less than the maximum likelihood threshold.

We consider a univariate semimartingale model for (the logarithm of) an asset price, containing jumps having possibly infinite activity (IA). The nonparametric threshold estimator of the integrated variance IV proposed in Mancini 2009 is constructed using observations on a discrete time grid, and precisely it sums up t…

2017-08-14abs ↗pdf ↗

Evaluation of the marginal likelihood plays an important role in model selection problems. The widely applicable Bayesian information criterion (WBIC) and singular Bayesian information criterion (sBIC) give approximations to the log marginal likelihood, which can be applied to both regular and singular models. When the…

2019-06-04abs ↗pdf ↗

New findings on community recovery in SBM with many communities.

problem Determining community recovery conditions in SBM with more than sqrt(n) communities.
method Constructing motifs and counting them to prove community recovery above the proposed threshold.
result Proving community recovery above the proposed threshold in SBM with K >= sqrt(n) communities.

The stochastic block model is one of the oldest and most ubiquitous models for studying clustering and community detection. In an exciting sequence of developments, motivated by deep but non-rigorous ideas from statistical physics, Decelle et al. conjectured a sharp threshold for when community detection is possible in…

2015-11-04abs ↗pdf ↗

The thresholded feature has recently emerged as an extremely efficient, yet rough empirical approximation, of the time-consuming sparse coding inference process. Such an approximation has not yet been rigorously examined, and standard dictionaries often lead to non-optimal performance when used for computing thresholde…

2018-04-16abs ↗pdf ↗

New findings support a new community recovery threshold for Stochastic Block Model with many communities.

problem Recovering communities in Stochastic Block Model with more than sqrt(n) communities.
method Counting specific motifs to achieve polynomial-time community recovery above a new threshold.
result LDP fails below the new threshold, but polynomial-time recovery is possible above it.

New algorithm achieves strong consistency in binary non-uniform hypergraph classification.

problem Node classification on binary non-uniform hypergraphs with varying edge probabilities.
method Proposes a refinement algorithm using power iteration on weighted adjacency matrices.
result Proves optimality of the refinement algorithm, achieving strong consistency and IT lower bound.

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.

Adaptive algorithm for outlier detection by balancing arm exploration and threshold estimation.

problem Identifying outliers in a set of rewards where the threshold is a function of all rewards.
method Adaptively updated confidence interval for the threshold based on previous rounds' estimates, balancing exploration of individual arms and the outlier threshold.
result Efficient algorithm with reduced sample complexity for outlier detection.

A simple thresholding technique improves graph selection in neural connectivity studies.

problem Graphical model selection for functional neural connectivity in the presence of latent variables.
method Apply a hard thresholding operator to graphical Lasso, neighborhood selection, or CLIME estimators.
result Thresholded estimators outperform existing methods in graph selection consistency and empirical results.