No article text was recorded for this version.
Lipschitz constant sensitivity
Version 2 of 236 papers47 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Safe Learning and Optimization Techniques: Towards a Survey of the State of the Art
- Blog: Are Evolutionary Algorithms Safe Optimizers?
- Blog: Transfer Learning in Bandits With Latent Continuity
- Blog: Safe Exploration for Interactive Machine Learning
- Blog: Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates
- Blog: Lipschitz Safe Bayesian Optimization for Automotive Control
- Blog: PAC Optimal Exploration in Continuous Space Markov Decision Processes
- Blog: Safe Exploration for Optimization with Gaussian Processes
- Blog: Efficient and Safe Exploration in Deterministic Markov Decision Processes with Unknown Transition Models
- Blog: Iterative data-driven inference of nonlinearity measures via successive graph approximation
- Blog: Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints
- Blog: Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations
- Blog: Off-Policy Interval Estimation with Lipschitz Value Iteration
- Blog: Benefits of monotonicity in safe exploration with Gaussian processes
- Blog: Identifying regions of trusted predictions
- Blog: Information-Theoretic Safe Exploration with Gaussian Processes
- Blog: Conservative collision prediction and avoidance for stochastic trajectories in continuous time and space
- Blog: Classification Confidence Scores with Point-wise Guarantees
- Blog: On Safety in Safe Bayesian Optimization
- Blog: Safe and Efficient Model-free Adaptive Control via Bayesian Optimization
- Blog: Safe Zeroth-Order Optimization Using Linear Programs
- Blog: Decentralized diffusion-based learning under non-parametric limited prior knowledge
- Blog: Partial Identification of Policy Values under Network Interference
- Blog: Transfer Learning for Control Systems via Neural Simulation Relations
- Blog: Smooth Sailing: Lipschitz-Driven Uncertainty Quantification for Spatial Associations
- Blog: Long-Term Safe Reinforcement Learning with Binary Feedback
- Blog: Transfer of Safety Controllers Through Learning Deep Inverse Dynamics Model
- Blog: Context-based Unsupervised Data Fusion for Decision Making
- Blog: Data-Driven Abstraction and Synthesis for Stochastic Systems with Unknown Dynamics
- Blog: Smoothing policies and safe policy gradients
- Blog: Regret Bounds for Risk-sensitive Reinforcement Learning with Lipschitz Dynamic Risk Measures
- Blog: Combining Bayesian optimization and Lipschitz optimization
- Blog: Safe Time-Varying Optimization based on Gaussian Processes with Spatio-Temporal Kernel
- Blog: No-Regret Algorithms for Safe Bayesian Optimization with Monotonicity Constraints
- Blog: Continuous-time Data-driven Barrier Certificate Synthesis
- Blog: Reachability Analysis of Deep Neural Networks with Provable Guarantees
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_lipschitz_constant_sensitivity_00479941,
title = {Lipschitz constant sensitivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lipschitz-constant-sensitivity/rdr_00479941e8804090a72d7c2e92844ad9},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_lipschitz_constant_sensitivity_00479941_v2,
title = {Lipschitz constant sensitivity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/lipschitz-constant-sensitivity/rdr_00479941e8804090a72d7c2e92844ad9/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}