69 citations · 88 across the 9 of their papers we have counts for
10 papers
Data Efficiency for Large Recommendation Models
Kshitij Jain, Jingru Xie, Kevin Regan +9
Large recommendation models (LRMs) are fundamental to the multi-billion dollar online advertising industry, processing massive datasets of hundreds of billions of examples before t…
Compatible Paths on Labelled Point Sets
Elena Arseneva, Yeganeh Bahoo, Ahmad Biniaz +8
Let and be finite point sets of the same cardinality in , each labelled from to . Two noncrossing geometric graphs and spanning and …
Unsupervised Multilingual Alignment using Wasserstein Barycenter
Xin Lian, Kshitij Jain, Jakub Truszkowski +2
We study unsupervised multilingual alignment, the problem of finding word-to-word translations between multiple languages without using any parallel data. One popular strategy is t…
Face flips in origami tessellations
Hugo A. Akitaya, Vida Dujmovi, David Eppstein +3
Given a flat-foldable origami crease pattern (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment …
Representation Learning for Dynamic Graphs: A Survey
Seyed Mehran Kazemi, Rishab Goel, Kshitij Jain +4
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learni…
Reconfiguring Undirected Paths
Erik D. Demaine, David Eppstein, Adam Hesterberg +4
We consider problems in which a simple path of fixed length, in an undirected graph, is to be shifted from a start position to a goal position by moves that add an edge to either e…
Token Swapping on Trees
Ahmad Biniaz, Kshitij Jain, Anna Lubiw +6
The input to the token swapping problem is a graph with vertices , and tokens with labels , one on each vertex. The goal is to get token…
Maximum Matchings and Minimum Blocking Sets in -Graphs
Therese Biedl, Ahmad Biniaz, Veronika Irvine +3
-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilatera…
Minimum Shared-Power Edge Cut
Sergio Cabello, Kshitij Jain, Anna Lubiw +1
We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s and t, and the…
Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges
Therese Biedl, Timothy M. Chan, Martin Derka +2
Let be an -node tree of maximum degree 4, and let be a set of points in the plane with no two points on the same horizontal or vertical line. It is an open question…