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.

169,051 papers · 148 categories

Trend · papers per month

197394590787 · Jun 202019922001200920172026
48 results for Language-independent feature space

Funnelling improves cross-lingual text classification accuracy.

problem Classifying documents in multiple languages more accurately than individual language classifiers.
method A two-tier classification system using posterior probabilities from language-dependent classifiers.
result Funnelling significantly outperforms state-of-the-art baselines in multilingual text classification.

We describe our language-independent unsupervised word sense induction system. This system only uses topic features to cluster different word senses in their global context topic space. Using unlabeled data, this system trains a latent Dirichlet allocation (LDA) topic model then uses it to infer the topics distribution…

2013-02-28abs ↗pdf ↗

New ASR system handles multiple languages without needing language-specific encoding.

problem Joint training of data-rich and data-scarce languages in a single model.
method Transforms all languages to a single writing system through transliteration, separating modeling and rendering.
result Language-agnostic multilingual ASR system reduces WER up to 10% over language-dependent models.

Entity relatedness has emerged as an important feature in a plethora of applications such as information retrieval, entity recommendation and entity linking. Given an entity, for instance a person or an organization, entity relatedness measures can be exploited for generating a list of highly-related entities. However,…

2018-10-23abs ↗pdf ↗

HTMLPhish detects phishing web pages using deep learning on HTML content.

problem Growing phishing attacks on the web require new detection methods.
method HTMLPhish uses Convolutional Neural Networks (CNNs) to classify HTML documents as phishing or benign.
result HTMLPhish achieves over 93% accuracy in detecting phishing web pages.

NP-HMC extends HMC for nonparametric models in probabilistic programming.

problem Inference for nonparametric models in probabilistic programming.
method Introduces NP-HMC, a generalization of HMC for nonparametric models using tree representable functions.
result Empirically shows significant performance improvements over existing approaches.

Paper benchmarks mutual info estimators on diverse distributions.

problem Evaluating mutual information estimators on complex, real-world distributions.
method Constructs a diverse family of known-ground truth distributions, proposes a benchmark platform.
result Highlights differences in classical and neural estimators' performance across various conditions.

Sentiment analysis (SA) is a task related to understanding people's feelings in written text; the starting point would be to identify the polarity level (positive, neutral or negative) of a given text, moving on to identify emotions or whether a text is humorous or not. This task has been the subject of several researc…

2018-11-29abs ↗pdf ↗

A new framework learns system design using neural features in function space.

problem Learning system design with neural feature extractors.
method Introduces feature geometry in function space, nesting technique for optimal feature approximation.
result Optimal features found from data samples using off-the-shelf architectures and optimizers.

Quantum machine learning models can approximate any continuous function.

problem Theoretical understanding of quantum feature maps in machine learning.
method Proving universal approximation property of quantum machine learning models in quantum-enhanced feature spaces.
result Quantum machine learning models are universal approximators of continuous functions.

In this paper we consider a problem of searching a space of predictive models for a given training data set. We propose an iterative procedure for deriving a sequence of improving models and a corresponding sequence of sets of non-linear features on the original input space. After a finite number of iterations N, the n…

2013-12-19abs ↗pdf ↗

A framework to compare atomistic descriptors and their transformations.

problem Comparing and understanding different atomistic descriptors and their transformations.
method Introducing a framework to compare different sets of descriptors and their transformations by metrics and kernels.
result Diagnostic tools to determine equivalent information and distorted common information between feature spaces.

Study characterizes cryospheric spectral feature space using joint PC+t-SNE approach.

problem Characterize cryospheric spectral feature space for remote sensing applications.
method Compare and contrast two approaches for identifying feature space basis vectors via dimensionality reduction (PCA and t-SNE).
result Joint characterization reveals distinct continua and clusters of ice reflectance properties.

A nonparametric approach for policy learning for POMDPs is proposed. The approach represents distributions over the states, observations, and actions as embeddings in feature spaces, which are reproducing kernel Hilbert spaces. Distributions over states given the observations are obtained by applying the kernel Bayes' …

2012-10-16abs ↗pdf ↗

SCOPE-FE improves feature engineering efficiency for high-dimensional datasets.

problem Expanding and reducing feature space in tabular learning becomes computationally expensive with increased dimensionality.
method SCOPE-FE controls the search space by regulating operator and feature-pair spaces, using OperatorProbing and FeatureClustering.
result SCOPE-FE reduces feature engineering time while maintaining competitive predictive performance.

Gradient descent reshapes the function space of neural networks.

problem Understanding how feature learning affects the function space of neural networks.
method Characterized the evolution of the feature space during training using a two-layer neural network.
result Gradient descent induces a data-adaptive deformation that selectively enhances signal-aligned directions.

Invertible networks help explain decisions and identify important features.

problem Interpreting and explaining the decisions of black-box neural networks.
method Two-stage approach: invertible transformation to feature space and linear classifier. Determining decision boundaries and feature importance using local linear models.
result Ability to explain decisions and identify important features in neural networks.

Proposes feature conformal prediction for broader application in semantic feature spaces.

problem Establishing valid prediction intervals in semantic feature spaces.
method Extends conformal prediction to semantic feature spaces using deep representation learning.
result Feature conformal prediction outperforms regular conformal prediction under mild assumptions.

Random feature models approximate functions in Banach spaces efficiently.

problem Approximating functions in Banach spaces efficiently.
method Randomly initialized feature maps and linear readout training.
result Universal approximation in Bochner spaces for Banach space-valued models.

We tackle linear bandits with partially observable features, achieving sublinear regret.

problem Linear regret due to unobserved features in partially observable linear bandits.
method Feature augmentation with orthogonal basis vectors and a doubly robust estimator.
result Sublinear regret bound of ildeO((d+dh)T) ilde{O}(\sqrt{(d + d_h)T}).

Steerable neural ODEs on homogeneous spaces for equivariant feature dynamics.

problem Learning continuous-time equivariant dynamics of vector-valued features on homogeneous spaces.
method Introduces steerable neural ordinary differential equations on homogeneous spaces, interpreting features as sections of associated vector bundles over MM.
result Steerable NODEs are GG-equivariant when the flow and connection are GG-invariant, and they incorporate existing models.

This paper develops a geometric framework for SHM using feature bundles and gauge theories.

problem Defining feature spaces in population-based SHM.
method Introduces feature bundles as sections of vector bundles over structure spaces, and uses Graph Neural Networks for feature assignment.
result Develops a mathematical framework for SHM that incorporates feature spaces and gauge theories.

A new algorithm detects out-of-distribution samples by concentrating them in feature space.

problem Building safe AI systems requires effective out-of-distribution detection.
method The paper proposes a novel algorithm based on the observation that OoD samples concentrate in feature space.
result The algorithm achieves state-of-the-art performance on various OoD detection benchmarks.

This paper uses Reinforcement Learning to select features from a large dataset.

problem Selecting the best features to minimize variance and bias in machine learning models.
method Formulated the feature selection problem as a Markov Decision Process (MDP) and used Temporal Difference (TD) algorithm.
result The approach using Reinforcement Learning outperformed other methods in selecting features.

Paper proposes redundancy-free features for zero-shot object recognition.

problem Redundant visual features degrade zero-shot object recognition.
method Project original features into a new, statistically independent space.
result RFF-GZSL achieves competitive results on benchmark datasets.

Improved detection of burnt areas in satellite images using evolved hyper-features.

problem Radiometric variations across satellite images and different datasets.
method Understanding feature spaces, training on multi-image datasets, evolving hyper-features, and optimizing for different classifiers.
result Training on multi-image datasets improves model generalization, and evolved hyper-features enhance classifier performance.

A new algorithm interprets DR dimensions and selects features.

problem Lack of interpretability in DR algorithms.
method I-KDR algorithm that maps data to a lower dimensional space with interpretable dimensions and feature selection.
result I-KDR provides better interpretations and higher discriminative performance.

This paper analyzes kNN convergence over feature transformations.

problem The curse of dimensionality affects kNN performance in transformed feature spaces.
method Developed a novel analysis on kNN convergence rates over transformed features, linking properties of the transformed space to raw feature space.
result Theoretical analysis explains why some feature transformations are better for kNN.

Quantum machine learning for 2D classification tasks using optimized feature maps.

problem Classifying data points in finite feature space with quantum machine learning.
method Optimized quantum feature maps and classical model training.
result Exponentially better scaling of deployed kernels in qubit number.

PML-LFC improves PML by estimating label confidence from both feature and label spaces.

problem PML challenges in real-world scenarios where only some labels are relevant.
method PML-LFC estimates label confidence using feature and label space similarities, training a predictor with these values.
result PML-LFC achieves superior performance on synthetic and real-world datasets.

Improves few-shot learning for hierarchical data using hyperbolic space.

problem Few-shot class-incremental learning for hierarchical data.
method Contrastive learning in hyperbolic space, Poincaré ball model, hyperbolic contrastive loss, maximum entropy distribution.
result Effective improvement of coarse and fine class accuracies in few-shot conditions.