Stokes' theorem's boundary maximizes entropy.
problem Characterizing the boundary of a manifold using entropy.
method Maximizing entropy for codimension-1 submanifolds satisfying Stokes' theorem.
result The boundary of a manifold maximizes the entropy functional.
We explore a new method for discrete-time control problems using randomization and entropy.
problem Discrete-time linear-exponential quadratic Gaussian (LEQG) control problem.
method Introduce exploration through randomization and apply duality between free energy and relative entropy.
result Reduced LEQG problem to equivalent risk-neutral LQG control problem with entropy regularization.
Develops a new duality between entropy martingale optimal transport and nonlinear pricing-hedging.
problem Entropy Martingale Optimal Transport problem and its associated optimization problem.
method Combines Entropy Optimal Transport and Martingale Optimal Transport theories, with novel penalization terms and constraints.
result Establishes a nonlinear robust pricing-hedging duality, covering various known robust results.
Solves risk-sensitive investment via duality, entropic regularization, and RL.
problem Risk-sensitive portfolio management in a factor-based setting.
method Free energy-entropy duality, Kuroda-Nagai change-of-measure, RL algorithm.
result Direct analytical solution, explicit controls, two interpretations of optimal allocation.
Characterizes sample complexity for outcome indistinguishability in machine learning.
problem Outcome indistinguishability in machine learning, focusing on distinguishers and predictors.
method Sample complexity characterized by metric entropy of predictor and distinguisher classes, using dual Minkowski norms.
result Equivalence and tightness of sample complexity characterizations in distribution-specific and distribution-free settings.
Reinforcement learning for continuous-time risk-sensitive asset allocation
problem Continuous-time risk-sensitive asset allocation
method Free energy-entropy duality reformulation and q-learning actor-critic method result Optimal policy learning with high accuracy
On the predual of a von Neumann algebra, we define a differentiable manifold structure and affine connections by embeddings into non-commutative L_p-spaces. Using the geometry of uniformly convex Banach spaces and duality of the L_p and L_q spaces for 1/p+1/q=1, we show that we can introduce the α-divergence, for αin (…
The paper shows how policy regularization acts like an adversary to improve robustness.
problem Improving robustness of learned policies in reinforcement learning.
method Using convex duality, the paper characterizes adversarial reward perturbations and provides generalization guarantees.
result Policy regularization acts as an adversary to improve robustness against worst-case reward perturbations.
DGKIP extends KIP for dataset distillation without bi-level optimization.
problem Efficiently distill datasets for various loss functions.
method Leverages duality theory to avoid bi-level optimization.
result DGKIP supports a wider range of loss functions.
We adapt tools from information theory to analyze how an observer comes to synchronize with the hidden states of a finitary, stationary stochastic process. We show that synchronization is determined by both the process's internal organization and by an observer's model of it. We analyze these components using the conve…
The paper presents a method to estimate joint interventional distributions from marginal interventional data.
problem Estimating joint interventional distributions from marginal interventional data.
method The paper extends the Causal Maximum Entropy method to use interventional data and employs Lagrange duality to prove the solution lies in the exponential family.
result The method allows for causal feature selection and inference of joint interventional distributions.
Symplectic homology matches dual capacities for convex domains.
problem Understanding symplectic capacities and Reeb flows on convex domains.
method Isomorphic filtered symplectic homology to dual singular homology.
result Gutt-Hutchings capacities match spectral invariants for convex domains.
Paper introduces a new method for risk-sensitive investment management using RL.
problem Risk-sensitive portfolio management with unknown model parameters.
method Combines RL and risk-sensitive stochastic control with Gaussian perturbations for exploration.
result Endogenous relative-entropy regularization and optimal investment strategy derived.
The paper studies scaling limits of hedging prices in financial models.
problem Scaling limits of exponential utility indifference prices in financial models.
method Formulated dual problem as stochastic control, solved HJB equation for upper bound, used duality result for lower bound.
result Represented scaling limit in terms of specific relative entropy and constructed asymptotic optimal hedging strategies.
Incorporating feature selection into a classification or regression method often carries a number of advantages. In this paper we formalize feature selection specifically from a discriminative perspective of improving classification/regression accuracy. The feature selection method is developed as an extension to the r…
Survey of linking information geometry and optimal transport.
problem Connecting two geometric frameworks for probability measures.
method Exploration of interactions and links between information geometry and optimal transport.
result Outstanding questions for both disciplines.
Study spherical convex bodies using Lp-floating areas and curvature entropy.
problem Analogous isoperimetric inequalities for spherical convex bodies.
method Introduced Lp-floating areas and curvature entropy for spherical convex bodies. result Established isoperimetric inequalities and dual isoperimetric inequalities.
ANTIDOTE reduces noisy labels influence during learning.
problem Learning with noisy labels.
method Information-divergence neighborhood relaxation and adversarial training.
result ANTIDOTE outperforms standard cross-entropy loss in noisy label settings.
New method finds rare dense clusters in asymmetric binary perceptrons, resolving algorithmic hardness.
problem Resolving algorithmic hardness in asymmetric binary perceptrons.
method Fully lifted random duality theory (fl RDT) and large deviation upgrade (sfl LD RDT).
result Local entropy breaks down for constraint densities in (0.77, 0.78) interval, matching current solver limits.
In this paper we propose a unified framework for structured prediction with latent variables which includes hidden conditional random fields and latent structured support vector machines as special cases. We describe a local entropy approximation for this general formulation using duality, and derive an efficient messa…
A one-to-one correspondence is drawn between law invariant risk measures and divergences, which we define as functionals of pairs of probability measures on arbitrary standard Borel spaces satisfying a few natural properties. Divergences include many classical information divergence measures, such as relative entropy a…
Unified approach for robust and heavy-tailed mean estimation in high dimensions.
problem Estimating mean in high dimensions with adversarial corruption or heavy-tailed distributions.
method Unified meta-problem and duality theorem leading to Filter algorithm and QUE scheme.
result Unified and efficient algorithms for both robust and heavy-tailed mean estimation.
Building upon recent advances in entropy-regularized optimal transport, and upon Fenchel duality between measures and continuous functions , we propose a generalization of the logistic loss that incorporates a metric or cost between classes. Unlike previous attempts to use optimal transport distances for learning, our …
Regularized policies are robust to adversarial rewards.
problem Understanding the effects of regularization on policy exploration and robustness.
method Using Fenchel duality to derive the dual problem of the regularized RL objective, showing the optimal policy is robust to adversarial rewards.
result Regularized policies are optimal for a reinforcement learning problem under adversarial reward conditions.
The paper introduces a new framework to understand and optimize deep neural networks.
problem Understanding and optimizing the trainability and generalization of deep neural networks.
method Developed a conjugate learning theoretical framework based on convex conjugate duality.
result Demonstrated that training deep neural networks with SGD achieves global optima of empirical risk.
This memoir presents a systematic study of the utility maximization problem of an investor in a constrained and unbounded financial market. Building upon the work of Hu et al. (2005) [Ann. Appl. Probab., 15, 1691--1712] in a bounded framework, we extend our analysis to the more challenging unbounded case. Our methodolo…
Unified geometric flows improve deep learning efficiency and simplify neural network topologies.
problem Improving deep learning performance and simplifying neural network structures.
method Proposes a thermodynamically coupled Ricci flow that dynamically adapts parameter space geometry to loss landscape topology, enabling automated singularity resolution and providing entanglement entropy bounds.
result Demonstrates 2.1× convergence acceleration and 63% topological simplification while maintaining O(NlogN) complexity, outperforming Riemannian baselines by 15.2% in few-shot accuracy. Study potential computational gaps in symmetric binary perceptrons using fl-RDT.
problem Potential statistical-computational gaps in symmetric binary perceptrons.
method Parametric utilization of fully lifted random duality theory (fl-RDT).
result Observation of a computational gap SCG=αc−αa in SBP. Black holes offer insights into machine learning's loss landscapes.
problem Understanding the loss landscape in machine learning.
method Comparing machine learning loss landscapes to black hole entropy.
result Black holes provide an infinite family of potential landscapes with known minima.
Proves Poincaré duality for Hopf algebroids with bijective antipode.
problem Proving Poincaré duality for Hopf algebroids.
method Using twisted Poincaré duality and bijective antipode properties.
result Recovering and extending known Poincaré dualities for Hopf algebroids.
Regularizing the optimal transport (OT) problem has proven crucial for OT theory to impact the field of machine learning. For instance, it is known that regularizing OT problems with entropy leads to faster computations and better differentiation using the Sinkhorn algorithm, as well as better sample complexity bounds …
New proof of chain duality for simplicial complexes.
problem Proving the existence of chain duality for chain complexes over simplicial complexes.
method Geometric and conceptual treatment of chain duality.
result Fundamental for Ranicki's surgery exact sequence.
Introduces Kähler duality between domains in complex space.
problem None explicitly stated; focuses on concept introduction.
method None explicitly stated; focuses on concept introduction.
result Introduces Kähler duality between domains in complex space.
Research on dualities in geometric stereotypes.
problem Understanding dualities in geometric stereotypes.
method Continuation of previous research on stereotype spaces and algebras.
result New insights into geometric stereotype dualities.
Duality restored in gauge theory, gravity, and string theory models.
problem Restoring duality invariance in theories coupled to matter.
method Extending phase space to allow for violations of the algebraic Bianchi identity and considering the axion as the duality current.
result Duality current in NS-NS gravity is the divergence of the axion.
Unified proof of four Bavard dualities and new results on quasimorphisms.
problem Comparing stable commutator length and quasimorphisms on groups.
method Expository account and new strengthening of Bavard duality, providing complete proofs.
result Generalized mixed Bavard duality, recovering all previous dualities.
Study timelike Ricci curvature bounds via optimal transport with Orlicz-type costs.
problem Characterize timelike Ricci curvature bounds.
method Optimal transport with Orlicz-type costs, convexity of relative entropy.
result Characterize timelike Ricci curvature lower bounds via convexity of relative entropy.
Verma Howe duality connects tensor products of Verma modules to LKB representations.
problem Understanding the relationship between tensor products of Verma modules and LKB representations.
method Established a quantized version of Verma Howe duality and used it to prove the simplicity of LKB representations.
result LKB representations arise from the quantized Verma Howe duality and are shown to be simple modules.
Cohomological and homological spectral sequences are shown to be isomorphic.
problem Cohomological and homological Atiyah-Hirzebruch spectral sequences are not always isomorphic.
method Spanier-Whitehead duality is used to establish an isomorphism between the two spectral sequences.
result Cohomological and homological Atiyah-Hirzebruch spectral sequences are isomorphic for finite spectra.
The paper proves T-duality and Hori formulae for winding loop spaces.
problem Realizing T-duality and Hori formulae for loop spaces.
method Proving T-duality and Hori formulae for winding q-loop spaces.
result T-duality and Hori formulae for winding q-loop spaces are proven.
Develops optimal transport in Lorentzian spaces with synthetic curvature bounds.
problem Synthetic curvature bounds for Lorentzian spaces.
method Optimal transport, convexity analysis of entropy functionals.
result Synthetic notion of timelike Ricci curvature lower bounds.
Equivariant T-duality connects bundles with twists.
problem Establishing a relationship between bundles with twists.
method Formulating T-duality in equivariant K-theory for compact Lie group actions.
result T-duality is an isomorphism in equivariant K-theory for compact Lie group actions.
We give the definition of a duality that is applicable to arbitrary k-forms. The operator that defines the duality depends on a fixed form Ω. Our definition extends in a very natural way the Hodge duality of n-forms in 2n dimensional spaces and the generalized duality of two-forms. We discuss the properties of …
A new framework for averaging spatio-temporal signals using optimal transport and soft alignments.
problem Averaging complex datasets with time and spatial components.
method Inspired by DTW, OT, and UOT, a new loss function is proposed to address shifts in time, space, and population size.
result The proposed loss function can be used to compute spatio-temporal barycenters efficiently.
The paper establishes T-duality for 2D σ-models with H-flux.
problem T-duality for 2D σ-models with H-flux.
method Localization and graded T-duality map (graded Hori morphism).
result Establishes the most general version of T-duality for Type II String Theory.
QP perspective on Poisson-Lie T-duality topology changes.
problem Understanding Poisson-Lie T-duality through QP manifolds.
method QP manifolds and canonical transformations for symplectic reductions.
result Canonical transformations mediate Poisson-Lie T-duality.
Unified framework for T-duality in both trivial and non-trivial topologies.
problem Unified description of T-duality for metrics and B-fields in non-trivial topology.
method Developed a new unifying framework for T-duality.
result Unified description of T-duality for metrics and B-fields in non-trivial topology.
Geometric duality connects graph isomorphism and knot equivalence.
problem Understanding the equivalence of graph isomorphism and knot equivalence.
method Observation of geometric duality in planar graphs and links.
result The equivalence relation defined by isomorphisms of checkerboard graphs is the same as 2-isomorphisms of checkerboard graphs.