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

326597129 · May 202619922001200920172026
48 results for coefficient thresholding

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.

GPDFlow models extreme threshold exceedance with flexible dependence using normalizing flows.

problem Challenges in modeling multivariate threshold exceedance probabilities due to infinite parametrizations.
method GPDFlow uses normalizing flows to flexibly represent dependence without explicit parametric assumptions.
result GPDFlow significantly improves modeling accuracy and flexibility compared to traditional parametric methods.

New robust method for high-dimensional data analysis in imaging studies.

problem Analyzing high-dimensional data with complex dependence and outliers.
method Robust high-dimensional regression with coefficient thresholding and Huber loss.
result Statistical consistency and computational convergence under high-dimensional settings.

Based on the daily data of American and Chinese stock markets, the dynamic behavior of a financial network with static and dynamic thresholds is investigated. Compared with the static threshold, the dynamic threshold suppresses the large fluctuation induced by the cross-correlation of individual stock prices, and leads…

2010-02-18abs ↗pdf ↗

Study on hemisphere threshold for Escobar functional on Riemannian manifolds, revealing mass and boundary invariant behaviors.

problem Analyzing the hemisphere threshold for the Escobar functional on compact Riemannian manifolds.
method Near-threshold landscape organization by boundary invariants, exact evaluation of weighted profile moments, Lyapunov-Schmidt correction, and blow-up analysis.
result At threshold, blow-ups concentrate at umbilic points with vanishing mass and gradient, leading to compactness and hemispherical rigidity.

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.

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 ↗

Geometric framework for signed multivariate tail-dependence compatibility at various thresholds.

problem Modeling and analyzing signed multivariate tail-dependence across different thresholds.
method Developed a geometric witness framework to represent and invert signed tail families, identifying nonnegative weights and normalized masses.
result Characterization and synthesis of signed multivariate tail-dependence at finite thresholds, preserving the complete signed tail family throughout.

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.

New algorithm resists contamination in high-dimensional regression with optimal performance.

problem Adversarial and measurement errors in high-dimensional data.
method Adversarial Contamination-resistant Iterative Hard Thresholding (AC-IHT) algorithm.
result Achieves minimax near-optimal estimation and signal-adaptive support recovery.

The study examines when to trust confidence thresholding in pseudo-labelling regression.

problem Calibrated probabilities from classifiers used for pseudo-labelling need careful handling to avoid bias in downstream regression.
method Developed a diagnostic apparatus to predict and bound the bias induced by confidence thresholding, derived a closed-form expression for the attenuation bias.
result The bias can be predicted from the residual score variance VV^{*}, motivating a structural separation between classifier features and downstream controls.

This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz bounds of the nonlinear analysis map and we establish theoretical performance bo…

2013-08-21abs ↗pdf ↗

This paper explains a mechanism called phase collapse that improves image classification accuracy.

problem Understanding the role of non-linearities and convolutional filters in image classification.
method Demonstrates phase collapse as a mechanism that eliminates spatial variability and linearly separates classes.
result Phase collapse improves classification accuracy, while thresholding operators degrade performance.

The non-negative solution to an underdetermined linear system can be uniquely recovered sometimes, even without imposing any additional sparsity constraints. In this paper, we derive conditions under which a unique non-negative solution for such a system can exist, based on the theory of polytopes. Furthermore, we deve…

2013-03-12abs ↗pdf ↗

We consider the dictionary learning problem, where the aim is to model the given data as a linear combination of a few columns of a matrix known as a dictionary, where the sparse weights forming the linear combination are known as coefficients. Since the dictionary and coefficients, parameterizing the linear model are …

2019-02-28abs ↗pdf ↗

Scaled sparse linear regression jointly estimates the regression coefficients and noise level in a linear model. It chooses an equilibrium with a sparse regression method by iteratively estimating the noise level via the mean residual square and scaling the penalty in proportion to the estimated noise level. The iterat…

2011-04-24abs ↗pdf ↗

Study reconstructs hidden perfect matchings in random graphs with specific edge weights.

problem Reconstructing hidden perfect matchings in random weighted bipartite graphs.
method Analyzes the maximum likelihood estimator for matching reconstruction under different probability distributions of edge weights.
result Sharp threshold and infinite-order phase transition in reconstruction error for different probability distributions.

HARFE approximates sparse additive functions using random features and ridge regression.

problem Approximating high-dimensional sparse additive functions.
method Hard-ridge random feature expansion with sparse ridge regression and hard-thresholding pursuit.
result HARFE method converges with a given error bound and achieves lower error than other algorithms.

A new family of momentum coefficients improves the convergence rate of accelerated algorithms.

problem Improving the convergence rate of accelerated gradient methods for strongly convex functions.
method Introducing a family of controllable momentum coefficients for forward-backward accelerated methods.
result Established a controllable $O\left(1/k^{2α} ight)$ convergence rate for the NAG-αα method.

Identifying the instances of jumps in a discrete-time-series sample of a jump diffusion model is a challenging task. We have developed a novel statistical technique for jump detection and volatility estimation in a return time series data using a threshold method. The consistency of the volatility estimator has been ob…

2019-10-23abs ↗pdf ↗

Continuous phase transitions identified in Doi-Onsager, noisy transformer, and Hegselmann-Krause models.

problem Phase transitions in multimodal models and their properties.
method Sharp coercivity estimate and constrained Lebedev--Milin inequality.
result Continuous phase transitions at critical coupling strengths for Doi-Onsager, noisy transformer, and Hegselmann-Krause models.

New algorithms optimize metrics for binary classification with class imbalance.

problem Optimizing metrics like Fβ, AM, Jaccard for imbalanced classes.
method Reformulates metric optimization as cost-sensitive learning, using surrogate loss functions.
result METRO algorithms provide strong theoretical guarantees and outperform baselines.