arXiv research

Paper analyzes robust matrix completion with efficient nonconvex method and leave-one-out analysis.

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

Study on discrete Okounkov bodies and their applications.

We investigate the probability distributions of the recurrence intervals $τ$ between consecutive 1-min returns above a positive threshold $q>0$ or below a negative threshold $q<0$ of two indices and 20 individual stocks in China's stock market. The distributions of recurrence intervals for positive and negative thresho…

In this work, we derive a generic overcomplete frame thresholding scheme based on risk minimization. Overcomplete frames being favored for analysis tasks such as classification, regression or anomaly detection, we provide a way to leverage those optimal representations in real-world applications through the use of thre…

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

Nuclear norm minimization (NNM) has recently gained significant attention for its use in rank minimization problems. Similar to compressed sensing, using null space characterizations, recovery thresholds for NNM have been studied in \cite{arxiv,Recht_Xu_Hassibi}. However simulations show that the thresholds are far fro…

In this paper, we implement multi-label neural networks with optimal thresholding to identify gas species among a multi gas mixture in a cluttered environment. Using infrared absorption spectroscopy and tested on synthesized spectral datasets, our approach outperforms conventional binary relevance - partial least squar…

We study confidence intervals based on hard-thresholding, soft-thresholding, and adaptive soft-thresholding in a linear regression model where the number of regressors $k$ may depend on and diverge with sample size $n$. In addition to the case of known error variance, we define and study versions of the estimators when…

In this work, a heuristic as operational tool to estimate the lactate threshold and to facilitate its integration into the training process of recreational runners is proposed. To do so, we formalize the principles for the lactate threshold estimation from empirical data and an iterative methodology that enables experi…

Even in the face of deteriorating and highly volatile demand, firms often invest in, rather than discard, aging technologies. In order to study this phenomenon, we model the firm's profit stream as a Brownian motion with negative drift. At each point in time, the firm can continue operations, or it can stop and exit th…

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

The use of M-estimators in generalized linear regression models in high dimensional settings requires risk minimization with hard $L_0$ constraints. Of the known methods, the class of projected gradient descent (also known as iterative hard thresholding (IHT)) methods is known to offer the fastest and most scalable sol…

Paper analyzes adaptive ISTA with MAD for LASSO problem.

Inspired by the recent success of deep neural networks and the recent efforts to develop multi-layer dictionary models, we propose a Deep Analysis dictionary Model (DeepAM) which is optimized to address a specific regression task known as single image super-resolution. Contrary to other multi-layer dictionary models, o…

The assumption that the values of model parameters are known or correctly learned, i.e., the Nishimori condition, is one of the requirements for the detectability analysis of the stochastic block model in statistical inference. In practice, however, there is no example demonstrating that we can know the model parameter…

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

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

Study online learner attacks by manipulating labels, revealing critical thresholds.

Paper bounds tensor decomposition's RLCT, aiding Bayesian inference.

Study community detection in multi-view data with various types of information.

Sparse Inverse Covariance Estimation (SICE) is useful in many practical data analyses. Recovering the connectivity, non-connectivity graph of covariates is classified amongst the most important data mining and learning problems. In this paper, we introduce a novel SICE approach using adaptive thresholding. Our method i…

This paper analyzes convergence of DP-SGD with adaptive quantile clipping.

This paper presents a novel analysis of two feed-in tariffs (FIT) under market and regulatory uncertainty, namely a sliding premium with cap and floor and a minimum price guarantee. Regulatory uncertainty is modeled with a Poisson process, whereby a jump event may reduce the tariff before the signature of the contract.…

A central problem of random matrix theory is to understand the eigenvalues of spiked random matrix models, in which a prominent eigenvector is planted into a random matrix. These distributions form natural statistical models for principal component analysis (PCA) problems throughout the sciences. Baik, Ben Arous and Pé…

We provide high probability finite sample complexity guarantees for hidden non-parametric structure learning of tree-shaped graphical models, whose hidden and observable nodes are discrete random variables with either finite or countable alphabets. We study a fundamental quantity called the (noisy) information threshol…

Sharp large deviations and Gibbs conditioning for portfolio credit risk models.

Traffic prediction plays a vital role in efficient planning and usage of network resources in wireless networks. While traffic prediction in wired networks is an established field, there is a lack of research on the analysis of traffic in cellular networks, especially in a content-blind manner at the user level. Here, …

Let $M$ be a compact, unit volume, Riemannian manifold with boundary. In this paper we study the homology of a random Čech-complex generated by a homogeneous Poisson process in $M$. Our main results are two asymptotic threshold formulas, an upper threshold above which the Čech complex recovers the $k$-th homology of $M…

The first order behavior of multivariate heavy-tailed random vectors above large radial thresholds is ruled by a limit measure in a regular variation framework. For a high dimensional vector, a reasonable assumption is that the support of this measure is concentrated on a lower dimensional subspace, meaning that certai…

Spectral density matrix estimation of multivariate time series is a classical problem in time series and signal processing. In modern neuroscience, spectral density based metrics are commonly used for analyzing functional connectivity among brain regions. In this paper, we develop a non-asymptotic theory for regularize…

We present a framework and analysis of consistent binary classification for complex and non-decomposable performance metrics such as the F-measure and the Jaccard measure. The proposed framework is general, as it applies to both batch and online learning, and to both linear and non-linear models. Our work follows recen…

Study proposes an active subsampling method for estimating individualized thresholds in high-dimensional data.

New findings on community recovery in SBM with many communities.

Unified analysis of parameter norms in overparameterized linear models, revealing scaling laws and thresholds.

Complex performance measures, beyond the popular measure of accuracy, are increasingly being used in the context of binary classification. These complex performance measures are typically not even decomposable, that is, the loss evaluated on a batch of samples cannot typically be expressed as a sum or average of losses…

We found a unified formula for description of the household incomes of all society classes, for instance, of those of the European Union in year 2007. This formula is a stationary solution of the threshold Fokker-Planck equation (derived from the threshold nonlinear Langevin one). The formula is more general than the w…

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

Stop-loss rules are often studied in the financial literature, but the stop-loss levels are seldom constructed systematically. In many papers, and indeed in practice as well, the level of the stops is too often set arbitrarily. Guided by the overarching goal in finance to maximize expected returns given available infor…

A new method for sparse PCA using orthogonal rotations and soft-thresholding.

New local-search methods close the gap in sparse tensor PCA.

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…

Sparse GCA finds linear relationships in multiple datasets, using gradient descent.

Optimal rank-adaptive matrix estimation from linear measurements.

Consider a two-class classification problem where the number of features is much larger than the sample size. The features are masked by Gaussian noise with mean zero and covariance matrix $Σ$, where the precision matrix $Ω=Σ^{-1}$ is unknown but is presumably sparse. The useful features, also unknown, are sparse and e…

In this paper, we establish two new types of invariant sets for the coupled nonlinear Schrodinger system on $\mathbb{R}^n$, and derive two sharp thresholds of blow-up and global existence for its solution. Some analogous results for the nonlinear Schrodinger system posed on the hyperbolic space $\mathbb{H}^n$ and on th…

Iterative thresholding algorithms seek to optimize a differentiable objective function over a sparsity or rank constraint by alternating between gradient steps that reduce the objective, and thresholding steps that enforce the constraint. This work examines the choice of the thresholding operator, and asks whether it i…

The analysis of Belief Propagation and other algorithms for the {\em reconstruction problem} plays a key role in the analysis of community detection in inference on graphs, phylogenetic reconstruction in bioinformatics, and the cavity method in statistical physics. We prove a conjecture of Evans, Kenyon, Peres, and Sch…