Oracle Operators for Non-Boolean Functions

• URL: http://arxiv.org/abs/2212.03933v1
• Date: Wed, 7 Dec 2022 19:58:11 GMT
• Title: Oracle Operators for Non-Boolean Functions
• Authors: Fatema Elgebali and Wolfgang Scherer
• Abstract summary: We present a construction of a general oracle operator for a real-valued function on the Boolean cube. We use such operators in Shyamsundar's Non-Boolean Amplitude Amplification [arXiv:2102.04975] to solve binary optimization problems with a non-adiabatic algorithm.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a construction of a general oracle operator for a real-valued function on the Boolean cube. As an application, we use such operators in Shyamsundar's Non-Boolean Amplitude Amplification [arXiv:2102.04975] to solve binary optimization problems with a non-adiabatic algorithm.

Related papers

• Thompson Sampling in Function Spaces via Neural Operators [14.0301500809197]
  We propose an extension of Thompson sampling to optimization problems over function spaces where the objective is a known functional of an unknown operator's output.<n>Our algorithm employs a sample-then-optimize approach using neural operator surrogates.
  arXiv  Detail & Related papers  (2025-06-27T04:21:57Z)
• Pruned-ADAPT-VQE: compacting molecular ansätze by removing irrelevant operators [0.0]
  ADAPT-VQE is a derivative-assembled pseudo-Trotter variational quantum eigensolver. It selects operators based on their gradient, constructing ans"atze that continuously evolve to match the energy landscape. We propose an automated, cost-free refinement method that removes unnecessary operators from the ansatz.
  arXiv  Detail & Related papers  (2025-04-07T00:54:31Z)
• Basis-to-Basis Operator Learning Using Function Encoders [16.128154294012543]
  We present Basis-to-Basis (B2B) operator learning, a novel approach for learning operators on Hilbert spaces of functions. We derive operator learning algorithms that are directly analogous to eigen-decomposition and singular value decomposition.
  arXiv  Detail & Related papers  (2024-09-30T19:18:34Z)
• Bregman-divergence-based Arimoto-Blahut algorithm [53.64687146666141]
  We generalize the Arimoto-Blahut algorithm to a general function defined over Bregman-divergence system. We propose a convex-optimization-free algorithm that can be applied to classical and quantum rate-distortion theory.
  arXiv  Detail & Related papers  (2024-08-10T06:16:24Z)
• A Unified Differentiable Boolean Operator with Fuzzy Logic [26.04871601931393]
  We present a unified differentiable operator for implicit solid shape modeling using Constructive Solid Geometry (CSG) Our proposed operator opens up new possibilities for future research toward fully continuous CSG optimization.
  arXiv  Detail & Related papers  (2024-07-15T17:52:22Z)
• Parameterized Projected Bellman Operator [64.129598593852]
  Approximate value iteration (AVI) is a family of algorithms for reinforcement learning (RL) We propose a novel alternative approach based on learning an approximate version of the Bellman operator. We formulate an optimization problem to learn PBO for generic sequential decision-making problems.
  arXiv  Detail & Related papers  (2023-12-20T09:33:16Z)
• Digging Deeper: Operator Analysis for Optimizing Nonlinearity of Boolean Functions [8.382710169577447]
  We investigate the effects of genetic operators for bit-string encoding in optimizing nonlinearity. By observing the range of possible changes an operator can provide, one can use this information to design a more effective combination of genetic operators.
  arXiv  Detail & Related papers  (2023-02-12T10:34:01Z)
• Will Bilevel Optimizers Benefit from Loops [63.22466953441521]
  Two current popular bilevelimats AID-BiO and ITD-BiO naturally involve solving one or two sub-problems. We first establish unified convergence analysis for both AID-BiO and ITD-BiO that are applicable to all implementation choices of loops.
  arXiv  Detail & Related papers  (2022-05-27T20:28:52Z)
• A Quantum-Inspired Classical Solver for Boolean k-Satisfiability Problems [0.0]
  We describe an algorithmic approach to the k-satisfiability (k-SAT) problem that is inspired by the amplification amplification algorithm. We then discuss meaningfully leveraging this setting in a classical digital or analog computing setting to identify the strengths and limitations of AmplifySAT.
  arXiv  Detail & Related papers  (2021-09-21T16:10:52Z)
• Bayesian Bellman Operators [55.959376449737405]
  We introduce a novel perspective on Bayesian reinforcement learning (RL) Our framework is motivated by the insight that when bootstrapping is introduced, model-free approaches actually infer a posterior over Bellman operators, not value functions.
  arXiv  Detail & Related papers  (2021-06-09T12:20:46Z)
• Glushkov's construction for functional subsequential transducers [91.3755431537592]
  Glushkov's construction has many interesting properties and they become even more evident when applied to transducers. Special flavour of regular expressions is introduced, which can be efficiently converted to $epsilon$-free functional subsequential weighted finite state transducers.
  arXiv  Detail & Related papers  (2020-08-05T17:09:58Z)
• A quantum algorithm to estimate the Gowers $U_2$ norm and linearity testing of Boolean functions [6.8072479152471566]
  We propose a quantum algorithm to estimate the Gowers $U$ norm of a Boolean function. We extend it into a second algorithm to distinguish between linear Boolean functions and Boolean functions that are $epsilon$-far from the set of linear Boolean functions.
  arXiv  Detail & Related papers  (2020-06-30T04:39:20Z)
• Efficient improper learning for online logistic regression [68.8204255655161]
  It is known that any proper algorithm which has logarithmic regret in the number of samples (denoted n) necessarily suffers an exponential multiplicative constant in B. In this work, we design an efficient improper algorithm that avoids this exponential constant while preserving a logarithmic regret. Our new algorithm based on regularized empirical risk minimization with surrogate losses satisfies a regret scaling as O(B log(Bn)) with a per-round time-complexity of order O(d2)
  arXiv  Detail & Related papers  (2020-03-18T09:16:14Z)

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.