Optimal robust stimulated Raman exact passage by inverse optimization

• URL: http://arxiv.org/abs/2209.07631v1
• Date: Thu, 15 Sep 2022 22:19:04 GMT
• Title: Optimal robust stimulated Raman exact passage by inverse optimization
• Authors: Xavier Laforgue, Ghassen Dridi and St\'ephane Gu\'erin
• Abstract summary: Control fields temporal shapes that are optimal with respect to pulse area, energy, and duration are found to form a simple sequence. Alternative optimal solutions featuring lower losses, larger pulse areas, and fully counter-intuitive pulse sequences are derived.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We apply the inverse geometric optimization technique to generate an optimal and robust stimulated Raman exact passage (STIREP) considering the loss of the upper state as a characterization parameter. Control fields temporal shapes that are optimal with respect to pulse area, energy, and duration, are found to form a simple sequence with a combination of intuitively (near the beginning and the end) and counter-intuitively ordered pulse pairs. The resulting dynamics produces a loss which is about a third of that of the non-robust optimal STIREP. Alternative optimal solutions featuring lower losses, larger pulse areas, and fully counter-intuitive pulse sequences are derived.

Related papers

• Faster WIND: Accelerating Iterative Best-of-$N$ Distillation for LLM Alignment [81.84950252537618]
  This paper reveals a unified game-theoretic connection between iterative BOND and self-play alignment. We establish a novel framework, WIN rate Dominance (WIND), with a series of efficient algorithms for regularized win rate dominance optimization.
  arXiv  Detail & Related papers  (2024-10-28T04:47:39Z)
• Optimizing EPR pulses for broadband excitation and refocusing [0.0]
  We numerically optimize broadband pulse shapes that maximize Hahn echo amplitudes. Pulses are parameterized as neural networks (NN), nonlinear amplitude limited Fourier series (FS), and discrete time series (DT)
  arXiv  Detail & Related papers  (2024-05-31T15:41:19Z)
• Provably Mitigating Overoptimization in RLHF: Your SFT Loss is Implicitly an Adversarial Regularizer [52.09480867526656]
  We identify the source of misalignment as a form of distributional shift and uncertainty in learning human preferences. To mitigate overoptimization, we first propose a theoretical algorithm that chooses the best policy for an adversarially chosen reward model. Using the equivalence between reward models and the corresponding optimal policy, the algorithm features a simple objective that combines a preference optimization loss and a supervised learning loss.
  arXiv  Detail & Related papers  (2024-05-26T05:38:50Z)
• Optimal STIRAP shortcuts using the spin to spring mapping [0.0]
  We derive shortcuts to adiabaticity maximizing population transfer in a three-level $Lambda$ quantum system. We solve the spring optimal control problem and obtain analytical expressions for the impulses, the durations of the zero control intervals and the singular control.
  arXiv  Detail & Related papers  (2023-12-27T17:11:59Z)
• Online Continuous Hyperparameter Optimization for Generalized Linear Contextual Bandits [55.03293214439741]
  In contextual bandits, an agent sequentially makes actions from a time-dependent action set based on past experience. We propose the first online continuous hyperparameter tuning framework for contextual bandits. We show that it could achieve a sublinear regret in theory and performs consistently better than all existing methods on both synthetic and real datasets.
  arXiv  Detail & Related papers  (2023-02-18T23:31:20Z)
• Optimal shortcuts of Stimulated Raman Adiabatic Passage in the presence of dissipation [0.0]
  We use optimal control theory to obtain shortcuts to adiabaticity in a three-level STIRAP system. We fix the sum of the intensities of the pump and Stokes pulses and use the mixing angle as the sole control variable.
  arXiv  Detail & Related papers  (2022-12-26T17:35:08Z)
• Perfect stimulated Raman adiabatic passage with imperfect finite-time pulses [0.0]
  We present a well-tailored sequence of two Gaussian-pulsed drives that achieves perfect population transfer in STImulated Raman Adiabatic Passage (STIRAP) Subject to optimal truncation of the drives and with reference to the point of fastest transfer, we obtain a new adiabaticity criteria, which is remarkably simple and effective.
  arXiv  Detail & Related papers  (2022-04-11T17:20:11Z)
• Non-Convex Optimization with Certificates and Fast Rates Through Kernel Sums of Squares [68.8204255655161]
  We consider potentially non- optimized approximation problems. In this paper, we propose an algorithm that achieves close to optimal a priori computational guarantees.
  arXiv  Detail & Related papers  (2022-04-11T09:37:04Z)
• Optimal shape of STIRAP pulses for large dissipation at the intermediate level [0.0]
  We study the problem of maximizing population transfer efficiency in the STIRAP system. We find the control fields which maximize the population transfer to the target state for a given duration $T$.
  arXiv  Detail & Related papers  (2021-12-27T11:52:06Z)
• Direct Optimal Control Approach to Laser-Driven Quantum Particle Dynamics [77.34726150561087]
  We propose direct optimal control as a robust and flexible alternative to indirect control theory. The method is illustrated for the case of laser-driven wavepacket dynamics in a bistable potential.
  arXiv  Detail & Related papers  (2020-10-08T07:59:29Z)
• Distributionally Robust Bayesian Optimization [121.71766171427433]
  We present a novel distributionally robust Bayesian optimization algorithm (DRBO) for zeroth-order, noisy optimization. Our algorithm provably obtains sub-linear robust regret in various settings. We demonstrate the robust performance of our method on both synthetic and real-world benchmarks.
  arXiv  Detail & Related papers  (2020-02-20T22:04:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.