Related papers: A complex-projected Rayleigh quotient iteration fo…
Existing face restoration models have relied on general assessment metrics that do not consider the characteristics of facial regions. Recent works have therefore assessed their methods using human studies, which is not scalable and…
The method of random projection (RP) is the standard technique in machine learning and many other areas, for dimensionality reduction, approximate near neighbor search, compressed sensing, etc. Basically, RP provides a simple and effective…
The QR algorithm is one of the three phases in the process of computing the eigenvalues and the eigenvectors of a dense nonsymmetric matrix. This paper describes a task-based QR algorithm for reducing an upper Hessenberg matrix to real…
The deep Q-network (DQN) and return-based reinforcement learning are two promising algorithms proposed in recent years. DQN brings advances to complex sequential decision problems, while return-based algorithms have advantages in making use…
Solving real-time quadratic programming (QP) is a ubiquitous task in control engineering, such as in model predictive control and control barrier function-based QP. In such real-time scenarios, certifying that the employed QP algorithm can…
Quantum optimization for computed tomography (CT) reconstruction is constrained by the number of binary variables required for image representation, making direct whole-image quantum reconstruction difficult for large or structurally…
Quantizing deep neural networks is an effective method for reducing memory consumption and improving inference speed, and is thus useful for implementation in resource-constrained devices. However, it is still hard for extremely low-bit…
We study the performance of our previously proposed Projective Quantum Eigensolver (PQE) on IBM's quantum hardware in conjunction with error mitigation techniques. For a single qubit model of H$_2$, we find that we are able to obtain…
The use of mid-circuit measurement and qubit reset within quantum programs has been introduced recently and several applications demonstrated that perform conditional branching based on these measurements. In this work, we go a step further…
Many problems require the selection of a subset of variables from a full set of optimization variables. The computational complexity of an exhaustive search over all possible subsets of variables is, however, prohibitively expensive,…
The problem of data-driven recursive computation of receding horizon LQR control through a randomized combination of online/current and historical/recorded data is considered. It is assumed that large amounts of historical input-output data…
A classical approach for solving discrete time nonlinear control on a finite horizon consists in repeatedly minimizing linear quadratic approximations of the original problem around current candidate solutions. While widely popular in many…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
We propose Quantum Riemannian Hamiltonian Descent (QRHD), a quantum algorithm for continuous optimization on Riemannian manifolds that extends Quantum Hamiltonian Descent (QHD) by incorporating geometric structure of the parameter space via…
In off-policy policy evaluation (OPE) tasks within reinforcement learning, Temporal Difference Learning(TD) and Fitted Q-Iteration (FQI) have traditionally been viewed as differing in the number of updates toward the target value function:…
We extend the classical primal-dual interior point method from the Euclidean setting to the Riemannian one. Our method, named the Riemannian interior point method, is for solving Riemannian constrained optimization problems. We establish…
In the iterative algorithm recently proposed by Waxman for solving eigenvalue problems, we point out that the convergence rate may be improved. For many non-singular symmetric potentials which vanish asymptotically, a simple analytical…
In this work we investigate a binned version of Quantum Phase Estimation (QPE) set out by [Somma 2019] and known as the Quantum Eigenvalue Estimation Problem (QEEP). Specifically, we determine whether the circuit decomposition techniques we…
This paper introduces a method for computing eigenvalues and eigenvectors of a generalized Hermitian, matrix eigenvalue problem. The work is focused on large scale eigenvalue problems, where the application of a direct inverse is out of…
Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this…