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

241481722962 · Jun 202019922001200920172026
48 results for Operational Improvements

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.

In this article, we introduce the notion of cycling operations of arbitrary order in Garside groups, which is a full generalization of the cycling and decycling operations. Theoretically, this notion together with other related concepts provides a context in which various definitions and arguments concerning Garside gr…

2006-05-30abs ↗pdf ↗

New restrictions on holonomy groups for certain curvature conditions.

problem Restrictions on holonomy groups for Riemannian manifolds with specific curvature properties.
method Analyzing the curvature operator of the second kind to derive restrictions on holonomy groups.
result Holonomy groups are restricted to SO(n)SO(n) or the manifold is flat for certain curvature conditions.

Integrates ML with operations knowledge to improve distributional forecasts in healthcare.

problem Challenges of ML in operational settings, especially lack of distributional information and integration of operations literature.
method Introduces Boosted Generalized Normal Distribution (bbGND) using gradient boosting with tree learners.
result Improves wait and service time forecasting by 6% and 9% compared to ML benchmarks.

New methods solve MI problems with locally Lipschitz operators, improving solution efficiency.

problem Solving monotone inclusions with locally Lipschitz continuous operators.
method Primal-dual extrapolation methods using backtracking line search.
result Improved operation complexity for solving MI problems.

Noise-robust Koopman operator framework for control with improved stability and performance.

problem Developing a stable and noise-robust Koopman operator for control tasks.
method Proposes a learning framework using Hankel matrix and neural network approximations for system dynamics, ensuring long-term stability and noise robustness.
result Demonstrates improved model performance and noise robustness in control tasks compared to existing methods.

The paper proposes a method to improve Koopman operator estimation using indicator functions.

problem Difficulty in identifying good observables for Koopman operator expansion.
method Clustering procedure based on Hidden Markov Model (HMM) to infer surrogate observables.
result Inferred indicator functions significantly improve estimation of Koopman operator eigenvalues and transition timescales.

Improved bounds for Carleson-Sjölin operators on manifolds with specific curvature conditions.

problem Bounding Carleson-Sjölin operators on manifolds with special curvature conditions.
method Two different methods: one using distance function conditions and the other using contact orders of oscillatory integral operators.
result Improved LpL^p bounds for Carleson-Sjölin operators on manifolds with constant sectional curvature and those satisfying Sogge's chaotic curvature condition.

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.

CASP improves portfolio optimization by considering asset covariance.

problem Infeasibility in cardinality-constrained portfolio optimization.
method CASP uses volatility-normalized selection and covariance-aware projection.
result CASP-Basic delivers lower portfolio variance than standard Euclidean repair.

The study shows conditions for Kähler manifolds to have rational cohomology of complex projective space.

problem Conditions for Kähler manifolds to have rational cohomology of complex projective space.
method Analyzing the Calabi curvature operator and its positivity conditions.
result Compact Kähler manifolds with specific curvature conditions have rational cohomology of complex projective space.

Improved convergence of fixed-point methods using windowed Anderson acceleration.

problem Improving convergence of fixed-point methods for symmetric operators.
method Windowed Anderson acceleration for symmetric fixed-point iterations.
result Windowed Anderson acceleration improves convergence over standard fixed-point methods.

Improved 2-bit covariance estimator with reduced operator norm error and no tuning needed.

problem Improving 2-bit covariance estimation with reduced operator norm error and no tuning needed.
method Proposed a new 2-bit covariance matrix estimator using triangular dithering scales.
result Improved operator norm error rate that depends on effective rank of covariance matrix, closing theoretical gap.

Study curvature operator on Riemannian manifolds, proving new classification results.

problem Classifying Riemannian manifolds based on the curvature operator of the second kind.
method Analyzing the curvature operator and proving classification theorems.
result Closed manifolds with specific curvature properties are classified.

The article improves Beckner's inequality for axially symmetric functions on the n-dimensional sphere.

problem Improving Beckner's inequality for axially symmetric functions on Sn\mathbb{S}^n.
method Uniqueness and existence results for Q-curvature type equations with a Paneitz operator on Sn\mathbb{S}^n for axially symmetric functions.
result Improved Beckner's inequality for axially symmetric functions on Sn\mathbb{S}^n.

In "Illinois J. of Math. {\bf 38} (1994) 653--678", the heat operator of a Bismut superconnection for a family of generalized Dirac operators is defined along the leaves of a foliation with Hausdorff groupoid. The Novikov-Shubin invariants of the Dirac operators were assumed greater than three times the codimension of …

2013-04-26abs ↗pdf ↗

MultiRocket boosts TSC speed and accuracy with pooling and transformations.

problem Efficient time series classification with high accuracy.
method Multiple pooling operators and transformations applied to raw and differenced series.
result MultiRocket outperforms MiniRocket and is competitive with state-of-the-art methods in terms of accuracy and speed.

Hybrid GP/NN framework for operator learning improves performance and enables zero-shot predictions.

problem Approximating mappings between infinite-dimensional function spaces for solving PDEs.
method A hybrid GP/NN framework that approximates the bilinear form of an operator, allowing recovery of the operator.
result Improves performance of neural operators and enables zero-shot predictions.

Improved set prediction model using multiset-equivariant operations and approximate implicit differentiation.

problem Existing set prediction models struggle with multisets and cannot represent certain functions.
method Introduced multiset-equivariance, improved DSPN with approximate implicit differentiation, and applied to CLEVR object property prediction.
result Significantly improved object property prediction on CLEVR dataset.

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.

GLAD improves latent graph generation by quantizing discrete latent space.

problem Latent space graph generative models lack performance and make unnatural assumptions.
method Adapting diffusion bridges to a discrete latent space, avoiding data space decompositions.
result GLAD achieves competitive performance on graph benchmark datasets.

CW-EDMD improves prediction accuracy by learning local Koopman models for different state-space regions.

problem Inefficient global Koopman operator approximation for distinct local dynamics.
method Cluster-Weighted EDMD (CW-EDMD) learns a soft phase-space partition and per-cluster EDMD operators using EM objective.
result CW-EDMD significantly reduces prediction errors across various systems and configurations.

HOPE improves SSMs for long-memory tasks with robust initialization and training.

problem Improving state-space models for long-memory tasks with robust initialization and training.
method Developed a new parameterization scheme called HOPE using Hankel operators and Markov parameters.
result HOPE improves SSMs' performance on Long-Range Arena tasks and demonstrates non-decaying memory.

MetaNOR learns common nonlocal kernels for efficient metamaterial modeling.

problem Efficiently modeling wave propagation in new metamaterials.
method Meta-learns a common nonlocal kernel from existing tasks and transfers this knowledge to new tasks with minimal data.
result Substantial improvements in sampling efficiency for new metamaterials.

Improved estimate for eigenvalues of minimal hypersurfaces in spheres.

problem Estimating the first non-zero eigenvalue of minimal hypersurfaces in spheres.
method Proved an improved lower bound for the first non-zero eigenvalue of the induced Laplace-Beltrami operator on minimal hypersurfaces in spheres.
result First explicitly computable improvement on the eigenvalue lower bound without additional assumptions.

Enhances neural operators with physics knowledge for more accurate simulations.

problem Improving accuracy and generalization of neural operators for physical systems.
method Jointly learns from original PDEs and simplified forms, incorporating fundamental physics.
result Significant improvement in nRMSE across various PDE problems.