Theory for gravity coupled with fields on manifolds with null-boundary.
problem Formulating a theory for gravity coupled with scalar, SU(n), and spinor fields on manifolds with null-boundary.
method Symplectic reduction of boundary fields and constraints analysis.
result The set of constraints does not form a first class system for the three couplings.
Develops an algorithm for bilevel optimization with coupled constraints.
problem Challenges in bilevel optimization with coupled constraints.
method Primal-dual-assisted penalty approach and a fully first-order algorithm (BLOCC).
result Established rigorous convergence theory and demonstrated effectiveness on real-world applications.
Two algorithms solve nonconvex minimax problems with linear constraints, achieving complexity guarantees.
problem Nonconvex minimax problems with coupled linear constraints.
method Zeroth-order primal-dual alternating projected gradient (ZO-PDAPG) and zeroth-order regularized momentum primal-dual projected gradient (ZO-RMPDPG) algorithms.
result Iteration complexity guarantees for solving nonconvex-(strongly) concave minimax problems with coupled linear constraints.
Paper proposes an algorithm for PARAFAC2-based CMTF models with various constraints.
problem Jointly analyze matrices and tensors with irregular/ragged data.
method Alternating Optimization (AO) and ADMM for fitting PARAFAC2-based CMTF models with various constraints.
result Accurately recovers underlying patterns using various constraints and linear couplings.
New algorithm solves minimax games with linear constraints.
problem Nonconvex minimax games with coupled linear constraints.
method Primal-dual alternating proximal gradient (PDAPG) algorithm.
result Achieves ε-stationary solution within O(ε^(-2)) iterations for strongly concave settings.
Flexible framework for CMTF with ADMM for various constraints and couplings.
problem Challenges in data fusion from multiple sources with varying characteristics.
method Flexible algorithmic framework using AO and ADMM for various constraints, loss functions, and couplings.
result Accurate and computationally efficient results for various loss functions, including KL divergence.
Study risk aggregation with order constraint under unknown dependence.
problem Risk aggregation with an order constraint under uncertainty.
method Introduced DL coupling for concave order risk aggregation, generalized to tail risk measures.
result Analytical formulas for bounds on Value-at-Risk with improved accuracy.
Constructs supermartingale couplings with full marginals constraints.
problem Optimal transport for supermartingale couplings with multiple marginals.
method Markovian iteration of one-period optimal supermartingale couplings.
result Explicit construction of supermartingale processes solving optimal transport problem.
In this paper, we prove that the set of solutions of constraint equations for coupled Einstein and scalar fields in classical general relativity possesses Hilbert manifold structure. We follow the work of R. Bartnik [2] and use weighted Sobolev spaces and Implicit Function Theorem to prove our results.
We develop randomized (block) coordinate descent (CD) methods for linearly constrained convex optimization. Unlike most CD methods, we do not assume the constraints to be separable, but let them be coupled linearly. To our knowledge, ours is the first CD method that allows linear coupling constraints, without making th…
This paper considers distributed online optimization with time-varying coupled inequality constraints. The global objective function is composed of local convex cost and regularization functions and the coupled constraint function is the sum of local convex functions. A distributed online primal-dual dynamic mirror des…
MUSIC learns coupled systems with sparse data and incomplete physics.
problem Learning coupled systems with incomplete physical constraints and missing data.
method Sparsity induced multitask neural network framework integrating partial physical constraints with data-driven learning.
result MUSIC accurately learns solutions to complex coupled systems under data-scarce and noisy conditions.
NSBI approach detects Higgs trilinear coupling with high luminosity upgrade constraints.
problem Determining the Higgs trilinear self-coupling via off-shell Higgs production.
method Hybrid neural simulation-based inference (NSBI) incorporating SMEFT and quantum interference effects.
result NSBI achieves sensitivity close to theoretical optimum for Higgs trilinear self-coupling.
DS2CF-Net learns hierarchical representations with deep coupled factorization and enriched prior.
problem Learning deep hierarchical representations from data.
method Dual-constrained Deep Semi-Supervised Coupled Factorization Network (DS2CF-Net) with enriched prior.
result DS2CF-Net achieves state-of-the-art performance in representation learning and clustering.
Study finds optimal martingale coupling between two distributions with minimal entropy.
problem Finding the optimal martingale coupling between two distributions with minimal relative entropy.
method Solving a dual problem to find the log-density of the optimal coupling, which represents the marginal and martingale constraints.
result The log-density of the optimal coupling is given by a triplet of real functions representing the marginal and martingale constraints.
New algorithm tackles low-rank constraints in optimal transport problems.
problem Optimal transport problems with low-rank constraints.
method Explicit factorization of low-rank couplings as a product of sub-coupling factors linked by a common marginal.
result Stationary convergence of the algorithm proved.
Equations link metrics with tensors, revealing curvature constraints.
problem Understanding curvature properties of geometric structures.
method Formal analogies to Einstein-Maxwell equations, studying Codazzi and conformal Killing equations.
result Constraints on scalar curvature of metrics in solutions.
A new method for optimal transport using neural ODEs that preserves marginal constraints.
problem Optimal transport between two continuous distributions with specific cost functions.
method Iterative construction of neural ODEs to minimize transport cost while preserving marginal constraints.
result Monotonic interior approach that decreases transport cost efficiently.
Study optimal consumption and investment strategies with constraints in a market with random coefficients.
problem Optimal consumption and investment strategies with constraints in a regime switching market with random coefficients.
method Explicit optimal strategies provided via solutions to new BSDE systems.
result Solving new BSDEs to find optimal values and strategies.
New optimal transport divergences derived from scoring functions.
problem Developing new divergences for optimal transport.
method Using scoring functions as cost functions in optimal transport.
result Comonotonic coupling is optimal for many new divergences.
We outline new approaches to incorporate ideas from deep learning into wave-based least-squares imaging. The aim, and main contribution of this work, is the combination of handcrafted constraints with deep convolutional neural networks, as a way to harness their remarkable ease of generating natural images. The mathema…
Study local topological constraints on Berry curvature in spin-orbit coupled Bose-Einstein condensates.
problem Understanding local topological obstructions to flattening Berry curvature in spin-orbit-coupled Bose-Einstein condensates.
method Adapting Pigazzini-Toda lower bound to Kaluza-Klein setting, analyzing harmonic part of torsion 3-form, and using exact pointwise curvature analysis.
result Obstruction kernel vanishes, preventing complete gauging-away of Berry phases even at zero net topological charge.
New ADMM method for PARAFAC2 tensor decomposition with flexible regularization.
problem Challenges in applying regularisation to the evolving mode of PARAFAC2.
method Alternating Direction Method of Multipliers (AO-ADMM) for PARAFAC2 tensor fitting.
result The proposed ADMM-based approach accurately recovers underlying components from simulated data.
New algorithm for low-rank optimal transport with improved interpretability and efficiency.
problem Quadratic scaling of optimal transport coupling matrix for massive datasets.
method Factor Relaxation with Latent Coupling (FRLC) algorithm.
result Superior performance on diverse applications including graph clustering and spatial transcriptomics.
A new method for conditional sampling using paired Wasserstein Autoencoders.
problem Conditional sampling from complex data distributions.
method Derive a novel loss function for Wasserstein Autoencoders to enable sampling from OT-type couplings.
result Learned cost-optimal transport maps and conditional sampling from an OT-type coupling.
Decomposing market impact into diffusive components
problem Market impact scaling
method Decomposing impact into realized and counterfactual returns
result Implication of square-root law in information-neutral regime
Eguchi-Hori-Xiong and S. Katz proposed a conjecture that the partition function of topological sigma model coupled to gravity is annihilated by infinitely many differential operators which form half branch of the Virasoro algebra. In this paper, we give a proof to this conjecture for the genus 0 part.
Nonconvex and nonsmooth optimization problems are frequently encountered in much of statistics, business, science and engineering, but they are not yet widely recognized as a technology in the sense of scalability. A reason for this relatively low degree of popularity is the lack of a well developed system of theory an…
In this paper, we introduce new methods for solving the vacuum Einstein constraints equations: the first one is based on Schaefer's fixed point theorem (known methods use Schauder's fixed point theorem) while the second one uses the concept of half-continuity coupled with the introduction of local supersolutions. These…
Modeling variability in tensor decomposition methods is one of the challenges of source separation. One possible solution to account for variations from one data set to another, jointly analysed, is to resort to the PARAFAC2 model. However, so far imposing constraints on the mode with variability has not been possible.…
Simplifies neural network models by explicitly enforcing constraints in Cartesian coordinates.
problem Learning dynamics of complex systems efficiently and accurately.
method Embedding systems into Cartesian coordinates and using Lagrange multipliers to enforce constraints.
result Explicitly enforcing constraints leads to a 100x improvement in accuracy and data efficiency.
Modeling HFT interactions reveals market instability.
problem Market instability caused by HFT dynamic coupling.
method Developed a recurrence relations framework to model HFT interactions.
result Unexpected latency and feedback can trigger market instability.
New single-loop algorithm tackles weakly convex constraints in stochastic optimization.
problem Optimization with weakly convex constraints in machine learning.
method Single-loop penalty-based stochastic algorithm using hinge-based penalty.
result Achieves state-of-the-art complexity for finding approximate KKT solutions.
Meta-theorems validate fair regression algorithms under demographic parity constraints.
problem Regression under demographic parity constraints.
method Meta-theorems and post-processing methods.
result Fair minimax optimal regression can be achieved through post-processing.
We extend the study of the vacuum Einstein constraint equations on manifolds with ends of cylindrical type initiated by Chruściel and Mazzeo by finding a class of solutions to the fully coupled system on such manifolds. We show that given a Yamabe positive metric g, which is conformally asymptotically cylindrical on ea…
In this paper we analyse semi-linear systems of partial differential equations which are motivated by the conformal formulation of the Einstein constraint equations coupled with realistic physical fields on asymptotically Euclidean (AE) manifolds. In particular, electromagnetic fields give rise to this kind of system. …
Paper solves MV portfolio selection in jump-diffusion models with no-shorting constraint.
problem Mean-variance portfolio selection in jump-diffusion model with no-shorting constraint.
method Reduces problem to LQ control and finding a maximal point of a function, constructs viscosity solution.
result Explicit viscosity solution to Hamilton-Jacobi-Bellman equation, optimal controls derived.
DiffSlack learns neural networks with nonlinear constraints via learnable slack variables.
problem Enforcing nonlinear inequality constraints in neural networks.
method DiffSlack reformulates inequalities as equalities with learnable slack variables, predicting them as part of the network output.
result DiffSlack achieves higher planning success rates and stronger geometric constraint satisfaction compared to existing methods.
Bayesian inference over admissible histories leads to irreversible kinetics.
problem Modeling irreversible processes in systems with uncertain histories.
method A Gibbs-type measure weighted by energy-dissipation action and observation constraints, interpreted as a Bayesian posterior.
result The measure concentrates on maximum-a-posteriori (MAP) histories, recovering classical deterministic evolution.
Recently, consistency-based methods have achieved state-of-the-art results in semi-supervised learning (SSL). These methods always involve two roles, an explicit or implicit teacher model and a student model, and penalize predictions under different perturbations by a consistency constraint. However, the weights of the…
Wilson loops in N=4 supersymmetric Yang-Mills theory correspond at strong coupling to extremal surfaces in AdS5. We study a class of extremal surfaces known as special Legendrian submanifolds. The "hemisphere" corresponding to the circular Wilson loop is an example of a special Legendrian submanifold, and w…
The Group-Lasso is a well-known tool for joint regularization in machine learning methods. While the l_{1,2} and the l_{1,\infty} version have been studied in detail and efficient algorithms exist, there are still open questions regarding other l_{1,p} variants. We characterize conditions for solutions of the l_{1,p} G…
Multi-domain translation seeks to learn a probabilistic coupling between marginal distributions that reflects the correspondence between different domains. We assume that data from different domains are generated from a shared latent representation based on a structural equation model. Under this assumption, we show th…
Single sample estimation for hard-constrained models like SAT and coloring problems.
problem Estimating parameters of Markov Random Fields with hard constraints using a single sample.
method Pseudo-likelihood estimator with coupling techniques.
result Single-sample estimation is not always possible for hard constraints, and existence of an estimator is related to satisfiability.
We study contextual bandits with budget and time constraints, referred to as constrained contextual bandits.The time and budget constraints significantly complicate the exploration and exploitation tradeoff because they introduce complex coupling among contexts over time.Such coupling effects make it difficult to obtai…
This paper considers the problem of minimizing an expectation function over a closed convex set, coupled with a {\color{black} functional or expectation} constraint on either decision variables or problem parameters. We first present a new stochastic approximation (SA) type algorithm, namely the cooperative SA (CSA), t…
Study shows how capital constraints can lead to systemic crises in financial systems.
problem Impact of regulatory capital constraints on fire sales and financial stability.
method Mean field game model with banks adjusting holdings via trading strategies under regulatory constraints.
result Capital constraints can lead to simultaneous defaults in a substantial proportion of the banking system.
Improved flow-based models capture dependencies better with multi-scale autoregressive priors.
problem Limited expressiveness of flow-based models for long-range data dependencies.
method Introducing channel-wise dependencies through multi-scale autoregressive priors (mAR) in split coupling flow layers (mAR-SCF).
result Achieves state-of-the-art density estimation results on MNIST, CIFAR-10, and ImageNet.