Improved Bayesian learning rule handles positive-definite constraints efficiently.
problem Bayesian learning rule struggles with positive-definite constraints.
method Proposes an improved rule using Riemannian gradient methods for block-coordinate natural parameterization.
result Outperforms existing methods without increased computation.
Sharp dimension constraints for positive intermediate curvature metrics are established.
problem Proving sharp dimension constraints for metrics with positive intermediate curvature.
method Constructing counterexamples and extending rigidity results.
result Sharp dimension constraints for positive intermediate curvature metrics are established.
The paper tackles sparse graph learning under Laplacian-related constraints, improving upon existing methods.
problem Learning a sparse undirected graph from multivariate data under Laplacian-related constraints.
method Modifications to penalized log-likelihood approaches to enforce total positivity and lasso/adaptive lasso penalties using ADMM.
result The proposed constrained adaptive lasso approach significantly outperforms existing Laplacian-based approaches.
Paper finds optimal selling rule for pairs trading with stock constraints.
problem Identifying the best time to sell in pairs trading of stocks.
method Optimal pairs-trading selling rule with constraints on trading.
result Closed-form solution for optimal policy determined by a threshold curve.
New model fits term structures with positivity constraints.
problem Calibrating term structure models to market curves with positivity constraints.
method Time-changed approach to fit term structures.
result Model generates larger volatility and covariance effects under positivity constraints.
New algorithms control loss and constraints in uncertain, changing environments.
problem Adapting to adversarial constraints in uncertain, changing environments.
method Developed algorithms for constrained MAB problems with optimal rates of regret and positive constraint violation.
result Achieved optimal rates of regret and positive constraint violation under varying degrees of adversariality.
Minimal splitting factors help study scalar curvature constraints.
problem Scalar curvature constraints in geometry.
method Introducing minimal splitting factors with positive scalar curvature.
result Minimal splitting factors have properties similar to area minimizing hypersurfaces.
We derive the Riemannian Positive Mass theorem in arbitrary dimensions, without any topological constraints. The main new tools are skin structures and surgeries on minimal hypersurfaces.
In E-commerce advertising, where product recommendations and product ads are presented to users simultaneously, the traditional setting is to display ads at fixed positions. However, under such a setting, the advertising system loses the flexibility to control the number and positions of ads, resulting in sub-optimal p…
We derive the Space-Time Positive Mass theorem in arbitrary dimensions, without topological constraints. The main new tools are skin structures and surgeries on minimal and marginally outer trapped hypersurfaces.
In a discrete-time market, we study model-independent superhedging, while the semi-static superhedging portfolio consists of {\it three} parts: static positions in liquidly traded vanilla calls, static positions in other tradable, yet possibly less liquid, exotic options, and a dynamic trading strategy in risky assets …
New mass inequalities and proofs for causal variational principles.
problem Proving new mass inequalities for causal variational principles.
method Proved a new inequality for minimizers of causal variational principles and applied it to prove the positive mass theorem.
result Introduced a positive quasilocal mass and proved new mass inequalities.
The paper proves positive energy-momentum theorems for charged AdS initial data sets.
problem Proving positive energy-momentum theorems for charged asymptotically AdS initial data sets.
method Introducing a charged energy-momentum functional and establishing positive theorems under a dominant energy condition.
result The charged energy-momentum functional is non-negative on a natural real cone.
Recurrent Neural Networks (RNNS) are now widely used on sequence generation tasks due to their ability to learn long-range dependencies and to generate sequences of arbitrary length. However, their left-to-right generation procedure only allows a limited control from a potential user which makes them unsuitable for int…
In this paper, we prove a far-from-CMC result similar to the ones obtained by Holst, Nagy, Tsogtgerel and Maxwell for the conformal Einstein-scalar field constraint equations on compact Riemannian manifolds with positive (modified) Yamabe invariant.
Study examines how EU's Value at Risk constraints affect insurance oligopolies.
problem Impact of EU's Value at Risk constraints on insurance oligopolies.
method Bertrand model with profit-maximizing companies facing Value at Risk constraints.
result Value at Risk constraints can lead to monopolistic premiums or market failure.
Survey of Gaussian process constraints for modeling expensive data.
problem Modeling expensive data with physical constraints.
method Overview of various Gaussian process constraints and their implementation.
result Discussion of computational challenges introduced by constraints.
Optimizes hedge ratio for delta-neutral liquidity positions in AMMs.
problem Balancing price exposure and liquidation risk in borrowing-funded delta-neutral positions.
method Model token prices as correlated geometric Brownian motions, derive optimal hedge ratio maximizing risk-adjusted return subject to liquidation probability constraint.
result Optimal hedge ratio h** = min(h*, h_bar(alpha)) lies between 50% and 70% for typical DeFi lending conditions.
Paper improves channel charting using autoencoders with spatial constraints.
problem Improving logical positioning of UEs using channel-state information.
method Representation-constrained autoencoders to enhance channel charts.
result Improved quality of learned channel charts for UE positioning.
We show the existence of a smooth spherical surface minimizing the Willmore functional subject to an area constraint in a compact Riemannian three-manifold, provided the area is small enough. Moreover, we classify complete surfaces of Willmore type with positive mean curvature in Riemannian three-manifolds.
Proves existence of solutions to Einstein constraints with specific boundary conditions and verifies Penrose inequality.
problem Existence of asymptotically hyperbolic solutions to Einstein constraints with marginally outer trapped boundaries.
method Constant mean curvature conformal method.
result Verification of Penrose inequality for certain Schwarzschild-AdS black hole perturbations.
Develops risk measures for markets with constraints and costs.
problem Risk measures in markets with portfolio constraints and transaction costs.
method Embeds portfolio constraints and transaction costs into securities market; provides comprehensive analysis of risk measures properties.
result Establishes dual representations for convex and quasiconvex risk measures.
Novel GP-modulated Cox process framework with linear inequality constraints.
problem Modeling point patterns with positiveness and inequality constraints.
method Directly impose positiveness and inequality constraints on the Gaussian process without restrictions on covariance functions.
result Accurate inference of intensity functions with improved results for monotonic processes.
There are some statistical anomalies in the Chinese stock market, i.e., positive return skewness, anti-leverage effect (positive returns induce higher volatility than negative returns); and reverse volatility asymmetry (contemporaneous return-volatility correlation is positive). In this paper, we first confirm the exis…
We explain how to derive largeness constraints in scalar curvature geometry using some basic splitting results and the potential theory on singular area minimizing hypersurfaces. This includes a variety of results like the non-existence of positive scalar curvature metrics on enlargeable manifolds or simplified proofs …
SpodNet learns SPD matrices with structural constraints.
problem Estimating SPD matrices with additional structural constraints.
method Introduces SpodNet, a neural network module that guarantees SPD outputs and supports structural constraints.
result SpodNet learns SPD and sparse matrices effectively.
A new metric learning scheme for structured data combining graph and feature-space information.
problem Learning a metric from structured data while respecting metric constraints.
method Training metric-constrained linear combinations of dissimilarity matrices, applying graph-based optimization under constraints.
result Our approach can reduce computational complexity by one order of magnitude for some cases.
In the present article the geometry of semi-Riemannian manifolds with nonholonomic constraints is studied. These manifolds can be considered as analogues to the sub-Riemannian manifolds, where the positively definite metric is substituted by a nondegenerate metric. To study properties of the exponential map the Christo…
Fairness constraints can improve accuracy from biased data.
problem Learning from biased training data can produce biased and suboptimal classifiers.
method Examined fairness-constrained ERM and other recovery methods.
result Equal Opportunity fairness constraint combined with ERM provably recovers Bayes Optimal Classifier under various bias models.
In typical applications of Bayesian optimization, minimal assumptions are made about the objective function being optimized. This is true even when researchers have prior information about the shape of the function with respect to one or more argument. We make the case that shape constraints are often appropriate in at…
In this article, we give nonexistence and nonuniqueness results for the vacuum Einstein conformal constraint equations in the far-from-CMC case and also show that in some cases the equations of the conformal method for positive Yamabe metrics and with TT-tensor σ = 0 have a non-trivial solution, and thus answer a que…
Many machine learning approaches are characterized by information constraints on how they interact with the training data. These include memory and sequential access constraints (e.g. fast first-order methods to solve stochastic optimization problems); communication constraints (e.g. distributed learning); partial acce…
Stability of black holes proven in full subextremal range with positive cosmological constant.
problem Stability of Kerr-de Sitter black holes in the full subextremal range.
method Similar to previous proof in slowly rotating case, with implementation of constraint damping and verification of subprincipal symbol condition.
result Stability of Kerr-de Sitter black holes proven in the full subextremal range.
Classifiers can be trained with data-dependent constraints to satisfy fairness goals, reduce churn, achieve a targeted false positive rate, or other policy goals. We study the generalization performance for such constrained optimization problems, in terms of how well the constraints are satisfied at evaluation time, gi…
UMNNs improve density estimation and variational inference without constraints.
problem Creating expressive invertible transformations without constraints.
method Proposed UMNN architecture enforcing monotonicity with a free-form neural network.
result UMNNs enhance autoregressive flows for density estimation and variational inference.
In this note we show that the Lagrangian Luttinger surgery preserves the symplectic Kodaira dimension. Some constraints on Lagrangian tori in symplectic four manifolds with non-positive Kodaira dimension are also derived.
Paper optimizes financial trading strategies under uncertain market conditions.
problem Guaranteeing robust positive expected profits in financial systems.
method Transformed semi-infinite constraints into structured policies and proposed a novel graphical approach.
result Demonstrated superior risk-adjusted returns and downside risk compared to conventional strategies.
The study examines Eschenburg orbifolds with positive sectional curvature and their geometric/topological properties.
problem Understanding the geometric and topological constraints of positively curved Eschenburg orbifolds.
method Proved restrictions on singular sets and computed orbifold cohomology rings.
result Distinctive behavior in cohomology groups of positively curved Eschenburg orbifolds.
We study an online classification problem with partial feedback in which individuals arrive one at a time from a fixed but unknown distribution, and must be classified as positive or negative. Our algorithm only observes the true label of an individual if they are given a positive classification. This setting captures …
We establish new existence and non-existence results for positive solutions of the Einstein-scalar field Lichnerowicz equation on compact manifolds. This equation arises from the Hamiltonian constraint equation for the Einstein-scalar field system in general relativity. Our analysis introduces variational techniques, i…
Solves probabilistic Lambert problem connecting astrodynamics with optimal mass transport.
problem Determining spacecraft velocity for given positions with probabilistic constraints.
method Generalized optimal mass transport (OMT) and Schrödinger bridge (SBP) connections.
result Existence and uniqueness of solution for probabilistic Lambert problem.
Study on contracting maps and their rigidity under curvature constraints.
problem Rigidity of contracting maps between manifolds with positive curvature.
method Analysis of curvature pinching and contracting conditions involving singular values.
result Established the relation between curvature pinching and contracting conditions.
We propose using category theory to unify deep learning architectures.
problem Lack of a coherent bridge between model constraints and implementations.
method Apply category theory to unify neural network design.
result Theory recovers constraints from geometric deep learning and encodes standard constructs.
Improves key instance detection in MIL models by using neural network inversion with sparseness constraint.
problem Limited key instance detection performance in attention-based deep MIL models due to skewed attention scores.
method Sparse network inversion with a sparseness constraint incorporated into neural network inversion, solved by proximal gradient method.
result Significantly improved key instance detection performance while maintaining bag-level prediction performance.
Extends trading framework to incorporate real-world constraints.
problem Trading strategies in multi-player non-cooperative games with constraints.
method Re-framed as quadratic programming problem, constraints readily incorporated.
result Two-trader equilibria calculated dynamically.
Paper proposes a new algorithm for graph learning with covariance constraints.
problem Graphical models and factor analysis not jointly leveraged in graph learning processes.
method Penalized maximum likelihood estimation of an elliptical distribution with Riemannian optimization.
result Effectiveness of the proposed approach demonstrated on real-world data sets.
Structured regularizers enable faster optimization on SPD manifolds with constraints.
problem Optimizing SPD matrices with additional constraints.
method Structured regularizers based on symmetric gauge functions.
result Structured regularizers can preserve or induce desirable structure like convexity.
Study on market entry timing in stock liquidation with trading constraints.
problem Optimal timing of market entry and exit in portfolio liquidation with trading restrictions.
method Mean-field game approach to model N-player and mean-field games of optimal portfolio liquidation. result Existence of unique equilibrium in both mean-field and N-player games.