Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Feras A. Saad

Feras A. Saad

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Complexity×1Algorithms×1Info Theory×1Probability×1Prog. Lang.×1ML×1

Frequent co-authors

Thomas L. Draper1×
Gaurav Arya1×
Mathieu Huot1×
Moritz Schauer1×
Alexander K. Lew1×

Research Timeline

2026
GradInf: Gradient Estimation as Probabilistic Inference

This paper introduces gradient inference, a new approach to developing sound and efficient gradient estimators for probabilistic programs by reducing gradient estimation to a related probabilistic inference problem.

Space-Entropy Lower Bounds for Random Sampling

This paper proves space lower bounds for entropy-efficient random sampling using i.i.d. uniform bits.

Highlighted terms show continued research focus across papers

Papers

cs.CCcs.DScs.ITTheoreticalRecentJul 16, 2026

Space-Entropy Lower Bounds for Random Sampling

Thomas L. Draper, Feras A. Saad

This paper proves space lower bounds for entropy-efficient random sampling using i.i.d. uniform bits.

View →
cs.PLcs.LGTheoretical
Recent
Jul 8, 2026

GradInf: Gradient Estimation as Probabilistic Inference

Gaurav Arya, Mathieu Huot, Moritz Schauer, Alexander K. Lew +1 more

This paper introduces gradient inference, a new approach to developing sound and efficient gradient estimators for probabilistic programs by reducing gradient estimation to a related probabilistic inf…

View →