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

3547091,0631,417 · Jun 202019922001200920172026
48 results for Model Modifications

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.

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.

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.

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.

In this work we present a modification in the conventional flow of information through a LSTM network, which we consider well suited for RNNs in general. The modification leads to a iterative scheme where the computations performed by the LSTM cell are repeated over a constant input and cell state values, while updatin…

2018-07-11abs ↗pdf ↗

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 ↗

Label smoothing improves model robustness against misspecification.

problem Improving model robustness against model misspecification.
method Introducing modified label smoothing (MLSLR) that maintains consistent probability estimation while modifying the loss function.
result MLSLR exhibits higher robustness against model misspecification than conventional label smoothing.

We present an axiomatic modification of quaternionic quantum mechanics with a possible-worlds semantics capable of predicting essential "nonquantum" features of an observable universe model - the dimensionality and topology of spacetime, the existence, the signature and a specific form of a metric on it, and certain na…

2007-02-28abs ↗pdf ↗

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 ↗

Max-Cut decision tree improves classification accuracy and reduces computation time.

problem Improving decision tree accuracy and efficiency for complex classification tasks.
method Alternative splitting metric (max cut) and PCA-based feature selection at each node.
result 49% improvement in accuracy with 94% reduction in CPU time on CIFAR-100 data.

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.

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.

MCD automates counterfactual design searches for multi-modal tasks.

problem Designing for multi-objective goals and complex constraints.
method Model-agnostic counterfactual search method for multi-modal design modifications.
result MCD streamlines and automates counterfactual search, recommending effective design modifications.

Modified BFGS and LBFGS++ libraries boost performance for non-parallelizable functions.

problem Improving performance of non-parallelizable functions using SIMD and AAD.
method Modifications to BFGS and LBFGS++ libraries, utilizing SIMD and Automatic Differentiation (AAD).
result Up to 3.8 times faster for European Swaption curve calibration and 1.4 times faster for LMM model calibration.

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.

Approves updates to machine learning models in healthcare based on accumulating data.

problem Designing policies to autonomously approve updates to machine learning algorithms in non-stationary settings.
method Learning-to-approve (L2A) approach that uses accumulating monitoring data to learn how to approve modifications.
result L2A learns to abstain when performance drops are common and approves beneficial modifications quickly when the distribution is stable.

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.

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 ↗

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 briefly review the approach to optimization of portfolios according to the theory of Markowitz and propose a further modification that can improve the outcome of the optimization process. The modification takes account of the entropic contribution from the time series used to compute the parameters in the Markowitz …

2014-08-01abs ↗pdf ↗

Kapustin and Witten associate a Hecke modification of a holomorphic bundle over a Riemann surface to a singular monopole on a Riemannian surface times an interval satisfying prescribed boundary conditions. We prove existence and uniqueness of singular monopoles satisfying prescribed boundary conditions for any given He…

2008-04-23abs ↗pdf ↗

For a stratified group GG, we construct a class of polarised Lie groups, which we call modifications of GG, that are locally contactomorphic to it. Vice versa, we show that if a polarised group is locally contactomorphic to a stratified group GG, whose Lie algebra has finite Tanaka prolongation, then it must be a mo…

2018-07-10abs ↗pdf ↗

Proposes new methods for inference in GLMs without assuming model correctness.

problem Inference for GLMs assumes model correctness, leading to uncertainty and bias.
method Develops nonparametric estimands and uses influence curves with flexible procedures.
result Inference for GLM parameters is improved without model correctness assumptions.

In this paper, we consider a proper modification f:M~Mf : \tilde M \to M between complex manifolds, and study when a generalized pp-Kähler property goes back from MM to M~\tilde M. When ff is the blow-up at a point, every generalized pp-Kähler property is conserved, while when ff is the blow-up along a submanifold, t…

2015-03-30abs ↗pdf ↗

Thompson Sampling remains differentially private with minimal modifications.

problem Ensuring privacy in Thompson Sampling for multi-arm bandits.
method Demonstrated differential privacy of original Thompson Sampling, provided per-round guarantees, and introduced modifications for tighter privacy.
result Privacy guarantees can be tuned by modifying the algorithm, and these modifications impact expected regret.

Many proteoforms - arising from alternative splicing, post-translational modifications (PTMs), or paralogous genes - have distinct biological functions, such as histone PTM proteoforms. However, their quantification by existing bottom-up mass-spectrometry (MS) methods is undermined by peptide-specific biases. To avoid …

2017-08-05abs ↗pdf ↗