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,742 papers · 148 categories

Trend · papers per month

91183274365 · Jun 202019922001200920172026
48 results for class descriptors

ALP outperforms other data descriptors in one-class classification.

problem Challenges in one-class classification using data descriptors.
method Determined optimal default hyperparameters for data descriptors, proposed ALP, evaluated using leave-one-dataset-out procedure.
result ALP outperforms other data descriptors, including IF and SVM.

DRAGON improves learning for rare classes in unbalanced datasets using class descriptions.

problem Learning rare classes in unbalanced datasets with deep models.
method DRAGON is a late-fusion architecture that corrects bias towards frequent classes and fuses class-descriptions to improve tail-class accuracy.
result DRAGON outperforms state-of-the-art models on new benchmarks for long-tail learning with class descriptors.

Optimizes atomic descriptors to reduce redundancy and improve machine learning models.

problem Redundant descriptors in atomistic machine learning models increase computational burden and limit model expressivity.
method Employing techniques from pattern recognition, we refine and augment existing atomistic representations to produce optimal sets of descriptors.
result New architectures recognize up to 5-body patterns with low computational cost and high accuracy.

Informative and discriminative feature descriptors play a fundamental role in deformable shape analysis. For example, they have been successfully employed in correspondence, registration, and retrieval tasks. In the recent years, significant attention has been devoted to descriptors obtained from the spectral decomposi…

2011-10-23abs ↗pdf ↗

Persistent homology provides a new, efficient molecular descriptor for protein dynamics.

problem Designing effective molecular descriptors for high-dimensional MD trajectories.
method Introduced masked Flood complex, a protein-tailored modification of simplicial complexes, for persistent homology.
result Persistent homology-based descriptors are competitive across protein dynamics tasks, including frame-level observable regression and MSM estimation.

In this paper, we provide a new neural-network based perspective on multi-task learning (MTL) and multi-domain learning (MDL). By introducing the concept of a semantic descriptor, this framework unifies MDL and MTL as well as encompassing various classic and recent MTL/MDL algorithms by interpreting them as different w…

2014-12-23abs ↗pdf ↗

A criterion for training-free time-lagged spectral embeddings of multivariate time series

problem Applicability of fixed-length descriptors for multivariate time series
method Using a stationary Gaussian VAR(1) model and cosine similarity to classify descriptors
result D(τ) separates two classes when signals are approximately stationary and cross-channel temporal coupling is present

This work characterizes topological descriptors of graph products and their expressive power.

problem Capturing multiscale structural information in graph products using topological descriptors.
method Analysis of various filtrations on graph products, including Euler characteristic and persistent homology.
result Persistent homology of graph products contains more information than individual graphs.

Although the recent progress in the deep neural network has led to the development of learnable local feature descriptors, there is no explicit answer for estimation of the necessary size of a neural network. Specifically, the local feature is represented in a low dimensional space, so the neural network should have mo…

2017-06-16abs ↗pdf ↗

Wittgenstein's Rule Following evolves datasets by extrapolating structural descriptors.

problem Generating meaningful continuations of evolving datasets.
method Wittgenstein's Rule Following (WRF) uses structural descriptors to extrapolate trajectories and average historical descriptors.
result WRF can generate meaningful continuations of evolving datasets.

Support Vector Machines (SVMs) are powerful learners that have led to state-of-the-art results in various computer vision problems. SVMs suffer from various drawbacks in terms of selecting the right kernel, which depends on the image descriptors, as well as computational and memory efficiency. This paper introduces a n…

2013-07-19abs ↗pdf ↗

PolyGraph Discrepancy improves graph generative model evaluation.

problem Inability of existing metrics to provide an absolute performance measure and comparability across different graph descriptors.
method Approximates Jensen-Shannon distance using binary classifiers trained to distinguish between real and generated graphs.
result PGD provides a more robust and insightful evaluation compared to MMD metrics.

This thesis uses Kantorovich-Rubinstein distance for classifying points based on their measures.

problem Classifying points based on their measures in a metric space.
method Using Kantorovich-Rubinstein distance as a metric in the space of measures to capture geometry and topology.
result A large Kantorovich-Rubinstein distance indicates the existence of a 1-Lipschitz classifier that well classifies the points.

A framework separates chemical and structural contributions to aqueous solubility.

problem Merging chemical and structural information in solubility models obscures their relative contributions.
method Additive MLP-GNN framework with separate chemical and structural branches.
result Framework reveals distinct roles of chemical and structural information in solubility.

Method separates target signal properties from noisy mixtures.

problem Signal recovery from noisy mixtures with specific statistical properties.
method Statistical component separation method using noise samples and matching statistics.
result Method outperforms standard denoising methods in recovering target signal properties.

The paper tackles binary classification with measure data using topological descriptors.

problem Binary classification with measure data.
method Develops classifiers for measure data using topological descriptors (persistence diagrams).
result Upper and lower bounds on the Rademacher complexity of classifiers on measures.

The ability to visually re-identify objects is a fundamental capability in vision systems. Oftentimes, it relies on collections of visual signatures based on descriptors, such as SIFT or SURF. However, these traditional descriptors were designed for a certain domain of surface appearances and geometries (limited relief…

2019-12-06abs ↗pdf ↗

Paper introduces stable vectorization for multiparameter PH using signed barcodes.

problem Lack of stable vectorization methods for multiparameter persistent homology.
method Signed barcodes as measures for stable vectorization of MPH.
result Stable feature vectors from signed barcodes improve performance in data science.

Study identifies COVID-19 pneumonia from chest X-rays.

problem Identifying COVID-19 pneumonia from other types and healthy lungs using CXR images.
method Proposed a multi-class and hierarchical classification schema using CXR images, texture descriptors, and a pre-trained CNN model. Employed resampling algorithms and early/late fusion techniques.
result Achieved macro-avg F1-Score of 0.65 and F1-Score of 0.89 for COVID-19 identification in hierarchical classification scenario.

The stochastic block model accurately describes most empirical networks but struggles with large diameter and slow-mixing networks.

problem Assessing the quality of fit of the stochastic block model for empirical networks.
method Posterior predictive model checking using network descriptors.
result The stochastic block model can accurately describe most empirical networks but struggles with large diameter and slow-mixing networks.

Covariance and histogram image descriptors provide an effective way to capture information about images. Both excel when used in combination with special purpose distance metrics. For covariance descriptors these metrics measure the distance along the non-Euclidean Riemannian manifold of symmetric positive definite mat…

2014-12-04abs ↗pdf ↗

Framework for interpreting ML models to reveal properties of real-world phenomena.

problem Lack of direct interpretability in modern ML models hinders scientific understanding.
method Developed 'property descriptors' grounded in statistical learning theory.
result Property descriptors can reveal relevant properties of joint probability distributions.

Optimizes one-class classification methods for better performance.

problem Improving one-class classification accuracy through hyperparameter optimization.
method Hyperparameter optimization for five one-class classification methods (SVM, NND, LNND, LOF, ALP) using various datasets.
result ALP and SVM perform best after hyperparameter optimization, with ALP being more efficient.

Time series forecasting models fail to consistently select the best model across different datasets.

problem Inconsistency in model selection for time series forecasting across varying data regimes.
method Characterized time series using descriptors like trend strength, seasonality, noise level, and temporal dependence. Developed a rule-based selection mechanism to map data regimes to candidate models.
result Rule-based model selection achieves low accuracy, with correct model identification occurring in only a small fraction of cases.

Method embeds numeric tabular datasets into a shared vector space for similarity and retrieval.

problem Lack of meaningful representation for numeric tabular datasets in large language models.
method Structured exploratory data analysis descriptors, sentence transformer embedding, CCA for cross-dataset alignment.
result Total P@1 score of 0.9 across 15 datasets, robust nearest-neighbor retrieval and cluster structure.

A new method learns from multi-modal sequences with external memory.

problem Learning new modes in a dynamic environment without prior knowledge.
method Maintains a neural episodic memory with a Dirichlet Process prior to store mode descriptors and transfers knowledge through retrieval.
result Performs continual learning favorably compared to mainstream approaches.

New method uses geometric moments for accurate machine learning potentials.

problem Creating high-dimensional potential energy surfaces efficiently.
method Feed-forward neural networks with invariant local molecular descriptors based on geometric moments.
result Accuracy comparable to established models, high efficiency.

Framework separates chemical and structural contributions to aqueous solubility.

problem Merging chemical and structural information in solubility models obscures their relative importance.
method Additive MLP-GNN framework with separate chemical and structural branches.
result Framework reveals distinct roles of chemical and structural information in solubility.

Unsupervised feature learning has shown impressive results for a wide range of input modalities, in particular for object classification tasks in computer vision. Using a large amount of unlabeled data, unsupervised feature learning methods are utilized to construct high-level representations that are discriminative en…

2013-01-14abs ↗pdf ↗

This paper studies the cooperative training of two generative models for image modeling and synthesis. Both models are parametrized by convolutional neural networks (ConvNets). The first model is a deep energy-based model, whose energy function is defined by a bottom-up ConvNet, which maps the observed image to the ene…

2016-09-29abs ↗pdf ↗

A new method interprets astrophysical spectra using geometric paths to distinguish line profiles.

problem Tackling the indistinguishability of spectral line profiles under scalar summaries.
method Introduces a geometric representation of line profiles using rough path theory, mapping profiles to a common velocity grid and defining descriptors from path properties.
result Compact descriptors separate morphologies with similar scalar summaries, revealing ordered line structures.

This work improves interpretability and calibration of complex-valued neural networks using Newton-Puiseux analysis.

problem Insufficient interpretability and probability calibration of complex-valued neural networks.
method Newton-Puiseux framework to examine local decision geometry, fitting a polynomial surrogate and factorizing it using Newton-Puiseux expansions.
result Enhanced Expected Calibration Error in ECG and wireless modulation datasets compared to uncalibrated softmax and standard post-hoc baselines.

We use persistent homology along with the eigenfunctions of the Laplacian to study similarity amongst triangulated 2-manifolds. Our method relies on studying the lower-star filtration induced by the eigenfunctions of the Laplacian. This gives us a shape descriptor that inherits the rich information encoded in the eigen…

2019-04-21abs ↗pdf ↗

Proposes a new model to predict polymer properties by integrating various data types.

problem Inaccurate polymer property prediction due to separate modeling of different data types.
method Multi-modal cascade feature transfer using GCN for chemical structure and molecular descriptors.
result Empirically evaluated model shows higher predictive performance than single-feature approaches.