Výsledky vyhľadávania - deterministic approximate algorithm

No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians Autor 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…”
Získať plný text

Deterministic Approximate EM Algorithm; Application to the Riemann Approximation EM and the Tempered EM Autor 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…”
Získať plný text

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

“…We describe a deterministic algorithm that computes an approximate root of  n complex polynomial equations…”
Získať plný text

Deterministic Approximate EM Algorithm; Application to the Riemann Approximation EM and the Tempered EM Autor 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…”
Získať plný text

A New Quadratic Matrix Inequality Approach to Robust Adaptive Beamforming for General-rank Signal Model Autor 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…”
Získať plný text

No Dimension-Free Deterministic Algorithm Computes Approximate Stationarities of Lipschitzians Autor 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…”
Získať plný text

Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler Autor 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…”
Získať plný text

Fast Deterministic Fully Dynamic Distance Approximation Autor 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…”
Získať plný text

A deterministic near-linear time approximation scheme for geometric transportation Autor 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…”
Získať plný text

Data-Driven Optimal Tracking Control for Discrete-Time Nonlinear Systems With Unknown Dynamics Using Deterministic ADP Autor 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…”
Získať plný text

A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time Autor 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…”
Získať plný text

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

“… DBSLMM also relies on a simple deterministic search algorithm to yield an approximate analytic estimation solution using summary statistics…”
Zistit podrobnosti o prístupe

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

Získať plný text

Deterministic Approximate Counting for Juntas of Degree-2 Polynomial Threshold Functions Autor 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…”
Získať plný text

Deterministic Dynamic Matching in O(1) Update Time Autor 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…”
Získať plný text

A linear time deterministic algorithm to find a small subset that approximates the centroid Autor 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 / ε…”
Získať plný text

A Deterministic Reduction for the Gap Minimum Distance Problem Autor 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…”
Získať plný text

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

“…We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set…”
Získať plný text

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms Autor 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…”
Získať plný text

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

“… approximate counting algorithms for hypergraph independent sets and hypergraph colourings, under local lemma type…”
Získať plný text