Phase-Selective Amplitude Amplification for Constrained Optimization

• URL: http://arxiv.org/abs/2607.18338v1
• Date: Sun, 19 Jul 2026 23:31:57 GMT
• Title: Phase-Selective Amplitude Amplification for Constrained Optimization
• Abstract summary: This work introduces a variant of amplitude amplification using stabilizer and blade qubits to improve boosting robustness across objective distributions.<n>Formal performance bounds and larger-scale validation are left for future research.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work introduces a variant of Grover amplitude amplification using stabilizer and blade qubits to improve boosting robustness across objective distributions. We give geometric intuition, example simulations, and discuss limitations. Formal performance bounds and larger-scale validation are left for future research.

Related papers

• Temper and Tilt Lead to SLOP: Reward Hacking Mitigation with Inference-Time Alignment [20.603753314256704]
  Inference-time alignment techniques offer a lightweight alternative or complement to costly reinforcement learning.<n>We extend these techniques by introducing reference-model temperature adjustment.<n>To reward hacking, we propose an algorithm for calibrating SLOP weight parameters.
  arXiv  Detail & Related papers  (2026-05-13T13:47:06Z)
• Generative Bayesian Hyperparameter Tuning [0.0]
  Cross-validation is often computationally prohibitive at scale, while fully Bayesian hyper- parameter learning can be difficult due to the cost of posterior sampling.<n>We develop a generative perspective that combines two ideas: (i) optimization-based approximations to Bayesian posteriors via randomized, weighted objectives (weighted Bayesian bootstrap) and (ii) repeated optimization across many hyper- parameter settings.
  arXiv  Detail & Related papers  (2025-12-23T05:00:52Z)
• Thompson Sampling via Fine-Tuning of LLMs [68.1722422968855]
  We propose an alternative based on Thompson sampling that eliminates the need for scalable large acquisition functions.<n>Our approach Thompson Sampling via Finening (ToSFiT) leverages the prior knowledge embedded in prompt-conditioned language models, and adapts incrementally toward the posterior.<n>Our analysis reveals the critical role of careful adaptation to the posterior probability of maximality-a principle that underpins our ToSFiT algorithm.
  arXiv  Detail & Related papers  (2025-10-15T09:13:59Z)
• A New Formulation of Lipschitz Constrained With Functional Gradient Learning for GANs [52.55025869932486]
  This paper introduces a promising alternative method for training Generative Adversarial Networks (GANs) on large-scale datasets with clear theoretical guarantees.<n>We propose a novel Lipschitz-constrained Functional Gradient GANs learning (Li-CFG) method to stabilize the training of GAN.<n>We demonstrate that the neighborhood size of the latent vector can be reduced by increasing the norm of the discriminator gradient.
  arXiv  Detail & Related papers  (2025-01-20T02:48:07Z)
• Verification of Geometric Robustness of Neural Networks via Piecewise Linear Approximation and Lipschitz Optimisation [57.10353686244835]
  We address the problem of verifying neural networks against geometric transformations of the input image, including rotation, scaling, shearing, and translation. The proposed method computes provably sound piecewise linear constraints for the pixel values by using sampling and linear approximations in combination with branch-and-bound Lipschitz. We show that our proposed implementation resolves up to 32% more verification cases than present approaches.
  arXiv  Detail & Related papers  (2024-08-23T15:02:09Z)
• An Element-wise RSAV Algorithm for Unconstrained Optimization Problems [13.975774245256561]
  We present a novel optimization algorithm, element-wise relaxed scalar auxiliary variable (E-RSAV) Our algorithm features rigorous proofs of linear convergence in the convex setting. We also propose an adaptive version of E-RSAV with Steffensen step size.
  arXiv  Detail & Related papers  (2023-09-07T20:37:23Z)
• Conditional Denoising Diffusion for Sequential Recommendation [62.127862728308045]
  Two prominent generative models, Generative Adversarial Networks (GANs) and Variational AutoEncoders (VAEs) GANs suffer from unstable optimization, while VAEs are prone to posterior collapse and over-smoothed generations. We present a conditional denoising diffusion model, which includes a sequence encoder, a cross-attentive denoising decoder, and a step-wise diffuser.
  arXiv  Detail & Related papers  (2023-04-22T15:32:59Z)
• Score-Guided Intermediate Layer Optimization: Fast Langevin Mixing for Inverse Problem [97.64313409741614]
  We prove fast mixing and characterize the stationary distribution of the Langevin Algorithm for inverting random weighted DNN generators. We propose to do posterior sampling in the latent space of a pre-trained generative model.
  arXiv  Detail & Related papers  (2022-06-18T03:47:37Z)
• Gaussian Blue Noise [49.45731879857138]
  We show that a framework for producing point distributions with blue noise spectrum attains unprecedented quality. Our algorithm scales smoothly and feasibly to high dimensions while maintaining the same quality.
  arXiv  Detail & Related papers  (2022-06-15T20:22:16Z)
• Long-distance distribution of qubit-qubit entanglement using Gaussian-correlated photonic beams [0.0]
  We investigate the deterministic generation and distribution of entanglement in large quantum networks by driving distant qubits with the output fields of a non-degenerate parametric amplifier. Our findings show that this passive conversion of Gaussian- into discrete- variable entanglement offers a robust and experimentally very attractive approach for operating large optical, microwave or hybrid quantum networks.
  arXiv  Detail & Related papers  (2022-04-06T18:00:01Z)
• Selective Cascade of Residual ExtraTrees [3.6575928994425735]
  We propose a novel tree-based ensemble method named Selective Cascade of Residual ExtraTrees (SCORE) SCORE draws inspiration from representation learning, incorporates regularized regression with variable selection features, and utilizes boosting to improve prediction and reduce generalization errors. Our computer experiments show that SCORE provides comparable or superior performance in prediction against ExtraTrees, random forest, gradient boosting machine, and neural networks.
  arXiv  Detail & Related papers  (2020-09-29T16:31:37Z)
• Extrapolation for Large-batch Training in Deep Learning [72.61259487233214]
  We show that a host of variations can be covered in a unified framework that we propose. We prove the convergence of this novel scheme and rigorously evaluate its empirical performance on ResNet, LSTM, and Transformer.
  arXiv  Detail & Related papers  (2020-06-10T08:22:41Z)

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.