activity
20182025
most citedApproximation power of random neural networks

7 citations · 13 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2025★ 1 cited

Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning

Haiming Wang, Mert Unsal, Xiaohan Lin +37

We introduce Kimina-Prover Preview, a large language model that pioneers a novel reasoning-driven exploration paradigm for formal theorem proving, as showcased in this preview rele…

quant-ph2024

51% Attack via Difficulty Increase with a Small Quantum Miner

Bolton Bailey, Or Sattath

We present a strategy for a single quantum miner with relatively low hashing power, with the same ramifications as a 51% attack. Bitcoin nodes consider the chain with the highest c…

cs.LG2019★ 4 cited

A gradual, semi-discrete approach to generative network training via explicit Wasserstein minimization

Yucheng Chen, Matus Telgarsky, Chao Zhang +3

This paper provides a simple procedure to fit generative networks to target distributions, with the goal of a small Wasserstein distance (or other optimal transport costs). The app…

cs.LG2019★ 7 cited

Approximation power of random neural networks

Bolton Bailey, Ziwei Ji, Matus Telgarsky +1

This paper investigates the approximation power of three types of random neural networks: (a) infinite width networks, with weights following an arbitrary distribution; (b) finite…

cs.LG2018★ 1 cited

Size-Noise Tradeoffs in Generative Networks

Bolton Bailey, Matus Telgarsky

This paper investigates the ability of generative networks to convert their input noise distributions into other distributions. Firstly, we demonstrate a construction that allows R…