Search Results - deterministic approximate algorithm

No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians by Tian, Lai, So, Anthony Man-Cho

“… In this paper, we show that no deterministic algorithm can do the same. Moreover, even without the dimension-free requirement, we show that any finite-time deterministic method cannot be general zero-respecting…”
Get full text

Deterministic Approximate EM Algorithm; Application to the Riemann Approximation EM and the Tempered EM by Lartigue, Thomas, Durrleman, Stanley, Allassonnière, Stéphanie

“…The Expectation Maximisation (EM) algorithm is widely used to optimise non-convex likelihood functions with latent variables…”
Get full text

A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time by Lairez, Pierre

“…We describe a deterministic algorithm that computes an approximate root of  n complex polynomial equations…”
Get full text

Deterministic Approximate EM Algorithm; Application to the Riemann Approximation EM and the Tempered EM by Lartigue, Thomas, Durrleman, Stanley, Allassonnière, Stéphanie

“…The Expectation Maximisation (EM) algorithm is widely used to optimise non-convex likelihood functions with latent variables…”
Get full text

A New Quadratic Matrix Inequality Approach to Robust Adaptive Beamforming for General-rank Signal Model by Huang, Yongwei, Vorobyov, Sergiy A., Luo, Zhi-Quan

“… This is a nonconvex problem, and an approximate version of it (by introducing a matrix decomposition on the presumed covariance matrix of the desired signal…”
Get full text

No Dimension-Free Deterministic Algorithm Computes Approximate Stationarities of Lipschitzians by Lai, Tian, Anthony Man-Cho So

“… For the general Lipschitz setting, only recently, Zhang et al. [47] introduced a randomized algorithm that computes Goldstein's approximate stationarity [25…”
Get full text

Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler by Maximilian Probst Gutenberg, Wulff-Nilsen, Christian

“…\). In this article, we consider the problems for undirected, unweighted graphs. We present a new \emph{deterministic} algorithm for the decremental…”
Get full text

Fast Deterministic Fully Dynamic Distance Approximation by Brand, Jan Van Den, Forster, Sebastian, Nazari, Yasamin

“…In this paper, we develop deterministic fully dynamic algorithms for computing approximate distances in a graph with worst-case update time guarantees…”
Get full text

A deterministic near-linear time approximation scheme for geometric transportation by Fox, Emily, Lu, Jiashuai

“… \sum_{(p, q) \in P^{+} \times P^{-}} \tau(p, q) \cdot\|q-p\|_{2} is minimized. We present the first deterministic algorithm that computes, in near-linear time, a transportation map whose cost is within a (1+\varepsilon) factor of optimal…”
Get full text

Data-Driven Optimal Tracking Control for Discrete-Time Nonlinear Systems With Unknown Dynamics Using Deterministic ADP by Song, Shijie, Gong, Dawei, Zhu, Minglei, Zhao, Yuyang, Huang, Cong

“…) nonlinear systems with completely unknown dynamics. A novel data-driven deterministic approximate dynamic programming (ADP…”
Get full text

A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time by Lairez, Pierre

“…We describe a deterministic algorithm that computes an approximate root of n complex polynomial equations in n unknowns in average polynomial time with respect to the size of the input, in the Blum…”
Get full text

Accurate and Scalable Construction of Polygenic Scores in Large Biobank Data Sets by Yang, Sheng, Zhou, Xiang

“… DBSLMM also relies on a simple deterministic search algorithm to yield an approximate analytic estimation solution using summary statistics…”
Get more information

A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents by Linial, Nathan, Samorodnitsky, Alex, Wigderson, Avi

Get full text

Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions by De, Anindya, Diakonikolas, Ilias, Servedio, Rocco A.

“… Our algorithm extends a recent result [1] which gave a deterministic approximate counting algorithm for a single degree-2 polynomial threshold…”
Get full text

Deterministic Dynamic Matching in O(1) Update Time by Bhattacharya, Sayan, Chakrabarty, Deeparnab, Henzinger, Monika

“…We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions…”
Get full text

A linear time deterministic algorithm to find a small subset that approximates the centroid by Worah, Pratik, Sen, Sandeep

“…Given a set of points S in any dimension, we describe a deterministic algorithm for finding a T ⊂ S , | T | = O ( 1 / ε…”
Get full text

A Deterministic Reduction for the Gap Minimum Distance Problem by Cheng, Qi, Wan, Daqing

“…) ). In this paper, we derandomize the reduction and thus prove that there is no deterministic polynomial time algorithm to approximate the minimum distance to any constant…”
Get full text

Approximate centerpoints with proofs by Miller, Gary L., Sheehy, Donald R.

“…We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set…”
Get full text

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms by Magdalen Dobson Manohar, Shen, Zheqi, Blelloch, Guy E, Dhulipala, Laxman, Gu, Yan, Harsha Vardhan Simhadri, Sun, Yihan

“…Approximate nearest-neighbor search (ANNS) algorithms are a key part of the modern deep learning stack due to enabling efficient similarity search over high-dimensional vector space representations (i.e., embeddings) of data…”
Get full text

Towards derandomising Markov chain Monte Carlo by Feng, Weiming, Guo, Heng, Wang, Chunyang, Wang, Jiaheng, Yin, Yitong

“… approximate counting algorithms for hypergraph independent sets and hypergraph colourings, under local lemma type…”
Get full text