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

Trend · papers per month

100200299399 · Jun 202019922001200920172026
48 results for feature reweighting

Toy model study shows resampling/reweighting can improve feature learning in imbalanced classification.

problem Improving feature learning in imbalanced classification problems.
method High-dimensional toy model with replica method, class-wise resampling/reweighting, and simplified model.
result No resampling/reweighting can sometimes give best feature learning performance.

ARL improves fairness without protected features, showing AUC improvements for worst-case groups.

problem Training fairness in ML without known protected features.
method Adversarially Reweighted Learning (ARL) using non-protected features and task labels.
result ARL improves Rawlsian Max-Min fairness with notable AUC improvements for worst-case groups.

Unified analysis of reweighted least-squares algorithms for linear models.

problem Recovering unknown signals from linear measurements using reweighted least squares.
method Unified asymptotic analysis of IRLS, lin-RFM, and alternating minimization algorithms.
result The algorithms can achieve favorable performance in a few iterations with appropriate reweighting.

DoubleEnsemble improves financial predictions by selecting key features and reweighting samples.

problem Overfitting and instability in financial data analysis.
method Sample reweighting and feature selection using learning trajectory and shuffling.
result DoubleEnsemble outperforms baseline methods in financial prediction tasks.

Paper identifies problematic baselines in Shapley value explanations and proposes a reweighting mechanism.

problem Identifying and addressing the suboptimality of baselines in Shapley value feature importance analysis.
method Analyzed suboptimality of baselines, identified problematic baseline, generalized uninformativeness, and designed a reweighting mechanism.
result Proposed uncertainty-based reweighting mechanism effectively accelerates computation and improves explanation quality.

AFR simplifies reducing reliance on spurious features, improving model performance.

problem Reducing reliance on spurious features for out-of-distribution generalization.
method Automatic Feature Reweighting (AFR) updates the model with a weighted loss.
result AFR improves model performance on benchmarks with minimal compute.

Given the lack of evidence for new particle discoveries at the Large Hadron Collider (LHC), it is critical to broaden the search program. A variety of model-independent searches have been proposed, adding sensitivity to unexpected signals. There are generally two types of such searches: those that rely heavily on simul…

2020-01-14abs ↗pdf ↗

We prove that, under low noise assumptions, the support vector machine with NmN\ll m random features (RFSVM) can achieve the learning rate faster than O(1/m)O(1/\sqrt{m}) on a training set with mm samples when an optimized feature map is used. Our work extends the previous fast rate analysis of random features method from…

2018-09-12abs ↗pdf ↗

RFM reduces feature space for linear models, improving sparse recovery.

problem Sparse linear regression and low-rank matrix recovery.
method Recursive Feature Machines (RFM) that alternates between reweighting feature vectors by AGOP and learning prediction function.
result RFM generalizes IRLS and outperforms deep linear networks.

This paper develops a novel deep recurrent neural network for sequential signal reconstruction.

problem Sequential signal reconstruction from low-dimensional measurements.
method Unfolding a reweighted 1\ell_1-1\ell_1 minimization algorithm to design a deep recurrent neural network.
result The proposed reweighted-RNN significantly outperforms existing RNN models in sequential frame reconstruction.

Improved matching for multiple objects using a novel reweighting method.

problem Current multi-object matching methods have limitations and are not robust.
method Proposes a novel iterative reweighting strategy using the graph connection Laplacian.
result Demonstrates superior performance over state-of-the-art methods.

Proposes a new method to improve regression models with reweighted samples.

problem Improves regression models' performance under low sample sizes and covariate perturbations.
method Reparametrizes sample weights using a doubly non-negative matrix and solves the reweighted estimate efficiently.
result Adversarial reweighting strategy delivers promising results on various datasets.

Improved learning to reweight using deep interactions between student and teacher models.

problem Limitation of existing learning to reweight methods in utilizing student model's internal states.
method Proposes an algorithm that uses the student model's internal states to the teacher model, which returns adaptive weights to enhance student model training.
result Significant improvement over previous methods in image classification and neural machine translation experiments.

Defense against user shilling attacks in collaborative filtering using edge reweighting.

problem Vulnerability of collaborative filtering to profile injection attacks.
method Adversarial robustness based edge reweighting to attenuate non-robust edges.
result Effective defense against various types of attacks demonstrated through experiments.

RR-GNN improves GNN prediction intervals by accounting for graph heteroscedasticity and structural biases.

problem Uncertainty quantification in GNNs for high-stakes domains.
method Graph-Structured Mondrian CP, Residual-Adaptive Nonconformity Scores, Cross-Training Protocol.
result Improved efficiency and no loss of coverage compared to CP baselines.

We analyze a reweighted version of the Kikuchi approximation for estimating the log partition function of a product distribution defined over a region graph. We establish sufficient conditions for the concavity of our reweighted objective function in terms of weight assignments in the Kikuchi expansion, and show that a…

2014-10-26abs ↗pdf ↗

CurveRL optimizes large model reasoning by reweighting prompts based on their rank and density.

problem Improving large language model reasoning through context reweighting.
method Formulated prompt reweighting as a functional derivative, proposing CurveRL based on quantile coordinate transform.
result CurveRL consistently outperforms existing methods across multiple benchmarks.

Federated learning has a variety of applications in multiple domains by utilizing private training data stored on different devices. However, the aggregation process in federated learning is highly vulnerable to adversarial attacks so that the global model may behave abnormally under attacks. To tackle this challenge, …

2019-12-24abs ↗pdf ↗

Domain adaptation provides a powerful set of model training techniques given domain-specific training data and supplemental data with unknown relevance. The techniques are useful when users need to develop models with data from varying sources, of varying quality, or from different time ranges. We build CrossTrainer, a…

2019-05-07abs ↗pdf ↗

New algorithm improves online binary classification with constant time complexity.

problem Online binary classification with rebalancing.
method Non-iteratively reweighted recursive least-squares.
result Exacts converges to batch formulation and outperforms existing algorithms.

Recently, the paradigm of unfolding iterative algorithms into finite-length feed-forward neural networks has achieved a great success in the area of sparse recovery. Benefit from available training data, the learned networks have achieved state-of-the-art performance in respect of both speed and accuracy. However, the …

2019-10-11abs ↗pdf ↗

Resampling outperforms reweighting for correcting biased data in machine learning models.

problem Correcting sampling bias in machine learning models trained on biased data sets.
method Compared resampling and reweighting techniques, focusing on their performance with stochastic gradient algorithms.
result Resampling outperforms reweighting when combined with stochastic gradient algorithms.

Machine learning tools are commonly used in modern high energy physics (HEP) experiments. Different models, such as boosted decision trees (BDT) and artificial neural networks (ANN), are widely used in analyses and even in the software triggers. In most cases, these are classification models used to select the "signal"…

2016-08-20abs ↗pdf ↗

Precise scientific analysis in collider-based particle physics is possible because of complex simulations that connect fundamental theories to observable quantities. The significant computational cost of these programs limits the scope, precision, and accuracy of Standard Model measurements and searches for new phenome…

2019-07-18abs ↗pdf ↗

Algorithm samples polygons of fixed edge lengths in any dimension.

problem Sampling random closed polygons with fixed edge lengths in any dimension.
method Weighted edge vectors on unit sphere, Möbius transformation, reweighting factors.
result Algorithm samples polygons according to standard probability measures efficiently.

The paper improves sample reweighting methods for adapting to covariate shifts.

problem Improving accuracy in reproducing kernel Hilbert spaces when data distributions differ.
method Combining known error bounds for reweighted kernel regression in RKHS to show reduced sample size needed for accuracy.
result Under weak smoothness conditions, fewer samples are needed for the same accuracy as standard supervised learning.

A bilevel optimization method for reweighting data leads to suboptimal results.

problem Reweighting data for better model performance on a different distribution.
method Formalizes data reweighting as a bilevel optimization problem and analyzes the limitations of classical solvers.
result The final data weights are often very sparse, indicating suboptimal solutions.

Optimizes sample reweighting to match laws under covariate shift using Wasserstein distance.

problem Matching laws of samples with different distributions under covariate shift.
method Minimizes Wasserstein distance between empirical measures of samples using Nearest Neighbors weights.
result Consistent reweighting leads to asymptotic convergence of empirical measures.

Q-MMR evaluates policies using reweighted rewards and moment matching.

problem Off-policy evaluation in finite-horizon MDPs.
method Q-MMR learns scalar weights for data points via a moment matching objective against a value-function discriminator class.
result Data-dependent finite-sample guarantee with a dimension-free error bound.

Method reweights instances and classes to improve robustness in noisy data.

problem Improving deep learning performance in the presence of label noise.
method Formulates constrained optimization problems to assign importance weights to instances and class labels.
result Significant performance gains observed in benchmark datasets with label noise.

Improving scalability and stability of Stein discrepancies for scalable goodness-of-fit testing

problem Improving scalability and stability of Stein discrepancies for scalable goodness-of-fit testing
method Reformulating Stein discrepancy construction as an explicit SNR^2 maximisation problem
result Avoiding exponential SNR^2 collapse and achieving stable SNR^2

Iteratively reweighted 1\ell_1 algorithm is a popular algorithm for solving a large class of optimization problems whose objective is the sum of a Lipschitz differentiable loss function and a possibly nonconvex sparsity inducing regularizer. In this paper, motivated by the success of extrapolation techniques in accele…

2017-10-22abs ↗pdf ↗

Ribbon: Scalable Approximation and Robust Uncertainty Quantification

problem Reliably quantifying predictive uncertainty for complex models
method Ribbon, a scalable approximation to Dirichlet-reweighted bootstrap uncertainty
result Asymptotically equivalent to a flat-prior Laplace approximation under correct likelihood specification, recovers robust sandwich covariance under misspecification

Graph Convolution Networks (GCNs) are becoming more and more popular for learning node representations on graphs. Though there exist various developments on sampling and aggregation to accelerate the training process and improve the performances, limited works focus on dealing with the dimensional information imbalance…

2019-07-04abs ↗pdf ↗

The increasing importance of renewable energy, especially solar and wind power, has led to new forces in the formation of electricity prices. Hence, this paper introduces an econometric model for the hourly time series of electricity prices of the European Power Exchange (EPEX) which incorporates specific features like…

2014-02-27abs ↗pdf ↗

Paper explains learning property of logistic and softmax losses for balanced and imbalanced class data.

problem Understanding and optimizing loss functions for deep neural networks with class imbalances.
method Analyzing necessary conditions for convergence of logistic and softmax losses in CNNs.
result Proposes a novel reweighted logistic loss function that improves performance over softmax loss.

Proposes SVI for covariate-shift generalization with sparse variable independence.

problem Covariate-shift generalization with limited data and unstable variables.
method Introduces sparsity constraint and combines reweighting and selection in an iterative way.
result Improves covariate-shift generalization performance on synthetic and real-world datasets.

A new method of moments estimator goes beyond data reweighting.

problem Estimation of moment restrictions and conditional moment restrictions.
method Kernel Method of Moments (KMM) based on maximum mean discrepancy.
result KMM achieves competitive performance on conditional moment restriction tasks.

Adaptive PI by reweighting nonconformity scores improves model uncertainty reflection.

problem CP methods using a constant correction for all test points ignore individual uncertainties.
method QRF learns distribution of nonconformity scores and assigns weights to samples.
result PI lengths more aligned with model uncertainty and improved adaptiveness.