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

201402602803 · Jun 202019922001200920172026
48 results for Optimal resampling

This paper tackles noisy multi-objective optimization with adaptive resampling using bootstrapping.

problem Challenges in optimizing noisy multi-objective problems, especially trade-offs between exploration and exploitation.
method Adaptive resampling with bootstrapping to estimate probability of dominance and improve precision.
result Demonstrates the efficiency of the resampling approach in NSGA-II algorithm under multiple noise variations.

This work proves convergence of adaptive resampling for random Fourier features.

problem Sampling Fourier frequencies well for high-dimensional data.
method Data adaptive resampling of Fourier frequencies, asymptotically optimal.
result Proves convergence of adaptive resampling method for regression and classification problems.

It is known that evolution strategies in continuous domains might not converge in the presence of noise. It is also known that, under mild assumptions, and using an increasing number of resamplings, one can mitigate the effect of additive noise and recover convergence. We show new sufficient conditions for the converge…

2014-04-09abs ↗pdf ↗

Reshuffling splits improves hyperparameter optimization's generalization performance.

problem Improving peak performance of machine learning models through better hyperparameter optimization.
method Reshuffling splits for every hyperparameter configuration improves generalization performance.
result Reshuffling leads to better generalization performance compared to fixed splits.

Paper analyzes FTPL's effectiveness in combinatorial semi-bandit problems.

problem Optimizing FTPL policy in combinatorial semi-bandit problems.
method Geometric resampling (GR) and conditional geometric resampling (CGR) for FTPL in semi-bandit setting.
result FTPL achieves optimal regret bounds in both Fréchet and Pareto distributions.

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.

OTSL improves structure learning accuracy with out-of-sample and resampling strategies.

problem Determining optimal hyperparameters for structure learning algorithms.
method Out-of-sample Tuning for Structure Learning (OTSL) using resampling strategies.
result Improves graphical accuracy of structure learning algorithms.

A new differentiable resampling method for Monte Carlo simulations.

problem Improving the efficiency and differentiability of resampling in Monte Carlo simulations.
method Proposes a diffusion model surrogate for resampling, proving consistency and outperforming existing methods.
result The proposed method outperforms state-of-the-art differentiable resampling methods on various benchmarks.

The paper investigates overfitting in hyperparameter optimization.

problem Overfitting in hyperparameter optimization (overtuning).
method Formal definition, large-scale reanalysis of HPO benchmark data, analysis of factors affecting overtuning.
result Overtuning is more common than previously assumed, leading to worse generalization error in 10% of cases.

This paper improves FTPL algorithm for semi-bandit problems with best-of-both-worlds guarantees.

problem Optimizing regret in adversarial and stochastic mm-set semi-bandit problems.
method Extending FTPL with geometric resampling (GR) to mm-set semi-bandits and analyzing its performance.
result FTPL with Fréchet and Pareto distributions achieves O(mdT)O(\sqrt{mdT}) regret in adversarial setting and logarithmic regret in stochastic setting.

Paper uses K-NN resampling to simulate and evaluate LOB markets.

problem Simulating and evaluating limit order book (LOB) markets.
method Applies KK-nearest neighbor (KK-NN) resampling to LOB simulation and evaluation.
result Demonstrates the effectiveness and efficiency of KK-NN resampling in LOB simulation and evaluation.

High-dimensional regression models struggle with resampling methods.

problem Estimating uncertainty in high-dimensional supervised regression tasks.
method Investigation of bootstrap, subsampling, and jackknife methods in high-dimensional generalized linear models.
result Resampling methods exhibit double-descent behavior and are inconsistent in high dimensions.

Many machine learning models have important structural tuning parameters that cannot be directly estimated from the data. The common tactic for setting these parameters is to use resampling methods, such as cross--validation or the bootstrap, to evaluate a candidate set of values and choose the best based on some pre--…

2014-05-27abs ↗pdf ↗

VPR improves posterior uncertainty quantification by combining VI and predictive resampling.

problem Inaccurate posterior sampling with MCMC due to computational constraints.
method Variational predictive resampling (VPR) that uses VI's predictive strength and imputes future observations.
result VPR converges to the exact Bayesian posterior in a Gaussian location model and improves uncertainty quantification.

In many real-world binary classification tasks (e.g. detection of certain objects from images), an available dataset is imbalanced, i.e., it has much less representatives of a one class (a minor class), than of another. Generally, accurate prediction of the minor class is crucial but it's hard to achieve since there is…

2017-07-12abs ↗pdf ↗

CARVE validates clustering results using resampling and stability analysis.

problem Inconsistent and unreliable clustering results due to algorithm, preprocessing, and kk sensitivity.
method CARVE uses resampling-based validation and stability analysis to evaluate multiple clustering algorithms and hyperparameters.
result CARVE consistently recovers near-optimal clusterings and finer biological structure.

fastml guards against data leakage in automated machine learning.

problem Data leakage during preprocessing before resampling inflates apparent performance.
method fastml uses guarded resampling to re-estimate preprocessing inside each resample.
result Guarded resampling reduces apparent performance compared to global preprocessing.

Unified framework for imbalanced data resampling improves classification performance.

problem Data imbalance negatively impacts machine learning performance.
method Unified framework combining over- and undersampling with radial basis functions optimization.
result Potential Anchoring outperforms state-of-the-art resampling algorithms.

Resampling techniques are widely used in statistical inference and ensemble learning, in which estimators' statistical properties are essential. However, existing methods are computationally demanding, because repetitions of estimation/learning via numerical optimization/integral for each resampled data are required. I…

2019-05-23abs ↗pdf ↗

This study introduces a framework for the forecasting, reconstruction and feature engineering of multivariate processes along with its renewable energy applications. We integrate derivative-free optimization with an ensemble of sequence-to-sequence networks and design a new resampling technique called additive resampli…

2019-09-12abs ↗pdf ↗

Class imbalance problem is commonly faced while developing machine learning models for real-life issues. Due to this problem, the fitted model tends to be biased towards the majority class data, which leads to lower precision, recall, AUC, F1, G-mean score. Several researches have been done to tackle this problem, most…

2019-08-18abs ↗pdf ↗

Generates diverse images by resampling specific parts while maintaining global consistency.

problem Creating diverse images while maintaining global consistency in certain parts.
method Developed a new network architecture, training procedure, and resampling algorithm.
result Achieved low distortion block-resampling with spatially stochastic networks.

This review explores resampling techniques for imbalanced binary classification.

problem Imbalanced classes lead to poor prediction results in classification.
method Classical, cost-sensitive, and Neyman-Pearson paradigms with resampling techniques and classification methods.
result Complex dynamics among resampling techniques, base methods, metrics, and imbalance ratios.

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.

The paper develops methods for constructing confidence regions for regression functions in binary classification.

problem Building distribution-free confidence regions for regression functions in binary classification.
method Resampling test and empirical risk minimization approach for model classes with finite pseudo-dimensions and inverse Lipschitz parameterizations.
result Strong uniform consistency and exponential probably approximately correct bounds on the L2L_2 sizes of the regions.

A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.

problem Optimizing Bayesian filtering with deterministic particles to avoid degeneration.
method Progressive flow of particles through a sequence of sub-steps, each using an optimal transport map to replace non-equally weighted particles with equally weighted ones.
result The method avoids particle degeneration and simplifies the filtering process by not requiring inversions or monotonicity constraints.

This paper investigates bias in resampled backtests for financial portfolios, finding it often negligible.

problem Bias in resampled backtests for financial portfolio evaluation.
method Investigation of bias in rolling-window mean-variance portfolios using resampling techniques.
result The bias in Sharpe Ratio estimates from IID resampling is often a fraction of estimation noise, making it tolerable.

Improved particle filters for estimating model parameters using differentiable resampling.

problem Inability to differentiate sampling and resampling steps in particle filters.
method Extended reparameterisation trick to include stochastic input, enabling differentiation. Used p-MCMC and NUTS for parameter estimation.
result NUTS improves mixing of Markov chain and produces more accurate results in less time.

Bayesian neural networks improve reliability in multimedia forensics.

problem Challenges with out-of-distribution data in multimedia authentication.
method Proposes Bayesian neural networks (BNN) for forensic tasks.
result BNNs provide distributions for better reliability and out-of-distribution detection.

A new UCB algorithm for heavy-tailed bandits with near-optimal regret.

problem Sequential decision making in uncertain environments with heavy-tailed rewards.
method Data-driven, distribution-free UCB algorithm combining resampled median-of-means and UCB.
result Near-optimal regret bound for heavy-tailed distributions.

An approximate method for conducting resampling in Lasso, the 1\ell_1 penalized linear regression, in a semi-analytic manner is developed, whereby the average over the resampled datasets is directly computed without repeated numerical sampling, thus enabling an inference free of the statistical fluctuations due to sam…

2018-02-28abs ↗pdf ↗