The paper interprets policy-gradient algorithms using continuation theory.
problem Optimizing nonconvex functions in reinforcement learning.
method Formulates policy optimization as optimization by continuation, interprets policy-gradient algorithms as implicitly optimizing deterministic policies.
result Exploration in policy-gradient algorithms is seen as computing a continuation of the return of the policy.
Bayes-CPACE optimally explores continuous BAMDPs.
problem Model uncertainty in continuous state and action spaces.
method Covering state-belief-action space with samples, exploiting Lipschitz continuity.
result Near-optimal value function computed efficiently.
Proposes a continuous relaxation for discrete Bayesian optimization.
problem Efficiently optimizing discrete data with limited target observations.
method Continuous relaxation of objective function, incorporating prior knowledge.
result Optimization can be computationally tractable with few observations.
KOOW method provides optimal covariate balance for continuous treatments.
problem Estimating effects of continuous treatments with robustness to model misspecification and extreme weights.
method Kernel Optimal Orthogonality Weighting (KOOW) using convex optimization.
result KOOW provides optimal covariate balance and controls for extreme weights.
Bayesian optimization tackles mixed discrete-continuous problems with Gaussian processes.
problem Optimizing problems with both discrete and continuous variables using costly simulations.
method Relaxing discrete variables into continuous latent variables, using Bayesian optimization, and incorporating compatibility constraints with Lagrangians.
result Comparative analysis of different mixed Bayesian optimization approaches.
The paper studies continuous submodular functions and their optimization.
problem Maximizing continuous submodular functions in poly. time.
method Characterization of continuous submodularity, operations preserving it, and algorithms for constrained maximization.
result Continuous submodularity is equivalent to a weak DR property, leading to continuous DR-submodular functions with the full DR property.
New research suggests continual learning should focus on both optimization objective and optimization trajectory.
problem Even with perfect joint loss approximation, continual learning still suffers from forgetting when starting a new task.
method Proposes focusing on both optimization objective and optimization trajectory, combining replay-approximated joint objectives with gradient projection-based optimization routines.
result Combining replay-approximated joint objectives with gradient projection-based optimization routines did not show clear benefits in initial experiments.
New model prevents forgetting in continual learning.
problem Learning from a continuous stream of tasks without forgetting.
method Bayesian Optimized Continual Learning with Attention Mechanism (BOCL).
result BOCL outperforms state-of-the-art in preventing catastrophic forgetting and fitting new tasks better.
New algorithm optimizes Hölder continuous functions efficiently.
problem Optimizing Hölder continuous multivariate functions.
method Uses a query creation rule for global optimization, avoiding proxy functions.
result Achieves an average regret bound of $O(T^{- racα{n}})$ for Hölder exponent α. Investment strategy optimization from discrete to continuous models.
problem Optimizing investment strategies and stopping times in both continuous and discrete settings.
method Characterized value functions via quadratic reflected BSDEs for continuous case, discretized BSDEs for discrete case, and derived uniform convergence rates.
result Uniform convergence and rate from discrete to continuous quadratic reflected BSDEs.
iMOCA optimizes multiple objectives with continuous approximations for resource efficiency.
problem Optimizing multiple objectives with continuous function approximations that balance accuracy and evaluation cost.
method Information-Theoretic Multi-Objective Bayesian Optimization with Continuous Approximations (iMOCA) selects input and function approximations to maximize information gain per unit cost.
result iMOCA significantly improves over existing single-fidelity methods in approximating the optimal Pareto set.
Novel proof shows continuity of optimal transport feasible set mapping.
problem Continuity of feasible set mapping in optimal transport problems.
method Presented a novel and shorter proof of continuity.
result Established continuity of the feasible set mapping.
Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.
problem Optimal stopping problems with finite-time horizon and state-dependent discounting.
method Linear diffusion process, time-homogeneous gain function, fine regularity properties, continuity and strict monotonicity proof.
result Proves continuity and strict monotonicity of the optimal stopping boundary under mild assumptions.
This paper tackles convex-submodular minimax problems in mixed continuous-discrete domains.
problem Convex-submodular minimax problems in mixed continuous-discrete domains.
method Introduces new notions of optimality and proposes iterative algorithms combining discrete and continuous optimization.
result Characterizes convergence rates, computational complexity, and quality of solutions for convex and monotone-submodular minimax problems.
CAQL tackles continuous action maximization in Q-learning.
problem Maximizing continuous actions in Q-learning.
method Developed CAQL algorithms using plug-and-play optimizers and MIP for optimal max-Q.
result CAQL outperforms policy-based methods in heavily constrained environments.
A new method for optimizing functions with both categorical and continuous variables.
problem Optimizing functions with mixed categorical and continuous variables.
method Formulates as a multi-armed bandit problem, uses Thompson sampling, extends to batch BO.
result Proves sub-linear regret bounds and demonstrates effectiveness on various benchmarks.
A new method for hierarchical clustering using continuous embeddings and optimization.
problem Hierarchical clustering with provable quality guarantees.
method Continuous relaxation of discrete optimization problem using hyperbolic embeddings and decoding.
result Continuous relaxation yields a discrete tree with (1 + epsilon)-factor approximation for optimal tree.
Paper introduces a continuous convexity measure for compact sets.
problem Lack of continuity in existing convexity measures.
method Enriched axioms with continuity hypothesis in Hausdorff's sense.
result Theoretical grounding and continuous convexity measure construction.
New method solves continuous time mean-variance model for consistent investment strategy.
problem Time-consistent optimal strategy for continuous time mean-variance model.
method Developed a new Bellman principle method.
result Obtained a time-consistent dynamic optimal strategy.
Optimal task order improves continual learning performance.
problem Challenges in neural networks learning multiple tasks in sequence.
method Linear teacher-student model with latent factors, derived analytical expression.
result Two principles for optimal task order: least representative first and dissimilar adjacent tasks.
Study continuous treatment policy evaluation and optimization.
problem Policy evaluation and learning from batched contextual bandit data with continuous treatments.
method Extended IPW and DR methods using kernel functions for continuous settings.
result Consistent policy estimator and convergent regret for learnable policy classes.
A new method for continuous control avoids local movement issues.
problem Limitations of policy gradient methods in continuous control.
method Distributional framework and Generative Actor Critic (GAC) method.
result GAC outperforms policy gradient methods in continuous domains.
New method uses continuous OT for fairness, outperforming discrete OT.
problem Fairness issues in machine learning models.
method Stochastic-gradient fairness method based on continuous optimal transport.
result Continuous OT method outperforms discrete OT when data is limited.
Proves FR-NGD optimally approximates evolutionary dynamics and continuous Bayesian inference.
problem Optimizing continuous time replicator equations and continuous Bayesian inference.
method Fisher-Rao natural gradient descent (FR-NGD) and its correspondence with evolutionary dynamics.
result FR-NGD optimally approximates continuous time replicator equations and continuous Bayesian inference.
New approach shows continuity and compactness of martingale measures.
problem Stability of martingale optimal transport problem.
method Set-valued map theory and lower-upper hemicontinuity.
result Lower and upper hemicontinuity of the set of martingale measures.
Consider power utility maximization of terminal wealth in a 1-dimensional continuous-time exponential Levy model with finite time horizon. We discretize the model by restricting portfolio adjustments to an equidistant discrete time grid. Under minimal assumptions we prove convergence of the optimal discrete-time strate…
The paper explores how accelerated methods in optimization can be understood through a continuous-time perspective.
problem Understanding the natural scope of acceleration in optimization methods.
method A variational perspective using a Bregman Lagrangian to study accelerated methods in optimization.
result Accelerated methods can be seen as traveling the same curve in spacetime at different speeds, providing a unified view.
Optimizes hybrid dividend strategies in dual models with periodic and continuous payments.
problem Determining the best dividend strategy in a dual model with periodic and continuous payments.
method Generalizes results from a Brownian model to a dual (spectrally positive Lévy) model, using the scale function.
result The optimal strategy is of the hybrid-barrier type and can be expressed using the scale function.
Paper tackles risk-sensitive impulse control for continuous-time processes.
problem Risk-sensitive impulse control for continuous-time Feller-Markov processes.
method Probabilistic approach to solve Bellman equation and construct optimal strategy.
result Optimal strategy approximated by dyadic impulse strategies.
New method optimizes decision-making in uncertain environments.
problem Optimal decision-making under partial observability.
method Nested sequential Monte Carlo algorithm for continuous POMDPs.
result Demonstrated effectiveness on continuous POMDP benchmarks.
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.
Continuous-time algorithms improve online learning performance.
problem Online learning with sequential data and minimizing overall regret.
method Extending discrete-time algorithms to continuous-time models for online linear optimization, adversarial bandit, and adversarial linear bandit.
result Optimal regret bounds are proven for continuous-time settings.
We aim to construct the optimal solutions to the undiscounted continuous-time infinite horizon optimization problems, the objective functionals of which may be unbounded. We identify the condition under which the limit of the solutions to the finite horizon problems is optimal for the infinite horizon problems under th…
Efficient deep policy gradient method for continuous-time control problems.
problem Optimal control in continuous time with fine time discretization.
method Multi-scale deep policy gradient method with varying time discretization.
result Targeted efficiency in computational resources achieved through multi-scale approach.
CMA-ES is a method for optimizing complex functions.
problem Optimizing non-linear, non-convex functions in continuous domains.
method Covariance Matrix Adaptation Evolution Strategy (CMA-ES).
result CMA-ES is effective for optimizing complex functions.
New continuous-time optimization algorithms converge in finite time to local minima.
problem Finding local minima in optimization problems.
method Discontinuous dynamical systems with finite-time convergence via Lyapunov-based differential inequality.
result Finite-time convergence to strict local minima with provable settling time.
Ada-BKB optimizes black-box functions on continuous domains with adaptive discretization.
problem Optimizing functions with continuous domains using Gaussian process optimization.
method Adaptive discretization of the function domain to avoid non-convex optimization costs.
result Ada-BKB algorithm runs in O(T2dexteff2), significantly faster than existing methods. The paper proves optimal smoothness for certain Lagrangian graphs with specific Hölder continuity.
problem Optimal regularity for Hölder continuous Hamiltonian stationary Lagrangian graphs.
method Establishing smoothness conditions based on Hölder exponent and Lagrangian phase properties.
result Smoothness of graphs is achieved when Hölder exponent is strictly greater than 1/3 and Lagrangian phase is supercritical.
Paper proves EM algorithm convergence for mixtures of discrete and continuous parameters.
problem Nontrivial convergence analysis for EM algorithms with mixed-integer parameters.
method Introduces conditions for EM convergence in mixed-integer optimization.
result Proves convergence of EM-based sparse Bayesian learning algorithm.
CRA improves UL-based CO solvers by dynamically smoothing and enforcing discreteness.
problem Local optima and artificial rounding issues in UL-based CO solvers.
method Continuous Relaxation Annealing (CRA) strategy that dynamically shifts from continuous to discrete solutions.
result Significantly enhances UL-based CO solver performance and eliminates artificial rounding.
Hybrid Policy Optimization tackles reinforcement learning in hybrid spaces, improving performance over PPO.
problem Credit assignment issues and biased gradients in hybrid discrete-continuous action spaces.
method Mixed gradient estimator combining pathwise and score-function gradients, reformulating problems in hybrid form.
result HPO substantially outperforms PPO on inventory control and switched systems, with performance gaps increasing with continuous action dimension.
Paper studies continuous prediction with experts' advice using differential equations.
problem Continuous prediction with experts' advice in online learning.
method Continuous-time stochastic calculus and differential equations.
result Improved guarantees for quantile regret with continuous-time algorithm.
Bilevel Continual Learning improves continual learning by transferring knowledge effectively.
problem Catastrophic forgetting and poor generalization in continual learning.
method Bilevel optimization and dual memory management strategies.
result BCL achieves effective knowledge transfer and alleviates catastrophic forgetting.
A graph VAE framework optimizes neural architectures in a continuous space.
problem Discovering efficient neural architectures in a discrete space.
method Graph VAE framework with VAE and GNN components, joint learning of predictors and decoders.
result The framework discovers powerful neural architectures with both excellent performance and high computational efficiency.
New approach to continual learning prioritizes adaptation over retention.
problem Catastrophic forgetting in lifelong learning models.
method Formalized CL as an online optimization problem, introduced Transfer Efficiency, and derived a Critical Task Duration.
result Retention can hinder real-time adaptation in non-stationary environments.
Optimal binning method for numeric targets using mathematical programming.
problem Optimizing the discretization of numeric variables for classification.
method Mathematical programming formulation for binary, continuous, and multi-class targets with constraints.
result Convex mixed-integer programming formulations for all target types.
Study on optimal portfolio selection with varying borrowing and saving rates in continuous-time markets.
problem Optimal portfolio selection in markets with different borrowing and saving rates.
method Hamilton-Jacobi-Bellman equation, partial differential equation, verification argument.
result Existence and smoothness of the value function, identification of trading regions and strategies.
Optimal contracts remain linear in output when both moral hazard and adverse selection are present.
problem Optimal compensation problems involving competing principals with uncertainty from both moral hazard and adverse selection.
method Continuous-time setting with risk-averse agent controlling drift of output process driven by Brownian motion. Shows linear contracts hold under type-dependent reservation utilities.
result Optimal contracts remain linear in output when both moral hazard and adverse selection are present.