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

Trend · papers per month

4078141,2211,628 · Jun 202019922001200920172026
48 results for high accuracy models

New classifier robust to adversarial perturbations from high-accuracy models.

problem Adversarial attacks on high-accuracy machine learning models.
method Randomized smoothing framework with random partitions and doubling dimension.
result Constructs a robust classifier with high accuracy and bounded adversarial error.

This work improves surrogate models for balancing accuracy and cost in multi-fidelity methods.

problem Balancing accuracy and computational cost in multi-fidelity methods.
method Develops context-aware surrogate models for multi-fidelity importance sampling and Bayesian inverse problems.
result Context-aware surrogate models can lead to runtime speedups of up to one order of magnitude.

CNNs overinterpret inputs, leading to high accuracy without meaningful features.

problem High accuracy in image classifiers can mask subtle model failures.
method Batched Gradient SIS method for discovering sufficient input subsets.
result Overinterpretation allows models to make confident predictions with masked input features.

A deep learning model predicts future cache accesses with high accuracy.

problem Improving cache management and performance through better prediction of future data accesses.
method Proposed a LSTM-based recurrent neural network model to predict future cache accesses using only a cache trace as input.
result The proposed model achieves high prediction accuracy and outperforms state-of-the-art practical policies.

We propose a novel adaptive approximation approach for test-time resource-constrained prediction. Given an input instance at test-time, a gating function identifies a prediction model for the input among a collection of models. Our objective is to minimize overall average cost without sacrificing accuracy. We learn gat…

2017-05-26abs ↗pdf ↗

EnSF improves accuracy in tracking high-dimensional nonlinear systems.

problem Low accuracy in high-dimensional, nonlinear filtering problems.
method Score-based diffusion model, mini-batch Monte Carlo estimator.
result EnSF outperforms state-of-the-art methods in tracking high-dimensional systems.

High-dimensional spectroscopy data makes ML models achieve near-perfect accuracy, even when chemical distinctions are absent.

problem Why machine learning models achieve near-perfect accuracy in spectroscopic classification tasks without chemically meaningful features.
method Theoretical analysis grounded in the Feldman-Hajek theorem and concentration of measure, combined with specific experiments on synthetic and real fluorescence spectra.
result Infinitesimal distributional differences in high-dimensional spaces can lead to perfect separability, making models achieve near-perfect accuracy in spectroscopy.

G-Net constructs binary neural networks with high accuracy using randomized binary embeddings.

problem Creating high-accuracy binary neural networks with theoretical guarantees.
method Proposes a novel floating-point G-Net family with randomized binary embeddings and theoretical accuracy guarantees.
result Empirically, G-Net achieves almost 30% higher accuracy on CIFAR-10 compared to prior HDC models.

We present a dynamic model selection approach for resource-constrained prediction. Given an input instance at test-time, a gating function identifies a prediction model for the input among a collection of models. Our objective is to minimize overall average cost without sacrificing accuracy. We learn gating and predict…

2017-04-25abs ↗pdf ↗

JTT improves model worst-group accuracy without group annotations.

problem Low worst-group accuracy in standard ERM models with spurious correlations.
method Two-stage approach: first ERM, then upweight misclassified examples.
result JTT closes 75% of the gap in worst-group accuracy compared to group DRO.

Extensive neural networks eliminate the need for SABR pricing formulas.

problem Lack of exact pricing formulas for the SABR model.
method Used a GPU-based simulation and an extensive neural network to learn implied volatilities.
result Neural networks achieve high accuracy and efficiency comparable to Monte-Carlo simulations.

Improved ridge estimators avoid tuning parameters for high-dimensional data.

problem Difficulty in calibrating tuning parameters for ridge estimators.
method Developed modified ridge estimators that eliminate tuning parameters.
result Modified ridge estimators outperform standard methods in prediction accuracy.

Hybrid model combines VAR and neural network for OFI prediction.

problem Accurate prediction of Order Flow Imbalance (OFI) in high frequency trading.
method Combines Vector Auto Regression (VAR) and a simple feedforward neural network (FNN).
result Hybrid model achieves superior predictive accuracy compared to standalone models.

In a model extraction attack, an adversary steals a copy of a remotely deployed machine learning model, given oracle prediction access. We taxonomize model extraction attacks around two objectives: *accuracy*, i.e., performing well on the underlying learning task, and *fidelity*, i.e., matching the predictions of the r…

2019-09-03abs ↗pdf ↗

This study compares machine learning methods for high-cardinality categorical variables.

problem Machine learning struggles with high-cardinality categorical variables.
method Empirical comparison of tree-boosting, deep neural networks, and linear mixed effects models.
result Tree-boosting with random effects outperforms deep neural networks with random effects.

DF2M uses deep neural networks within a factor model for high-dimensional functional time series forecasting.

problem Forecasting high-dimensional functional time series with explainability and accuracy.
method Bayesian nonparametric model based on Indian Buffet Process and multi-task Gaussian Process, incorporating a deep kernel function.
result DF2M provides better explainability and superior predictive accuracy compared to conventional deep learning models.

The paper tackles fairness and accuracy in ML models under domain shifts.

problem Designing fair and accurate ML models that perform well in unseen domains.
method Theoretical bounds and sufficient conditions for fairness and accuracy transfer under domain generalization.
result A learning algorithm that ensures fair and accurate models even when deployment environments change.

SynergicLearning combines NN and HD models for high accuracy and efficiency.

problem Combining neural networks and hyperdimensional learning for improved accuracy and efficiency.
method Hybrid model combining NN feature extraction and HD classification, parameterized hardware implementation.
result Improves accuracy by at least 10% compared to HD learning models and 1.60x power efficiency.

New method uses low-fidelity simulations to efficiently infer parameters of high-fidelity models.

problem Challenges in inferring parameters of computationally expensive high-fidelity models.
method Multifidelity simulation-based inference using transfer learning and adaptive selection of high-fidelity parameters.
result Significant reduction in the number of high-fidelity simulations required for inference.

Newfluence improves model interpretability in high-dimensional AI models.

problem Challenges in interpreting high-dimensional AI models.
method Introduced Newfluence, an alternative approximation to influence functions.
result Newfluence offers significantly improved accuracy in high-dimensional settings.

A simple, yet reasonably accurate, analytical technique is proposed for multi-factor structural credit portfolio models. The accuracy of the technique is demonstrated by benchmarking against Monte Carlo simulations. The approach presented here may be of high interest to practitioners looking for transparent, intuitive,…

2011-07-11abs ↗pdf ↗

Proposes a new prior for complex models to improve prediction accuracy.

problem Difficulty in specifying priors for complex models like neural networks.
method Predictive complexity priors defined by comparing model predictions to a reference model, transferred to parameters via change of variables.
result Improves model predictions by reducing unintuitive effects of traditional priors.

Optimal kernel learning improves GP regression for high-dimensional inputs.

problem High computational costs and low prediction accuracy in GP models with many inputs.
method Approximates GP covariance with a convex combination of kernel functions, identifying active variables.
result Improves prediction accuracy and correctly identifies active input variables.

Adversarial training can hurt robust accuracy in small sample size scenarios.

problem Adversarial training improves test accuracy but may degrade robustness in limited data settings.
method Analyzes high-dimensional linear classification with noiseless observations, and observes perceptible attacks on image datasets.
result Adversarial training can negatively impact robust generalization in small sample size regimes.

Proposes an accuracy-preserving calibration method for DNNs.

problem Calibration of deep neural networks (DNNs) to measure prediction reliability.
method Uses Concrete distribution on the probability simplex to calibrate DNNs without accuracy loss.
result The proposed method outperforms previous methods in accuracy-preserving calibration tasks.

QubitHD improves HD computing ML efficiency without sacrificing accuracy.

problem Trade-off between energy efficiency and classification accuracy in HD computing-based ML.
method Stochastically binarizes HD-based algorithms while maintaining comparable classification accuracies.
result 65% improvement in energy efficiency and 95% improvement in training time on FPGA.

Learning ReLU networks to high uniform accuracy requires exponentially many samples.

problem Achieving high uniform accuracy on ReLU networks for security-critical applications.
method Quantified the number of training samples needed for any algorithm to guarantee uniform accuracy.
result The minimal number of training samples scales exponentially with network depth and input dimension.

New method estimates graphons from multiple networks with high accuracy and low complexity.

problem Estimating graphon function from multiple networks with different node sets and sizes.
method Histogram-based estimator that aligns nodes across all networks.
result High accuracy and low computational complexity achieved.

SPPCSO addresses multicollinearity in high-dimensional data, improving model stability and predictive accuracy.

problem Multicollinearity in high-dimensional data leads to unstable estimation and reduced predictive accuracy.
method SPPCSO integrates principal component regression and L1 regularization to adaptively adjust shrinkage factors.
result SPPCSO achieves stable and reliable estimation in high-noise settings, distinguishing signal variables from noise.

New methods combine low and high-fidelity data for accurate surrogate modeling.

problem Challenges in surrogate modeling for high-dimensional outputs with limited training data.
method Projection-based multifidelity linear regression methods integrating low-fidelity and high-fidelity data.
result Multifidelity methods achieve up to 12% improvement in median accuracy compared to single-fidelity methods.

This paper proposes BAT to balance accuracy and robustness in adversarial training.

problem Balancing accuracy and robustness in adversarial training models.
method Blind adversarial training (BAT) uses a cutoff-scale strategy to adaptively estimate a nonuniform budget for AEs.
result BAT improves the overall robustness of adversarial training models.

Stochastic methods improve data assimilation with high-frequency sensor data.

problem Computational challenges in data assimilation with high-frequency sensor data.
method Adapted stochastic approximation methods to handle high-frequency observations.
result Produces high-quality estimates using all observations without compromising statistical accuracy.

New model predicts travel demand uncertainty with high accuracy.

problem Uncertainty and sparsity in sparse travel demand prediction.
method Spatial-Temporal Zero-Inflated Negative Binomial Graph Neural Network (STZINB-GNN).
result STZINB-GNN outperforms benchmarks in predicting travel demand uncertainty.

This study explores training Bayesian neural networks at scale using high-performance computing.

problem Challenges in training Bayesian neural networks at scale due to computational overhead.
method High-performance computing with distributed training, network pruning.
result Pruning up to 80% of the network can reduce inference time by 7.0% without significant accuracy loss.