Unsupervised domain adaptation methods aim to alleviate performance degradation caused by domain-shift by learning domain-invariant representations. Existing deep domain adaptation methods focus on holistic feature alignment by matching source and target holistic feature distributions, without considering local feature…
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
48 results for “Feature localization”
New method R-LOCO improves local feature importance analysis.
problem Local attribution methods fail to accurately identify important features.
method R-LOCO segments input space into regions and applies global methods within.
result R-LOCO delivers more accurate local attributions.
FSL-Net detects and localizes feature shifts in large, high-dimensional datasets.
problem Feature shifts between data sources lead to erroneous features in various applications.
method FSL-Net is a neural network trained on multiple datasets to localize feature shifts.
result FSL-Net accurately localizes feature shifts from unseen datasets without re-training.
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…
Improves local learning models for complex feature extraction.
problem Limited use of simple model families in local learning.
method Uses complex local model families to extract features.
result Demonstrates applications in various fields.
Paper presents a novel approach for global feature aggregation in Graph Neural Networks.
problem Graphs lack a straightforward way to perform non-local feature aggregation like images and texts.
method Utilizes Latent Fixed Data Structure (LFDS) to aggregate feature vectors from local extraction.
result Proposed methods achieve competitive or better results with linear computational complexity.
This paper introduces a family of local feature aggregation functions and a novel method to estimate their parameters, such that they generate optimal representations for classification (or any task that can be expressed as a cost function minimization problem). To achieve that, we compose the local feature aggregation…
Study proposes Local Linear Encoding for better feature discretization.
problem Improving feature discretization for numeric data.
method Theoretical analysis and Local Linear Encoding (LLE) method.
result LLE outperforms conventional methods with fewer parameters.
We introduce a method called multi-scale local shape analysis, or MLSA, for extracting features that describe the local structure of points within a dataset. The method uses both geometric and topological features at multiple levels of granularity to capture diverse types of local information for subsequent machine lea…
New method identifies important features and interactions in RF models.
problem Limited theoretical understanding of local feature and interaction importance in RF models.
method Combines global and local analysis to identify frequent feature co-occurrences.
result Proves consistent recovery of true local signal features and interactions.
Purpose: Lung nodules have very diverse shapes and sizes, which makes classifying them as benign/malignant a challenging problem. In this paper, we propose a novel method to predict the malignancy of nodules that have the capability to analyze the shape and size of a nodule using a global feature extractor, as well as …
New method for private learning with public features improves convergence rates.
problem Private estimation with public features under local differential privacy.
method Semi-feature LDP, HistOfTree estimator.
result HistOfTree reaches mini-max optimal convergence rate.
GOLFS selects features for clustering by combining global and local information.
problem Feature selection for high-dimensional clustering without labels.
method Combines global and local information via manifold learning and regularized self-representation.
result Improves feature selection and clustering accuracy.
Improved local feature attributions using neighbourhood reference distributions.
problem Misleading results from global population in local model behaviour.
method Formulation of neighbourhood reference distributions and self-normalised importance sampling.
result Neighbourhood Shapley values provide meaningful sparse feature attributions.
RbX generates local explanations for black-box models using greedy polytope construction.
problem Generating interpretable local explanations for complex models.
method Greedy algorithm for building a convex polytope to approximate feature regions.
result RbX can more accurately identify important features compared to existing methods.
Data-Adaptive Discriminative Feature Localization with Statistically Guaranteed Interpretationstat.ML
Develops a method to interpret deep learning models by identifying key features.
problem Revealing the decision-making process of blackbox models from raw data to predictions.
method Adversarial attacks to localize discriminative features with statistical guarantees.
result Locally identified features are both biologically plausible and statistically significant.
Gradient descent learns useful features even in the NTK regime.
problem The ability of neural networks to learn useful features.
method Local convergence analysis of gradient descent with regularization.
result Gradient descent can capture ground-truth directions for feature learning even after the loss threshold is reached.
Unified method for local GBDT feature contributions.
problem Need for local model interpretation for GBDT.
method Unified computation mechanism for instance-level feature contributions.
result Unified computation mechanism for GBDT feature contributions.
SVM with local features improves human action recognition.
problem Improving human action recognition in videos.
method Local appearance and motion features extracted using CNNs, concatenated, and used with SVM for classification.
result SVM with local features outperforms previous methods on benchmark datasets.
Image Super-Resolution with Cross-Scale Non-Local Attention and Exhaustive Self-Exemplars Miningcs.CV
This paper improves image super-resolution by integrating cross-scale non-local attention.
problem Improving image super-resolution by leveraging long-range and cross-scale feature correlations.
method Proposes a Cross-Scale Non-Local (CS-NL) attention module integrated into a recurrent neural network.
result Significantly improved performance on SISR benchmarks.
3D convolutional neural networks (3D-CNN) have been used for object recognition based on the voxelized shape of an object. In this paper, we present a 3D-CNN based method to learn distinct local geometric features of interest within an object. In this context, the voxelized representation may not be sufficient to captu…
Local MDI+ improves feature importance for tree-based models, enhancing interpretability and performance.
problem Lack of instance-specific feature importance for tree-based models.
method Local MDI+ extends MDI+ framework to provide instance-specific feature importances.
result Local MDI+ outperforms existing baselines, improving predictive performance by 10%.
CDLEEDS detects local changes in evolving data streams for accurate feature attributions.
problem Local feature attributions become obsolete in evolving data streams.
method CDLEEDS, a flexible framework for detecting local change and concept drift.
result CDLEEDS reliably detects both local and global concept drift.
The excellent performance of representation learning of autoencoders have attracted considerable interest in various applications. However, the structure and multi-local collaborative relationships of unlabeled data are ignored in their encoding procedure that limits the capability of feature extraction. This paper pre…
Losaw improves FI scores by decorrelating features in ML models.
problem Feature correlation distorts feature importance scores in ML models.
method Losaw uses local sample weighting to decorrelate features.
result Losaw consistently improves feature importance scores and prediction accuracy.
A theory of feature geometry using spectral analysis of weight matrices.
problem Current methods decompose neural network activations into sparse linear features, losing geometric structure.
method Develops a theory by analyzing the spectra of weight-derived matrices, introducing the frame operator.
result Features collapse onto single eigenspaces, organizing into tight frames, and admit discrete classification.
Study models deep learning training dynamics using locally elastic SDEs to reveal feature separability.
problem Understanding how deep learning models separate features from different classes during training.
method Modeling deep learning training using locally elastic SDEs with a drift term reflecting backpropagation impact.
result Local elasticity in SDEs leads to linear separability of features, resulting in vanishing training loss.
FedCONST adapts update magnitudes to enhance feature generalization in FL.
problem Heterogeneous client data in FL leads to overfitting and distorted transferable features.
method FedCONST uses linear convex constraints to stabilize training and preserve generalization.
result FedCONST enhances feature transferability and robustness, achieving state-of-the-art performance.
HKConv learns hyperbolic features by aggregating kernel points.
problem Challenges in learning good hyperbolic representations using Euclidean operations.
method Proposes HKConv, a trainable hyperbolic convolution that correlates local features with kernel points and aggregates them.
result HKConv learns expressive local features according to hyperbolic geometry and enjoys equivariance to permutation and invariance to parallel transport.
DNNs improve localization from channel estimates, overcoming practical impairments.
problem Improving localization accuracy from channel estimates in Massive MIMO systems.
method Principled feature design for DNNs invariant to practical impairments.
result DNN achieves high localization accuracy and generalization capability.
In recent years, a large amount of model-agnostic methods to improve the transparency, trustability and interpretability of machine learning models have been developed. We introduce local feature importance as a local version of a recent model-agnostic global feature importance method. Based on local feature importance…
GADGET framework decomposes global feature effects using recursive partitioning.
problem Misleading global feature effects when feature interactions are present.
method Generalized additive decomposition of global effects (GADGET) based on recursive partitioning.
result Minimizes interaction-related heterogeneity of local feature effects.
In many fields such as bioinformatics, high energy physics, power distribution, etc., it is desirable to learn non-linear models where a small number of variables are selected and the interaction between them is explicitly modeled to predict the response. In principle, neural networks (NNs) could accomplish this task s…
Uncovering Locally Low-dimensional Structure in Networks by Locally Optimal Spectral Embeddingstat.ML
LASE improves local network structure visualization by targeting locally low-dimensional regions.
problem Global spectral embedding fails to capture local geometric features in sparse, transitive networks.
method Local Adjacency Spectral Embedding (LASE) using weighted spectral decomposition.
result LASE reveals locally low-dimensional structure, improving local reconstruction and visualization.
This paper presents a spermwhale' localization architecture using jointly a bag-of-features (BoF) approach and machine learning framework. BoF methods are known, especially in computer vision, to produce from a collection of local features a global representation invariant to principal signal transformations. Our idea …
We give asymptotically tight estimates of tangent space variation on Riemannian submanifolds of Euclidean space with respect to the local feature size of the submanifolds. We show that the result follows directly from structural properties of local feature size of the Riemannian submanifold and some elementary Euclidea…
Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentationcs.LG
Axis-aligned subspace clustering generally entails searching through enormous numbers of subspaces (feature combinations) and evaluation of cluster quality within each subspace. In this paper, we tackle the problem of identifying subsets of features with the most significant contribution to the formation of the local n…
Covariance pooling is a feature pooling method with good classification accuracy. Because covariance features consist of second-order statistics, the scale of the feature elements are varied. Therefore, normalizing covariance features using a matrix square root affects the performance improvement. When pooling methods …
Combines global and local features for better social circle prediction in ego-networks.
problem Efficiently analyzing ego-networks with hidden local structures.
method Evolved deep learning techniques to capture both global and local network features.
result Social circle prediction benefits from a combination of global and local features.
In recent years, many publications showed that convolutional neural network based features can have a superior performance to engineered features. However, not much effort was taken so far to extract local features efficiently for a whole image. In this paper, we present an approach to compute patch-based local feature…
Linear dimensionality reduction techniques are powerful tools for image analysis as they allow the identification of important features in a data set. In particular, nonnegative matrix factorization (NMF) has become very popular as it is able to extract sparse, localized and easily interpretable features by imposing an…
In this paper, we propose and study random maxout features, which are constructed by first projecting the input data onto sets of randomly generated vectors with Gaussian elements, and then outputing the maximum projection value for each set. We show that the resulting random feature map, when used in conjunction with …
In probabilistic approaches to classification and information extraction, one typically builds a statistical model of words under the assumption that future data will exhibit the same regularities as the training data. In many data sets, however, there are scope-limited features whose predictive power is only applicabl…
CaLoNet integrates spatial and local correlations for multivariate time series classification.
problem Ignoring spatial and local correlations in multivariate time series classification.
method Model spatial correlations using causality modeling, extract local correlations, integrate into graph neural network.
result Competitive performance compared to state-of-the-art methods on UEA datasets.
Proposes a method for multi-view clustering that considers local structures and feature weights.
problem Challenges in effectively exploiting complementary information across multiple views.
method Simultaneously assigns weights to different features and captures local information in view-specific feature spaces.
result Achieves state-of-the-art performance on benchmark datasets.
Classifiers label data as belonging to one of a set of groups based on input features. It is challenging to obtain accurate classification performance when the feature distributions in the different classes are complex, with nonlinear, overlapping and intersecting supports. This is particularly true when training data …
Local convolutions bias neural networks towards high-frequency adversarial examples.
problem High-frequency adversarial examples in neural networks.
method Analysis of different linear and nonlinear architectures, focusing on the impact of local convolution operations.
result Local convolutions induce an implicit bias towards high frequency features, leading to high-frequency adversarial examples.
Proposes RLAR for efficient labeled data classification with robust margin and manifold structure.
problem Clear margin representation and data manifold structure difficulty in linear discriminant methods.
method Introduces retargeted regression for adaptive margin learning and locality-aware strategy for compact data manifold.
result RLAR outperforms state-of-the-art approaches in UCI and benchmark data sets.