activity
20232026
collaborators

6 papers

cs.LG2026

BRANCH-MoE: Balance-Aware Tree Routing for Large Embedding Models

Gang Fu, Adel Javanmard, MohammadHossein Bateni +1

Mixture-of-experts (MoE) layers increase model capacity without a proportional increase in per-example computation. However, conventional flat routers can yield imbalanced expert u…

cs.LG2025

Bipartite Ranking From Multiple Labels: On Loss Versus Label Aggregation

Michal Lukasik, Lin Chen, Harikrishna Narasimhan +7

Bipartite ranking is a fundamental supervised learning problem, with the goal of learning a ranking over instances with maximal Area Under the ROC Curve (AUC) against a single bina…

cs.LG2025

DeepCrossAttention: Supercharging Transformer Residual Connections

Mike Heddes, Adel Javanmard, Kyriakos Axiotis +3

Transformer networks have achieved remarkable success across diverse domains, leveraging a variety of architectural innovations, including residual connections. However, traditiona…

cs.LG2024

SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization

Taisuke Yasuda, Kyriakos Axiotis, Gang Fu +2

Neural network pruning is a key technique towards engineering large yet scalable, interpretable, and generalizable models. Prior work on the subject has developed largely along two…

cs.LG2024

Learning from Aggregate responses: Instance Level versus Bag Level Loss Functions

Adel Javanmard, Lin Chen, Vahab Mirrokni +2

Due to the rise of privacy concerns, in many practical applications the training data is aggregated before being shared with the learner, in order to protect privacy of users' sens…

cs.LG2023

Greedy PIG: Adaptive Integrated Gradients

Kyriakos Axiotis, Sami Abu-al-haija, Lin Chen +2

Deep learning has become the standard approach for most machine learning tasks. While its impact is undeniable, interpreting the predictions of deep learning models from a human pe…