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.
Paper proposes automated depression screening using deep CNNs.
Model detects depression from transcribed interviews using affective language.
Study proposes a decision tree for more accurate depression recognition in speech.
Machine learning models predict depression risk based on various factors.
Transfer entropy shows abnormal brain connectivity in depression.
Depression is one of the most common mental health disorders, and a large number of depressed people commit suicide each year. Potential depression sufferers usually do not consult psychological doctors because they feel ashamed or are unaware of any depression, which may result in severe delay of diagnosis and treatme…
Study uses machine learning to detect depression in Twitter users.
Study finds PLI functional connectivity feature superior for depression recognition.
Digital risk scores predict depression and anxiety over 10 years.
Cost-effective models detect depression from speech.
Detecting depression early from social media texts.
Reliable diagnosis of depressive disorder is essential for both optimal treatment and prevention of fatal outcomes. In this study, we aimed to elucidate the effectiveness of two non-linear measures, Higuchi Fractal Dimension (HFD) and Sample Entropy (SampEn), in detecting depressive disorders when applied on EEG. HFD a…
Social media has recently emerged as a premier method to disseminate information online. Through these online networks, tens of millions of individuals communicate their thoughts, personal experiences, and social ideals. We therefore explore the potential of social media to predict, even prior to onset, Major Depressiv…
In this paper, we aimed at reviewing several different approaches present today in the search for more accurate diagnostic and treatment management in mental healthcare. Our focus is on mood disorders, and in particular on the major depressive disorder (MDD). We are reviewing and discussing findings based on neuroimagi…
In this paper, we aimed at reviewing present literature on employing nonlinear analysis in combination with machine learning methods, in depression detection or prediction task. We are focusing on an affordable data-driven approach, applicable for everyday clinical practice, and in particular, those based on electroenc…
The study compares machine learning models for depression detection and highlights the importance of feature selection.
The behaviors of patients with depression are usually difficult to predict because the patients demonstrate the symptoms of a depressive episode without a warning at unexpected times. The goal of this research is to build algorithms that detect signals of such unusual moments so that doctors can be proactive in approac…
Bluetooth data predicts depression severity, showing 18.8% extra variance.
The Audio/Visual Emotion Challenge and Workshop (AVEC 2019) "State-of-Mind, Detecting Depression with AI, and Cross-cultural Affect Recognition" is the ninth competition event aimed at the comparison of multimedia processing and machine learning methods for automatic audiovisual health and emotion analysis, with all pa…
RaSE screens variables via random subspaces, identifying joint effects.
Recurrent major mood episodes and subsyndromal mood instability cause substantial disability in patients with bipolar disorder. Early identification of mood episodes enabling timely mood stabilisation is an important clinical goal. Recent technological advances allow the prospective reporting of mood in real time enabl…
The problem of learning a sparse model is conceptually interpreted as the process of identifying active features/samples and then optimizing the model over them. Recently introduced safe screening allows us to identify a part of non-active features/samples. So far, safe screening has been individually studied either fo…
New Bayesian optimization models for efficient material screening.
This paper treats the problem of screening for variables with high correlations in high dimensional data in which there can be many fewer samples than variables. We focus on threshold-based correlation screening methods for three related applications: screening for variables with large correlations within a single trea…
Statistical inference can be computationally prohibitive in ultrahigh-dimensional linear models. Correlation-based variable screening, in which one leverages marginal correlations for removal of irrelevant variables from the model prior to statistical inference, can be used to overcome this challenge. Prior works on co…
New screening rules improve lasso model fitting efficiency.
A new screening rule 'dynamic Sasvi' improves sparse optimization speed.
In the present paper, we introduce screen transversal lightlike submanifolds of metallic semi-Riemannian manifolds with its subclasses, namely screen transversal anti-invariant, radical screen transversal and isotropic screen transversal lightlike submanifolds, and give an example. We show that there do not exist co-is…
New AI platform screens portfolios for desirable firms and news.
A variable screening procedure via correlation learning was proposed Fan and Lv (2008) to reduce dimensionality in sparse ultra-high dimensional models. Even when the true model is linear, the marginal regression can be highly nonlinear. To address this issue, we further extend the correlation learning to marginal nonp…
Recent computational strategies based on screening tests have been proposed to accelerate algorithms addressing penalized sparse regression problems such as the Lasso. Such approaches build upon the idea that it is worth dedicating some small computational effort to locate inactive atoms and remove them from the dictio…
A new screening method for high-dimensional data reduces computational cost.
We study safe screening for metric learning. Distance metric learning can optimize a metric over a set of triplets, each one of which is defined by a pair of same class instances and an instance in a different class. However, the number of possible triplets is quite huge even for a small dataset. Our safe triplet scree…
In this paper we develop the notion of screen isoparametric hypersurface for null hypersurfaces of Robertson-Walker spacetimes. Using this formalism we derive Cartan identities for the screen principal curvatures of null screen hypersurfaces in Lorentzian space forms and provide a local characterization of such hypersu…
A new method for virtual drug screening detects top treatments.
A new screening rule improves lasso solving speed.
Recently, to solve large-scale lasso and group lasso problems, screening rules have been developed, the goal of which is to reduce the problem size by efficiently discarding zero coefficients using simple rules independently of the others. However, screening for overlapping group lasso remains an open challenge because…
Safe sample screening improves RSVM performance without sacrificing accuracy.
The main purpose of the present paper is to study the geometry of screen transversal lightlike submanifolds and radical screen transversal lightlike submanifolds and screen transversal anti-invariant lightlike submanifolds of Golden Semi-Riemannian manifolds. We investigate the geometry of distributions and obtain nece…
In data sets with many more features than observations, independent screening based on all univariate regression models leads to a computationally convenient variable selection method. Recent efforts have shown that in the case of generalized linear models, independent screening may suffice to capture all relevant feat…
Efficiently allocate budgets for LLM-assisted virtual screening to reduce costs.
Deep learning predicts breast cancer with high accuracy from patient data.
New rules reduce SLOPE model fitting time by screening out irrelevant variables.
A new method reduces feature screening cost from to .
To find efficient screening methods for high dimensional linear regression models, this paper studies the relationship between model fitting and screening performance. Under a sparsity assumption, we show that a subset that includes the true submodel always yields smaller residual sum of squares (i.e., has better model…
Author2Vec generates user embeddings from social media data.
Variable screening is a fast dimension reduction technique for assisting high dimensional feature selection. As a preselection method, it selects a moderate size subset of candidate variables for further refining via feature selection to produce the final model. The performance of variable screening depends on both com…
This paper introduces LR-FFS for robust feature screening in federated learning under label shift.