Ankur Mallick

Orcid: 0009-0009-7068-5627

According to our database1, Ankur Mallick authored at least 24 papers between 2016 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Tetris: Efficient Intra-Datacenter Calls Packing for Large Conferencing Services.
CoRR, August, 2025

BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute.
CoRR, June, 2025

Enhancing Reasoning Capabilities of Small Language Models with Blueprints and Prompt Template Search.
CoRR, June, 2025

Exploring How LLMs Capture and Represent Domain-Specific Knowledge.
CoRR, April, 2025

Serving Models, Fast and Slow:Optimizing Heterogeneous LLM Inferencing Workloads at Scale.
CoRR, February, 2025

Performance Aware LLM Load Balancer for Mixed Workloads.
Proceedings of the 5th Workshop on Machine Learning and Systems, 2025

2024
Ensuring Fair LLM Serving Amid Diverse Applications.
CoRR, 2024

EcoAct: Economic Agent Determines When to Register What Action.
CoRR, 2024

Intelligent Router for LLM Workloads: Improving Performance Through Workload-Aware Scheduling.
CoRR, 2024

Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Probabilistic Methods for Mitigating Uncertainties in Large-Scale Computing and Machine Learning
PhD thesis, 2023

2022
Matchmaker: Data Drift Mitigation in Machine Learning for Large-Scale Systems.
Proceedings of the Fifth Conference on Machine Learning and Systems, 2022

Rateless Sum-Recovery Codes For Distributed Non-Linear Computations.
Proceedings of the IEEE Information Theory Workshop, 2022

2021
Deep kernels with probabilistic embeddings for small-data learning.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Rateless Codes for Distributed Non-linear Computations.
Proceedings of the 11th International Symposium on Topics in Coding, 2021

2020
Probabilistic Neighbourhood Component Analysis: Sample Efficient Uncertainty Estimation in Deep Learning.
CoRR, 2020

2019
Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication.
Proc. ACM Meas. Anal. Comput. Syst., 2019

Deep Probabilistic Kernels for Sample-Efficient Learning.
CoRR, 2019

Rateless Codes for Distributed Computations with Sparse Compressed Matrices.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Fast and Efficient Distributed Matrix-vector Multiplication Using Rateless Fountain Codes.
Proceedings of the IEEE International Conference on Acoustics, 2019

2018
Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication.
CoRR, 2018

2016
Bandlimited Field Reconstruction from Samples Obtained at Unknown Random Locations on a Grid.
CoRR, 2016

Bandlimited field reconstruction from samples obtained on a discrete grid with unknown random locations.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016


  Loading...