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

122245367489 · Jun 202019922001200920172026
48 results for complex Monge-Ampère

Continuity of complex Monge-Ampère potentials on Kähler manifolds.

problem Continuity of solutions to complex Monge-Ampère equations on compact Kähler manifolds.
method Extending DiNezza-Lu's approach to big cohomology classes, proving continuity on Zariski open sets.
result Singular Kähler-Einstein metrics have continuous potentials on the ample locus outside of the non-klt part.

We establish a stability result for elliptic and parabolic complex Monge-Amp{è}re equations on compact K{ä}hler manifolds, which applies in particular to the K{ä}hler-Ricci flow. Dedicated to Jean-Pierre Demailly on the occasion of his 60th birthday.

2018-10-04abs ↗pdf ↗

We develop a parabolic pluripotential theory on compact K{ä}hler manifolds, defining and studying weak solutions to degenerate parabolic complex Monge-Amp{è}re equations. We provide a parabolic analogue of the celebrated Bedford-Taylor theory and apply it to the study of the K{ä}hler-Ricci flow on varieties with log te…

2018-10-04abs ↗pdf ↗

We obtain a necessary and sufficient condition of existence of a K{ä}hler-Einstein metric on a G×GG\times G-equivariant Fano compactification of a complex connected reductive group GG in terms of the associated polytope. This condition is not equivalent to the vanishing of the Futaki invariant. The proof relies on the …

2015-10-26abs ↗pdf ↗

N. V. Efimov \cite{Ef1} proved that there is no complete, smooth surface in R3\R^3 with uniformly negative curvature. We extend this to isometric immersions in a 3-manifold with pinched curvature: if M3M^3 has sectional curvature between two constants K2K_2 and K3K_3, then there exists K1<min(K2,0)K_1 < \min(K_2, 0) such that $M…

1999-12-13abs ↗pdf ↗

We propose a numerical method for solving high dimensional fully nonlinear partial differential equations (PDEs). Our algorithm estimates simultaneously by backward time induction the solution and its gradient by multi-layer neural networks, while the Hessian is approximated by automatic differentiation of the gradient…

2019-07-31abs ↗pdf ↗

We come up with infinite-dimensional prequantum line bundles and moment map interpretations of three different sets of equations - the generalised Monge-Amp`ere equation, the almost Hitchin system, and the Calabi-Yang-Mills equations. These are all perturbations of already existing equations. Our construction for the g…

2017-02-03abs ↗pdf ↗

The paper studies mean curvature flow of Lagrangian graphs in pseudo-Euclidean space.

problem Mean curvature flow of Lagrangian graphs in pseudo-Euclidean space.
method Analyzes the parabolic equation and Monge-Ampère type equation, proving smooth solutions and convergence to self-expanding solutions.
result Smooth solutions u(x,t)u(x,t) for specific nonlinear equations and convergence to self-expanding solutions.

In this paper, we investigate two hyperbolic flows obtained by adding forcing terms in direction of the position vector to the hyperbolic mean curvature flows in \cite{klw,hdl}. For the first hyperbolic flow, as in \cite{klw}, by using support function, we reduce it to a hyperbolic Monge-Ampeˋ\grave{\rm{e}}re equation …

2012-03-12abs ↗pdf ↗

It is natural to ask: what kinds of matrices satisfy the Restricted Eigenvalue (RE) condition? In this paper, we associate the RE condition (Bickel-Ritov-Tsybakov 09) with the complexity of a subset of the sphere in Rp\R^p, where pp is the dimensionality of the data, and show that a class of random matrices with indep…

2009-12-21abs ↗pdf ↗

Given a complex analytic function f on a Whitney stratified complex analytic variety of complex dimension n, whose real part Re(f) is Morse, we prove the existence of a stratified gradient-like vector field for Re(f) such that the unstable set of a critical point p on a stratum S of complex dimension s has real dimensi…

2009-08-13abs ↗pdf ↗

Study on colored Jones polynomial of figure-eight knot for complex parameters.

problem Asymptotic behavior of colored Jones polynomial for figure-eight knot.
method Analyzing the asymptotic growth rate of the polynomial for complex parameters with small imaginary part.
result Growth rate of polynomial is related to the Chern-Simons invariant for large real part of the parameter and to the reciprocal of Alexander polynomial for small real part.

Study reduces complexity and uncertainty in human atrial cell models.

problem Uncertainty in parameter estimates from gating kinetics models.
method Approximate Bayesian computation to re-calibrate models, investigate two approaches: more complete datasets and less complex formulations.
result Less complex model with fewer parameters gives better fit and lower uncertainty.

The paper studies a special Grassmannian space and shows it's an orbit of a unitary group.

problem Investigating a specific Grassmannian space of infinite-dimensional subspaces.
method Analyzing the restricted pp-Schatten class Grassmannian and showing it's an affine coadjoint orbit of a unitary group.
result The restricted pp-Schatten class Grassmannian is shown to be an affine coadjoint orbit of an infinite-dimensional restricted unitary group.

Beta-SOD detects and corrects noisy object re-identification using cosine similarity and Beta mixtures.

problem Noisy object re-identification in image datasets.
method Reframed Re-ID as a similarity task, using Siamese networks and Beta mixture models.
result Superior performance in noisy conditions compared to state-of-the-art methods.

We compare the isoperimetric profiles of $S^2 \times \re^3$ and of $S^3 \times \re^2$ with that of a round 5-sphere (of appropriate radius). Then we use this comparison to obtain lower bounds for the Yamabe constants of $S^2 \times \re^3$ and $S^3 \times \re^2$. Explicitly we show that $Y(S^3 \times \re^2, [g_0^3 +dx^2…

2012-02-06abs ↗pdf ↗

We prove that the three-sphere recognition problem lies in the complexity class NP. Our work relies on Thompson's original proof that the problem is decidable [Math. Res. Let., 1994], Casson's version of her algorithm, and recent results of Agol, Hass, and Thurston [ArXiv, 2002].

2004-07-05abs ↗pdf ↗

Re-initializing neural networks improves generalization but not as much as other techniques.

problem Understanding when and how re-initialization improves neural network performance.
method Empirical comparison of re-initialization with standard training and various regularization techniques.
result Re-initialization is beneficial for generalization but not as much as other techniques, especially when combined with careful tuning of hyperparameters.

A deep reinforcement learning approach for slate re-ranking in e-commerce.

problem Improving user satisfaction in e-commerce by optimizing the ranking of items in a slate.
method Generator and Critic approach, using reinforcement learning and a Full Slate Critic model.
result The Generator and Critic approach significantly outperforms existing methods in slate evaluation and efficiency.

Model predicts wound and episode-level readmission risk and time to re-admit.

problem Identify patients at high risk of re-admission to prevent wound recurrences and reduce healthcare costs.
method Data-driven analysis of wound care and episode-level patient data.
result Model achieves high recall and precision for predicting re-admission risk and time.

Person Re-identification (re-id) faces two major challenges: the lack of cross-view paired training data and learning discriminative identity-sensitive and view-invariant features in the presence of large pose variations. In this work, we address both problems by proposing a novel deep person image generation model for…

2017-12-06abs ↗pdf ↗

New GoF test improves change point detection in multivariate time series.

problem Detecting changes in multivariate time series data efficiently and robustly.
method Developed a novel multivariate rank-energy GoF test (sRE) for change point detection.
result sRE-based CPD outperforms existing methods in AUC and F1-score.

New research challenges the flatness-generalization link in deep neural networks.

problem The correlation between flatness of the loss landscape and generalization in deep neural networks is questioned.
method The study examines various flatness measures and popular SGD variants, finding some break the flatness-generalization link. It proposes using logP(f)\log P(f), a global quantity, as a predictor of generalization.
result The log of Bayesian prior upon initialization, logP(f)\log P(f), is a significantly more robust predictor of generalization than flatness measures.

Paper proves Reshetikhin-Turaev link invariants appear in higher order terms of re-normalized link invariants for plumbed links.

problem Proving relations between Reshetikhin-Turaev and re-normalized link invariants for links.
method Analyzing higher order terms of re-normalized link invariants for plumbed links.
result Reshetikhin-Turaev link invariants appear in higher order terms of re-normalized link invariants for plumbed links.

Develops RES metrics for stable rare-event forecasting evaluation.

problem Challenges in evaluating forecasts of rare events.
method Rare-event-stable (RES) metrics designed to maintain stable thresholds under extreme rarity.
result RES metrics maintain stable thresholds, consistent model rankings, and near-complete prevalence invariance.

The paper analyzes how re-weighting helps in reducing variance in high-dimensional kernel methods under covariate shifts.

problem The challenge of high-dimensional kernel methods under covariate shifts and the role of re-weighting.
method Derives asymptotic expansion of high-dimensional kernels under covariate shifts, analyzes bias-variance decomposition, and characterizes the regularized kernel.
result Re-weighting helps in decreasing variance and can be seen as a data-dependent regularization.

By the Fox's re-embedding theorem, any compact submanifold of the 3-sphere can be re-embedded in the 3-sphere so that it is unknotted. It is unknown whether the Fox's re-embedding can be replaced with twistings. In this paper, we will show that any closed 2-manifold embedded in the 3-sphere can be unknotted by twisting…

2016-09-21abs ↗pdf ↗

Examines climate financing for renewable energy projects using structured funds.

problem Valuation of structured climate financing on diverse renewable energy asset pools.
method Bottom-up Gaussian copula framework with LH++ model for diversification analysis.
result Shows how the mix of indirect and direct RE investments affects the sensitivity of the senior tranche.

RE enhances DL by learning model behavior, enabling iterative self-improvement.

problem Static data representations limit DL's potential for evolving models.
method RE uses multiple mappings of data through identical deep architectures, analyzing internal representations and performance signals.
result Models can gain insight from predecessors, leading to iterative self-improvement.

New theory shows perishable goods markets are more stable and efficient.

problem Lower stability and efficiency of markets for re-tradable assets compared to perishable goods.
method Reformulation of no-trade and no-arbitrage theorems in neoclassical finance.
result Perishable goods markets exhibit higher stability and efficiency.

We are interested in attribute-guided face generation: given a low-res face input image, an attribute vector that can be extracted from a high-res image (attribute image), our new method generates a high-res face image for the low-res input that satisfies the given attributes. To address this problem, we condition the …

2017-05-28abs ↗pdf ↗

New algorithm tackles dynamic assortment optimization with knapsack constraints.

problem Optimizing retailer's assortment decisions under resource constraints with multi-nomial choice modeling.
method Epoch-based re-solving algorithm that transforms MNL's fractional structure into a linear program with slack variables.
result Regret scales logarithmically with time horizon and resource capacities.