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

109218326435 · Jun 202019922001200920172026
48 results for linear perturbation

Study linear perturbations in Schwarzschild black hole spacetime.

problem Linear perturbations of Schwarzschild black hole spacetime.
method Investigate linearised perturbation of constant mass aspect function foliation at null infinity.
result Linearised perturbations of Bondi energy and mass vanish, and all linear momentum can be achieved.

Refined theorem on linear perturbations with applications in singularity theory and optimization.

problem Linear perturbations and their implications in singularity theory and optimization.
method New perspective of Hausdorff measures for refined transversality theorem.
result Applications in singularity theory and optimization.

EVILL uses randomised perturbations to improve exploration in bandit problems.

problem Improving exploration in structured stochastic bandit problems.
method Solves for the minimiser of a linearly perturbed regularised negative log-likelihood function.
result EVILL matches the performance of Thompson-sampling-style methods in theory and practice.

Improved online Lasso reduces regret in sparse linear contextual bandits.

problem Sparse linear contextual bandit problem with inefficient sampling.
method Perturbed adversary approach to alleviate sampling inefficiency.
result Online Lasso achieves O(kTlogd)\mathcal{O}(\sqrt{kT\log d}) regret bound.

The paper strengthens a theorem on crossings under linear perturbations with Hausdorff measure estimates.

problem Understanding multiple-point crossings under linear perturbations.
method Establishes a transversality theorem with Hausdorff measure estimates for exceptional parameter sets.
result Explicit upper bounds on the Hausdorff dimension of the exceptional set.

New approach reduces unconstrained linear bandits to simpler optimization problems.

problem Unconstrained linear bandits problem.
method Perturbation-based approach combined with comparator-adaptive OLO algorithms.
result First high-probability guarantees for both static and dynamic regret in unconstrained linear bandits.

We propose a new online algorithm for cumulative regret minimization in a stochastic linear bandit. The algorithm pulls the arm with the highest estimated reward in a linear model trained on its perturbed history. Therefore, we call it perturbed-history exploration in a linear bandit (LinPHE). The perturbed history is …

2019-03-21abs ↗pdf ↗

Paper analyzes GCNN sensitivity to probabilistic graph perturbations.

problem Investigating how GCNNs handle probabilistic graph errors.
method Establishes error bounds and linear relationships between GSO perturbations and GCNN outputs.
result GCNNs maintain stability under graph edge perturbations if GSO errors are bounded.

In this work, we have presented a simple analytical approximation scheme for generic non-linear FBSDEs. By treating the interested system as the linear decoupled FBSDE perturbed with non-linear generator and feedback terms, we have shown that it is possible to carry out a recursive approximation to an arbitrarily highe…

2011-06-01abs ↗pdf ↗

TULiP estimates uncertainty for deep learning models safely.

problem Reliable uncertainty estimation for deep learning models in the open world.
method TULiP considers a hypothetical perturbation, bounds its effect, and computes uncertainty from sampled predictions.
result TULiP achieves state-of-the-art performance in OOD detection benchmarks.

Improved perturbation reduces matrix condition number to O(n) with minimal storage.

problem Reducing the condition number of deterministic matrices for efficient algorithmic use.
method Introduced pattern matrices and sparse perturbations with dependent entries.
result Condition number reduced to O(n) with O(n) random numbers in O(log n) precision.

This work proves Kerr black holes are dynamically stable under certain perturbations.

problem Dynamical stability of Kerr black holes under axially symmetric perturbations.
method Dimensional reduction to 2+1 Einstein-wave map system, construction of positive-definite energy functional, proving boundary terms vanish.
result Strictly conserved positive energy for axially symmetric linear perturbations of Kerr black holes.

Researchers found a way to measure energy in black hole perturbations.

problem Lack of positive-definite and conserved energy in black hole stability.
method Dimensional reduction and construction of a positive-definite energy functional.
result Conserved Hamiltonian energy for axially symmetric perturbations of Kerr black holes.

Charge measurements for instantons and gravitational perturbations.

problem Evaluating charges in Hermitian non-Kähler Einstein 4-manifolds and their perturbations.
method Evaluation of charges via Killing spinors and perturbation analysis of gravitational instantons.
result Generic gravitational perturbations admit a closed 2-form measuring the charge change.

Paper addresses eigenvector perturbation in small eigen-gap scenarios.

problem Fine-grained behavior of eigenvectors in the presence of small eigen-gaps.
method Develops de-biased estimators for linear functions of an unknown eigenvector.
result Achieves minimax lower bounds for a family of scenarios, even with small eigen-gaps.

The paper studies the asymptotic behavior of adversarial training under \ell_\infty-perturbation.

problem Theoretical guarantees for sparsity-recovery in adversarial training.
method Investigation of the asymptotic distribution of the adversarial training estimator in generalized linear models.
result The asymptotic distribution of the adversarial training estimator under \ell_\infty-perturbation could have a positive probability mass at 0 when the true parameter is 0.

This work presents a novel approach to train invertible linear layers by adding rank-one perturbations.

problem Training invertible linear layers during optimization with gradient-based methods is challenging.
method Train rank-one perturbations and add them to weight matrices infrequently, keeping track of inverses and determinants.
result Invertible linear layers improve mixing and mode separation in normalizing flows.

In his celebrated paper "Generic projections", John Mather has shown that almost all linear projections from a submanifold of a vector space into a subspace are transverse with respect to a given modular submanifold. In this paper, an improvement of Mather's result is stated. Namely, we show that almost all linear pert…

2016-07-12abs ↗pdf ↗

Study perturbs Dirac operators in any dimension, focusing on Majorana fermions.

problem Understanding perturbations of Dirac operators in various dimensions.
method Analyzes canonical perturbations of Dirac operators on Hermitian Clifford modules.
result Characterizes the low-energy spectrum of these operators on complete surfaces.

New metric scores perturbations across populations, not cells, improving model comparison.

problem Single-cell perturbation data overlaps, making per-cell accuracy unreliable.
method Average per-cell probability vectors over all cells of a perturbation to form a population profile and rank candidate perturbations.
result Classifier Discrimination Score (CDS) identifies true perturbation more reliably than pseudobulk-based scores.

Adversarial training can lead to overfitting without compromising robustness.

problem Explaining benign overfitting in adversarially robust linear classification.
method Theoretical analysis and numerical experiments on adversarial training.
result Adversarially trained linear classifiers can achieve near-optimal risks despite overfitting noisy data.

Paper develops robust Bayesian models for linear regression under adversarial perturbations.

problem Ensuring reliable machine learning models under data perturbations.
method Formulates adversarial Bregman divergence loss, computes adversarial perturbation, introduces adversarially robust posteriors, derives generalization certificates.
result Derives first rigorous generalization certificates for adversarially robust Bayesian linear regression.

This work examines how adversarial vulnerability changes with the dimensionality of the subspace of perturbations.

problem Understanding adversarial vulnerability in constrained input spaces.
method Investigates adversarial vulnerability in subspace VV of the input space XX with varying dimensions, using PGD attacks and analyzing the dependence on εε and dim(V)/dim(X)dim(V)/dim(X).
result Adversarial success of PGD attacks is a monotonically increasing function of $ε( rac{dim(V)}{dim(X)})^{ rac{1}{q}}$.

New geometric interpretation explains over-parameterized models and adversarial perturbations.

problem Geometric understanding of over-parameterized regression and adversarial perturbations.
method Alternative geometric interpretation of regression in feature space.
result Adversarial perturbations are a natural feature of biased models due to underlying geometry.

We present an algorithm for computing class-specific universal adversarial perturbations for deep neural networks. Such perturbations can induce misclassification in a large fraction of images of a specific class. Unlike previous methods that use iterative optimization for computing a universal perturbation, the propos…

2019-12-01abs ↗pdf ↗

We consider the problem of controlling an unknown linear dynamical system in the presence of (nonstochastic) adversarial perturbations and adversarial convex loss functions. In contrast to classical control, the a priori determination of an optimal controller here is hindered by the latter's dependence on the yet unkno…

2019-11-27abs ↗pdf ↗

The SPS method constructs confidence regions for true parameters with optimal sample complexity.

problem Constructing exact, non-asymptotic confidence regions for true system parameters.
method Sign-Perturbed Sums (SPS) method, generalized to various types of problems.
result High probability upper bounds for SPS confidence regions show optimal shrinkage rate.

The paper tackles extrapolation of gene knockouts effects on RNA counts.

problem Modeling effects of gene knockouts on RNA counts for new perturbations.
method Formulated as a latent variable model with additive perturbation effects, proved identifiability, proposed PDAE for estimation.
result PDAE can accurately predict effects of unseen but identifiable perturbations.

Enhances GBDT robustness with one-hot encoding and regularization.

problem Low robustness of GBDT models against covariate perturbation.
method One-hot encoding to linear framework, risk decomposition, L1L_1 or L2L_2 regularization.
result Regularization enhances GBDT robustness.