Geometrically characterizes virtual nonlinear nonholonomic constraints using symplectic methods.
problem Characterizing virtual nonlinear nonholonomic constraints geometrically.
method Geometric characterization using symplectic structures and Chetaev equations.
result A unique control law exists to satisfy virtual constraints, and closed-loop dynamics are projections of uncontrolled dynamics.
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.
In this paper, we study a type of reflected BSDE with a constraint and introduce a new kind of nonlinear expectation via BSDE with a constraint and prove the Doob-Meyer decomposition with respect to the super(sub)martingale introduced by this nonlinear expectation. We then apply the results to the pricing of American o…
Introduces nonlinear splittings on fibre bundles for generalizing connections.
problem Generalizing connections on fibre bundles.
method Definition and properties of nonlinear splittings, including affine, homogeneous, and principal splittings.
result Curvature map defined for nonlinear splittings, linking to nonholonomic systems and magnetic Lagrangian systems.
We identify linear models from nonlinear systems with initialization constraints.
problem Identifying linear models from nonlinear systems with initialization constraints.
method Multiple trajectories-based deterministic data acquisition algorithm followed by regularized least squares.
result We provide a finite sample error bound on the learned linearized dynamics.
New algorithm tackles stochastic optimization with inequality constraints.
problem Stochastic optimization with inequality constraints in various applications.
method Active-set stochastic sequential quadratic programming (StoSQP) with a differentiable exact augmented Lagrangian.
result Global convergence for any initialization, KKT residuals converge to zero almost surely.
Framework for designing nonlinearities in neural networks with slope constraints.
problem Designing nonlinearities with specific properties for signal processing.
method Variational framework with regularization for slope constraints and optimization of adaptive splines.
result Adaptive nonuniform linear splines achieve global optimum in constrained optimization.
Study optimal investment and consumption in incomplete markets with nonlinear expectations.
problem Utility maximization in incomplete markets with general constraints.
method Utilizes g-martingale method to solve optimization problem for various utility functions. result Characterizes optimal investment-consumption strategy through quadratic BSDE solutions.
Method solves complex optimization problems with high probability bounds.
problem Nonlinear equality constrained stochastic optimization problems.
method Step-search sequential quadratic programming method.
result High-probability bound on iteration complexity for first-order stationarity.
New algorithms reduce complexity for solving nonconvex optimization problems with stochastic objectives and constraints.
problem Solving nonconvex optimization problems with stochastic objectives and constraints.
method Single-loop quadratic penalty and augmented Lagrangian algorithms with variance reduction techniques.
result Achieved best-known complexity guarantees for solving nonconvex optimization problems with stochastic objectives and constraints.
This paper introduces a robust mixing model to describe hyperspectral data resulting from the mixture of several pure spectral signatures. This new model not only generalizes the commonly used linear mixing model, but also allows for possible nonlinear effects to be easily handled, relying on mild assumptions regarding…
Identification of causal direction between a causal-effect pair from observed data has recently attracted much attention. Various methods based on functional causal models have been proposed to solve this problem, by assuming the causal process satisfies some (structural) constraints and showing that the reverse direct…
We discuss the portfolio optimization problem with the obligatory deposits constraint. Recently it has been shown that as a consequence of this nonlinear constraint, the solution consists of an exponentially large number of optimal portfolios, completely different from each other, and extremely sensitive to any changes…
We introduce the study of nonlinear harmonic forms. These are forms which minimize the L2 energy in a cohomology class subject to a nonlinear constraint. In this note, we include only motivations and the most basic existence results. We also introduce a variant of the Bochner formula suitable for probing the structu…
Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors amounts to finding critical points of a quadratic function subject to quadratic constraints. In this paper we show that a certain class of con…
Extends RRR to capture nonlinear interactions in multi-response regression.
problem Complex relationships in real-world data cannot be adequately modeled by linear interactions.
method Introduces Higher Order Reduced Rank Regression (HORRR) using tensor representations and Tucker decomposition.
result HORRR can capture nonlinear interactions in multi-response regression.
Combines Gaussian processes and polynomial chaos for stochastic control.
problem Uncertainties in dynamic models lead to performance issues in predictive control.
method Combines Gaussian processes with polynomial chaos expansions to estimate probability distributions of nonlinear functions.
result Demonstrates accurate approximation and closed-loop performance in stochastic nonlinear model predictive control.
Solves optimal stopping problem with Poisson constraints using jumps.
problem Optimal stopping with Poisson constraints and jumps.
method Penalized backward stochastic differential equation (PBSDE) with jumps, decomposition method based on Jacod-Pham, comparison theorem of BSDEs with jumps.
result Solves American option pricing in nonlinear markets with Poisson constraints.
This work establishes safe reinforcement learning for LQR with nonlinear baselines.
problem Safe reinforcement learning in LQR with unknown dynamics and safety constraints.
method General framework for nonlinear baselines, focusing on 1D spaces.
result Achieves optimal regret bounds for constrained reinforcement learning.
We investigate the application of two heuristic methods, genetic algorithms and tabu/scatter search, to the optimisation of realistic portfolios. The model is based on the classical mean-variance approach, but enhanced with floor and ceiling constraints, cardinality constraints and nonlinear transaction costs which inc…
The paper improves Gaussian processes by adding sum constraints, enhancing prediction accuracy.
problem Improving Gaussian process predictions with background knowledge constraints.
method Conditioning the prior distribution on sum constraints to ensure fulfillment of linear and nonlinear constraints.
result The approach fulfills constraints with high precision and improves prediction accuracy.
In this paper we consider the problem of minimising drawdown in a portfolio of financial assets. Here drawdown represents the relative opportunity cost of the single best missed trading opportunity over a specified time period. We formulate the problem (minimising average drawdown, maximum drawdown, or a weighted combi…
We study local complexity measures for stochastic convex optimization problems, providing a local minimax theory analogous to that of Hájek and Le Cam for classical statistical problems. We give complementary optimality results, developing fully online methods that adaptively achieve optimal convergence guarantees. Our…
The paper tackles online resource allocation with uncertain coefficients and chance constraints.
problem Online stochastic resource allocation problem with chance constraints.
method Linearization and primal-dual algorithms with heuristic corrections.
result Optimality gap and constraint violation are on the order of √n.
A novel optimisation framework through quadratic nonlinear projection is introduced for credit portfolio when the portfolio risk is measured by Conditional Value-at-Risk (CVaR). The whole optimisation procedure to search toward the optimal portfolio state is conducted by a series of single-step optimisations under the …
KCRL learns stable policies for nonlinear systems with formal guarantees.
problem Lack of stabilization guarantees in RL methods for safety-critical systems.
method KCRL uses Krasovskii's Lyapunov functions as a stability constraint and a primal-dual approach to learn stabilizing policies.
result KCRL guarantees learning a stabilizing policy in a finite number of interactions.
Improved stability analysis of neural network systems using Zames-Falb multipliers.
problem Analyzing stability of linear systems with neural network nonlinearities.
method Using integral quadratic constraints, sector-bounded and slope-restricted structure, and acausal Zames-Falb multipliers.
result Flexible and versatile framework for stability analysis with improved computational efficiency.
Study shows global invertibility in nonlinear elasticity with vanishing self-repulsion term.
problem Global invertibility in nonlinear elasticity with a vanishing nonlocal self-repulsion term.
method Proves global invertibility in the Γ-limit of elastic energy with a vanishing nonlocal self-repulsion term. result Global invertibility can be obtained in the Γ-limit of the elastic energy with a vanishing nonlocal self-repulsion term. On a constraint manifold we give an explicit formula for the Hessian matrix of a cost function that involves the Hessian matrix of a prolonged function and the Hessian matrices of the constraint functions. We give an explicit formula for the case of the orthogonal group O(n) by using only Euclidean coordinates …
New algorithms optimize constrained problems faster, avoiding full set optimization.
problem Optimizing constrained problems efficiently and quickly.
method Designing accelerated first-order algorithms that avoid full set optimization.
result Proved convergence to stationary points in nonconvex settings and accelerated rates in convex settings.
In this work, we prove the existence of a family of solutions of the Allen-Cahn equation with nonlinear Neumann boundary condition under some constraints, whose nodal sets concentrate asymptotically to a given volume nondegenerate capillary hypersurface in a compact Riemannian manifold. Our construction is inspired by …
NKI integrates obfuscated datasets using nonlinear kernels for improved data collaboration.
problem Privacy-preserving data collaboration with reduced reconstruction risk.
method Formulates linear kernel integration, kernelizes it, and introduces graph regularization and centering constraints.
result NKI improves classification accuracy over existing linear integration methods under nonlinear dimensionality reduction.
We address the restriction problem for viscosity subsolutions of a fully nonlinear PDE on a manifold Z. The constraints on the restrictions of smooth subsolutions to a submanifold X in Z determine a restricted subequation on X. The problem is to show that general (upper semi-continuous) subsolutions restrict to satisfy…
New findings on identifying latent variables in nonlinear ICA models.
problem Identifying latent variables in nonlinear ICA models is challenging due to spurious solutions.
method Proved that conformal maps are identifiable and provided theoretical results on preventing spurious solutions.
result Conformal maps are identifiable in nonlinear ICA models, preventing spurious solutions.
Unified framework identifies nonlinear systems using characteristic curves and neural networks.
problem Balancing interpretability and flexibility in nonlinear system identification.
method Combines differential equation structure with neural networks, using characteristic curves as modular components.
result NN-CC approach outperforms other methods in complex nonlinear systems.
Continuous-time mean-variance portfolio selection model with nonlinear wealth equations and bankruptcy prohibition is investigated by the dual method. A necessary and sufficient condition which the optimal terminal wealth satisfies is obtained through a terminal perturbation technique. It is also shown that the optimal…
Robust model predictive control (MPC) is a well-known control technique for model-based control with constraints and uncertainties. In classic robust tube-based MPC approaches, an open-loop control sequence is computed via periodically solving an online nominal MPC problem, which requires prior model information and fr…
We give multiplicity results for the solutions of a nonlinear elliptic equation, with an asymmetric double well potential of Van der Waals-Allen--Cahn--Hilliard type, satisfying a linear volume constraint, on a bounded Lipschitz domain $Ω\subset\mathds R^N$. The number of solutions is estimated in terms of topological …
Algorithm samples constrained stochastic differential equations.
problem Sampling stochastic differential equations with complex constraints.
method Pathspace Metropolis-adjusted manifold sampling.
result Demonstrated effectiveness in various constrained conditions.
This paper develops a fast algorithm for solving nonlinear PDEs using sparse Cholesky factorization.
problem Efficiently solving nonlinear PDEs with Gaussian processes and kernel methods.
method Sparse Cholesky factorization for near-linear complexity.
result Near-linear complexity algorithm for working with kernel matrices of nonlinear PDEs.
Formula for Laplace-Beltrami on orthogonal group in Euclidean coords.
problem Computing Laplace-Beltrami on constrained submanifolds.
method Embedded gradient vector field method, explicit formula derivation.
result Explicit formula for Laplace-Beltrami on orthogonal group.
Proposes a transfer learning framework for sparse SIMs without raw source data.
problem Lack of direct access to raw source data and known link functions in transfer learning.
method Source-data-free framework based on SIM, using summary statistics and a multilayer perceptron.
result Consistent improvements over existing approaches in synthetic and real-world data.
New method identifies latent sources from nonlinear mixtures without auxiliary variables.
problem Identifying latent sources from nonlinear mixtures without additional information.
method Structural Sparsity assumptions on the mixing process.
result Latent sources can be identified up to permutation and transformation.
The paper tackles data-driven optimal control of unknown nonlinear systems using RKHS.
problem Unknown nonlinear dynamics and stage cost functions.
method Embed state densities into RKHS, learn Markov operators, solve Hamilton-Jacobi-Bellman recursions.
result Solves a wide range of nonlinear control problems, including depth regulation.
DMT enhances deep neural networks to better preserve data structures.
problem Preserving geometric, topological, and distributional structures of data in NLDR.
method Deep manifold transformation (DMT) using cross-layer LGP constraints.
result DMT networks outperform existing NLDR methods in preserving data structures.
A new algorithm solves constrained optimization problems with stochastic gradients.
problem Nonlinear equality constrained optimization with rank-deficient Jacobians.
method Step decomposition strategy combining normal and tangential steps.
result Convergence guarantees in rank-deficient Jacobian cases.
Recently there has been sustained interest in modifying prediction algorithms to satisfy fairness constraints. These constraints are typically complex nonlinear functionals of the observed data distribution. Focusing on the path-specific causal constraints proposed by Nabi and Shpitser (2018), we introduce new theoreti…
A new method infers parameters from PDEs using Gaussian processes.
problem Estimating unknown parameters in PDEs from noisy data.
method PDE-Informed Gaussian Process (PIGP) method.
result The method bypasses numerical solvers for PDEs and provides uncertainty quantification.