Risultati della ricerca - decoding ((algorithm OR Algorithms) OR (algorithmics OR algorithmics))

Hardness of Maximum Likelihood Learning of DPPs di Grigorescu, Elena, Juba, Brendan, Wimmer, Karl, Xie, Ning

Sommario: “... the likelihood of the data is typically desirable. The algorithms used for this task to date either optimize over...”
Testo

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme di Li, Xiaxin, Mazumdar, Arya

Sommario: “...) and within the general sublinear regime $K=Θ(N^α)$ where $0<α<1$, our algorithm has a decoding complexity...”
Testo

Entangled Mean Estimation in High-Dimensions di Diakonikolas, Ilias, Kane, Daniel M., Liu, Sihan, Pittas, Thanasis

Sommario: “... computationally efficient algorithm achieving an information-theoretically near-optimal error. Specifically, we...”
Testo

All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free di Fischer, Orr, Parter, Merav

Sommario: “... results are general compilers that take any Congested Clique algorithm and simulate it, in a round...”
Testo

Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time di Li, Xiaxin, Mazumdar, Arya

Sommario: “... methods minimize the number of measurements but often incur $Ω(n)$ decoding complexity, limiting large...”
Testo

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences di Gabric, Daniel, Imam, Wazed, Jones, Lukas Janik, Sawada, Joe

Sommario: “... decoding (ranking/unranking) algorithms. In this paper we develop the first polynomial time/space decoding...”
Testo

Recursive decoding of binary rank Reed-Muller codes and Plotkin construction for matrix codes di Couvreur, Alain, Pratihar, Rakhi

Sommario: “... complexity beats that of the recently proposed decoding algorithm for arbitrary rank metric Reed-Muller codes...”
Testo

The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding di Gu, Shouzhen, Wang, Lily, Kubica, Aleksander

Sommario: “...The decoding problem is a ubiquitous algorithmic task in fault-tolerant quantum computing...”
Testo

Coupling without Communication and Drafter-Invariant Speculative Decoding di Daliri, Majid, Musco, Christopher, Suresh, Ananda Theertha

Sommario: “... algorithm. This bound was shown to be optimal in the worst-case by [Bavarian et al., 2020]. In this work, we...”
Testo

Data-driven decoding of quantum error correcting codes using graph neural networks di Lange, Moritz, Havström, Pontus, Srivastava, Basudha, Bengtsson, Isak, Bergentall, Valdemar, Hammar, Karl, Heuts, Olivia, van Nieuwenburg, Evert, Granath, Mats

Sommario: “... whereas decoders based on more efficient algorithms give sub-optimal performance. In addition...”
Testo

Breeding 5.0: Artificial intelligence (AI)‐decoded germplasm for accelerated crop innovation di Jiayi Fu, Shouzhi Zheng, Longjiang Fan, Xiaoming Zheng, Qian Qian

Sommario: “...Breeding 5.0: Artificial intelligence (AI)‐decoded germplasm for accelerated crop innovation Jiayi...”
Testo

Retrieval with Learned Similarities di Ding, Bailu, Zhai, Jiaqi

Sommario: “... (MIPS) algorithms for efficient retrieval. However, state-of-the-art retrieval algorithms have migrated...”
Testo

Compression with Privacy-Preserving Random Access di Chandar, Venkat, Tchamkerten, Aslan, Vatedka, Shashank

Sommario: “... at any rate above entropy such that the individual decoding of any $X_i$ reveals \emph{no} information...”
Testo

Comparison of linear and nonlinear methods for decoding selective attention to speech from ear-EEG recordings di Thornton, Mike, Mandic, Danilo, Reichenbach, Tobias

Sommario: “... decoding algorithms were next compared, including stimulus-reconstruction algorithms based on linear...”
Testo

Average-Case Complexity of Quantum Stabilizer Decoding di Khesin, Andrey Boris, Lu, Jonathan Z., Poremba, Alexander, Ramkumar, Akshar, Vaikuntanathan, Vinod

Sommario: “... of the algorithmic hardness of decoding random quantum versus random classical codes. We prove that decoding a random...”
Testo

SpecTr: Fast Speculative Decoding via Optimal Transport di Sun, Ziteng, Suresh, Ananda Theertha, Ro, Jae Hun, Beirami, Ahmad, Jain, Himanshu, Yu, Felix

Sommario: “..., and even prohibitive in certain tasks. One way to speed up sampling is $\textit{speculative decoding}$: use...”
Testo

Block Verification Accelerates Speculative Decoding di Sun, Ziteng, Mendlovic, Uri, Leviathan, Yaniv, Aharoni, Asaf, Ro, Jae Hun, Beirami, Ahmad, Suresh, Ananda Theertha

Sommario: “... guarantee of the standard speculative decoding verification algorithm, cannot deteriorate performance...”
Testo

Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound di Li, Songsong, Liu, Shu, Ma, Liming, Wan, Yunqi, Xing, Chaoping

Sommario: “..., burst errors often allow for the design of more efficient decoding algorithms. However, achieving both...”
Testo

Explicit Good Codes Approaching Distance 1 in Ulam Metric di Goldenberg, Elazar, Habib, Mursalin, S, Karthik C.

Sommario: “...$ in poly$(n)$ time and can also decode in poly$(n)$ time, a permutation $π$ on $[n]$ to its closest...”
Testo

Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning di Golowich, Noah, Moitra, Ankur, Rohatgi, Dhruv

Sommario: “..., by exhibiting a class of block MDPs and associated decoding functions where reward-free exploration is provably...”
Testo