$ALGO algorithm
Counts every occurrence ofalgorithm, algorithms in arXiv titles and abstracts.
Price
Daily candles and credits traded. Today's candle is live.
Trade
Every player starts with 10,000 credits of play money.
Daily arXiv hits
settled still being announced 7-day average
Where it's used · 30 days
Share of hits by each paper's main arXiv category, from 2,379 papers.
Latest papers
-
Quantum Feature Selection for Biomedical Data Analysis
…Bias-Field Digitized Counterdiabatic Quantum Optimization (BF-DCQO) and Quantum Approximate Optimization Algorithm (QAOA) on a quantum gate based computer. We also compared the method to several classical methods…
-
How Not to Build Microcrypt
…computed given the description of an efficient preparation circuit for the state. We also give new algorithms for NP-aided learning of unitaries given polynomially many queries to the unitary. By building on…
-
Frobenius lifts and point counting for smooth curves
We describe an algorithm for computing the zeta function of a proper, smooth curve over a finite field $k$ of characteristic…
-
PoEM: Predicting RL Outcomes from Existing Policies
…estimated using only the reward or basis policy outputs on the samples. We turn these observations into an algorithm that takes post-trained models and a new reward function, and approximates the target RL policy…
-
Riemannian Gradient Descent for Gaussian Mixture Models with unknown diagonal covariances
…Our contributions are twofold. First, we provide theoretical guarantees for the convergence of our algorithm. In particular, we establish exponential local convergence under a non-degeneracy condition on the…
-
A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies in the Membership Oracle Model
We prove nearly quadratic lower bounds for randomized algorithms for linear optimization and uniform sampling over convex bodies in the membership oracle model.…
-
ReVAMP: Vector-Accelerated Motion Planning for Kinematically-Constrained Systems via Reparameterization
…When such constraints reduce the valid configuration space to a measure-zero subset, sampling based planning algorithms require modifications to draw feasible samples. For many common end-effector constraints,…
-
Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems
…this result with a worst-case lower bound of $\Omega(\varepsilon^{-2/(3p-1)})$ for every deterministic algorithm in the $p$th-order oracle model, without restricting the algorithm to tensor steps or any other…
Dividends per share
| Day | Hits | Per share |
|---|---|---|
| Wed 23 Sep | 203 | 2.03 |
Recent trades
| When (UTC) | Side | Shares | Credits | Price after |
|---|---|---|---|---|
| 27 Sep 00:31 | buy | 1.74 | 500.00 | 286.96 |