We compare various notions of weak subsolutions to degenerate complex Monge-Amp{è}re flows, showing that they all coincide. This allows us to show that the viscosity solution coincides with the envelope of pluripotential subsolutions. Dedicated to Duong Hong Phong on the occasion of his 65th birthday.
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
48 results for “Monge-Ampère capacities”
The paper constructs invariant Calabi-Yau structures on complexified symmetric spaces.
problem Constructing invariant Calabi-Yau structures on complexified symmetric spaces.
method Solutions of a Monge-Ampère type equation.
result Existence of solutions to the Monge-Ampère type equation.
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.
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…
Study solves complex equation on specific types of manifolds.
problem Solving complex Monge-Ampère equation on Kähler manifolds.
method Flow-based arguments to establish existence of smooth solutions.
result Existence of smooth solutions under decreasing right-hand side.
We obtain a necessary and sufficient condition of existence of a K{ä}hler-Einstein metric on a -equivariant Fano compactification of a complex connected reductive group in terms of the associated polytope. This condition is not equivalent to the vanishing of the Futaki invariant. The proof relies on the …
We develop the first steps of a parabolic pluripotential theory in bounded strongly pseudo-convex domains of Cn. We study certain degenerate parabolic complex Monge-Amp{è}re equations, modelled on the K{ä}hler-Ricci flow evolving on complex algebraic varieties with Kawamata log-terminal singularities. Under natural ass…
N. V. Efimov \cite{Ef1} proved that there is no complete, smooth surface in with uniformly negative curvature. We extend this to isometric immersions in a 3-manifold with pinched curvature: if has sectional curvature between two constants and , then there exists such that $M…
Study complex Monge-Ampère flows on Kähler manifolds using Perron method.
problem Complex Monge-Ampère flows in big cohomology classes.
method Perron method for pluripotential subsolutions.
result Upper envelope of subsolutions is a unique pluripotential solution with regularity.
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…
K{ä}hler geometry of horosymmetric varieties, and application to Mabuchi's K-energy functionalmath.DG
We introduce a class of almost homogeneous varieties contained in the class of spherical varieties and containing horospherical varieties as well as complete symmetric varieties. We develop K{ä}hler geometry on these varieties, with applications to canonical metrics in mind, as a generalization of the Guillemin-Abreu-D…
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…
Feed in tariff (FiT) is one of the most efficient ways that many governments throughout the world use to stimulate investment in renewable energies (REs) technology. For governments, financial management of the policy is very challenging as that it needs a considerable amount of budget to support RE producers during th…
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 for specific nonlinear equations and convergence to self-expanding solutions.
The grid integration of intermittent Renewable Energy Sources (RES) causes costs for grid operators due to forecast uncertainty and the resulting production schedule mismatches. These so-called profile service costs are marginal cost components and can be understood as an insurance fee against RES production schedule u…
gLSTM improves graph neural networks by increasing storage capacity to prevent over-squashing.
problem Over-squashing in GNNs collapses information from a large receptive field into a single vector, creating an information bottleneck.
method Introduced a new synthetic task to measure over-squashing and adapted ideas from sequence modeling to develop gLSTM, a novel GNN architecture with improved capacity.
result gLSTM architecture demonstrates strong performance on synthetic and real-world graph benchmarks, mitigating over-squashing.
Solves complex Monge-Ampère equations on Kähler manifolds.
problem Behavior of singularities in solutions to degenerate equations.
method Analyzes singularities of solutions to degenerate complex Monge-Ampère equations.
result Resolves unresolved problem from Yau's work.
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.
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-Ampre equation …
The brain optimizes memory by forgetting what's predictable, improving generalization.
problem Memory consolidation struggles with representational drift, semanticisation, and offline replay.
method Proposes predictive forgetting as a mechanism to optimize generalization by reducing complexity.
result Predictive forgetting improves information-theoretic generalization bounds on stored representations.
Holographic Invariant Storage: Design-Time Safety Contracts via Vector Symbolic Architecturesstat.ML
Holographic Invariant Storage uses vector architectures to ensure LLM safety at design time.
problem Mitigating context drift in large language models (LLMs) during deployment.
method Introduces Holographic Invariant Storage (HIS) protocol that combines known properties of bipolar Vector Symbolic Architectures into a design-time safety contract.
result Closed-form guarantees for single-signal recovery fidelity, continuous-noise robustness, and multi-signal capacity degradation are provided and validated.
A new memory system handles non-stationary environments by self-sizing and retaining memories.
problem Non-stationary environments where memories arrive over time and must be distinguished from noise.
method A self-sizing continual associative memory that generalizes Hopfield's network, handling adaptation and novelty.
result The memory system grows to the intrinsic memory demand of the environment and retains memories without forgetting.
Softmax is an output activation function for modeling categorical probability distributions in many applications of deep learning. However, a recent study revealed that softmax can be a bottleneck of representational capacity of neural networks in language modeling (the softmax bottleneck). In this paper, we propose an…
Recent progress in deep convolutional neural networks (CNNs) have enabled a simple paradigm of architecture design: larger models typically achieve better accuracy. Due to this, in modern CNN architectures, it becomes more important to design models that generalize well under certain resource constraints, e.g. the numb…
This paper addresses detection of a reverse engineering (RE) attack targeting a deep neural network (DNN) image classifier; by querying, RE's aim is to discover the classifier's decision rule. RE can enable test-time evasion attacks, which require knowledge of the classifier. Recently, we proposed a quite effective app…
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…
We study various capacities on compact Kähler manifolds which generalize the Bedford-Taylor Monge-Ampère capacity. We then use these capacities to study the existence and the regularity of solutions of complex Monge-Ampère equations.
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.
Solves a discrete logarithmic Minkowski problem for electrostatic p-capacity.
problem Characterize measures generated by electrostatic p-capacity.
method Solves the discrete logarithmic Minkowski problem for 1 < p < n.
result Solves the discrete logarithmic Minkowski problem for measures in general position.
CapOptix uses options theory to price capacity in electricity markets.
problem Traditional capacity market designs fail to account for risk and price shocks.
method Interprets capacity commitments as reliability options and uses Markov Regime Switching Process.
result CapOptix provides more accurate pricing of capacity premia compared to existing mechanisms.
In this article, we propose the notion of the general -affine capacity and prove some basic properties for the general -affine capacity, such as affine invariance and monotonicity. The newly proposed general -affine capacity is compared with several classical geometric quantities, e.g., the volume, the -var…
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.
While symplectic manifolds have no local invariants, they do admit many global numerical invariants. Prominent among them are the so-called symplectic capacities. Different capacities are defined in different ways, and so relations between capacities often lead to surprising relations between different aspects of sympl…
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…
Study excess capacity in neural networks using Rademacher complexity.
problem Understanding how much capacity deep networks have beyond what's needed for classification.
method Unified Rademacher complexity bounds for function composition and convolutional layers, considering Lipschitz constants and initialization norms.
result There is substantial excess capacity per task, and capacity can be kept similar across different tasks.
Study rigidity by logarithmic capacity and related functions.
problem Rigidity phenomena in kernel functions and capacities.
method Exploration of Bergman kernel, logarithmic capacity, Green's function, and Euclidean distance/volume.
result Established rigidity theorems by logarithmic capacity.
Study binary perceptrons' capacity using random duality theory.
problem Characterize the capacity of binary perceptrons with general thresholds.
method Utilized fully lifted random duality theory (fl RDT) to characterize the capacity.
result Characterizations match replica symmetry breaking predictions and uncover the capacity for zero-threshold scenario.
Analyzes COVID-19 data to predict mortality, forecast spread, and optimize resource allocation.
problem Challenges in patient triage, treatment, and care management during the pandemic.
method Integrated four-step approach combining descriptive, predictive, and prescriptive analytics.
result Optimized resource allocation and informed policy decisions.
Study capacity constraints in continual learning with a simple model.
problem Understanding optimal resource allocation for agents with limited memory and compute resources.
method Analyzes a capacity-constrained linear-quadratic-Gaussian (LQG) sequential prediction problem and demonstrates optimal capacity allocation strategies.
result Derives a solution to the capacity-constrained LQG sequential prediction problem and shows how to optimally allocate capacity across sub-problems in the steady state.
Enhances speech emotion recognition by adapting to varying time scales.
problem Robust emotion recognition from speech audio with temporal variations.
method Introduces multi-time-scale (MTS) convolutional layers to CNNs.
result MTS layers improve generalization, especially on smaller datasets.
New complete panel dataset for LMICs helps analyze innovation and development.
problem Lack of complete data for empirical analyses in LMICs.
method Predictive Mean Matching multiple imputation technique.
result Created a large dataset of 47 variables for 82 LMICs from 2005-2019.
Upper bounds for Lagrangian capacities of Liouville domains
problem Lagrangian capacity of Liouville domains
method Using -equivariant techniques
result Extremal Lagrangian torus on the boundary of ellipsoid
Memory capacity of DAM scales exponentially with feature separation, unaffected by correlations.
problem Understanding how feature correlations impact DAM's capacity.
method Developed an empirical framework to analyze DAM's capacity under varying feature correlations and pattern separations.
result Memory capacity scales exponentially with feature separation, unaffected by correlations.
We implement a method for re-ranking top-10 results of a state-of-the-art question answering (QA) system. The goal of our re-ranking approach is to improve the answer selection given the user question and the top-10 candidates. We focus on improving deployed QA systems that do not allow re-training or re-training comes…
Proves local maximizers for higher Ekeland-Hofer capacities in 4D star-shaped domains.
problem Finding local maximizers for higher Ekeland-Hofer capacities in specific domains.
method Analogous to 4D local Viterbo conjecture, proving maximizers for rational ellipsoids.
result Local maximizers of the k-th Ekeland-Hofer capacities are symplectomorphic to rational ellipsoids.
Develops a theory for mth order p-affine capacity for convex bodies containing the origin.
problem Defines and studies the mth order p-affine capacity for convex bodies containing the origin.
method Provides equivalent definitions, proves properties, and establishes inequalities.
result Establishes inequalities comparing to other geometric measures.