Skip to content
Code for "Efficient optimization of loops and limits with randomized telescoping sums"
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
awd_lstm_lm
README.md
adaptive_randomized_telescope.py
enwik_runner.py add run scripts and modify code to actual version that was run on server May 13, 2019
lv_runner.py Initial commit May 13, 2019
mnist_runner.py
optimize_sampling_greedy.py Initial commit May 13, 2019
optimize_sampling_greedy_roulette.py
randomized_telescope.py Initial commit May 13, 2019
randomized_telescope_runner.py add run scripts and modify code to actual version that was run on server May 13, 2019
run_experiments.sh
run_for_paper.sh add run scripts and modify code to actual version that was run on server May 13, 2019
run_for_paper_meta.sh
run_for_train_horizons.sh add run scripts and modify code to actual version that was run on server May 13, 2019
run_gridsearch.sh add run scripts and modify code to actual version that was run on server May 13, 2019
run_lv.sh add run scripts and modify code to actual version that was run on server May 13, 2019
run_proc.sh
tensorboard_logger.py
timer.py
util.py

README.md

Code for "Efficient optimization of loops and limits with randomized telescoping sums", Alex Beatson and Ryan Adams, ICML 2019.

Todo:

  • finish cleaning up and commenting code
  • add requirements
  • double check this runs cleanly
  • add usage instructions and flesh out readme
You can’t perform that action at this time.