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

205411616821 · Jun 202019922001200920172026
48 results for training modifications

A modification of the confidence screening mechanism based on adaptive weighing of every training instance at each cascade level of the Deep Forest is proposed. The idea underlying the modification is very simple and stems from the confidence screening mechanism idea proposed by Pang et al. to simplify the Deep Forest …

2019-01-04abs ↗pdf ↗

New method detects RNA modifications without prior training, revealing novel sites.

problem Detecting RNA modifications with high accuracy and sensitivity.
method Anomaly detection using nanopore raw ionic current signals and nearest neighbor comparison.
result Detects diverse RNA modifications without prior training, including a novel 2'-O-methylated site in DENV.

We present new intuitions and theoretical assessments of the emergence of disentangled representation in variational autoencoders. Taking a rate-distortion theory perspective, we show the circumstances under which representations aligned with the underlying generative factors of variation of data emerge when optimising…

2018-04-10abs ↗pdf ↗

A new method for effective VAE training using calibrated decoders.

problem Training VAEs requires hyperparameter tuning, leading to inefficiency.
method Calibrated decoders that learn uncertainty and automatically determine information retention.
result Calibrated decoders can simplify VAE training without heuristic modifications.

We study and provide exposition to several phenomena that are related to the perceptron's compression. One theme concerns modifications of the perceptron algorithm that yield better guarantees on the margin of the hyperplane it outputs. These modifications can be useful in training neural networks as well, and we demon…

2018-06-14abs ↗pdf ↗

The Resilient Propagation (Rprop) algorithm has been very popular for backpropagation training of multilayer feed-forward neural networks in various applications. The standard Rprop however encounters difficulties in the context of deep neural networks as typically happens with gradient-based learning algorithms. In th…

2015-09-15abs ↗pdf ↗

We propose a novel approach towards adversarial attacks on neural networks (NN), focusing on tampering the data used for training instead of generating attacks on trained models. Our network-agnostic method creates a backdoor during training which can be exploited at test time to force a neural network to exhibit abnor…

2018-08-21abs ↗pdf ↗

ModHiFi identifies critical components for model modification without gradients or loss function.

problem Modifying open weight models without access to training data or loss function.
method Theoretical analysis of Lipschitz-continuous networks, Subset Fidelity metric, and ModHiFi algorithm.
result ModHiFi-P and ModHiFi-U achieve significant performance improvements in model pruning and unlearning.

Proposes a method for clearer counterfactual explanations of deep networks.

problem Unclear explanations from current counterfactual methods.
method Gradual construction of explanations through masking and composition steps.
result Produces human-friendly, interpretable explanations with fewer modifications.

Training modern deep learning models requires large amounts of computation, often provided by GPUs. Scaling computation from one GPU to many can enable much faster training and research progress but entails two complications. First, the training library must support inter-GPU communication. Depending on the particular …

2018-02-15abs ↗pdf ↗

Deep Boltzmann machines are in principle powerful models for extracting the hierarchical structure of data. Unfortunately, attempts to train layers jointly (without greedy layer-wise pretraining) have been largely unsuccessful. We propose a modification of the learning algorithm that initially recenters the output of t…

2012-03-16abs ↗pdf ↗

This work improves testing of machine learning model modifications using novel statistical methods.

problem Overfitting and conservative Bonferroni correction when testing multiple model modifications.
method Introduces alpha-recycling and SRGPs to control error rate and approve more beneficial modifications.
result Novel statistical methods approve a higher number of beneficial modifications than previous approaches.

There are many award-winning pre-trained Convolutional Neural Network (CNN), which have a common phenomenon of increasing depth in convolutional layers. However, I inspect on VGG network, which is one of the famous model submitted to ILSVRC-2014, to show that slight modification in the basic architecture can enhance th…

2019-11-20abs ↗pdf ↗

SurvLIME-Inf simplifies explanation of survival models using a linear programming approach.

problem Explain complex survival models using simple linear programming.
method Uses LL_{\infty }-norm for feature importance and explains black-box models.
result SurvLIME-Inf outperforms SurvLIME in small training set scenarios.

One pixel modification can make deep models unlearnable.

problem Protecting data from unauthorized training of deep neural networks.
method Perturbing only one pixel in each image to degrade model accuracy.
result Generated One-Pixel Shortcut (OPS) cannot be erased by adversarial training and strong augmentations.

A new method improves continual learning by replaying pseudo data and using orthogonal weight modification.

problem Catastrophic forgetting in class incremental learning.
method Generative replay with orthogonal weight modification.
result Our method achieves substantial improvement over conventional generative replay and OWM.

Stable training of deep normalizing flows for high-dimensional variational inference.

problem Training deep normalizing flows for high-dimensional posterior distributions is infeasible due to high stochastic gradient variance.
method Proposed a combination of soft-thresholding of scale and bijective soft log transformation to stabilize training.
result Stable training of Real NVPs for posterior distributions with thousands of dimensions is possible.

A new framework for offline RL improves policy flexibility and regularity.

problem Lack of environmental interactions in offline RL leads to poor policy performance.
method Proposes a behavior-regularized implicit policy framework with modified policy-matching methods.
result The framework improves policy effectiveness and robustness beyond static datasets.

New method uses non-translation invariant risk measures for fair financial derivative pricing.

problem Inequalities in financial derivative pricing under traditional risk measures.
method Deep reinforcement learning with modified deep hedging algorithm.
result Effective pricing of financial derivatives without price inflation.

We define an operation on homology B4{B}^4 which we call an nn-twist annulus modification. We give a new construction of smoothly slice knots and exotically slice knots via nn-twist annulus modifications. As an application, we present a new example of a smoothly slice knot with non-slice derivatives. Such examples we…

2015-12-01abs ↗pdf ↗

Training Generative Adversarial Networks (GANs) is notoriously challenging. We propose and study an architectural modification, self-modulation, which improves GAN performance across different data sets, architectures, losses, regularizers, and hyperparameter settings. Intuitively, self-modulation allows the intermedia…

2018-10-02abs ↗pdf ↗

We show that Residual Networks (ResNet) is equivalent to boosting feature representation, without any modification to the underlying ResNet training algorithm. A regret bound based on Online Gradient Boosting theory is proved and suggests that ResNet could achieve Online Gradient Boosting regret bounds through neural n…

2019-09-25abs ↗pdf ↗

We show that training a deep network using batch normalization is equivalent to approximate inference in Bayesian models. We further demonstrate that this finding allows us to make meaningful estimates of the model uncertainty using conventional architectures, without modifications to the network or the training proced…

2018-02-18abs ↗pdf ↗

A simple modification improves GAN performance by discarding bad samples.

problem Improving GAN performance with minimal computational cost.
method Top-k update procedure: zero out gradient contributions from least realistic elements.
result Significant improvement in FID score for conditional generation on CIFAR-10.

Behavior modification improves prediction accuracy by nudging user behavior.

problem Improving prediction accuracy using behavior modification techniques.
method Combining prediction and behavior modification with reinforcement learning algorithms.
result Behavior modification can make predictions more certain but may not generalize.

New bounds ensure reliable deep learning performance without model changes.

problem Certifying deep neural networks' reliability without altering them.
method Data-dependent generalization bounds that apply directly to trained models.
result Achieves meaningful generalization guarantees for large, unaltered deep networks.

Study of unimodular Sasaki and Vaisman Lie groups, determining all modifications explicitly.

problem Classifying unimodular Sasaki and Vaisman Lie groups.
method Applying the technique of modification to determine all homogeneous Sasaki and Vaisman manifolds of unimodular Lie groups explicitly.
result Complete classification of unimodular Sasaki and Vaisman Lie groups.

We propose a novel approach for generating unrestricted adversarial examples by manipulating fine-grained aspects of image generation. Unlike existing unrestricted attacks that typically hand-craft geometric transformations, we learn stylistic and stochastic modifications leveraging state-of-the-art generative models. …

2019-11-20abs ↗pdf ↗

With the wealth of high-throughput sequencing data generated by recent large-scale consortia, predictive gene expression modelling has become an important tool for integrative analysis of transcriptomic and epigenetic data. However, sequencing data-sets are characteristically large, and previously modelling frameworks …

2015-07-21abs ↗pdf ↗

Simplified DGPs training by fixing inducing inputs to subset of data.

problem Challenging training of deep Gaussian processes.
method Fixed subset of data for inducing inputs, variational sampling.
result Significant reduction in trainable parameters and computation cost without performance degradation.

Post-training quantization saves resources for neural networks.

problem Implementing neural networks in resource-constrained hardware.
method Generalized post-training quantization method (GPFQ) with modifications for sparsity and error analysis.
result Error decays linearly with over-parametrization, showing minor loss of accuracy.

New methods improve cross-conformal prediction's prediction sets without sacrificing coverage guarantees.

problem Improving the width of prediction sets in cross-conformal prediction.
method Proposed new variants of existing methods based on recent results on more efficient combination of p-values.
result Smaller prediction sets achieved without compromising theoretical guarantees.

The convolutional layers are core building blocks of neural network architectures. In general, a convolutional filter applies to the entire frequency spectrum of the input data. We explore artificially constraining the frequency spectra of these filters and data, called band-limiting, during training. The frequency dom…

2019-11-21abs ↗pdf ↗