Proposes a method to train neural networks that solve differential equations faster.
problem Training neural networks that solve differential equations becomes computationally expensive.
method Introduces a differentiable surrogate for numerical solver time cost using higher-order derivatives.
result Trains models that are faster to solve while maintaining nearly the same accuracy.
Polynomial-time algorithm solves random parity games with high probability.
problem Solving random parity games efficiently.
method SWCP algorithm based on cycles in subgraphs.
result Polynomial-time solution for large-degree games with high probability.
Graph neural networks improve solving linear optimization problems.
problem Improving the efficiency of solving linear optimization problems.
method Using graph neural networks to simulate standard interior-point methods for linear optimization problems.
result Graph neural networks can solve linear optimization problems close to optimality, often outperforming conventional solvers.
New method speeds up solving L0-regularized least-squares problems.
problem Solving L0-regularized least-squares problems efficiently.
method Safe peeling for Branch-and-Bound algorithm.
result Significant gains in solving time and node exploration.
We show that several popular few-shot learning benchmarks can be solved with varying degrees of success without using support set Labels at Test-time (LT). To this end, we introduce a new baseline called Centroid Networks, a modification of Prototypical Networks in which the support set labels are hidden from the metho…
Deep learning solves EV routing with time windows for EV fleets.
problem Electric vehicle routing with time windows for logistics.
method End-to-end deep reinforcement learning with attention model and graph embedding.
result Proposed model efficiently solves large EVRPTW instances.
New algorithms solve dense linear systems with low-rank structure efficiently.
problem Solving dense linear systems with specific singular value conditions.
method Randomized algorithms using matrix sketching and low-rank update formulas.
result Achieves nearly-linear time complexity for solving such systems.
New method solves KP problem using global Cartan decompositions.
problem Solving time-optimal unitaries for targets in semi-simple Lie groups.
method Global Cartan decompositions of symmetric spaces for optimal control.
result Analytical solutions for time-optimal unitaries under specific conditions.
New algorithm solves unbalanced optimal transport on trees in quasi-linear time.
problem Efficiently solving unbalanced optimal transport problems on trees.
method Proposed an algorithm that solves a more general unbalanced optimal transport problem exactly in quasi-linear time on a tree metric.
result Solves unbalanced optimal transport on trees in quasi-linear time (less than one second for a tree with one million nodes).
Deep learning solves complex stochastic control with jumps.
problem Solving high-dimensional stochastic control tasks with jumps.
method Model-based approach using two neural networks, iteratively trained with objectives derived from the Hamilton-Jacobi-Bellman equation.
result Demonstrates effectiveness in solving complex high-dimensional stochastic control tasks.
A new ML algorithm solves complex economic control problems.
problem Solving high-dimensional, finite-horizon stochastic control problems in economics.
method Deep neural network representation of optimal policy functions with three key features.
result Efficiently solves various economic control problems including recursive utility and growth models.
EKM solves the K-medoids problem in polynomial time.
problem The K-medoids problem in data analysis. method EKM is a novel algorithm using transformational programming and combinatorial generation.
result EKM solves the K-medoids problem in worst-case $O\left(N^{K+1}
ight)$ time complexity. We present both, theory and an algorithm for solving time-harmonic wave problems in a general setting. The time-harmonic solutions will be achieved by computing time-periodic solutions of the original wave equations. Thus, an exact controllability technique is proposed to solve the time-dependent wave equations. We dis…
Solves steering problem with continuous time, Hilbert-Schmidt cost, and matrix ODEs.
problem Fixed horizon linear quadratic covariance steering in continuous time with a specific terminal cost.
method Formulates necessary conditions as a coupled matrix ODE two-point boundary value problem, designs a matricial recursive algorithm, and proves convergence.
result Proposes and proves the convergence of a matricial recursive algorithm for solving the steering problem.
This paper examines challenges and solutions for solving variational inequalities.
problem Stability issues in solving variational inequalities, especially in multi-objective scenarios.
method Continuous-time analysis to understand and improve stability of algorithms.
result Understanding continuous-time dynamics can help in designing more stable algorithms for variational inequalities.
Efficiently estimates binary product distributions with privacy.
problem Estimating means of binary product distributions privately and accurately.
method Polynomial time, pure differential privacy approach.
result Optimal sample complexity with polylogarithmic factors.
New methods improve solving linear systems and preconditioning with reduced complexity.
problem Efficiently solving linear systems and preconditioning matrices.
method Developed structured semidefinite programming algorithms.
result Improved runtimes for preconditioning and solving linear systems.
Develops framework for understanding deep learning in time series data.
problem Understanding and explaining decisions made by deep learning models in time series data.
method Uses deep neural networks to capture and explain temporal dependencies in time series data.
result Framework successfully captures and explains temporal dependencies in various synthetic and real-world datasets.
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.
We show how binary classification methods developed to work on i.i.d. data can be used for solving statistical problems that are seemingly unrelated to classification and concern highly-dependent time series. Specifically, the problems of time-series clustering, homogeneity testing and the three-sample problem are addr…
Paper identifies reductive MDPs, solving them in polynomial time.
problem Computational hardness of general MDPs and tractability of finite-horizon MDPs.
method Defines reductivity, a new class of SSPs, and develops a polynomial-time solution.
result Optimal policies can be found in polynomial time for reductive SSPs and MDPs.
Study solves HJB equations for time-inconsistent control problems.
problem Time-inconsistent deterministic linear quadratic control problems.
method Characterized solutions using Riccati equations with integral terms, proving uniqueness.
result Uniqueness of solutions to equilibrium HJB equations proved.
Solves a model for sudden problem-solving ability in deep learning.
problem Emergence of new problem-solving abilities in deep learning models.
method Solves a simple multi-linear model in a skill-basis, finding analytic expressions for emergence and scaling laws.
result Simple model captures sigmoidal emergence of multiple new skills in neural networks.
Continuous-time MBRL framework tackles control systems with Bayesian ODEs.
problem Discretization of continuous-time systems in MBRL.
method Novel actor-critic method with Bayesian ODEs for state inference.
result Model robust against irregular and noisy data, sample-efficient, solves challenging control problems.
RL solves discrete LQ control with Gaussian optimal policy.
problem Discrete-time linear-quadratic control problem.
method Entropy-based RL to find Gaussian optimal policy.
result RL algorithm solves mean-variance asset-liability management problem.
A minimal space-like surface in Minkowski space-time is said to be of general type if it is free of degenerate points. The fact that minimal space-like surfaces of general type in Minkowski space-time admit canonical parameters of the first (second) type implies that any minimal space-like surface is determined uniquel…
New algorithms solve word and conjugacy problems in braid group B3.
problem Word and conjugacy problems in braid group B3.
method Classical interpretation of braid group B3 as central extension of modular group, theory of continued fractions.
result Simple and efficient algorithms to solve word and conjugacy problems in braid group B3.
Develops ML method for solving financial equations.
problem Solving financial equations efficiently and accurately.
method Combines semi-analytical and numerical techniques.
result Significantly faster and more accurate solutions.
Study analyzes derivative-free loss method for solving PDEs and fluid problems.
problem Solving elliptic PDEs and fluid problems using neural networks.
method Derivative-free loss method with Feynman-Kac formulation and stochastic walkers.
result Training loss bias scales with time interval and spatial gradient, inversely with walker size.
The Burer-Monteiro method is one of the most widely used techniques for solving large-scale semidefinite programs (SDP). The basic idea is to solve a nonconvex program in Y, where Y is an n×p matrix such that X=YYT. In this paper, we show that this method can solve SDPs in polynomial time in a smooth…
Solves optimal stopping for Gauss-Markov bridges using time-space transformation.
problem Optimal stopping problem of a Gauss-Markov bridge.
method Time-space transformation approach, Picard iteration algorithm.
result Lipschitz continuity of the optimal stopping boundary and its characterization.
This note explores the mathematical theory to solve modern gamblers ruin problems. We establish a ruin framework and solve for the probability of bankruptcy. We also show how this relates to the expected time to bankruptcy and review the risk neutral probabilities associated an adjustment to asymmetrical views.
Discontinuous Finite Element Methods (DFEM) have been widely used for solving Sn radiation transport problems in participative and non-participative media. In the DFEM Sn methodology, the transport equation is discretized into a set of algebraic equations that have to be solved for each spatial cell and angular d…
Solves portfolio optimization with costs using numerical methods.
problem Dynamic portfolio optimization with transaction costs and constraints.
method Numerical dynamic programming techniques.
result Problems can now be solved tractably.
We consider a class of participation rights, i.e. obligations issued by a company to investors who are interested in performance-based compensation. Albeit having desirable economic properties equity-based debt obligations (EbDO) pose challenges in accounting and contract pricing. We formulate and solve the associated …
Paper solves POMDPs in continuous time and discrete spaces.
problem Optimal decision making in discrete state and action space systems under partial observability.
method Combining optimal filtering theory and deep learning to solve a Hamilton-Jacobi-Bellman equation.
result Derives a mathematical description and solution approach for continuous-time POMDPs.
In this paper, we solve the time inconsistent portfolio selection problem by using different utility functions with a moving target as our constraint. We solve this problem by finding an equilibrium control under the given definition as our optimal control. We firstly derive a sufficient equilibrium condition for secon…
In this introductory paper, we discuss how quantitative finance problems under some common risk factor dynamics for some common instruments and approaches can be formulated as time-continuous or time-discrete forward-backward stochastic differential equations (FBSDE) final-value or control problems, how these final val…
I prove that if markets are weak-form efficient, meaning current prices fully reflect all information available in past prices, then P = NP, meaning every computational problem whose solution can be verified in polynomial time can also be solved in polynomial time. I also prove the converse by showing how we can "progr…
Study a continuous-time PA problem with private effort and consumption decisions.
problem Continuous-time Principal-Agent problem with private information.
method Proposes a new sufficient condition for solving the agent's problem directly.
result Directly yields a solution to the agent's problem without verification.
Solves super-hedging for financial models with uncertain prices.
problem Super-hedging European or Asian options in discrete-time models with uncertain prices.
method Numerical procedure under AIP condition to compute infimum price.
result Solves super-hedging problem under weak no-arbitrage condition.
JAMPR learns to solve complex VRP with time windows.
problem Vehicle routing problems with time windows and vehicle capacities.
method Joint attention to construct multiple routes concurrently.
result JAMPR outperforms existing models on different problem sizes.
New algorithms solve linear bandits in high dimensions efficiently.
problem Maximizing bilinear functions over convex sets and ellipsoids.
method Two novel algorithms for solving the problem efficiently.
result First known method to implement optimistic algorithms for linear bandits in high dimensions.
Recent research has shown that performance in signal processing tasks can often be significantly improved by using signal models based on sparse representations, where a signal is approximated using a small number of elements from a fixed dictionary. Unfortunately, inference in this model involves solving non-smooth op…
Deep network solves maze path planning without training.
problem Efficient path planning in large mazes with obstacles.
method Max pooling layers without training.
result Solves mazes with over half a billion nodes in short time.
This paper extends the classical consumption and portfolio rules model in continuous time (Merton 1969, 1971) to the framework of decision-makers with time-inconsistent preferences. The model is solved for different utility functions for both, naive and sophisticated agents, and the results are compared. In order to so…
Given a data matrix X∈Rn×d and a response vector y∈Rn, suppose n>d, it costs O(nd2) time and O(nd) space to solve the least squares regression (LSR) problem. When n and d are both large, exactly solving the LSR problem is very expensive. When n≫d, one feasible approach to spee…
We consider the fundamental problem of solving quadratic systems of equations in n variables, where yi=∣⟨ai,x⟩∣2, i=1,…,m and x∈Rn is unknown. We propose a novel method, which starting with an initial guess computed by means of a …