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

16.7%33.3%50.0%66.7% · Jan 199319922001200920172026
48 results for partial resolution

This is the third companion paper of arXiv:1601.03586. When a gauge theory has a flavor symmetry group, we construct a partial resolution of the Coulomb branch as a variant of the definition. We identify the partial resolution with a partial resolution of a generalized slice in the affine Grassmannian, Hilbert scheme o…

2018-05-30abs ↗pdf ↗

MeshfreeFlowNet generates high-resolution spatio-temporal solutions from low-resolution inputs.

problem Generating high-resolution spatio-temporal solutions from low-resolution inputs.
method Physics-constrained deep learning framework using fully convolutional encoders.
result Significantly outperforms existing baselines in super-resolution of turbulent flows.

Study uses multi-agent reinforcement learning to control self-assembly with high-resolution external control.

problem Designing effective external control protocols for self-assembly with high-resolution control.
method Investigated a multi-agent reinforcement learning approach, comparing fully decentralized and partially decentralized strategies.
result Partially decentralized approach outperforms fully decentralized in controlling self-assembly towards target structures.

Study on cohomology of SL_n(Z) for n>=3, proving vanishing of certain cohomology groups.

problem Determine the cohomology of SL_n(Z) for n>=3.
method Construct a partial resolution of the Steinberg module to show vanishing of specific cohomology groups.
result Vanishing of codimension-2 rational cohomology group H^{{n \choose 2} -2} for n >= 3.

We describe partial semi-simplicial resolutions of moduli spaces of surfaces with tangential structure. This allows us to prove a homological stability theorem for these moduli spaces, which often improves the known stability ranges and give explicit stability ranges in many new cases. In each of these cases the stable…

2009-09-23abs ↗pdf ↗

The metrics of S. Y. Cheng and S.-T. Yau are considered on a strictly pseudoconvex domains in a complex manifold. Such a manifold carries a complete Kähler-Einstein metric if and only if its canonical bundle is positive. We consider the restricted case in which the CR structure on M\partial M is normal. In this case M…

2010-12-31abs ↗pdf ↗

We prove that given any smooth metric γγ and smooth positive function HH on S2S^{2}, there is a constant λ>0λ> 0, depending on (γ,H)(γ, H), and an asymptotically flat solution (M,g,u)(M, g, u) of the static vacuum Einstein equations on M=R3B3M = {\mathbb R}^{3} \setminus B^{3}, such that the induced metric and mean curvature of $…

2015-07-21abs ↗pdf ↗

In this thesis, we show the existence of a sequence of differential operators starting with with the Dirac operator in k Clifford variables, D=(D1,...,Dk)D=(D_1,..., D_k), where Di=jejij:C((Rn)k,§)C((Rn)k,§)D_i=\sum_j e_j\cdot \partial_{ij}: C^\infty((\R^n)^k,§)\to C^\infty((\R^n)^k,§) (§§ is the spinor module). This operator is the Cauchy-Riemann operato…

2007-08-09abs ↗pdf ↗

We introduce a Bayesian Gaussian process latent variable model that explicitly captures spatial correlations in data using a parameterized spatial kernel and leveraging structure-exploiting algebra on the model covariance matrices for computational tractability. Inference is made tractable through a collapsed variation…

2018-05-22abs ↗pdf ↗

The study optimizes Gaussian process approximations for finite-rank models.

problem Posterior behavior of finite-rank approximations differs from parent GP priors.
method Locally supported basis expansions with dependent Gaussian coefficients.
result Finite-rank expansions inherit the same posterior contraction rate as parent GP priors.

Framework learns surrogates for molecular dynamics across multiple time-scales.

problem Stable molecular dynamics simulations require small time-steps, but long-time-scale moments need repeated simulations.
method Implicit Transfer Operator Learning with denoising diffusion probabilistic models and SE(3) equivariant architecture.
result Models can generate self-consistent stochastic dynamics across multiple time-scales.

NKN deep neural network learns governing equations and classifies images.

problem Learning governing equations and classifying images with deep neural networks.
method Nonlocal kernel network (NKN) that is resolution independent, deep, and handles various tasks.
result NKN outperforms baseline methods in learning governing equations and image classification tasks.

Novel neural operator predicts complex spatiotemporal dynamics from partial observations.

problem Capturing complex operator dynamics in infinite-dimensional function spaces.
method Integrates Koopman operator theory with deep neural networks to approximate nonlinear operators between Banach spaces.
result BNO achieves robust zero-shot super-resolution in unsteady flow prediction and outperforms conventional methods.

Sig-DEG speeds up diffusion models by distilling them into faster approximations.

problem Computational intensity of diffusion models at inference time.
method Signature-based differential equation generation to summarize Brownian motion.
result Sig-DEG reduces inference steps by an order of magnitude while maintaining generation quality.

Torus covers have controlled volume and diameter under curvature and diameter bounds.

problem Bounding volume and diameter of torus covers with curvature and diameter constraints.
method Using lower Ricci curvature bound and upper diameter bound, constructing finite-sheeted covering spaces.
result Recovering and extending a result of Kloeckner and Sabourau with controlled bounds.

LUNO linearizes neural operators to quantify their predictive uncertainty.

problem Quantifying the predictive error of neural operators for high-stakes simulations.
method Model linearization to push weight-space uncertainty forward to predictions.
result LUNO provides a practical and theoretically sound way to apply Bayesian methods to neural operators.

New method learns PDE solutions from low-fidelity data.

problem Challenges in learning PDE surrogates with scarce data.
method Flow matching in infinite-dimensional space with conditional neural operators.
result Accurately learns PDE solutions across different resolutions and fidelities.

Study portfolio optimization with partial info and drawdown constraints using deep learning.

problem Optimizing portfolios with partial information and maximum drawdown constraints.
method Bayesian framework, dynamic programming, semi-explicit solutions, deep learning for stochastic control.
result Numerical solutions and performance analysis with deep learning, convergence to Merton problem.

Cut-DeepONet handles discontinuities and sharp transitions in neural operators.

problem Neural operators struggle with discontinuities and sharp transitions in PDEs.
method Two-stage training framework that explicitly models discontinuities via a lifting strategy and input-dependent discontinuity prediction.
result Cut-DeepONet outperforms state-of-the-art methods on benchmark PDEs with low-resolution datasets.

Partial AHS-structures extend G-structures and Cartan geometries to manifolds with involutive distributions.

problem Extending G-structures and Cartan geometries to manifolds with involutive distributions.
method Developing a canonical Cartan geometry for partial AHS-structures and constructing BGG sequences.
result Partial AHS-structures have analogs of BGG sequences, providing fine resolutions of sheaves.

SR-NAM maps low-res images to multiple high-res images realistically.

problem Mapping low-resolution images to multiple high-resolution images realistically.
method SR-NAM using Non-Adversarial Mapping (NAM) technique and a degradation model.
result Realistic degradation and down-sampling of high-resolution images.

New model tackles complex spatio-temporal causal inference with dynamic confounders and functional data.

problem Complex spatio-temporal dynamics and unmeasured confounders hinder causal inference.
method PFD-BDCM, a unified generative framework for spatio-temporal dependencies, functional data, and dynamic confounding.
result PFD-BDCM outperforms existing methods across observational, interventional, and counterfactual queries.

This paper solves PDEs for embedding discrete lattices into smooth manifolds.

problem Embedding discrete lattices into smooth manifolds while preserving geometric and topological properties.
method Rigorous mathematical framework and analysis of partial differential equations (PDEs).
result Existence and regularity of solutions to PDEs under initial boundary conditions.

The abstract discusses p-harmonic forms and their geometric properties, proving new theorems about Lp-cohomology.

problem The abstract tackles the geometric properties of p-harmonic forms and their role in Lp-cohomology.
method The approach involves using p-harmonic and p-coclosed forms to reprove vanishing theorems and provide injectivity theorems.
result The main finding is the reproof of vanishing theorems and the provision of injectivity theorems for Lp-cohomology.

Paper introduces CRP-O framework for uncertainty quantification in deep operators.

problem Uncertainty quantification in energy-efficient deep learning algorithms, especially in SNNs.
method CRP-O framework using RP networks and SCP, with Gaussian Process Regression for super-resolution.
result Enhanced uncertainty bounds improve UQ estimates compared to existing methods.

We present explicit constructions of complete Ricci-flat Kahler metrics that are asymptotic to cones over non-regular Sasaki-Einstein manifolds. The metrics are constructed from a complete Kahler-Einstein manifold (V,g_V) of positive Ricci curvature and admit a Hamiltonian two-form of order two. We obtain Ricci-flat Ka…

2007-07-11abs ↗pdf ↗

State-free reversible VAMPnets (SRVs) are a neural network-based framework capable of learning the leading eigenfunctions of the transfer operator of a dynamical system from trajectory data. In molecular dynamics simulations, these data-driven collective variables (CVs) capture the slowest modes of the dynamics and are…

2019-06-12abs ↗pdf ↗

A new deep metric learning method for defect classification in threaded pipe connections.

problem Defect classification in threaded pipe connections with limited and imbalanced multichannel functional data.
method COMPILED approach based on deep metric learning for imbalanced, multichannel, and partially observed functional data.
result Superior accuracy compared to existing benchmarks in a real-world case study.

Paper introduces a Gaussian Process for operator learning in computational mechanics.

problem Efficient and accurate solutions for large datasets with reliable uncertainty quantification.
method Gaussian Process (GP) embedded in a neural operator framework with stochastic dual descent (SDD) algorithm.
result Improves GP resolution independence and scalability for high-dimensional and non-linear systems.

The paper proposes a method to improve fine-resolution predictions using coarse-resolution data.

problem Limited supervision for fine-resolution predictions with scarce data.
method Attention-based regularization on multi-view coarse-resolution data.
result The method improves fine-resolution predictions using coarse-resolution data.

Proposes ENOs for learning PDE solutions that conserve energy.

problem Learning dynamics that obey physical laws, especially in super-resolution settings.
method Energy-consistent Neural Operators (ENOs) with a novel penalty function inspired by energy-based theory.
result ENOs outperform existing DNN models in predicting solutions from data, especially in super-resolution settings.