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.

169,291 papers · 148 categories

Trend · papers per month

162323485646 · Jun 202019922001200920182026
48 results for effective operators

Introduce Collapsed Effective Operators for higher-order structures.

problem Existing spectral operators decompose topology into separate ranks, leaving practitioners to fuse information back to vertices.
method Introduce Collapsed Effective Operators via Schur complementation of a graded Laplacian.
result Preserves positive semi-definiteness, lowers system energy under higher-order connectivity.

Study Laplace operators in adiabatic limit of fibre bundles.

problem Understanding Laplace-type operators in the adiabatic limit of complex vector bundles.
method Analyse the adiabatic limit of fibre bundles with compact fibres, proving existence of effective operators providing asymptotics.
result Existence of effective operators providing asymptotics to any order in ε for Laplace-type operators H on an almost-invariant subspace of L^2(E).

Analyzes tunneling effects for Schrödinger operators on vector bundles.

problem Tunneling effects in quantum systems with multiple potential wells.
method Quasimodes and WKB analysis near potential wells, interaction matrix for coupling between wells.
result Polynomial prefactor for exponentially small eigenvalue splitting determined by dimension of minimal geodesics.

New neural operators model turbulence with memory and randomness.

problem Modeling turbulence in complex fluid dynamics with memory and randomness.
method Symmetrized activation functions, fractional derivatives, and stochastic noise.
result Theoretical guarantees for approximation quality in turbulent phenomena.

ISOKANN learns collective variables and effective dynamics for metastable transitions.

problem Understanding metastable transitions in complex molecular systems.
method Integrates Koopman operators with neural networks to extract CVs and effective dynamics.
result Reconstructs coarse-grained kinetics and reproduces transition times across barriers.

Paper uses Koopman operator and Nyström method for efficient nonlinear control.

problem Control of nonlinear dynamical systems.
method Combines Koopman operator framework with Nyström approximation for kernel methods.
result Theoretical guarantees on the convergence rates of the approximated Riccati operator and regulator objective.

Physics-informed neural networks improve by measuring effective dimensionality of constraints.

problem Task interference in physics-informed neural networks due to shared parameter space.
method Introduce effective dimensionality (deffd_{eff}) as an operator invariant to quantify constraints.
result Effective dimensionality measures unconstrained parameter directions, independent of network architecture.

We study a regular closure operator in the category of quandles. We show that the regular closure operator and the pullback closure operator corresponding to the reflector from the category of quandles to its full subcategory of trivial quandles coincide, we give a simple description of this closure operator, and analy…

2014-12-30abs ↗pdf ↗

Framework learns to optimize tensor programs for various hardware.

problem Manual optimization of tensor operators for deep learning limits applicability and increases engineering costs.
method Learning-based statistical cost models guide tensor operator implementations over billions of variants.
result Framework delivers performance competitive with hand-tuned libraries across multiple hardware targets.

Paper learns Koopman operator from sparse data, escaping function space constraints.

problem Learning Koopman operator from non-closed function spaces.
method Operator stochastic approximation algorithm using conditional mean embeddings (CME).
result Online sparse learning algorithm with trajectory-based sampling guarantees.

Functional determinant for mixed signature sphere products depends on sphere dimensions and parity.

problem Determining the functional determinant for scalar fields on mixed signature sphere products.
method Analyzing the GJMS operator on Sqimes^q imesSp^p to derive the functional determinant.
result The functional determinant depends only on the total dimension and parity of the sphere dimensions.

SCOPE-FE improves feature engineering efficiency for high-dimensional datasets.

problem Expanding and reducing feature space in tabular learning becomes computationally expensive with increased dimensionality.
method SCOPE-FE controls the search space by regulating operator and feature-pair spaces, using OperatorProbing and FeatureClustering.
result SCOPE-FE reduces feature engineering time while maintaining competitive predictive performance.

Paper proposes adaptive parameter selection for KGD algorithms.

problem Improving parameter selection for kernel-based gradient descent.
method Integrates bias-variance analysis with splitting method, introduces empirical effective dimension.
result Adaptive parameter selection strategy achieves optimal generalization error bound.

CViT learns complex physical systems using vision transformer techniques.

problem Learning maps between infinite-dimensional function spaces in scientific machine learning.
method Combines vision transformer encoder, grid-based coordinate embedding, and cross-attention mechanism.
result Achieves state-of-the-art performance on multiple benchmarks, often surpassing larger models.

Paper estimates upper bound of analytic torsion under Arakelov metric.

problem Estimating the analytic torsion under Arakelov metric.
method Defined and analyzed the regularized determinant of Laplacian, providing an asymptotic upper bound.
result The logarithm of analytic torsion is asymptotically upper bounded by gg for g>1g>1.

New method speeds up Bayesian inverse problem solving with neural operators.

problem Solving infinite-dimensional Bayesian inverse problems with high computational cost.
method Delayed-acceptance geometric MCMC driven by derivative-informed neural operator surrogates.
result Significant speedup in generating posterior samples (3-9 times faster).

Develops a framework for learning nonlinear operators using Mercer kernels.

problem Learning nonlinear operators between infinite-dimensional spaces.
method Stochastic approximation framework with Mercer operator-valued kernels.
result Establishes dimension-free polynomial convergence rates for nonlinear operator learning.

Extends expected value framework for cost-sensitive causal decision-making.

problem Optimizing operational decision-making with cost-sensitive causal classification.
method Introduces a cost-sensitive decision boundary based on estimated individual treatment effects, positive outcome probability, and cost parameters.
result Effective in maximizing expected causal profit, outperforming cost-insensitive ranking approach.

CD estimates demand by separating promotions from a stable base, reducing inventory costs.

problem Operational volatility in demand forecasts leads to excessive safety stock and inventory costs.
method Contextual Deconvolution (CD) decomposes demand into a smooth base and promotion-driven shocks.
result CD reduces inventory costs by stabilizing demand forecasts, but under-provisions event spikes.

Proposes a new method to learn operators for stochastic problems using DeepONet with autoencoder.

problem Efficiently solve forward and inverse stochastic problems with limited data.
method MultiAuto-DeepONet, a multi-resolution autoencoder DeepONet model.
result The model effectively handles high-dimensional stochastic inputs and reduces the number of trainable parameters.

We generalise the analysis in [arXiv:0904.1744] to superspace, and explicitly prove that for any embedding of surface operators in a general, twisted N=2 pure abelian theory on an arbitrary four-manifold, the parameters transform naturally under the SL(2,Z) duality of the theory. However, for nontrivially-embedded surf…

2009-06-15abs ↗pdf ↗

Researchers derive asymptotic expansions for thermoelastic operators on manifolds.

problem Determining precise geometric information from thermoelastic spectra.
method Asymptotic expansions with Dirichlet and Neumann boundary conditions.
result Explicit calculation of first two coefficients for volumes.

PILNO uses neural operators to solve PDEs efficiently on point clouds.

problem Solving partial differential equations (PDEs) on point cloud data efficiently.
method Physics-informed low-rank neural operator framework combining low-rank kernel approximations and an encoder-decoder architecture.
result PILNO efficiently approximates solution operators of PDEs on point cloud data, satisfying PDE constraints and boundary conditions.

GATES improves neural architecture search by modeling operations as information transformation.

problem Improving predictor-based neural architecture search efficiency.
method GATES models operations as information transformation, covering both node and edge cell search spaces.
result GATES boosts sample efficiency and improves predictor performance.

We find flat band Hamiltonians and Ginsparg-Wilson relations for symmetry classes.

problem Finding flat band Hamiltonians and Ginsparg-Wilson relations for symmetry classes.
method Integrating out the additional bulk direction to obtain effective Dirac operators and then deriving flat and overlap Dirac operators.
result Established Ginsparg-Wilson relations and mod-two index theorems for each symmetry class.

Statistical depth metrics help identify risky power grid scenarios.

problem Identifying extreme scenarios for risk mitigation in power grid planning.
method Functional depth metrics for sub-selecting outlying scenarios.
result The proposed approach effectively identifies risky scenarios for operational risk mitigation.

New method shows Hessian estimator from random samples converges to true Hessian on complex manifolds.

problem Uncertainty in Hessian estimator accuracy on complex manifolds with boundaries and nonuniform sampling.
method Locally fitting quadratic polynomials, rigorous theoretical analysis under mild conditions.
result The Hessian estimator asymptotically converges to the true Hessian, even near boundaries.

Softmax Bellman operator improves Q-function performance in RL despite sub-optimality.

problem Softmax Bellman operator's impact on value functions in RL is problematic.
method Revisited theoretical properties of softmax Bellman operator, proving convergence and overestimation reduction.
result Softmax Bellman operator leads to superior policies in practice, even outperforming double Q-learning.