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

Trend · papers per month

97194291388 · Jun 202019922001200920172026
48 results for IMU features

This paper proposes IMU preintegrated features for efficient deep inertial odometry.

problem Efficient odometry from IMU data is challenging due to sensor imperfections and noise.
method Proposes IMU preintegrated features exploiting IMU motion model's manifold structure.
result Improves odometry performance and reduces computational burdens.

Deep neural network improves hand gesture classification from wearable IMUs.

problem Classifying hand gestures from wearable IMUs using conventional methods.
method Deep Neural Network (DNN) with optimization objective for signal fitting.
result 3-5% improvement in classification accuracy compared to SVM and kNN.

In this paper we propose a novel accurate method for dead-reckoning of wheeled vehicles based only on an Inertial Measurement Unit (IMU). In the context of intelligent vehicles, robust and accurate dead-reckoning based on the IMU may prove useful to correlate feeds from imaging sensors, to safely navigate through obstr…

2019-04-12abs ↗pdf ↗

Novel CNN array for sign language recognition using wearable IMUs.

problem Efficiently recognizing sign language from wearable IMU signals.
method Two-dimensional Convolutional Neural Network array architecture for Indian sign language recognition.
result Peak classification accuracies of 94.20% for general sentences and 95.00% for interrogative sentences achieved.

Wearables like smartwatches which are embedded with sensors and powerful processors, provide a strong platform for development of analytics solutions in sports domain. To analyze players' games, while motion sensor based shot detection has been extensively studied in sports like Tennis, Golf, Baseball; Table Tennis and…

2018-05-14abs ↗pdf ↗

Deep CapsNet improves sign language recognition from wearable IMUs.

problem Continuous recognition of sign language from wearable devices.
method Custom CapsNet architecture using deep capsule networks and game theory.
result Improved accuracy of 94% and 92.50% for 3 and 5 routings respectively, compared to 87.99% for CNN.

Deep learning identifies functional primitives in stroke rehabilitation.

problem Measuring the necessary dose of rehabilitation training for stroke recovery.
method Automatic identification of functional primitives using IMUs and deep learning.
result Convolutional neural network achieved 70% accuracy in primitive classification.

The problem of automatic identification of physical activities performed by human subjects is referred to as Human Activity Recognition (HAR). There exist several techniques to measure motion characteristics during these physical activities, such as Inertial Measurement Units (IMUs). IMUs have a cornerstone position in…

2019-06-05abs ↗pdf ↗

Deep RL drone trained to compete against classical path planning in drone racing.

problem Optimizing long-term drone racing strategies using reinforcement learning.
method Used PPO algorithm on a simulated quadrotor in a racing environment created with AirSim.
result Deep RL agent outperformed classical path planning in drone racing competitions.

Feature networks link ML features via graph structure for enhanced learning.

problem Enhancing feature expressiveness and learning efficiency in machine learning.
method Graph representation of feature vectors, leveraging Fourier and functional analysis.
result Feature networks enable novel, complex feature dependencies.

New stability measures for similar features improve feature selection accuracy.

problem Existing stability measures fail to distinguish similar features in highly correlated datasets.
method Introduce new adjusted stability measures that consider feature similarities.
result One new stability measure considers highly similar features as interchangeable.

This paper shows feature importance remains valid even in low-performing models.

problem Feature importance validity in low-performing machine learning models for biomedical data.
method Experiments with synthetic and real biomedical datasets to compare feature rank stability under different data reductions.
result Feature importance can be maintained even at low performance levels if data size is adequate.

New algorithms select and rank features from MTS without feature extraction.

problem Feature extraction step for MTS classification.
method Directly computes similarity between time series and assesses cluster structure matching labels.
result Techniques match labels well without feature extraction.

In this paper we demonstrate predicting electroencephalograpgy (EEG) features from acoustic features using recurrent neural network (RNN) based regression model and generative adversarial network (GAN). We predict various types of EEG features from acoustic features. We compare our results with the previously studied p…

2020-02-29abs ↗pdf ↗

Pipeline learns topological features for protein stability prediction.

problem Predicting protein stability using topological features.
method Data-driven method to learn topological features, comparing with expert features.
result Topological features achieve 92%-99% of SME-based models' performance.

In text classification, dictionaries can be used to define human-comprehensible features. We propose an improvement to dictionary features called smoothed dictionary features. These features recognize document contexts instead of n-grams. We describe a principled methodology to solicit dictionary features from a teache…

2016-06-24abs ↗pdf ↗

FeAT improves OOD generalization by learning richer features.

problem Improving feature learning for out-of-distribution (OOD) generalization.
method Feature Augmented Training (FeAT) iteratively augments and retains features from different subsets of training data.
result FeAT effectively learns richer features, boosting OOD performance.

The paper defines and analyzes feature complexity in DNNs, proposing metrics for feature disentanglement and evaluation.

problem Understanding and quantifying the complexity of features learned by deep neural networks.
method Proposes a definition and disentanglement of feature complexity orders, introduces metrics for reliability and over-fitting evaluation.
result Establishes a relationship between feature complexity and DNN performance, and proposes a generic mathematical tool for network compression and knowledge distillation.

A new method for measuring conditional feature importance using generative models.

problem Challenges in evaluating feature importance given other feature values.
method Adversarial Random Forest (ARF) for generating on-manifold data points.
result cARFi method yields robust importance scores adaptable for various feature importance notions.

Existing feature selection methods fail to properly account for interactions between features when evaluating feature subsets. In this paper, we attempt to remedy this issue by using orthogonal variance decomposition to evaluate features. The orthogonality of the decomposition allows us to directly calculate the total …

2019-10-22abs ↗pdf ↗

CAN approximates explicit feature interactions for CTR prediction.

problem Learning explicit feature interactions from sparse features.
method Co-Action Network approximates explicit pairwise feature interactions without introducing too many additional parameters.
result CAN outperforms state-of-the-art CTR models and the cartesian product method.

Online feature selection has been an active research area in recent years. We propose a novel diverse online feature selection method based on Determinantal Point Processes (DPP). Our model aims to provide diverse features which can be composed in either a supervised or unsupervised framework. The framework aims to pro…

2018-06-12abs ↗pdf ↗

New method disentangles feature importance scores in machine learning.

problem Misinterpretation of feature importance scores due to interactions and dependencies.
method Derive DIP (Disentangled Importance) decomposition of feature importance scores.
result DIP decomposition uniquely separates standalone contributions from interactions and dependencies.

Feature selection has been proven a powerful preprocessing step for high-dimensional data analysis. However, most state-of-the-art methods tend to overlook the structural correlation information between pairwise samples, which may encapsulate useful information for refining the performance of feature selection. Moreove…

2019-02-26abs ↗pdf ↗

GRANITE unifies feature-based explanation methods to reduce disagreement.

problem Disagreement among feature-based explanation methods.
method GRANITE partitions feature space into regions minimizing interaction and distribution influences.
result Unified and consistent feature explanations.

Orthogonal random features approximate a Bessel kernel, offering sharper bounds than random Fourier features.

problem Approximating Gaussian kernel efficiently for large datasets.
method Use of Haar orthogonal matrices to construct orthogonal random features and analyze their bias and variance.
result Orthogonal random features approximate a Bessel kernel, not the Gaussian kernel, with sharper bounds.

New methods for assessing and visualizing feature groups in machine learning models.

problem Lack of methods for interpreting feature groups in machine learning models.
method Permutation-based, refitting, and Shapley-based techniques for grouped feature importance. Introduced a sequential procedure for identifying stable feature combinations. Developed a combined features effect plot.
result Effective methods for assessing and visualizing the importance and effect of feature groups in machine learning models.

Learning with streaming data has attracted much attention during the past few years. Though most studies consider data stream with fixed features, in real practice the features may be evolvable. For example, features of data gathered by limited-lifespan sensors will change when these sensors are substituted by new ones…

2017-06-16abs ↗pdf ↗

Hermite polynomials improve private data generation by reducing feature count.

problem Infinite-dimensional features in kernel mean embedding are impractical for private data generation.
method Replace random features with Hermite polynomial features, leveraging their ordered nature.
result Hermite polynomial features yield a more accurate approximation of kernel mean embedding with fewer features.

Feature selection is a technique to screen out less important features. Many existing supervised feature selection algorithms use redundancy and relevancy as the main criteria to select features. However, feature interaction, potentially a key characteristic in real-world problems, has not received much attention. As a…

2012-10-06abs ↗pdf ↗