Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

218435653870 · Jun 202019922001200920172026
48 results for Constraint optimization

FISAR uses neural networks to optimize safe reinforcement learning with forward-invariant constraints.

problem Safe reinforcement learning with constraints in safety-critical environments.
method Imposing linear constraints on policy parameters' updating dynamics, using a DNN-based optimizer to satisfy these constraints.
result The policy decreases constraint violation and maximizes cumulative reward monotonically.

Algorithm ensures privacy while strictly adhering to constraints.

problem Differential privacy with linear constraints that must be strictly followed.
method Developed an algorithm that releases a nearly-optimal solution satisfying constraints with probability 1.
result Achieved nearly optimal performance while preserving privacy and strictly adhering to constraints.

DC3 uses deep learning to solve hard-constrained optimization problems efficiently.

problem Hard constraints in optimization problems make classical solvers slow and infeasible.
method DC3 employs a differentiable procedure to enforce feasibility and unrolls corrections for inequality constraints.
result DC3 achieves near-optimal solutions while maintaining feasibility in both synthetic and real-world tasks.

Study optimizes portfolio allocation policies using off-policy data and constraints.

problem Optimizing portfolio allocation policies under constraints using off-policy data.
method Solves a minimax objective with off-policy estimators and online learning to control constraint violations.
result Constructs near-optimal allocation policies for various regimes of operation and constraints.

Study optimal consumption and investment strategies with leverage constraints using Epstein-Zin utility.

problem Optimal portfolio choice under leverage constraints and Epstein-Zin utility.
method Established viscosity solution to HJB equation, demonstrated smoothness, characterized optimal strategies, derived explicit solutions.
result Explicit solutions for optimal consumption and investment strategies under leverage constraints.

Study examines how liquidity constraints impact optimal retirement decisions.

problem Impact of liquidity constraints on optimal retirement decisions.
method Analytical solution using duality method with different liquidity constraints.
result Sensitivity analysis reveals the effect of liquidity constraints on retirement decisions.

Recent work on Bayesian optimization has shown its effectiveness in global optimization of difficult black-box objective functions. Many real-world optimization problems of interest also have constraints which are unknown a priori. In this paper, we study Bayesian optimization for constrained problems in the general ca…

2014-03-22abs ↗pdf ↗

Study optimal policies under budget and coverage constraints.

problem Optimal policy learning with budget and coverage constraints.
method Combination of knapsack structure, affine threshold rule, linear programming relaxation, Greedy-Lagrangian (GLC), and rank-and-cut (RC) algorithms.
result GLC closely approximates the optimal solution and achieves near-optimal performance in finite samples; RC is approximately optimal under certain conditions.

VRSGT algorithm reduces orthogonality constraints in decentralized optimization.

problem Decentralized optimization with orthogonality constraints.
method VRSGT algorithm with variance reduction and orthogonal techniques.
result VRSGT achieves convergence rate of O(1 / k) for orthogonality constraints.

SAA method solves insurance portfolio optimization with CVaR constraints.

problem Optimal allocation under CVaR constraint in insurance.
method Sample Average Approximation (SAA) method applied to CVaR constrained portfolio optimization.
result Convergence of SAA method and solution uniqueness proved under mild assumptions.

New algorithms optimize actions under time-varying constraints without projecting.

problem Optimizing actions under time-varying constraints without projecting.
method Projection-free algorithms using linear optimization oracle.
result Guaranteed ildeO(T3/4) ilde{O}(T^{3/4}) regret and O(T7/8)O(T^{7/8}) constraints violation.

Hybrid quantum algorithm tackles binary optimization problems with multiple constraints.

problem Efficiently solving binary optimization problems with multiple constraints using quantum algorithms.
method Combines QAOA with penalty dephasing and Zeno effect for non-Ising constraints.
result Significant improvement in solving practical aircraft loading problems.

We reformulate data-dependent constraints to ensure they are always met with high probability.

problem Ensuring fairness and stability in machine learning models with data-dependent constraints.
method Calibrated reformulation of constraints to guarantee satisfaction with a specified probability.
result Our method guarantees that fairness constraints are met at test time with high probability.

Proposes a method to learn both constraints and objective functions from data.

problem Data-driven inverse optimization for mixed-integer linear programs (MILPs).
method Two-stage approach: first learns constraints, then estimates objective-function weights conditioned on learned constraints.
result Proposes and validates a method for learning both objective functions and constraints from data.

Study binary hypothesis testing with privacy and communication constraints.

problem Binary hypothesis testing under local differential privacy and communication constraints.
method Qualifies results as minimax or instance optimal, develops instance-optimal algorithms.
result Achieves minimum possible sample complexity under both privacy and communication constraints.

New algorithm tackles optimization with distributed constraints.

problem Optimization problems with generalized orthogonality constraints in a decentralized setting.
method Introduced a novel algorithm that tracks gradients and Jacobians simultaneously.
result Global convergence with an iteration complexity established.

Optimal dividend strategy with irreversible reinsurance constraints.

problem Maximizing dividends while adhering to ratcheting and irreversible reinsurance constraints.
method Modeling dividend and reinsurance levels as nondecreasing processes, solving Hamilton-Jacobi-Bellman equation.
result Threshold strategy is optimal for maximizing discounted dividends until ruin.

Optimistic algorithm reduces regret and constraint violations in online convex optimization with adversarial constraints.

problem Online convex optimization with adversarial constraints.
method Improved algorithm using accurate predictions of loss and constraint functions.
result Improved bounds on regret and cumulative constraint violations.

Parallel BO method for multi-objective optimization with constraints.

problem Optimizing multiple objectives under constraints with expensive evaluations.
method PPESMOC, a batch method for simultaneous optimization of black-box functions.
result Empirical evidence shows PPESMOC is effective for multi-objective optimization with constraints.

This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex transport constraints in addition to having given initial and terminal marginals. Sev…

2018-04-12abs ↗pdf ↗

New algorithm reduces regret and constraint violation in online convex optimization with complex constraints.

problem Online convex optimization with multiple functional constraints and a simple constraint set.
method Instance-dependent bound using online primal-dual mirror-prox algorithm in general normed spaces.
result Achieves an O(√V*(T)) regret and O(1) constraint violation, improving over previous works.

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…

2019-10-09abs ↗pdf ↗

Study uses DRL with Lagrangian relaxation to solve temporal control tasks with STL constraints.

problem Optimal control problems with temporal logic constraints.
method Extended CMDP formulation, Lagrangian relaxation, two-phase constrained DRL algorithm.
result Demonstrated learning performance of the proposed algorithm through simulations.

Tikhonov regularization is robust under specific martingale constraints in distributionally robust optimization.

problem Distributionally robust optimization and regularization of learning models.
method Optimal transport approach with martingale constraints.
result Tikhonov regularization is optimal transport robust under specified martingale constraints.

Quantum computing tackles non-convex portfolio optimization with cardinality constraints.

problem Non-convex portfolio optimization problems in asset management.
method Application of quantum annealing with non-linear cardinality constraints.
result Quantum portfolio optimization yields smaller, more profitable portfolios.

Paper proposes a model-free algorithm for CMDPs with long-term constraints, achieving optimal regret bounds.

problem Optimizing systems with long-term constraints where transition probabilities are unknown.
method Combines concepts from constrained optimization and Q-learning to propose an algorithm.
result Achieves optimal regret bounds for reward and constraint violation.

New method optimizes processes under constraints using bivariate Gaussian models.

problem Optimizing processes with constraints using traditional methods.
method Developed a constrained expected improvement acquisition function using bivariate Gaussian process models.
result Demonstrated improved performance in a manufacturing cure process optimization.

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…

2016-12-28abs ↗pdf ↗

Optimal bounds on regret and constraint violation in adversarial COCO.

problem Minimizing regret and cumulative constraint violation in adversarial COCO.
method New surrogate loss function and Follow-the-Regularized-Leader/Online Gradient Descent.
result Achieved optimal O(T)O(\sqrt{T}) bounds on both regret and cumulative constraint violation.

This paper considers online convex optimization (OCO) with stochastic constraints, which generalizes Zinkevich's OCO over a known simple fixed set by introducing multiple stochastic functional constraints that are i.i.d. generated at each round and are disclosed to the decision maker only after the decision is made. Th…

2017-08-12abs ↗pdf ↗

Paper studies optimal investing for retirees with risk constraints.

problem Retirees' longevity and living standard risks in a fluctuating market.
method Formulated as a portfolio choice problem under time-varying risk capacity constraint. Derived optimal investment strategy using differential equations. Demonstrated endogenous spending measure and active investment strategy.
result Time-varying risk capacity constraint impacts asset allocation in retirement.

Develops an algorithm for bilevel optimization with coupled constraints.

problem Challenges in bilevel optimization with coupled constraints.
method Primal-dual-assisted penalty approach and a fully first-order algorithm (BLOCC).
result Established rigorous convergence theory and demonstrated effectiveness on real-world applications.

Study optimal consumption with relaxed benchmarks and drawdown constraints.

problem Optimal consumption under relaxed benchmark tracking and consumption drawdown constraint.
method Transformed stochastic control problem into regular control problem with state-control constraints, then solved using dual transform and optimal consumption behavior.
result Closed-form solution for optimal investment and consumption in feedback form.

New algorithms for constrained online optimization with memory and predictions.

problem Control of constrained dynamical systems and scheduling with reconfiguration budgets.
method Proposed algorithms achieving sublinear regret and constraint violation under time-varying constraints, both with and without predictions.
result First algorithms achieving sublinear regret and constraint violation in constrained online optimization with memory.

USeMOC framework reduces expensive simulations for MO optimization with constraints.

problem Efficiently optimizing multi-objective problems with constraints using expensive function evaluations.
method USeMOC framework uses surrogate models to identify promising candidates and selects the best based on uncertainty.
result USeMOC achieves more than 90% reduction in function evaluations for circuit optimization.

New loss function handles uncertain constraints in CSLO problems.

problem Handling uncertain inequality constraints in CSLO with machine learning predictions.
method Introduces SPO-RC loss and SPO-RC+ surrogate, trains on truncated datasets, corrects bias.
result SPO-RC+ effectively manages constraint uncertainty and improves performance.

We explore machine learning methods for AC Optimal Powerflow (ACOPF) - the task of optimizing power generation in a transmission network according while respecting physical and engineering constraints. We present two formulations of ACOPF as a machine learning problem: 1) an end-to-end prediction task where we directly…

2019-10-19abs ↗pdf ↗

This paper considers online convex optimization over a complicated constraint set, which typically consists of multiple functional constraints and a set constraint. The conventional online projection algorithm (Zinkevich, 2003) can be difficult to implement due to the potentially high computation complexity of the proj…

2016-04-08abs ↗pdf ↗

The paper optimizes investment strategies with constraints for life-cycle models.

problem Maximizing consumption, death benefit, and wealth under trading constraints.
method Deep pricing kernel approach to solve constrained portfolio optimization.
result Individuals reduce consumption, insurance demand, and wealth due to constraints.