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,742 papers · 148 categories

Trend · papers per month

4.2%8.3%12.5%16.7% · Apr 199519922001200920172026
48 results for unknown constraints

Iterative method learns unknown constraints for MPC control.

problem Learning to satisfy unknown polyhedral state constraints in iterative MPC.
method Collects and improves estimates of unknown constraints using collected data, designs an MPC controller to satisfy the estimated constraints.
result Robust and probabilistic guarantees of constraint satisfaction as a function of task iterations.

CoCoRL learns safe constraints from demonstrations with unknown rewards.

problem Learning safe constraints from demonstrations with different unknown rewards.
method Convex Constraint Learning for Reinforcement Learning (CoCoRL) constructs a convex safe set based on demonstrations.
result CoCoRL learns constraints that lead to safe driving behavior and can safely transfer to different tasks and environments.

Paper tackles SMPC for linear systems with unknown noise distribution.

problem Stochastic MPC for linear systems with chance state constraints and unknown noise distribution.
method Reformulate chance constraints, design robust benchmark SMPC, and develop adaptive SMPC with online noise statistics learning.
result Adaptive SMPC guarantees time-uniform satisfaction of unknown reformulated state constraints with high probability.

Safety filter for unknown discrete-time systems with learned models and noise covariance.

problem Ensuring safety for unknown discrete-time linear systems with Gaussian noise.
method Develops a learning-based safety filter using empirical model and noise covariance, optimizing control actions to stay within safety constraints.
result Minimally modifies nominal control actions to ensure safety with high probability, tightening constraints as more data is collected.

New methods for efficient exploration under unknown linear constraints in bandits.

problem Optimizing decisions under unknown linear constraints in bandit problems.
method Lagrangian relaxation, computationally efficient extensions of existing methods, constraint-adaptive stopping rule.
result LAGEX achieves asymptotically optimal sample complexity, LATS shows asymptotic optimality up to novel constants.

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 ↗

Efficient learning-based MPC for unknown nonlinear systems with state constraints.

problem Control of discrete-time nonlinear systems with unknown dynamics and state constraints.
method Receding horizon reinforcement learning (r-LPC) using Koopman operator-based prediction model.
result Proven closed-loop recursive feasibility, robustness, and asymptotic stability under function approximation errors.

New method optimizes costly functions with unknown costs and budget constraints.

problem Optimizing functions with unknown and heterogeneous evaluation costs under a budget constraint.
method Budgeted multi-step expected improvement acquisition function.
result Our method outperforms existing approaches in various synthetic and real problems.

New algorithm for reinforcement learning in uncertain environments with unknown thresholds.

problem Safety in reinforcement learning in unknown and uncertain environments.
method Growing-Window estimator sampling and Stochastic Pessimistic-Optimistic Thresholding (SPOT) algorithm.
result Achieves sublinear regret and constraint violation of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}).

Bandit algorithms have various application in safety-critical systems, where it is important to respect the system constraints that rely on the bandit's unknown parameters at every round. In this paper, we formulate a linear stochastic multi-armed bandit problem with safety constraints that depend (linearly) on an unkn…

2019-08-16abs ↗pdf ↗

c-lasso is a Python tool for robust and sparse regression with linear constraints.

problem Sparse and robust linear regression with linear constraints.
method Estimates coefficients and scale under linear constraints using perspective M-estimators.
result Provides estimators for various loss functions with linear constraints.

We outline new approaches to incorporate ideas from deep learning into wave-based least-squares imaging. The aim, and main contribution of this work, is the combination of handcrafted constraints with deep convolutional neural networks, as a way to harness their remarkable ease of generating natural images. The mathema…

2019-09-13abs ↗pdf ↗

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.

New RL algorithm tackles adversarial RMAB with unknown transitions and bandit feedback.

problem Learning in episodic RMAB with unknown transition functions and adversarial rewards.
method Developed a novel RL algorithm with a biased reward estimator and an index policy.
result Achieved ildeO(HT) ilde{\mathcal{O}}(H\sqrt{T}) regret bound for adversarial RMAB.

Symbolic regression is a type of discrete optimization problem that involves searching expressions that fit given data points. In many cases, other mathematical constraints about the unknown expression not only provide more information beyond just values at some inputs, but also effectively constrain the search space. …

2019-01-23abs ↗pdf ↗

Bayesian models use hyperparameters to indirectly assign priors, and this work shows how these priors can be derived from maximum entropy principles.

problem Understanding the assumptions and dependencies in Bayesian hierarchical models.
method Demonstrates how canonical distributions and maximum entropy principles can be used to derive marginal priors in hierarchical models.
result Marginal priors in hierarchical models derived from maximum entropy principles have different constraints compared to the original priors.

Algorithm solves two-sided matching markets with unknown preferences and constraints.

problem Two-sided online matching markets with complementary preferences and quota constraints.
method Formulated as a bandit learning problem, proposed MMTS algorithm combining Thompson Sampling and double matching.
result MMTS achieves stability and linear Bayesian regret with respect to quota and time horizon.

ARTEO algorithm optimizes safety-critical systems with uncertainty.

problem Decision-making under uncertainty with safety constraints in real-time optimization.
method ARTEO algorithm uses multi-armed bandits as a mathematical programming problem subject to safety constraints, learning unknown characteristics through exploration and incorporating uncertainty quantification.
result ARTEO achieves less cumulative regret with accurate and safe decisions.

Algorithm reduces regret in safe Bayesian optimization with monotonicity constraints.

problem Sequentially maximize unknown function with safety constraints.
method Sequential algorithms using Gaussian processes with safety constraints modeled as monotonicity.
result Sublinear regret achieved for expanding safe region and finding optimal ss.

KCRL learns stable policies for nonlinear systems with formal guarantees.

problem Lack of stabilization guarantees in RL methods for safety-critical systems.
method KCRL uses Krasovskii's Lyapunov functions as a stability constraint and a primal-dual approach to learn stabilizing policies.
result KCRL guarantees learning a stabilizing policy in a finite number of interactions.

Two new algorithms optimize rewards while respecting safety constraints in sequential decisions.

problem Optimizing rewards with safety constraints in sequential decisions.
method Stage-wise conservative linear Thompson Sampling (SCLTS) and stage-wise conservative linear UCB (SCLUCB).
result Probabilistic regret bounds of order O(\sqrt{T} \log^{3/2}T) and O(\sqrt{T} \log T).

We study statistical detection of grayscale objects in noisy images. The object of interest is of unknown shape and has an unknown intensity, that can be varying over the object and can be negative. No boundary shape constraints are imposed on the object, only a weak bulk condition for the object's interior is required…

2011-02-23abs ↗pdf ↗

In many practical problems, a learning agent may want to learn the best action in hindsight without ever taking a bad action, which is significantly worse than the default production action. In general, this is impossible because the agent has to explore unknown actions, some of which can be bad, to learn better action…

2018-06-03abs ↗pdf ↗

The paper analyzes regret in online recommendation systems with constraints.

problem Analyzing regret in online recommendation systems with user-item constraints.
method Theoretical analysis and algorithm design considering user-item constraints and unknown probabilities.
result Derives regret lower bounds and algorithms achieving these limits for various structural assumptions.

We analyse the definition of quasi-local energy in GR based on a Hamiltonian analysis of the Einstein-Hilbert action initiated by Brown-York. The role of the constraint equations, in particular the Hamiltonian constraint on the timelike boundary, neglected in previous studies, is emphasized here. We argue that a consis…

2010-08-25abs ↗pdf ↗

Paper proposes a shape-constrained approach to distributionally robust learning.

problem Challenges in statistical learning under distribution shift.
method Shape-constrained approach to distributionally robust learning (DRL). Assumes isotonic density ratio.
result Improved accuracy demonstrated in empirical studies.

Adapting Hedge algorithm for semi-adversarial data with root-entropy regularization.

problem Minimizing regret in prediction with expert advice under varying distributions.
method Follow-the-Regularized-Leader (FTRL) with root-entropy regularization.
result Adaptive minimax optimal regret across all levels of constraint sets.

We study the constrained linear quadratic regulator with unknown dynamics, addressing the tension between safety and exploration in data-driven control techniques. We present a framework which allows for system identification through persistent excitation, while maintaining safety by guaranteeing the satisfaction of st…

2018-09-26abs ↗pdf ↗

We develop a novel method for detection of signals and reconstruction of images in the presence of random noise. The method uses results from percolation theory. We specifically address the problem of detection of multiple objects of unknown shapes in the case of nonparametric noise. The noise density is unknown and ca…

2013-10-31abs ↗pdf ↗

ACOL learns constraints from human preferences in driving simulations.

problem Learning constraints from human preferences in driving simulations.
method Adaptive Constraint Learning (ACOL) algorithm for constrained linear best-arm identification.
result ACOL's sample complexity matches worst-case lower bound and is significantly tighter in the average case.