Ronen Eldan

Orcid: 0000-0002-0678-741X

According to our database1, Ronen Eldan authored at least 44 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone.
CoRR, 2024

Great, Now Write an Article About That: The Crescendo Multi-Turn LLM Jailbreak Attack.
CoRR, 2024

2023
TinyGSM: achieving >80% on GSM8k with small language models.
CoRR, 2023

Positional Description Matters for Transformers Arithmetic.
CoRR, 2023

Fast relaxation of the random field Ising dynamics.
CoRR, 2023

Who's Harry Potter? Approximate Unlearning in LLMs.
CoRR, 2023

Textbooks Are All You Need II: phi-1.5 technical report.
CoRR, 2023

Textbooks Are All You Need.
CoRR, 2023

TinyStories: How Small Can Language Models Be and Still Speak Coherent English?
CoRR, 2023

Sparks of Artificial General Intelligence: Early experiments with GPT-4.
CoRR, 2023

An Optimal "It Ain't Over Till It's Over" Theorem.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Second-Order Bounds on Correlations Between Increasing Families.
Comb., December, 2022

Community detection and percolation of information in a geometric setting.
Comb. Probab. Comput., 2022

Hit-and-run mixing via localization schemes.
CoRR, 2022

Unveiling Transformers with LEGO: a synthetic reasoning task.
CoRR, 2022

Isoperimetric Inequalities Made Simpler.
CoRR, 2022

Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains.
CoRR, 2022

Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains (extended abstract).
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Kernel-based Methods for Bandit Convex Optimization.
J. ACM, 2021

Non-asymptotic approximations of neural networks by Gaussian processes.
Proceedings of the Conference on Learning Theory, 2021

2020
Reduction From Non-Unique Games To Boolean Unique Games.
Electron. Colloquium Comput. Complex., 2020

Network size and weights size for memorization with two-layers neural networks.
CoRR, 2020

Concentration on the Boolean hypercube via pathwise stochastic analysis.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Network size and size of the weights in memorization with two-layers neural networks.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
The Entropic Barrier: Exponential Families, Log-Concave Geometry, and Self-Concordance.
Math. Oper. Res., 2019

Stability of Talagrand's influence inequality.
CoRR, 2019

Krivine diffusions attain the Goemans-Williamson approximation ratio.
CoRR, 2019

Stability of the Shannon-Stam inequality via the Föllmer process.
CoRR, 2019

Depth Separations in Neural Networks: What is Actually Being Separated?
Proceedings of the Conference on Learning Theory, 2019

2018
Efficient algorithms for discrepancy minimization in convex sets.
Random Struct. Algorithms, 2018

Sampling from a Log-Concave Distribution with Projected Langevin Monte Carlo.
Discret. Comput. Geom., 2018

2017
Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors.
Random Struct. Algorithms, 2017

Exponential random graphs behave like mixtures of stochastic block models.
CoRR, 2017

2016
Testing for high-dimensional geometry in random graphs.
Random Struct. Algorithms, 2016

Information and dimensionality of anisotropic random geometric graphs.
CoRR, 2016

The Power of Depth for Feedforward Neural Networks.
Proceedings of the 29th Conference on Learning Theory, 2016

Multi-scale exploration of convex functions and bandit convex optimization.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Finite-Time Analysis of Projected Langevin Monte Carlo.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Talagrand's Convolution Conjecture on Gaussian Space.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

The entropic barrier: a simple and optimal universal self-concordant barrier.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
From trees to seeds: on the inference of the seed from large trees in the uniform attachment model.
CoRR, 2014

2011
A Polynomial Number of Random Points Does Not Determine the Volume of a Convex Body.
Discret. Comput. Geom., 2011


  Loading...