Search Results for author:
Found 5 papers, 0 papers with code
Enigma: Privacy-Preserving Execution of QAOA on Untrusted Quantum Computers
As quantum computers are expensive and hard to maintain, the typical model for performing quantum computation is to send the circuit to a quantum cloud provider.
A Penalty-Based Method for Communication-Efficient Decentralized Bilevel Programming
A key feature of the proposed algorithm is to estimate the hyper-gradient of the penalty function via decentralized computation of matrix-vector products and few vector communications, which is then integrated within an alternating algorithm to obtain finite-time convergence analysis under different convexity assumptions.
Sparse Universum Quadratic Surface Support Vector Machine Models for Binary Classification
Further, we propose the L1 norm regularized version that is beneficial for detecting potential sparsity patterns in the Hessian of the quadratic surface and reducing to the standard linear models if the data points are (almost) linearly separable.
Density Estimation using Entropy Maximization for Semi-continuous Data
Using simulations, we show that the estimate of the entropy produced by our algorithm has significantly less bias compared to existing methods.
Quadratic Surface Support Vector Machine with L1 Norm Regularization
We propose $\ell_1$ norm regularized quadratic surface support vector machine models for binary classification in supervised learning.
