arXiv research

Researchers use Gaussian processes to approximate Lagrange multipliers for Maximum-Entropy distributions.

The paper explores the correspondence between gradient flow lines of a function and its Lagrange multiplier functional.

Optimization with inequality constraints using embedded gradient vector field method

It is shown that the Euler-Lagrange equations for a Lagrangian system on a Lie algebroid are obtained as the equations for the critical points of the action functional defined on a Banach manifold of curves. The theory of reduction and the relation with Lagrange multiplier method are also studied.

Discrete Lagrange problems solved with Lie group constraints.

We methodologically address the problem of Q-value overestimation in deep reinforcement learning to handle high-dimensional state spaces efficiently. By adapting concepts from information theory, we introduce an intrinsic penalty signal encouraging reduced Q-value estimates. The resultant algorithm encompasses a wide r…

Researchers prove existence of smooth hypersurface in hyperbolic space.

A new algorithm finds optimal solutions for constrained decision processes.

A new method solves variational inequality problems with multiple constraints without needing optimal Lagrange multipliers.

Maximizes capacity of extensions with fixed boundary data.

Given two Morse functions $f, μ$ on a compact manifold $M$, we study the Morse homology for the Lagrange multiplier function on $M \times {\mathbb R}$ which sends $(x, η)$ to $f(x) + ημ(x)$. Take a product metric on $M \times {\mathbb R}$, and rescale its ${\mathbb R}$-component by a factor $λ^2$. We show that generica…

Simplifies neural network models by explicitly enforcing constraints in Cartesian coordinates.

A large number of objectives have been proposed to train latent variable generative models. We show that many of them are Lagrangian dual functions of the same primal optimization problem. The primal problem optimizes the mutual information between latent and visible variables, subject to the constraints of accurately …

A continuous-time financial portfolio selection model with expected utility maximization typically boils down to solving a (static) convex stochastic optimization problem in terms of the terminal wealth, with a budget constraint. In literature the latter is solved by assuming {\it a priori} that the problem is well-pos…

Extending Lévi-Civita's concept to non-quadratic spaces, this study finds extremal compatible linear connections.

The paper studies Einstein-Hilbert action on complex manifolds.

Study S-shaped utility maximization with VaR constraint and unobservable drift.

In this paper we provide generalized Helmholtz conditions, in terms of a semi-basic 1-form, which characterize when a given system of second order ordinary differential equations is equivalent to the Lagrange equations, for some given arbitrary non-conservative forces. For the particular cases of dissipative or gyrosco…

We consider the Willmore functional on graphs, with an additional penalization of the area where the curvature is non-zero. Interpreting the penalization parameter as a Lagrange multiplier, this corresponds to the Willmore functional with a constraint on the area where the graph is flat. Sending the penalization parame…

Study on membranes under confinement, proving existence and regularity of minimizers.

We consider the classical optimal dividends problem under the Cramér-Lundberg model with exponential claim sizes subject to a constraint on the time of ruin. We introduce the dual problem and show that the complementary slackness conditions are satisfied, thus there is no duality gap. Therefore the optimal value functi…

Paper improves MVSC using tensor low-rank modeling.

Study of critical points for 4D conformally invariant curvature energies.

Solves an Arnold trivium problem using calculus and topology.

Unified framework for network model assessment using maximum entropy.

Despite the recent successes of deep neural networks, the corresponding training problem remains highly non-convex and difficult to optimize. Classes of models have been proposed that introduce greater structure to the objective function at the cost of lifting the dimension of the problem. However, these lifted methods…

We consider discriminative dictionary learning in a distributed online setting, where a network of agents aims to learn a common set of dictionary elements of a feature space and model parameters while sequentially receiving observations. We formulate this problem as a distributed stochastic program with a non-convex o…

Critical trajectories in a sphere are found for a specific bending functional.

In this paper, Kernel PCA is reinterpreted as the solution to a convex optimization problem. Actually, there is a constrained convex problem for each principal component, so that the constraints guarantee that the principal component is indeed a solution, and not a mere saddle point. Although these insights do not impl…

Global implicit function theorem for Fréchet spaces, solving derivative loss problems.

Existing approaches to resource allocation for nowadays stochastic networks are challenged to meet fast convergence and tolerable delay requirements. The present paper leverages online learning advances to facilitate stochastic resource allocation tasks. By recognizing the central role of Lagrange multipliers, the unde…

The paper proves transversality for special Lagrangian submanifolds in a 6D manifold.

The information bottleneck (IB) problem tackles the issue of obtaining relevant compressed representations $T$ of some random variable $X$ for the task of predicting $Y$. It is defined as a constrained optimization problem which maximizes the information the representation has about the task, $I(T;Y)$, while ensuring t…

This paper solves a utility maximization problem under utility-based shortfall risk constraint, by proposing an approach using Lagrange multiplier and convex duality. Under mild conditions on the asymptotic elasticity of the utility function and the loss function, we find an optimal wealth process for the constrained p…

In this paper we consider a Lagrange Multiplier-type test (LM) to detect change in the mean of time series with heteroskedasticity of unknown form. We derive the limiting distribution under the null, and prove the consistency of the test against the alternative of either an abrupt or smooth changes in the mean. We perf…

New model tackles real-world distribution mismatches in machine learning.

Study of closed trajectories in hyperbolic plane with specific curvature constraints.

We consider a multicast scheme recently proposed for a wireless downlink in [1]. It was shown earlier that power control can significantly improve its performance. However for this system, obtaining optimal power control is intractable because of a very large state space. Therefore in this paper we use deep reinforceme…

Matrix rank minimization problem is in general NP-hard. The nuclear norm is used to substitute the rank function in many recent studies. Nevertheless, the nuclear norm approximation adds all singular values together and the approximation error may depend heavily on the magnitudes of singular values. This might restrict…

In this paper, we revisit the portfolio optimization problems of the minimization/maximization of investment risk under constraints of budget and investment concentration (primal problem) and the maximization/minimization of investment concentration under constraints of budget and investment risk (dual problem) for the…

In many optimization problems in wireless communications, the expressions of objective function or constraints are hard or even impossible to derive, which makes the solutions difficult to find. In this paper, we propose a model-free learning framework to solve constrained optimization problems without the supervision …

Although Deep Neural Networks(DNNs) have achieved successful applications in many fields, they are vulnerable to adversarial examples.Adversarial training is one of the most effective methods to improve the robustness of DNNs, and it is generally considered as solving a saddle point problem that minimizes risk and maxi…

In this paper, as a first step in examining the properties of a feasible portfolio subset that is characterized by budget and risk constraints, we assess the maximum and minimum of the investment concentration using replica analysis. To do this, we apply an analytical approach of statistical mechanics. We note that the…

We introduce a longevity feature to the classical optimal dividend problem by adding a constraint on the time of ruin of the firm. We extend the results in \cite{HJ15}, now in context of one-sided Lévy risk models. We consider de Finetti's problem in both scenarios with and without fix transaction costs, e.g. taxes. We…

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 …

The potential of recovering the topology of a grid using solely publicly available market data is explored here. In contemporary whole-sale electricity markets, real-time prices are typically determined by solving the network-constrained economic dispatch problem. Under a linear DC model, locational marginal prices (LM…

In recent years, the evaluation of the minimal investment risk of the quenched disordered system of a portfolio optimization problem and the investment concentration of the optimal portfolio has been actively investigated using the analysis methods of statistical mechanical informatics. However, the work to date has no…

The main purpose of this paper is to revisit the well known potentials, called stress functions, needed in order to study the parametrizations of the stress equations, respectively provided by G.B. Airy (1863) for 2-dimensional elasticity, then by E. Beltrami (1892), J.C. Maxwell (1870) and G. Morera (1892) for 3-dimen…