Homepage
Close
Menu

Site Navigation

  • Home
  • Archive(TODO)
    • By Day
    • By Month
  • About(TODO)
  • Stats
Close
by mblondel_ml on 2018-07-10 (UTC).

Smoothing the max operator in a dynamic program recursion induces a random walk on the computational graph. The expected path on that walk can be computed efficiently by backpropagation, which converges to backtracking as smoothing vanishes. https://t.co/AjyGsez1B1 pic.twitter.com/RZELfrmRqn

— Mathieu Blondel (@mblondel_ml) July 10, 2018
research
by avdnoord on 2018-07-11 (UTC).

Our latest work is out!
Representation Learning with Contrastive Predictive Coding (CPC).

Autoregressive modeling meets contrastive losses in the latent space.
Learn useful representations in an unsupervised way.
-> On Audio, Vision, NLP and RL.

Arxiv: https://t.co/HN0zChI9he pic.twitter.com/3Tnpqt9N0v

— Aäron van den Oord (@avdnoord) July 11, 2018
research

Tags

learning tutorial misc nlp rstats gan ethics research dataviz survey python tool security kaggle video thought bayesian humour tensorflow w_code bias dataset pytorch cv tip application javascript forecast swift golang rl jax julia gnn causal surey diffusion
© Copyright Philosophy 2018 Site Template by Colorlib