جست‌وجوی استاد و پژوهشگر

Sunita Sarawagiمشاهده پروفایل

استاد

• Machine Learning
• Data Analytics
• Databases
• +۱۰ مورد دیگر

Sunita Sarawagi is a Professor at Computer Science and Engineering , IIT Bombay, and a member of AI Labs@CSE . She is also associated with the Center for Machine Intelligence and Data Science (CMInDS), which she founded in 2020. Education: PhD in Computer Science from UC Berkeley (Thesis: Query Processing in Tertiary Memory Databases), BTech in Computer Science from IIT Kharagpur Research Interests span machine learning , data analytics , graphical models , and structured learning , with applications in text segmentation, sequence modeling, domain adaptation, and human-in-the-loop systems. Her publications reveal a strong focus on integrating data mining with database systems , temporal data analysis , and information extraction using probabilistic methods. Professional Activities include serving on the IEEE John Von Neumann Medal committee (2017-), VLDB 2011 Research Track Co-chair , and multiple program committee roles at top conferences like ICML, KDD, and SIGMOD. Labs & Teams : Leads the SS Lab , a research group focused on probabilistic graphical models, sequence modeling, and data integration techniques.

Catherine Greenhillمشاهده پروفایل

استاد

• Combinatorics
• Graph Theory
• Applied Probability
• +۶ مورد دیگر

Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.

• Machine Learning
• Probability
• Mathematical Physics
• +۶ مورد دیگر

Boris Hanin is an Associate Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE) and Associated Faculty at the Program in Applied and Computational Mathematics (PACM). Prior to Princeton, he held academic positions at Texas A&M University (Assistant Professor of Mathematics), MIT (NSF Postdoctoral Fellow), and Northwestern University (PhD in Mathematics under Steve Zelditch). He works part-time at Foundry, an AI/computing startup, leading the Foundry Institute. PhD in Mathematics, Northwestern University NSF Postdoctoral Fellowship, MIT Mathematics Associate Professor, Princeton ORFE Part-Time Leader, Foundry Institute His research spans machine learning, probability theory, and mathematical physics, focusing on neural network theory (approximation power, optimization guarantees), random matrix theory, and spectral asymptotics. He has made foundational contributions to understanding gradient behavior, initialization, and infinite-width limits in deep learning. Boris has supervised numerous PhD students and postdocs, with former members securing prestigious positions at Harvard, MIT, and Huawei. He serves as Associate Editor for journals like Pure and Applied Analysis and Mathematics of Operations Research , and has taught short courses at Oxford, Luxembourg, and Tor Vergata on statistical physics of neural networks and deep learning theory. 2024 Sloan Fellowship in Mathematics NSF CAREER grant DMS-2143754 NSF grant DMS-2133806 His research group collaborates on topics including hyperparameter transfer, architecture-aware scaling, and spectral analysis of random waves and neural networks. He actively contributes to theoretical machine learning through foundational publications in venues like Probability Theory and Related Fields , Journal of Machine Learning Research , and Communications in Mathematical Physics .

Yee Whye Tehمشاهده پروفایل

استاد

• Statistical Machine Learning
• Probabilistic Learning
• Deep Learning
• +۴ مورد دیگر

Yee Whye Teh is a Professor at the Department of Statistics, University of Oxford, and a research scientist at DeepMind. His work focuses on statistical machine learning, including probabilistic learning, Bayesian nonparametrics, deep learning, and Monte Carlo methods. He co-directs the ELLIS programme on Robust Machine Learning and has held roles such as Programme Co-chair for ICML 2017. Teh has delivered keynotes at UAI 2019, an IMS Medallion Lecture at JSM 2019, and the Breiman Lecture in 2017. His research emphasizes scalable inference algorithms, hierarchical models, and applications in genetics and natural language processing. Teh's educational background includes a PhD from the University of Toronto (2003) and a Master's from the same institution (2000). He has contributed to widely used software tools like the Sequence Memoizer and has been recognized for his work through prestigious lectureships. Research interests span Bayesian nonparametric models, MCMC methods, and their applications in genetics and data compression. His lab collaborates on projects like fragmentation-coagulation processes for genetic variation modeling and Mondrian forests for online learning. Teh advises students through Oxford's graduate programs, though he notes high demand for mentorship. His work often bridges theory and practice, addressing challenges in big data learning and small data problems.

• Machine Learning
• Statistics
• Theoretical Machine Learning
• +۷ مورد دیگر

Fanny Yang is an Assistant Professor in the Computer Science Department at ETH Zurich . She previously held postdoctoral positions at Stanford University and a Junior Fellowship at the Institute for Theoretical Studies at ETH Zurich, advised by Nicolai Meinshausen . Her PhD was completed at the EECS Department of UC Berkeley , supervised by Martin Wainwright . Research Interests : Theoretical foundations of machine learning and statistics , particularly focusing on overparameterized models and high-dimensional data . Developing trustworthy ML models with emphasis on distributional robustness , domain generalization , and interpretability . Applications in medical diagnostics and treatment effect analysis , aiming to address reliability issues in real-world domains. Recent Work Trends : 2025 Articles : Theoretical analysis of semi-supervised multi-objective learning , test-time scaling with verifiers, and foundation models for efficient randomized experiments . 2024 Articles : Studies on robust mixture learning , privacy-preserving data synthesis via optimal transport , confounding quantification in causal inference , and semi-private learning frameworks. 2023 Articles : Investigations into active vs. passive learning in high dimensions, inductive bias in noisy interpolation , and semi-supervised novelty detection using model ensembles .

Amitabha Bagchiمشاهده پروفایل

استاد

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +۷ مورد دیگر

Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +۵ مورد دیگر

Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).

Tal Malkinمشاهده پروفایل

استاد

• Cryptography
• Computer Security
• Complexity Theory
• +۸ مورد دیگر

Tal Malkin is a Professor of Computer Science at Columbia University, directing the Cryptography Lab and serving as inaugural chair of the Cybersecurity Center at Columbia's Data Science Institute. She holds a Ph.D. from MIT (2000), joined Columbia after AT&T Labs research experience, and focuses on cryptography, security, complexity theory with applications in secure computation, zero-knowledge proofs, and privacy-preserving systems . Education: B.S. in Math and Computer Science, Bar-Ilan University M.S. in Computer Science, Weizmann Institute of Science Ph.D. in Computer Science, MIT (2000) Research Interests: Malkin's work spans foundational and applied cryptography, including homomorphic encryption, lattice-based protocols, attribute-based encryption, and tamper-resilient systems . She explores intersections with machine learning and information theory , addressing challenges in multi-party computation , public-key encryption , and side-channel resistance . Scientific Contributions: Her publications include breakthroughs in non-malleable codes , secure computation , and privacy-preserving databases . Notable works involve continual leakage resilience , optimally-fair coin tossing , and garbled circuits for efficient cryptographic protocols. Awards & Grants: Recipient of the NSF CAREER award, IBM and Google faculty research awards, and the IACR Fellow designation. Her research is funded by NSF, NSA, DHS, NYSIA, IARPA, and industry partnerships with Google, IBM, Mitsubishi, and NEC. Professional Leadership: Former conference chairs at CRYPTO 2021 , CCS 2017 , and CT-RSA conferences. Active in program committees for over 20 leading cryptography and security events, including FOCS , Eurocrypt , and Real World Crypto . Advising: Supervised numerous Ph.D. students and postdoctoral researchers, including Marshall Ball , Chengyu Lin , and Negev Shekhel Nosatzki . Her lab has mentored graduates like Ghada Almashaqbeh (2019) and Fernando Krell (2016), focusing on decentralized networks , secure learning , and cryptographic primitives .

Maya Ramanathمشاهده پروفایل

دانشیار

• Database Systems
• Information Retrieval
• Semantic Web Data Management
• +۳ مورد دیگر

Maya Ramanath is an Associate Professor in the Department of Computer Science and Engineering at Indian Institute of Technology (IIT) Delhi. She joined IIT Delhi in 2011 after a postdoctoral research stint at the Max-Planck Institute for Informatics in Germany. Her research interests focus on database systems, information retrieval, semantic web technologies, and knowledge graph construction and applications. Education: PhD in Computer Science, Indian Institute of Science, Bangalore M.Sc.(Engg.) in Computer Science, Indian Institute of Science, Bangalore B.E. in Computer Science and Engineering, Bangalore University, Bangalore Her recent work emphasizes efficient query processing over large-scale graphs, knowledge graph applications, and natural language interfaces for semantic data. Notable contributions include algorithms for reachability approximation in web-scale graphs, speculative query planning for knowledge graphs, and exploratory querying techniques. She has collaborated extensively on projects like NAGA, ESTHETE, and KlusTree, advancing the state of the art in graph-based data management and semantic search. Publications span conferences such as ICDE, ECIR, EDBT, and VLDB, reflecting a strong focus on database systems, graph algorithms, and semantic web applications. Her work bridges theoretical foundations with practical implementations, addressing scalability and efficiency challenges in modern data management systems. Research and advising activities include supervision of projects on distributed graph processing, query optimization, and knowledge representation. She has contributed to open-source tools like LegoDB and StatiX, and her lab focuses on interdisciplinary approaches to data-centric AI.

Peter Bühlmannمشاهده پروفایل

استاد

• High-dimensional Statistics
• Causal Inference
• Machine Learning
• +۳ مورد دیگر

Peter Bühlmann is a Professor at ETH Zürich within the Seminar für Statistik , focusing on high-dimensional statistics, causal inference, and machine learning. His work bridges theoretical advancements with practical software implementations in R packages like pcalg , mboost , and glmmlasso , impacting fields such as genomics, proteomics, and intensive care analytics. Key Contributions : Causal structure learning, stability selection, anchor regression, and deconfounding. Software : Developed widely used R packages for statistical modeling and causal inference. Teaching : Courses on high-dimensional statistics at ETH Zürich and international institutions. Research Trends : Recent articles emphasize causal robustness, domain adaptation, and applications in medicine. His work addresses challenges in heterogeneous data, missing values, and covariate shifts using methods like spectral deconfounding and residual prediction tests. Scientific Recognition : Co-author of a paper designated as a New Hot Paper (Meinshausen and Bühlmann, 2006) by Essential Science Indicators, indicating significant impact in high-dimensional multiple testing.

Amin Keramatiمشاهده پروفایل

استادیار

• Transportation & Logistics
• Supply Chain Management
• Data Analytics
• +۴ مورد دیگر

Dr. Amin Keramati is an Assistant Professor of Supply Chain Management at Widener University’s School of Business Administration. He holds a PhD in Transportation & Logistics from North Dakota State University and previously served as a graduate research assistant at the Upper Great Plains Transportation Institute. His work includes federally funded projects like the Mountain-Plains Consortium’s MPC-550 project, focusing on highway-rail grade crossing safety. Dr. Keramati teaches courses in enterprise resource planning, decision analytics, database management, transportation/logistics, project management, and data analytics. Education: PhD in Transportation & Logistics, North Dakota State University Graduate Research Assistant at Upper Great Plains Transportation Institute Research Focus: Dr. Keramati develops mathematical, statistical, and machine learning approaches to solve complex problems in transportation, supply chain, and logistics. Key areas include data mining, big data decision support, transportation network analytics, project scheduling, smart manufacturing, and accident analysis. His interdisciplinary work bridges supply chain optimization with emerging technologies like blockchain for healthcare and clinical trials. Awards & Recognition: Student Paper Award, American Association of State Highway and Transportation Officials (2017) Grants & Projects: Lead researcher on the Mountain-Plains Consortium’s MPC-550 project, which expanded his dissertation work on safety systems for highway-rail crossings. Collaborates on federally funded transportation safety initiatives and supply chain optimization for bioethanol and pharmaceutical industries. Labs/Teams: Active in Widener’s School of Business research groups focusing on supply chain innovation and interdisciplinary projects combining logistics with emerging technologies.

Paul Gölzمشاهده پروفایل

استادیار

• Social Choice Theory
• Algorithmic Fairness
• AI Ethics
• +۳ مورد دیگر

Paul Gölz is an Assistant Professor at Cornell University's School of Operations Research and Information Engineering (ORIE), with affiliations in Computer Science. His research focuses on computational social choice, algorithmic fairness, and AI ethics, addressing topics like democratic innovation, fair resource allocation, and AI systems for diverse users. Education: Undergraduate studies at Saarland University (Germany), PhD in Computer Science from Carnegie Mellon University, followed by postdoctoral research at Harvard University, UC Berkeley, and the Simons Laufer Mathematical Sciences Institute. His work has been recognized with awards including the JPMorgan Chase AI Research Fellowship (2021) and honorable mentions for prestigious dissertation awards (Dantzig and ACM SIGecom). Research Highlights : Developed Panelot, a tool for selecting citizens' assemblies using state-of-the-art algorithms. His work on fair refugee resettlement and apportionment methods has been featured in Operations Research and Nature . Recent projects include AI alignment distortion analysis and generative social choice mechanisms. Teaching : Teaches Optimized Democracy (Spring 2025) and Mathematical Programming (Fall 2024). Supervises PhD students in ORIE, focusing on interdisciplinary applications of optimization and social choice. Awards & Grants : Received a $40K Structural Democracy Fellowship (Crankstart) and an OpenAI grant for Democratic Inputs to AI. Active in policy briefs (e.g., mini-public selection strategies). Labs/Tools : Co-developed Panelot.org , a nonprofit platform for fair citizen assembly selection. Active in open-source tool development for social choice applications.

Osman Yağanمشاهده پروفایل

استاد پژوهشی

• Machine Learning
• Data Science
• Network Science
• +۷ مورد دیگر

Osman Yağan is a Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), with affiliate faculty status in the School of Computer Science. He is also a core member of CyLab Security and Privacy Institute. Prior to joining CMU in 2013, he was a Postdoctoral Research Fellow at CyLab. He holds a Ph.D. in Electrical and Computer Engineering from the University of Maryland (2011) and a B.S. from Middle East Technical University (2007). His research focuses on modeling, analysis, and optimization of computing systems, leveraging applied probability, network science, data science, and machine learning. Key areas include multi-armed bandits, resilient machine learning, contagion processes in networks, and cybersecurity. Research Interests include Machine Learning, Data Science, Network Science, Cybersecurity, and Robustness in Cyber-Physical Systems. He has advised numerous students, including current PhD candidates Yurun Tian, Orkun İrsoy, and Ishank Juneja, as well as notable alumni such as Mansi Sood (now at MIT) and Jun Zhao (Assistant Professor at Nanyang Technological University). Key Awards include the CIT Dean's Early Career Fellowship, IBM Academic Award, and Best Paper Awards at ICC 2021, IPSN 2022, and ASONAM 2023. His work spans theoretical contributions (e.g., contagion models in multi-layer networks) and applied research (e.g., mitigating cascading failures in power systems). He leads or co-leads grants from ONR, NSF, and ARO, focusing on resilient machine learning, network robustness, and pandemic modeling.

Celestine Mendler-Dünnerمشاهده پروفایل

استاد

• Machine Learning in Social Context
• Algorithmic Collective Action
• Performative Prediction
• +۶ مورد دیگر

Celestine Mendler-Dünner is a Principal Investigator at the ELLIS Institute in Tübingen, co-affiliated with the Max Planck Institute for Intelligent Systems and the Tübingen AI Center. She leads the Algorithms and Society research group, focusing on machine learning in social contexts and the role of prediction in digital economies. Her work bridges theoretical machine learning with practical societal impact, developing tools for safe, reliable, and equitable AI ecosystems. Her educational background includes a PhD from ETH Zurich in collaboration with IBM Research, followed by an SNSF postdoctoral fellowship at UC Berkeley hosted by Moritz Hardt. She was previously a group leader at the Max Planck Institute for Intelligent Systems before joining the ELLIS Institute. Mendler-Dünner's research spans several interconnected themes including performative prediction (where predictions change the behavior they aim to predict), algorithmic collective action (how participants can steer AI systems toward common goals), and the role of LLMs in social science research. Her work combines theoretical foundations with practical implementations, addressing challenges in interactive machine learning, optimization in dynamic environments, and context-specific evaluation of AI systems. She particularly examines how algorithmic predictions mediate services and platforms at societal scale, exploring concepts of economic power in digital markets. Her publication record shows a clear evolution from system-aware machine learning algorithms (including foundational work on IBM Snap ML) toward increasingly sociotechnical questions at the intersection of machine learning, economics, and policy. Recent work focuses on measuring performative power in digital economies, evaluating LLMs as risk scores, and developing frameworks for algorithmic collective action in recommender systems and labor markets. Among her notable recognitions are the ETH Medal for her dissertation, the IBM Research Division Award, the Fritz Kutter Award, and the IBM Eminence and Excellence Award. She is an ELLIS Scholar, a fellow of the Elisabeth-Schiemann-Kolleg, and affiliated with several prestigious research programs including the International Max Planck Research School for Intelligent Systems and the Max Planck ETH Center for Learning Systems. ETH Medal (dissertation award) IBM Research Division Award Fritz Kutter Award IBM Eminence and Excellence Award SNSF Early Postdoc Mobility Fellowship Mendler-Dünner actively mentors the next generation of researchers, advising PhD student Patrik Wolf and supervising research interns including Joachim Baumann, Haiqing Zhu, and Anna Badalyan, as well as Master's student Dorothee Sigg. She serves as core faculty for the International Max Planck Research School and associated faculty for the Max Planck ETH Center for Learning Systems. Her group has secured significant research funding through fellowships and institutional support, enabling work on projects like Powermeter (measuring search engine influence) and Snap ML (resource-efficient machine learning library with over 1 million PyPI downloads). She leads the Algorithms and Society research group, which examines machine learning as part of broader sociotechnical ecosystems. The group explores human-population interactions with algorithmic systems and incorporates these insights into learning system fundamentals. Current projects include investigating economic incentives in digital platforms, developing tools for systematic LLM evaluation in social science contexts, and creating frameworks for collective action in algorithmic systems. Mendler-Dünner also co-organizes the Algorithmic Collective Action workshop at NeurIPS 2025, demonstrating her leadership in emerging research directions at the AI-society interface.

Michael A Osborneمشاهده پروفایل

استاد

• Machine Learning
• Bayesian Optimization
• Gaussian Processes
• +۳ مورد دیگر

Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML