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

6.3%12.5%18.8%25.0% · Apr 199319922001200920172026
48 results for ADE classification

Deep AD on images outperforms traditional methods.

problem Traditional AD methods struggle with unsupervised learning due to lack of labeled data.
method Used deep learning on ImageNet to discern between normal and a few random natural images.
result Deep AD classifiers trained on a few random images outperform current state-of-the-art methods.

This paper contains a classification of smooth Kaluza--Klein reductions (by one-parameter subgroups) of the maximally supersymmetric anti de Sitter backgrounds of supergravity theories. We present a classification of one-parameter subgroups of isometries of anti de Sitter spaces, discuss the causal properties of their …

2004-01-27abs ↗pdf ↗

ProtoX-AD: A self-explainable time series anomaly detection framework

problem Lack of explainability in self-supervised time series anomaly detection
method Learning transformation-aware latent representations and interpretable prototypes
result Achieves detection performance comparable to black-box methods while offering more consistent and semantically meaningful explanations

Novel approach combines local and global brain changes for AD prediction.

problem Detecting Alzheimer's disease through local and global brain changes.
method Patch-based 3D-CNNs combined with global topological features for multi-scale brain tissue connectivity.
result Average precision score of 0.95 for classifying cognitively normal subjects and AD patients (prevalence ~55%).

A solution to the problem of topological classification of real cubic fourfolds is presented. It is shown that the real locus of a real non-singular cubic fourfold is obtained from a projective 4-space either by adding several trivial one- and two-handles, or by adding a spherical connected component.

2009-06-08abs ↗pdf ↗

In this paper, we theoretically prove that adding one special neuron per output unit eliminates all suboptimal local minima of any deep neural network, for multi-class classification, binary classification, and regression with an arbitrary loss function, under practical assumptions. At every local minimum of any deep n…

2019-01-02abs ↗pdf ↗

A framework combines unsupervised and semi-supervised AD using synthetic anomalies.

problem Improving anomaly detection in both unsupervised and semi-supervised settings.
method Proposes a new framework that uses both known and synthetic anomalies for training.
result Synthetic anomalies improve anomaly modeling in low-density regions and provide optimal convergence guarantees.

Paper introduces a framework for diagnosing Alzheimer's disease using higher-order topological features from fMRI.

problem Diagnosing Alzheimer's disease using brain network topology.
method Persistent homology to extract higher-order features (cycles, cavities) from fMRI data.
result Framework significantly outperforms existing methods in AD classification.

QC-SPHARM detects Alzheimer's Disease early using hippocampal surface geometry.

problem Early detection of Alzheimer's Disease (AD) using hippocampal surface geometry.
method Spherical harmonics registration, conformality and curvature distortions quantification, t-test feature selection, SVM classification.
result 85.2% testing accuracy on ADNI data, 81.2% on aMCI progression data.

Hierarchical randomized smoothing improves model robustness for complex data.

problem Certifying robustness on complex data (e.g. images, graphs) is challenging.
method Add random noise to a randomly selected subset of entities in a hierarchical manner.
result Hierarchical randomized smoothing yields stronger robustness guarantees with high accuracy.

FCDD improves image anomaly detection without post-hoc explainers.

problem Image anomaly detection, especially pixel-wise.
method Fully Convolutional Data Description (FCDD) directly addresses anomaly detection without post-hoc methods.
result FCDD achieves state-of-the-art results on pixel-wise AD tasks.

Models predict Alzheimer's Dementia from spontaneous speech with high accuracy.

problem Early diagnosis of Alzheimer's Dementia (AD) through spontaneous speech analysis.
method Compared natural language processing techniques including SVM, GBDT, CRFs, and Transformer-based models.
result Top models achieve 0.81-0.82 test set scores for AD vs controls and 4.58 RMSE for Mental Mini State Exam scores.

We classify Freund-Rubin backgrounds of eleven-dimensional supergravity of the form AdS_4 x X^7 which are at least half BPS; equivalently, smooth quotients of the round 7-sphere by finite subgroups of SO(8) which admit an (N>3)-dimensional subspace of Killing spinors. The classification is given in terms of pairs consi…

2009-09-01abs ↗pdf ↗

Smooth Freund-Rubin backgrounds of eleven-dimensional supergravity of the form AdS_4 x X^7 and preserving at least half of the supersymmetry have been recently classified. Requiring that amount of supersymmetry forces X to be a spherical space form, whence isometric to the quotient of the round 7-sphere by a freely-act…

2010-07-27abs ↗pdf ↗

One of the main difficulties in analyzing neural networks is the non-convexity of the loss function which may have many bad local minima. In this paper, we study the landscape of neural networks for binary classification tasks. Under mild assumptions, we prove that after adding one special neuron with a skip connection…

2018-05-22abs ↗pdf ↗

Traditional text classifiers are limited to predicting over a fixed set of labels. However, in many real-world applications the label set is frequently changing. For example, in intent classification, new intents may be added over time while others are removed. We propose to address the problem of dynamic text classifi…

2019-11-04abs ↗pdf ↗

Langevin algorithms improve training of very deep neural networks, especially for image classification.

problem Training very deep neural networks is challenging due to increased non-linearity and the risk of getting stuck in local minima.
method Comparison of Langevin and non-Langevin algorithms for training deep neural networks, introduction of Layer Langevin algorithm.
result Langevin algorithms, especially Layer Langevin, lead to significant improvements in training deep neural networks, particularly for image classification tasks.

We discuss a gap in Besse's book, recently pointed out by Merton, which concerns the classification of Riemannian manifolds admitting a Codazzi tensors with exactly two distinct eigenvalues. For such manifolds, we prove a structure theorem, without adding extra hypotheses and then we conclude with some application of t…

2012-05-15abs ↗pdf ↗

Enhances functional classifier performance with new tree-based methods and unbiased feature importance assessment.

problem Challenges of high-dimensional functional data and biased feature importance assessment.
method Augmented functional classification trees and random forests with ad-hoc conditional permutations for unbiased feature importance.
result Significant enhancement in predictive power of functional classifiers through new feature importance assessment.

In this paper, we present Paranom, a parallel anomaly dataset generator. We discuss its design and provide brief experimental results demonstrating its usefulness in improving the classification correctness of LSTM-AD, a state-of-the-art anomaly detection model.

2018-01-09abs ↗pdf ↗

This research improves multimodal systems by adding a second objective and regularisation methods.

problem Improving performance of multimodal systems with multiple objectives and regularisation.
method Introduces a second objective over multimodal fusion using variational inference and regularisation methods.
result Demonstrates potential for multiple objectives and probabilistic methods to lower variance and improve generalisation.

Graph Neural Networks (GNNs) have boosted the performance of many graph related tasks such as node classification and graph classification. Recent researches show that graph neural networks are vulnerable to adversarial attacks, which deliberately add carefully created unnoticeable perturbation to the graph structure. …

2019-06-10abs ↗pdf ↗

Improves disease progression prediction using auxiliary surrogate labels and health markers.

problem Challenges in predicting disease progression due to unknown true disease states.
method Integrates hidden Markov model with time-varying discriminative classification model.
result Significant improvement in distinguishing LBD from AD using objective markers.

New model detects Alzheimer's and severity from speech, cognitive, and language data.

problem Detecting Alzheimer's disease and its severity from multimodal data.
method Multimodal ensemble system using acoustic, cognitive, and linguistic features.
result State-of-the-art accuracy and robustness in AD detection and MMSE score regression.

Interprets feature interactions in ad-click prediction models.

problem Improving interpretability of black-box recommender systems.
method Interprets feature interactions from a source model and encodes them in a target model.
result Interpretations significantly outperform existing recommender models.

In order to improve mobile data transparency, a number of network-based approaches have been proposed to inspect packets generated by mobile devices and detect personally identifiable information (PII), ad requests, or other activities. State-of-the-art approaches train classifiers based on features extracted from HTTP…

2019-07-30abs ↗pdf ↗