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

326597129 · Jun 202019922001200920172026
48 results for mode perturbation

New metrics improve scRNA-seq perturbation modeling by reducing mode collapse.

problem Outperformed by simple mean prediction in scRNA-seq perturbation modeling.
method Introduce DEG-aware metrics (WMSE, Rw2(Δ)R^{2}_{w}(Δ)) and negative/positive baselines.
result WMSE loss function reduces mode collapse and improves model performance.

Novel tensor perturbation bounds for orthogonal iteration methods.

problem Developing robust bounds for tensor reconstruction and subspace estimation.
method Blockwise tensor perturbation bounds for high-order orthogonal iteration (HOOI).
result Upper bounds for singular subspace estimation converge linearly and tensor reconstruction error bound is characterized by a simple quantity.

Study on mode stability of gravitational instantons of type D.

problem Proving mode stability of gravitational instantons of type D.
method Analogous to Lorentzian case, analyze Weyl curvature scalars satisfying a separable Teukolsky equation.
result Prove mode stability, showing no solutions compatible with regularity and asymptotic flatness.

We consider the Yang-Mills flow on hyperbolic 3-space. The gauge connection is constructed from the frame-field and (not necessarily compatible) spin connection components. The fixed points of this flow include zero Yang-Mills curvature configurations, for which the spin connection has zero torsion and the associated R…

2012-10-02abs ↗pdf ↗

We propose a non-perturbative formulation of the Atiyah-Patodi-Singer(APS) index in lattice gauge theory, in which the index is given by the ηη invariant of the domain-wall Dirac operator. Our definition of the index is always an integer with a finite lattice spacing. To verify this proposal, using the eigenmode set o…

2019-10-21abs ↗pdf ↗

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.

New framework assesses graph-learning datasets for better evaluation.

problem Insufficient evaluation of graph-learning datasets and methods.
method Introduces Rings framework for dataset ablations and proposes performance separability and mode complementarity measures.
result Demonstrates utility of Rings framework for graph-learning dataset evaluation.

Improved KSD test for better detection of differences in distributions.

problem Low power of KSD test when distributions have same modes but different mixing proportions.
method Perturb the observed sample using Markov transition kernels to improve KSD test power.
result Perturbed KSD test can lead to substantially higher power than the original KSD test.

A method to explain disease transformation using biomarker covariance matrices.

problem Understanding disease transformation from a healthy baseline.
method Modeling healthy and disease states of biomarker covariance matrices to characterize perturbations.
result Disease perturbs the biomarker covariance structure, allowing for mechanistic explanations and individual patient prognosis.

In a previous paper [\AS], we used superspace techniques to prove that perturbation theory (around a classical solution with no zero modes) for Chern--Simons quantum field theory on a general 33-manifold MM is finite. We conjectured (and proved for the case of 22-loops) that, after adding counterterms of the expecte…

1993-04-21abs ↗pdf ↗

Inhomogeneous plasmas filaments instabilities are investigated by using the techniques of classical differential geometry of curves where Frenet torsion and curvature describe completely the motion of curves. In our case the Frenet frame changes in time and also depends upon the other coordinates taking into account th…

2007-03-05abs ↗pdf ↗

PerturBench benchmarks ML models for cellular perturbation analysis.

problem Standardizing benchmarking in modeling single cell transcriptomic responses to perturbations.
method Modular platform, diverse datasets, metrics, extensive evaluation, rank metrics.
result Simpler models are competitive and scale well with larger datasets.

The paper introduces a diagnostic method to detect grokking transitions in models before test accuracy improves.

problem Detecting the transition from training to generalization in machine learning models.
method Summarize task-dependent observables as empirical distributions, map them to Wasserstein/quantile coordinates, and analyze using Hankel dynamic mode decomposition.
result The diagnostic method achieves AUROC \(\approx\) 0.93 for grokking-vs-non-grokking discrimination at the run level.

We quantify forgetting in post-training models, distinguishing mass and drift.

problem Understanding and preventing forgetting in post-training generative models.
method Developed theoretical results under a two-mode mixture abstraction, formalizing mass and drift forgetting.
result Forgetting can be precisely quantified based on divergence direction, geometric overlap, and training regime.

New measures quantify diversity of latent representations using metric space magnitude.

problem Evaluating the diversity of latent representations in machine learning models.
method Developed magnitude-based measures for latent representations, stable under data perturbations.
result Demonstrated superior performance across various domains and tasks.

Quantum Kerr learning shows enhancements in convergence and generalization for kernel-based methods.

problem Improving convergence and generalization in kernel-based methods for quantum computing.
method Combining quantum mechanics with neural tangent kernel theory and first-order perturbation theory.
result Quantum enhancements in terms of convergence time and generalization error.

LoRA-Curve connects independent LoRA optima through continuous low-loss valleys, improving Bayesian model averaging.

problem Challenges in estimating epistemic uncertainty in LoRA-based Bayesian inference.
method Introduces LoRA-Curve, a segmented Bézier curve parameterization in the LoRA space, with free and anchored configurations.
result Empirically shows that connecting independent LoRA optima through continuous low-loss valleys improves mutual information of the predictive distribution.

We prove boundedness and polynomial decay statements for solutions to the spin ±1\pm1 Teukolsky-type equation projected to the =1\ell=1 spherical harmonic on Reissner-Nordström spacetime. The equation is verified by a gauge-invariant quantity which we identify and which involves the electromagnetic and curvature tensor…

2018-12-06abs ↗pdf ↗

Motivated by advantages of current-mode design, this brief contribution explores the implementation of weight matrices in neuromemristive systems via current-mode memristor crossbar circuits. After deriving theoretical results for the range and distribution of weights in the current-mode design, it is shown that any we…

2017-07-17abs ↗pdf ↗

Prior work on neural network verification has focused on specifications that are linear functions of the output of the network, e.g., invariance of the classifier output under adversarial perturbations of the input. In this paper, we extend verification algorithms to be able to certify richer properties of neural netwo…

2019-02-25abs ↗pdf ↗

The paper tackles sampling from Gibbs measures with constrained support, providing a sampling guarantee.

problem Sampling from Gibbs measures with constrained support, especially in the pre-asymptotic regime.
method Analyzing the spectral gap of Langevin dynamics to provide a non-asymptotic sampling guarantee.
result The low-temperature Gibbs distribution concentrates on a neighborhood of its mode in the pre-asymptotic regime.

This paper explores tradeoffs between invariance and sensitivity in adversarial examples.

problem Understanding the limitations of existing adversarial defenses.
method Study of invariance-based adversarial examples and their impact on model accuracy.
result Adversarial defenses against sensitivity-based attacks can harm invariance-based attacks, necessitating new approaches.

For dynamical systems that can be modelled as asymptotically stable linear systems forced by Gaussian noise, this paper develops methods to infer or estimate their modes from observations in real time. The modes can be real or complex. For a real mode, we wish to infer its damping rate and mode shape. For a complex mod…

2019-09-23abs ↗pdf ↗

Mathematical analysis shows annealing prevents mode collapse in Gaussian mixtures.

problem Mode collapse in variational inference for multimodal distributions.
method Analyzed annealing strategies for Gaussian mixtures, derived formulas, and tested on neural networks.
result Appropriately chosen annealing schemes can robustly prevent mode collapse.

This paper tackles adaptive control of unknown Markov jump systems with sample complexity and regret bounds.

problem Adaptive control of unknown Markov jump systems with changing dynamics.
method Identification-based adaptive control using a system identification algorithm and certainty equivalent control.
result The proposed adaptive control scheme achieves O(T)\mathcal{O}(\sqrt{T}) regret, improving to O(polylog(T))\mathcal{O}(polylog(T)) with partial knowledge.

Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.

problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.

Analyzes learning dynamics of RNNs under locality constraints.

problem Understanding learning dynamics in RNNs with locality constraints.
method Dynamical systems theory applied to data-aligned linear RNNs.
result RFLO solutions are restricted to low-rank perturbations of initial parameters.

A new, efficient kk-modes algorithm improves clustering of categorical data.

problem Clustering categorical data using existing methods like kk-means is inefficient.
method Developed a novel kk-modes algorithm called OTQT, which improves on existing methods.
result OTQT finds more accurate clusters per iteration and is faster overall.

Multimodal clustering is an unsupervised technique for mining interesting patterns in nn-adic binary relations or nn-mode networks. Among different types of such generalized patterns one can find biclusters and formal concepts (maximal bicliques) for 2-mode case, triclusters and triconcepts for 3-mode case, closed $n…

2017-02-27abs ↗pdf ↗