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

123246368491 · Jun 202019922001200920172026
48 results for Feature averaging

Gradient descent biases neural networks to use an average of features, leading to non-robustness.

problem Non-robustness in neural networks due to feature averaging.
method Theoretical analysis and experiments on binary classification tasks.
result Gradient descent trains networks to rely on an average of features, making them vulnerable to adversarial attacks.

Introduces joint Shapley values to measure feature importance in models.

problem Measuring the importance of feature sets in machine learning models.
method Extends Shapley's axioms to measure a set of features' average contribution to a model's prediction.
result Joint Shapley values provide unique insights and are more consistent with local intuitions.

This work analyzes benefits and limitations of data augmentation and feature averaging in deep learning models.

problem Theoretical understanding of incorporating invariance into deep learning models is lacking.
method Data augmentation and feature averaging are analyzed in the context of invariance in deep learning.
result Training with data augmentation leads to better estimates of risk and gradients, and feature averaging reduces generalization error with convex losses.

Proposes a new method to find features affecting treatment effect distribution.

problem Existing methods fail to detect differences in treatment effect distribution parameters other than the mean.
method Formulates and estimates a feature importance measure that quantifies feature influence on potential outcome distribution discrepancies. Develops a feature selection algorithm to control type I error rate.
result Successfully discovers important features and outperforms existing mean-based methods.

Given a model ff that predicts a target yy from a vector of input features x=x1,x2,,xM\pmb{x} = x_1, x_2, \ldots, x_M, we seek to measure the importance of each feature with respect to the model's ability to make a good prediction. To this end, we consider how (on average) some measure of goodness or badness of prediction (wh…

2019-10-01abs ↗pdf ↗

Random Feature (RF) models are used as efficient parametric approximations of kernel methods. We investigate, by means of random matrix theory, the connection between Gaussian RF models and Kernel Ridge Regression (KRR). For a Gaussian RF model with PP features, NN data points, and a ridge λλ, we show that the avera…

2020-02-19abs ↗pdf ↗

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…

2018-04-18abs ↗pdf ↗

Feature-based time series representations have attracted substantial attention in a wide range of time series analysis methods. Recently, the use of time series features for forecast model averaging has been an emerging research focus in the forecasting community. Nonetheless, most of the existing approaches depend on …

2019-04-17abs ↗pdf ↗

Revises Bayesian model averaging for foundation models.

problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.

Automatically learns summary features from time series data for likelihood-free inference.

problem Necessity of hand-tailored summary features for time series data in likelihood-free inference.
method Data-driven approach to automatically learn summary features.
result Learning summary features from data can outperform hand-crafted values in likelihood-free inference.

Recursive Feature Machines show grokking in modular arithmetic without neural networks.

problem Grokking in modular arithmetic tasks.
method Recursive Feature Machines (RFM) with Average Gradient Outer Product (AGOP).
result RFM and neural networks learn block-circulant features to solve modular arithmetic.

Ensemble learning is a method of combining multiple trained models to improve model accuracy. We propose the usage of such methods, specifically ensemble average, inside Convolutional Neural Network (CNN) architectures by replacing the single convolutional layers with Inner Average Ensembles (IEA) of multiple convoluti…

2018-08-30abs ↗pdf ↗

Improves contrastive learning invariance with novel training objectives and feature averaging.

problem Contrastive learning's implicit invariance is insufficient for robust performance.
method Introduces a novel training objective and feature averaging approach to enforce invariance.
result Improved performance and robustness to transformations on downstream tasks.

Improved TD learning with tail averaging and regularization achieves optimal convergence rates.

problem Convergence analysis of TD learning with linear function approximation.
method Tail-averaging and regularization applied to TD learning algorithm.
result Achieves optimal O(1/t)O(1/t) convergence rate in expectation and with high probability.

UCRL2-VTR achieves nearly optimal regret for learning MDPs with linear function approximation.

problem Learning infinite-horizon average-reward MDPs with linear function approximation.
method UCRL2-VTR algorithm with Bernstein-type bonus.
result Achieves a regret of ildeO(dDT) ilde{O}(d\sqrt{DT}) with matching lower bound.

We study least squares linear regression over NN uncorrelated Gaussian features that are selected in order of decreasing variance. When the number of selected features pp is at most the sample size nn, the estimator under consideration coincides with the principal component regression estimator; when p>np>n, the esti…

2019-06-04abs ↗pdf ↗

FBMS R package simplifies Bayesian model selection and averaging.

problem Complex regression settings with multi-modal posterior landscapes.
method Efficient MJMCMC and GMJMCMC algorithms for Bayesian model exploration.
result FBMS effectively handles Bayesian generalized linear and nonlinear models.

Study compares and contrasts various ML explanation methods, highlighting their disagreements and similarities.

problem Understanding and quantifying the differences between various machine learning explanation methods.
method Synthesized and visualized various explanation methods for global and local aspects of ML models.
result There is substantial agreement on the top features but less on specific rankings, and tree interpreter is comparable to SHAP for feature effects.

Kernel balancing weights are generalized as KRRR, providing better confidence intervals for treatment effects.

problem Lack of generalization error, correct feature specification, and limited to average effects.
method Interpreting kernel balancing weights as KRRR, relaxing feature specification, and extending Gaussian approximation.
result KRRR provides strong generalization properties and justifies confidence sets for causal functions.

Deep neural-kernel models combine neural networks and kernel machines for scalable large datasets.

problem Combining neural networks and kernel machines for efficient large-scale learning.
method Hybrid neural-kernel architecture using explicit feature mapping and pooling layers.
result The deep neural-kernel models are effective and scalable on benchmark datasets.

Rotationally equivariant convolutions improve molecular property prediction.

problem Predicting molecular properties using graph neural networks.
method Ablation study with rotationally equivariant and invariant convolutions on QM9 data set.
result Rotationally equivariant layers decrease test error by an average of 23%.

No feature ranking can be faithful, stable, and complete when features are collinear.

problem The impossibility of creating a feature ranking that is simultaneously faithful, stable, and complete when features are collinear.
method Proving the impossibility, quantifying it for four model classes, resolving it via ensemble averaging (DASH), and machine-verifying it with Lean 4 theorems.
result No method lies outside the dichotomy of faithful-complete methods (unstable, with rankings that flip up to 50% of the time) and ensemble methods (stable, reporting ties for symmetric features).

New statistical methods improve explainability of boosting models.

problem Uncertainty quantification for boosting models is computationally intensive and hard to interpret.
method Derive methods for statistical inference using gradient boosting and Boulevard regularization.
result Achieve asymptotically normal predictions with theoretical guarantees and runtime independent of data size.

This paper proposes a novel generic one-class feature learning method based on intra-class splitting. In one-class classification, feature learning is challenging, because only samples of one class are available during training. Hence, state-of-the-art methods require reference multi-class datasets to pretrain feature …

2018-12-20abs ↗pdf ↗

Bayesian model averaging fails under covariate shift, affecting neural networks' performance.

problem Bayesian model averaging's failure in neural networks under covariate shift.
method Explained the issue and proposed novel priors to improve robustness.
result Bayesian model averaging is problematic under covariate shift, especially with linear feature dependencies.

A machine learning approach to record fusion with high accuracy.

problem Aggregating multiple records corresponding to the same entity.
method Constructing feature vectors from attribute-level, record-level, and database-level signals; using a stagewise additive model to learn a classifier.
result Average precision of ~98% with source information and ~94% without source information across diverse datasets.

Paper analyzes TD(λλ) convergence rates for arbitrary features.

problem Convergence rates for linear TD(λλ) under arbitrary features.
method Developed a novel stochastic approximation result for arbitrary features.
result Established L2L^2 convergence rates for linear TD(λλ) without linearly independent features assumption.

Max-margin classifiers' behavior is studied in high dimensions with non-Gaussian features.

problem Understanding the role of featurization maps and high-dimensional misclassification error.
method High-dimensional asymptotics, Gaussian model, support vector representation.
result Asymptotic behavior of max-margin classifiers is determined by feature covariance and label covariance.

New method improves domain generalization by aligning causal mechanisms across domains.

problem Improving model's ability to generalize across different distributions.
method Introduces invariance of average causal effect of features to labels, regularizing training approach.
result Demonstrates superior performance on benchmark datasets compared to state-of-the-art methods.

New versions of the set-valued average value at risk for multivariate risks are introduced by generalizing the well-known certainty equivalent representation to the set-valued case. The first "regulator" version is independent from any market model whereas the second version, called the market extension, takes trading …

2012-02-25abs ↗pdf ↗

The paper reduces the complexity of financial market correlation matrices to a 2x2 matrix.

problem Reducing the complexity of financial market correlation matrices for easier analysis.
method Sectorial coarse graining followed by averaging over blocks of stocks.
result Averaging over blocks of stocks results in a reduced matrix with specific properties.

Optimizes LightGBM for stock market forecasting with novel feature engineering and transformation methods.

problem Accurately forecasting stock market fluctuations to mitigate risks.
method Feature engineering and transformation methods for LightGBM optimization.
result Log Returns, Returns and EMA Difference Ratio are the most effective target variable transformations.

Federated learning allows edge devices to collaboratively learn a shared model while keeping the training data on device, decoupling the ability to do model training from the need to store the data in the cloud. We propose Federated matched averaging (FedMA) algorithm designed for federated learning of modern neural ne…

2020-02-15abs ↗pdf ↗

Motivated by modern applications in which one constructs graphical models based on a very large number of features, this paper introduces a new class of cluster-based graphical models, in which variable clustering is applied as an initial step for reducing the dimension of the feature space. We employ model assisted cl…

2018-06-13abs ↗pdf ↗