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

3775112149 · May 202619922001200920172026
48 results for projective resolutions

Computes LL_\infty-algebroid for linear foliations on vector spaces.

problem Invariants of singular foliations on vector spaces induced by Lie subalgebras.
method Explicitly constructs projective resolutions and computes LL_\infty-algebroid structure.
result Provides invariants and constant-rank replacements of singular foliations.

A refined form of the `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type is proved in the context of manifolds with corners. This procedure is shown to capture the simultaneous resolution of all isotropy types in a `resolution stru…

2010-12-28abs ↗pdf ↗

The `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type is proved in the context of manifolds with corners. This procedure is shown to capture the simultaneous resolution of all isotropy types in a `resolution tower' which projects …

2009-07-20abs ↗pdf ↗

We give a criterion for a projective surface to become a quotient of a fake projective plane. We also give a detailed information on the elliptic fibration of a (2,3)(2,3)-elliptic surface that is the minimal resolution of a quotient of a fake projective plane. As a consequence, we give a classification of Q{\mathbb Q}-h…

2010-10-02abs ↗pdf ↗

New projection operators for multipatch spaces with stable properties.

problem Problems with non-matching interfaces in multipatch spaces.
method Construction of commuting projection operators on de Rham sequences of multipatch spaces with local tensor-product parametrization.
result Local and stable projection operators in any LpL^p norm for shape-regular spline patches with different mappings and local refinements.

New method uses hyperspherical geometry to improve community detection.

problem Improving community detection methods in network analysis.
method Mapping networks to points on a hypersphere, then projecting to clustering vectors.
result Modularity maximization is equivalent to minimizing angular distance on the hypersphere.

Classifies and constructs intertwining differential operators between vector bundles over real projective space.

problem Classifying and constructing intertwining differential operators between vector bundles over RP2\mathbb{RP}^2.
method Utilizes SL(3,R)SL(3,\mathbb{R})-intertwining differential operators, BGG resolution, and representation theory.
result Irreducible unitary highest weight modules of SU(1,2)SU(1,2) at reduction points classified by Cartan and PRV operators.

We give an exposition of a theorem of Hirzebruch, Kodaira and Yau which proves the uniqueness of the Kahler structure of complex projective space, and of Yau's resolution of the Severi Conjecture.

2015-08-23abs ↗pdf ↗

Pronoun resolution is part of coreference resolution, the task of pairing an expression to its referring entity. This is an important task for natural language understanding and a necessary component of machine translation systems, chat bots and assistants. Neural machine learning systems perform far from ideally in th…

2019-06-03abs ↗pdf ↗

Efficiently generates high-resolution images with reduced sampling time using LEGO bricks.

problem Efficiently generating high-resolution images with reduced sampling time.
method Introduces LEGO bricks that integrate Local-feature Enrichment and Global-content Orchestration to create a test-time reconfigurable diffusion backbone.
result Significantly reduces sampling time compared to other methods.

We propose a novel, projection based way to incorporate the conditional information into the discriminator of GANs that respects the role of the conditional information in the underlining probabilistic model. This approach is in contrast with most frameworks of conditional GANs used in application today, which use the …

2018-02-15abs ↗pdf ↗

Entity resolution seeks to merge databases as to remove duplicate entries where unique identifiers are typically unknown. We review modern blocking approaches for entity resolution, focusing on those based upon locality sensitive hashing (LSH). First, we introduce kk-means locality sensitive hashing (KLSH), which is b…

2018-10-11abs ↗pdf ↗

The paper reformulates U-Nets as wavelet-based models and applies this to hierarchical VAEs.

problem Theoretical understanding and regularization properties of U-Nets and their relationship to wavelets.
method Formulating a multi-resolution framework to identify U-Nets as finite-dimensional truncations of infinite-dimensional models, proving average pooling corresponds to projection, and identifying HVAEs as discretizations of multi-resolution diffusion processes.
result HVAEs learn a time representation allowing for improved parameter efficiency through weight-sharing.

The paper defines new homotopy relations on knot projections and classifies certain knot types.

problem Defining and classifying knot homotopy relations.
method Introducing cross chord numbers and using them to define strong and weak (1, 3) homotopies.
result Complete classification of knot projections with trivializing number two.

We show that the generalized Kähler-Ricci soliton equation on 4-dimensional toric Kähler orbifolds reduces to ODEs assuming there is a Hamiltonian 2-form. This leads to an explicit resolution of this equation on labeled triangles and convex labeled quadrilaterals. In particular, we give the explicit expression of the K…

2011-03-24abs ↗pdf ↗

We apply the techniques of totally twisted Khovanov homology to the constructions by M. Asaeda, J. Przytycki, and A. Sikora of Khovanov type homologies for links and tangles in I-bundles over (orientable) surfaces. As a result we describe an invariant chain complex built out of resolutions with only non-contractible ci…

2012-09-13abs ↗pdf ↗

Non-Abelian actions are resolved using equivariant K-theory and delocalized cohomology.

problem Resolving non-Abelian actions on manifolds.
method Using equivariant K-theory and delocalized cohomology, the structure of the quotient space is described.
result A new model for non-Abelian equivariant K-theory and cohomology is developed.

EnScale learns to downscale climate models efficiently, capturing both spatial and temporal consistency.

problem Downscaling climate models from coarse to high-resolution data is computationally expensive and challenging.
method EnScale uses generative models and proper scoring rules to map GCM data to RCM data, reducing computational cost.
result EnScale achieves competitive performance and computational efficiency in downscaling multiple climate variables.

The study examines the balancedness of random partition models and finds the rich-get-richer characteristic is a result of model assumptions.

problem The balancedness of random partition models is largely neglected in the literature.
method Formulated a framework to define and study the balancedness of exchangeable random partition models, analyzed using product-form exchangeability and projectivity assumptions.
result The 'rich-get-richer' characteristic is an inevitable consequence of the model assumptions.

The paper generalizes K-stability results to singular and weighted settings.

problem Generalizing K-stability to singular and weighted settings.
method Generalization of results in \cite{Li22a} to singular and weighted settings.
result The \(\mathbb{G}\)-uniform weighted K-stability for models implies \(\mathbb{G}\)-coercivity of the weighted Mabuchi functional.

Esnault-Viehweg developed the theory of cyclic branched coverings X~X\tilde X\to X of smooth surfaces providing a very explicit formula for the decomposition of H1(X~,C)H^1(\tilde X,\mathbb{C}) in terms of a resolution of the ramification locus. Later, the first author applies this to the particular case of coverings of $\mat…

2019-12-18abs ↗pdf ↗

Image super-resolution (SR) is an underdetermined inverse problem, where a large number of plausible high-resolution images can explain the same downsampled image. Most current single image SR methods use empirical risk minimisation, often with a pixel-wise mean squared error (MSE) loss. However, the outputs from such …

2016-10-14abs ↗pdf ↗

Efficiently solves inverse problems with diffusion and flow models in just a few steps.

problem Solving inverse problems like super-resolution, inpainting, or deblurring using diffusion or flow models.
method Conditional Conjugate Integrators framework that projects inverse problem dynamics into a more amenable space for sampling.
result Generates high-quality samples in as few as 5 conditional sampling steps, outperforming competing methods.

CE improves climate uncertainty quantification using GCM ensembles and observational data.

problem Uncertainty in climate projections due to model inadequacies and variability.
method Conformal ensembles integrating GCM ensembles and observational data.
result CE generates statistically rigorous, easy-to-interpret uncertainty estimates.

The point of the paper is to show some limitations of geometrical optics in the analysis of subwavelength focusing. We analyze the resolution of the image of a line source radiating in the Maxwell fisheye and the Veselago-Pendry slab lens. The former optical medium is deduced from the stereographic projection of a virt…

2009-12-01abs ↗pdf ↗

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.

Background: Three-dimensional, whole heart, balanced steady state free precession (WH-bSSFP) sequences provide delineation of intra-cardiac and vascular anatomy. However, they have long acquisition times. Here, we propose significant speed ups using a deep learning single volume super resolution reconstruction, to reco…

2019-12-22abs ↗pdf ↗