Amir Najafi

Orcid: 0000-0002-6680-0110

Affiliations:
  • Sharif University of Technology, Computer Engineering Department, Tehran, Iran


According to our database1, Amir Najafi authored at least 22 papers between 2011 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Federated Ensemble Learning with Progressive Model Personalization.
CoRR, February, 2026

Efficient Adversarial Attacks on High-dimensional Offline Bandits.
CoRR, February, 2026

2025
Fundamental Limits of Learning High-dimensional Simplices in Noisy Regimes.
CoRR, June, 2025

Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations.
CoRR, June, 2025

Navigating the MIL Trade-Off: Flexible Pooling for Whole Slide Image Classification.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

New Algorithmic Directions in Optimal Transport and Applications for Product Spaces.
Proceedings of the 36th International Symposium on Algorithms and Computation, 2025

Certifiably Robust Model Evaluation in Federated Learning under Meta-Distributional Shifts.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
Robust Model Evaluation over Large-scale Federated Networks.
CoRR, 2024

Gradual Domain Adaptation via Manifold-Constrained Distributionally Robust Optimization.
CoRR, 2024

Gradual Domain Adaptation via Manifold-Constrained Distributionally Robust Optimization.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

Out-Of-Domain Unlabeled Data Improves Generalization.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2022
Sample Complexity Bounds for Learning High-dimensional Simplices in Noisy Regimes.
CoRR, 2022

2020
Regularizing Recurrent Neural Networks via Sequence Mixup.
CoRR, 2020

2019
Statistical Association Mapping of Population-Structured Genetic Data.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

Robustness to Adversarial Perturbations in Learning from Incomplete Data.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Manifold Mixup: Better Representations by Interpolating Hidden States.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
On Statistical Learning of Simplices: Unmixing Problem Revisited.
CoRR, 2018

2017
Reliable Learning of Bernoulli Mixture Models.
CoRR, 2017

2016
Nonlinear Dimensionality Reduction via Path-Based Isometric Mapping.
IEEE Trans. Pattern Anal. Mach. Intell., 2016

Fundamental Limits of Pooled-DNA Sequencing.
CoRR, 2016

2012
Sum capacity bounds and design of errorless codes for binary asynchronous CDMA systems.
Proceedings of the 19th International Conference on Telecommunications, 2012

2011
A content-based digital image watermarking algorithm robust against JPEG compression.
Proceedings of the 2011 IEEE International Symposium on Signal Processing and Information Technology, 2011


  Loading...