Related papers: Evading the model sign problem in the PNJL model w…
This paper introduces an enhanced meta-heuristic (ML-ACO) that combines machine learning (ML) and ant colony optimization (ACO) to solve combinatorial optimization problems. To illustrate the underlying mechanism of our ML-ACO algorithm, we…
Yuan's theorem of the alternative is an important theoretical tool in optimization, which provides a checkable certificate for the infeasibility of a strict inequality system involving two homogeneous quadratic functions. In this paper, we…
Many optimizers can be interpreted as steepest-descent methods under norm-induced geometries, and thus inherit corresponding implicit biases. We introduce \nameA{} (\fullname{}), which combines spectral control from orthogonalized update…
We study a trajectory-planning problem whose solution path evolves by means of a Lie group action and passes near a designated set of target positions at particular times. This is a higher-order variational problem in optimal control,…
In this work, we present an approach to minimizing the time necessary for the end-effector of a redundant robot manipulator to traverse a Cartesian path by optimizing the trajectory of its joints. Each joint has limits in the ranges of…
We consider the estimation of the state transition matrix in vector autoregressive models, when time sequence data is limited but nonsequence steady-state data is abundant. To leverage both sources of data, we formulate the least squares…
We propose a neural network approach that yields approximate solutions for high-dimensional optimal control problems and demonstrate its effectiveness using examples from multi-agent path finding. Our approach yields controls in a feedback…
Recently, machine learning, particularly message-passing graph neural networks (MPNNs), has gained traction in enhancing exact optimization algorithms. For example, MPNNs speed up solving mixed-integer optimization problems by imitating…
We present a novel strategy aimed at restoring correct convergence in complex Langevin simulations. The central idea is to incorporate system-specific prior knowledge into the simulations, in order to circumvent the NP-hard sign problem. In…
While Physics-Informed Neural Networks (PINNs) are powerful for solving Partial Differential Equations (PDEs), their training is often paralyzed by gradient pathology. The gradients from the PDE residuals and boundary constraints oppose…
In this work we study a modification of the Monge-Kantorovich problem taking into account path dependence and interaction effects between particles. We prove existence of solutions under mild conditions on the data, and after imposing…
Effective Polyakov line models, derived from SU(3) gauge-matter systems at finite chemical potential, have a sign problem. In this article I solve two such models, derived from SU(3) gauge-Higgs and heavy quark theories by the relative…
In lattice field theory, the interactions of elementary particles can be computed via high-dimensional integrals. Markov-chain Monte Carlo (MCMC) methods based on importance sampling are normally efficient to solve most of these integrals.…
Quantum Monte Carlo methods are sophisticated numerical techniques for simulating interacting quantum systems. In some cases, however, they suffer from the notorious "sign problem" and become too inefficient to be useful. A recent…
This paper investigates symbol detection for single-carrier communication systems operating in the presence of additive interference with Nakagami-m statistics. Such interference departs from the assumptions underlying conventional…
Differential equations have void applications in several practical situations, sciences, and non sciences as Euler Lagrange equation in classical mechanics, Radioactive decay in nuclear physics, Navier Stokes equations in fluid dynamics,…
The NP-hard problem of optimizing a shallow ReLU network can be characterized as a combinatorial search over each training example's activation pattern followed by a constrained convex problem given a fixed set of activation patterns. We…
A family of optimal control problems for a single and two coupled spinning particles in the Euler-Lagrange formalism is discussed. A characteristic of such problems is that the equations controlling the system are implicit and a reduction…
Deep Neural Networks and Reinforcement Learning methods have empirically shown great promise in tackling challenging combinatorial problems. In those methods a deep neural network is used as a solution generator which is then trained by…
We apply a phase field approach for a general shape optimization problem of a stationary Navier-Stokes flow. To be precise we add a multiple of the Ginzburg--Landau energy as a regularization to the objective functional and relax the…