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

3876113151 · Jun 202019922001200920172026
48 results for noisy disordered matrices

New algorithm optimizes matrix reordering for noisy disordered matrices.

problem Optimizing matrix reordering for noisy disordered matrices in single-cell biology and metagenomics.
method Proposed a polynomial-time adaptive sorting algorithm to improve upon spectral seriation.
result Our algorithm achieves superior performance compared to existing methods in real datasets.

R-PLS improves analysis of brain functional connectivity matrices.

problem Improving analysis of functional connectivity matrices in brain imaging.
method Introducing R-PLS, a generalization of PLS for symmetric positive definite matrices.
result R-PLS identifies key functional connections in brain imaging datasets.

We investigate the problem of estimating a given real symmetric signal matrix C\textbf{C} from a noisy observation matrix M\textbf{M} in the limit of large dimension. We consider the case where the noisy measurement M\textbf{M} comes either from an arbitrary additive or multiplicative rotational invariant perturbati…

2015-02-24abs ↗pdf ↗

Study optimizes shared singular subspace estimation from noisy matrices.

problem Estimating shared singular subspaces across multiple noisy matrices.
method Low-rank matrix denoising framework with Stack-SVD and novel estimators.
result Stack-SVD achieves minimax rate-optimality for identical shared subspaces, and novel estimators for partial sharing.

A method to explain disease transformation using biomarker covariance matrices.

problem Understanding disease transformation from a healthy baseline.
method Modeling healthy and disease states of biomarker covariance matrices to characterize perturbations.
result Disease perturbs the biomarker covariance structure, allowing for mechanistic explanations and individual patient prognosis.

New method uses nuclear and ℓ1 penalties for matrix regression, improving brain disorder detection.

problem Modeling high-dimensional matrix predictors with binary responses.
method Convex optimization with ADMM for low-rank and sparse structures.
result Effective in identifying brain disorder-related connectivity patterns.

Linear problems appear in a variety of disciplines and their application for the transmission matrix recovery is one of the most stimulating challenges in biomedical imaging. Its knowledge turns any random media into an optical tool that can focus or transmit an image through disorder. Here, converting an input-output …

2019-01-15abs ↗pdf ↗

Framework predicts clinical severity from rs-fMRI data using network optimization.

problem Predicting clinical severity from rs-fMRI data.
method Joint network optimization framework combining sparse subnetworks and linear regression.
result Framework outperforms standard methods and identifies clinically relevant ASD networks.

We consider the problem of approximate joint triangularization of a set of noisy jointly diagonalizable real matrices. Approximate joint triangularizers are commonly used in the estimation of the joint eigenstructure of a set of matrices, with applications in signal processing, linear algebra, and tensor decomposition.…

2016-07-02abs ↗pdf ↗

Proposes BONMI for integrating noisy matrices from multi-source data.

problem Integrating noisy matrices from multi-source data with block-wise missingness.
method Exploits orthogonal Procrustes problem to align eigenspaces and completes missing blocks.
result Statistical rate for eigenspace of underlying matrix comparable to independently missing assumption.

Dual-T method improves transition matrix estimation in noisy label learning.

problem Large estimation error in noisy class posterior leads to poor transition matrix estimation.
method Introducing an intermediate class to avoid direct estimation of noisy class posterior, factorizing the transition matrix into two easier-to-estimate matrices.
result The dual-T estimator leads to better classification performances.

Unified model combines neural networks and dictionary learning for clinical predictions from brain data.

problem Predicting clinical severity from brain imaging data.
method Combines neural networks with dictionary learning to model patient-specific and shared features.
result Unified model outperforms state-of-the-art methods in predicting clinical severity.

Study uses interviews to automatically detect BD and BPD with good accuracy.

problem Challenges in distinguishing BD and BPD from clinical interviews.
method Developed a multi-modal dataset and used a linear classifier with selected features from interviews.
result Different sets of features characterize BD and BPD, providing insights into their differences.

This review covers recent results concerning the estimation of large covariance matrices using tools from Random Matrix Theory (RMT). We introduce several RMT methods and analytical techniques, such as the Replica formalism and Free Probability, with an emphasis on the Marchenko-Pastur equation that provides informatio…

2016-10-25abs ↗pdf ↗

Study on a pinning model with random walk increments, showing convergence to a critical disordered pinning measure.

problem Understanding the critical behavior of a disordered pinning model.
method Analyzing a disordered pinning model induced by a random walk with specific moment conditions, showing convergence to a limiting measure.
result Convergence of point-to-point partition functions to the critical disordered pinning measure in the critical window.

Automated detection of voice disorders with computational methods is a recent research area in the medical domain since it requires a rigorous endoscopy for the accurate diagnosis. Efficient screening methods are required for the diagnosis of voice disorders so as to provide timely medical facilities in minimal resourc…

2018-12-04abs ↗pdf ↗

As a mental disorder progresses, it may affect brain structure, but brain function expressed in brain dynamics is affected much earlier. Capturing the moment when brain dynamics express the disorder is crucial for early diagnosis. The traditional approach to this problem via training classifiers either proceeds from ha…

2019-11-16abs ↗pdf ↗

Proposes a method for tensor completion with sparse factors and missing data.

problem Recovering nonnegative data from noisy observations with missing values.
method Sparse nonnegative Tucker decomposition with 0\ell_0 norm for sparsity, maximum likelihood estimation, and error bounds.
result The method outperforms existing tensor-based or matrix-based methods in nonnegative tensor data completion.

Paper introduces a noise-robust classification method using hypergraph neural networks.

problem Noisy label learning problem in image datasets.
method PCA for dimensionality reduction, then applies graph-based semi-supervised learning methods including hypergraph neural network.
result Our proposed hypergraph neural network achieves the best performance when noise level increases.

The study predicts how discussions in mental disorder Reddit communities affect users' emotional states.

problem Improving mental health conditions through social support analysis.
method Text embedding techniques and RNNs for predicting emotional tone shifts.
result Users' emotional states can improve due to social support, as evidenced by positive comments following negative posts.

Spectral denoising recovers meaningful network structure from noisy financial correlations.

problem Noise in empirical correlation matrices from financial returns obscures genuine interactions.
method Spectral decomposition to separate structured and random components.
result Structured networks derived from 10-16 eigenmodes exhibit stronger core-periphery organization and scale-free degree distributions.

Overview of high-dimensional dynamical systems and their applications to machine learning.

problem Characterizing behavior of high-dimensional dynamical systems driven by random matrices.
method Cavity method arguments, path integrals, dynamical mean field theory (DMFT), and random matrix resolvents.
result Connections between random matrix resolvents and DMFT response, and non-monotonic loss curves in training.

A general framework for solving the subspace clustering problem using the CUR decomposition is presented. The CUR decomposition provides a natural way to construct similarity matrices for data that come from a union of unknown subspaces U=Mi=1Si\mathscr{U}=\underset{i=1}{\overset{M}\bigcup}S_i. The similarity matrices thus c…

2017-11-11abs ↗pdf ↗

Deep-learning model detects ASD from MRI data with high accuracy.

problem Challenges in diagnosing ASD due to subjective behavioral assessments and informant biases.
method Integrates deep-learning and SVM techniques to classify ASD brain scans.
result Highly accurate classification of ASD brain scans from neurotypical scans.

Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix rank, we define a new notion of link-rank based on a non-linear link function used within factorization. In particular, by applying the round …

2018-05-01abs ↗pdf ↗

The inverse covariance matrix provides considerable insight for understanding statistical models in the multivariate setting. In particular, when the distribution over variables is assumed to be multivariate normal, the sparsity pattern in the inverse covariance matrix, commonly referred to as the precision matrix, cor…

2017-10-19abs ↗pdf ↗

Model predicts cannabis use disorder risk for adolescents and young adults.

problem Predicting cannabis use disorder progression in adolescents and young adults.
method Bayesian machine learning model trained on longitudinal data.
result Model provides personalized risk assessment with AUC of 0.68-0.75 and E/O ratio of 0.95-1.

We construct 1-parameter families of non-periodic embedded minimal surfaces of infinite genus in T×RT \times \mathbb{R}, where TT denotes a flat 2-tori. Each of our families converges to a foliation of T×RT \times \mathbb{R} by TT. These surfaces then lift to minimal surfaces in R3\mathbb{R}^3 that are periodic in hori…

2019-08-17abs ↗pdf ↗

Deep learning predicts opioid use disorder risk in patients.

problem Identifying patients at high risk of opioid use disorder.
method Applied LSTM models to analyze electronic health records of opioid users.
result LSTM model outperformed other methods with F1 score of 0.8023 and AUCROC of 0.9369.

Study exact limits of matrix reconstruction from noisy projections.

problem Reconstructing matrices from linear projections with high-dimensional data.
method Asymptotic analysis, universality properties, and generalized linear models.
result Exact asymptotic equations for optimal learning performance.

APGD algorithm efficiently recovers over-parameterized matrices from noisy measurements.

problem Matrix sensing problem with over-parameterization and noisy measurements.
method Alternating preconditioned gradient descent (APGD) algorithm incorporating preconditioning terms.
result APGD converges to a near-optimal error at a linear rate.

Boolean matrix factorization and Boolean matrix completion from noisy observations are desirable unsupervised data-analysis methods due to their interpretability, but hard to perform due to their NP-hardness. We treat these problems as maximum a posteriori inference problems in a graphical model and present a message p…

2015-09-28abs ↗pdf ↗