Love, Regrets and Hope — Again


It feels like: Returning
To my place
A palace…lit with dark

Exasperated , lost, beatified
After a long —
Thirsty walk
Thro’ the Meadows dark —
A desert devoid.

And at last
There was that sheen — that call.
A smile spread: sweeping broad.

From the snaky swallowing isthmus,

Search Based Structured Prediction — by Graham Neubig

In our last few lecture notes(11 , 12 & 13) we have been talking all about Structured Prediction, i.e., predicting a label for input sequence, where the space of all possible labels is too big, but has some inherent structure. …

Parsing with Dynamic Programming — by Graham Neubig

Previous Post : Lecture 12

Prerequisites : Context Free Grammars, Chomsky Normal Form, CKY Algorithm. You can read about them from here.

In the following, “grammar” refers to CFG. CKY algorithm is also referred to as CYK algorithm, sometimes.

In this lecture…

Generating Incremental Trees — Part 1 : by Graham Neubig

In this lecture, we learn how to adapt the structure of outputs of a neural net to predict some tree structure over an input sequence.

What kind of tree structure over the sequence ?

First, note that the words in…

A collection of important points while going through the course “Audio Signal Processing for Music Applications” by Xavier Serra and Prof. Julius O. Smith, III on Coursera .

The STFT of a windowed signal is in the shape of DFT of the window, but repeated at the frequencies(k0 and -k0)…

Network Routing (with Failures)

Last time , we discussed two routing protocols, Link State Routing(L.S.R.) and Distance Vector Routing Protocol(D.V.R.P.). This lecture discusses how networks with these Routing protocols behave in case of failures, and how to resolve them.

Types of Failures

  1. A packet (in particular, an advertisement) may get lost.
  2. A link…

Network Routing (Without Failures)

Problem : We talked before about these special kind of computers in our network called, switches , that implement a set of rules deciding on which outward link to send a packet received from some in-ward link. …

MAC Protocols


The basic problem that we are trying to figure out is how to share a medium of communication(Ethernet, or range of frequencies, etc.) between several nodes trying to communicate using the shared medium ?


We simplify our problem by assuming that only one device can communicate using the…

MIT 8.02 Lecture 17 Packet Switching

1.) Problem :- You can design reliable connection b/w 2 nodes. You want to allow any device in your network to communicate with any other. And, the network should be application agnostic. [[May not be optimal for a particular application]]

2.) Three themes …

Structured Prediction with Local independence Assumptions — Graham Neubig

Structured prediction” is used for prediction problems where the input is a sentence, and the label assigned to a sentence comes from a space whose size is exponential in length of the input sentence, or infinite. Some examples for these are…

Jeevesh Juneja

Searching 🧐 for the forgotten and lost truths

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store