5 citations · 10 across the 6 of their papers we have counts for
7 papers
LLM Judge Validation Under Sparse Overlap: From Inference to Design
Junxuan Li, Arko Mukherjee, Soumyabrata Pal
Validating an LLM-as-a-judge requires estimating its agreement with humans, yet annotation budgets rarely allow every item to be multiply labeled. We prove that this overlap sparsi…
Agentic Planning with Reasoning for Image Styling via Offline RL
Subhojyoti Mukherjee, Stefano Petrangeli, Branislav Kveton +3
Direct prompt-based editing often fails on complex transformations because vague and subjective prompts often require nuanced understanding of what should be changed in the image.…
Abstract Operations Research Modeling Using Natural Language Inputs
Junxuan Li, Ryan Wickman, Sahil Bhatnagar +2
Operations research (OR) uses mathematical models to enhance decision-making, but developing these models requires expert knowledge and can be time-consuming. Automated mathematica…
Federated Graph Representation Learning using Self-Supervision
Susheel Suresh, Danny Godbout, Arko Mukherjee +3
Federated graph representation learning (FedGRL) brings the benefits of distributed training to graph structured data while simultaneously addressing some privacy and compliance co…
Enumerating Maximal Bicliques from a Large Graph using MapReduce
Arko Provo Mukherjee, Srikanta Tirthapura
We consider the enumeration of maximal bipartite cliques (bicliques) from a large graph, a task central to many practical data mining problems in social network analysis and bioinf…
Identifying Correlated Heavy-Hitters in a Two-Dimensional Data Stream
Bibudh Lahiri, Arko Provo Mukherjee, Srikanta Tirthapura
We consider online mining of correlated heavy-hitters from a data stream. Given a stream of two-dimensional data, a correlated aggregate query first extracts a substream by applyin…
Mining Maximal Cliques from an Uncertain Graph
Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura
We consider mining dense substructures (maximal cliques) from an uncertain graph, which is a probability distribution on a set of deterministic graphs. For parameter 0 < α < 1, we…