We stand with Ukraine

We stand with Ukraine

Mohsen Bayati

Orcid: 0000-0002-7280-912X

According to our database¹, Mohsen Bayati authored at least 55 papers between 2005 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Optimal Experimental Design for Staggered Rollouts.

[BibT_eX]

[DOI]

,

,

,

Manag. Sci., 2024

Higher-Order Causal Message Passing for Experimentation with Complex Interference.

[BibT_eX]

[DOI]

,

,

William Overman

,

,

CoRR, 2024

Aligning Model Properties via Conformal Risk Control.

[BibT_eX]

[DOI]

William Overman

,

Jacqueline Jil Vallon

,

CoRR, 2024

A Probabilistic Approach for Alignment with Human Comparisons.

[BibT_eX]

[DOI]

,

CoRR, 2024

2023

Technical Note - The Elliptical Potential Lemma for General Distributions with an Application to Linear Thompson Sampling.

[BibT_eX]

[DOI]

,

Oper. Res., July, 2023

Geometry-Aware Approaches for Balancing Performance and Theoretical Guarantees in Linear Bandits.

[BibT_eX]

[DOI]

,

CoRR, 2023

2022

On Low-rank Trace Regression under General Sampling Distribution.

[BibT_eX]

[DOI]

,

J. Mach. Learn. Res., 2022

Speed Up the Cold-Start Learning in Two-Sided Bandits with Many Arms.

[BibT_eX]

[DOI]

,

,

CoRR, 2022

Thompson Sampling Efficiently Learns to Control Diffusion Processes.

[BibT_eX]

[DOI]

Mohamad Kazem Shirani Faradonbeh

,

Mohamad Sadegh Shirani Faradonbeh

,

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Mostly Exploration-Free Algorithms for Contextual Bandits.

[BibT_eX]

[DOI]

,

,

Khashayar Khosravi

Manag. Sci., 2021

Learning to Recommend Using Non-Uniform Data.

[BibT_eX]

[DOI]

,

CoRR, 2021

The Randomized Elliptical Potential Lemma with an Application to Linear Thompson Sampling.

[BibT_eX]

[DOI]

,

CoRR, 2021

PatientFlowNet: A Deep Learning Approach to Patient Flow Prediction in Emergency Departments.

[BibT_eX]

[DOI]

Ali Reza Sharafat

,

IEEE Access, 2021

2020

Online Decision Making with High-Dimensional Covariates.

[BibT_eX]

[DOI]

,

Oper. Res., 2020

On Worst-case Regret of Linear Thompson Sampling.

[BibT_eX]

[DOI]

,

CoRR, 2020

Optimal and Greedy Algorithms for Multi-Armed Bandits with Many Arms.

[BibT_eX]

[DOI]

,

,

,

Khashayar Khosravi

CoRR, 2020

A General Framework to Analyze Stochastic Linear Bandit.

[BibT_eX]

[DOI]

,

CoRR, 2020

Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms.

[BibT_eX]

[DOI]

,

,

,

Khashayar Khosravi

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Recommendation on a Budget: Column Space Recovery from Partially Observed Entries with Random or Active Sampling.

[BibT_eX]

[DOI]

,

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Evidence of Upcoding in Pay-for-Performance Programs.

[BibT_eX]

[DOI]

,

,

Manag. Sci., 2019

Scalable Approximations for Generalized Linear Problems.

[BibT_eX]

[DOI]

Murat A. Erdogdu

,

,

J. Mach. Learn. Res., 2019

Personalizing Many Decisions with High-Dimensional Covariates.

[BibT_eX]

[DOI]

,

,

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Data Uncertainty in Markov Chains: Application to Cost-Effectiveness Analyses of Medical Innovations.

[BibT_eX]

[DOI]

,

,

Stefanos A. Zenios

,

,

Oper. Res., 2018

Generating Random Networks Without Short Cycles.

[BibT_eX]

[DOI]

,

Andrea Montanari

,

Oper. Res., 2018

2017

Exploiting the Natural Exploration In Contextual Bandits.

[BibT_eX]

[DOI]

,

,

Khashayar Khosravi

CoRR, 2017

2016

Accurate Emergency Department Wait Time Prediction.

[BibT_eX]

[DOI]

,

,

,

Erica L. Plambeck

,

Manuf. Serv. Oper. Manag., 2016

Scaled Least Squares Estimator for GLMs in Large-Scale Problems.

[BibT_eX]

[DOI]

Murat A. Erdogdu

,

,

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015

Bargaining dynamics in exchange networks.

[BibT_eX]

[DOI]

,

Christian Borgs

,

Jennifer T. Chayes

,

,

Andrea Montanari

J. Econ. Theory, 2015

Active Postmarketing Drug Surveillance for Multiple Adverse Events.

[BibT_eX]

[DOI]

,

Margrét V. Bjarnadóttir

,

,

Stefanos A. Zenios

Oper. Res., 2015

Matrix Completion Methods and Imputation for EMR-Based Prediction.

[BibT_eX]

[DOI]

Erika Strandberg

,

Proceedings of the AMIA 2015, 2015

A Low-Cost Method for Multiple Disease Prediction.

[BibT_eX]

[DOI]

,

,

Andrea Montanari

Proceedings of the AMIA 2015, 2015

2013

Message-Passing Algorithms for Sparse Network Alignment.

[BibT_eX]

[DOI]

,

David F. Gleich

,

,

ACM Trans. Knowl. Discov. Data, 2013

Estimating LASSO Risk and Noise Level.

[BibT_eX]

[DOI]

,

Murat A. Erdogdu

,

Andrea Montanari

Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2012

The LASSO Risk for Gaussian Matrices.

[BibT_eX]

[DOI]

,

Andrea Montanari

IEEE Trans. Inf. Theory, 2012

Universality in Polytope Phase Transitions and Message Passing Algorithms

[BibT_eX]

[DOI]

,

,

Andrea Montanari

CoRR, 2012

Universality in polytope phase transitions and iterative algorithms.

[BibT_eX]

[DOI]

,

,

Andrea Montanari

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing.

[BibT_eX]

[DOI]

,

Andrea Montanari

IEEE Trans. Inf. Theory, 2011

Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions.

[BibT_eX]

[DOI]

,

Christian Borgs

,

Jennifer T. Chayes

,

Riccardo Zecchina

SIAM J. Discret. Math., 2011

Fast Convergence of Natural Bargaining Dynamics in Exchange Networks.

[BibT_eX]

[DOI]

Yashodhan Kanoria

,

,

Christian Borgs

,

Jennifer T. Chayes

,

Andrea Montanari

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Session MA3b: Graphical models in signal processing I.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011

2010

A Sequential Algorithm for Generating Random Graphs.

[BibT_eX]

[DOI]

,

,

Algorithmica, 2010

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs.

[BibT_eX]

[DOI]

,

,

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

The LASSO risk: asymptotic results and real world examples.

[BibT_eX]

[DOI]

,

,

Andrea Montanari

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2009

A Natural Dynamics for Bargaining on Exchange Networks

[BibT_eX]

[DOI]

Yashodhan Kanoria

,

,

Christian Borgs

,

Jennifer T. Chayes

,

Andrea Montanari

CoRR, 2009

A rigorous analysis of the cavity equations for the minimum spanning tree

[BibT_eX]

[DOI]

,

Alfredo Braunstein

,

Riccardo Zecchina

CoRR, 2009

Generating random graphs with large girth.

[BibT_eX]

[DOI]

,

Andrea Montanari

,

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Algorithms for Large, Sparse Network Alignment Problems.

[BibT_eX]

[DOI]

,

Margot Gerritsen

,

David F. Gleich

,

,

Proceedings of the ICDM 2009, 2009

2008

Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality.

[BibT_eX]

[DOI]

,

,

IEEE Trans. Inf. Theory, 2008

2007

Simple deterministic approximation algorithms for counting matchings.

[BibT_eX]

[DOI]

,

,

Dimitriy A. Katz

,

,

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Iterative Scheduling Algorithms.

[BibT_eX]

[DOI]

,

Balaji Prabhakar

,

,

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

Optimal scheduling in a multiserver stochastic network.

[BibT_eX]

[DOI]

,

,

Mark S. Squillante

SIGMETRICS Perform. Evaluation Rev., 2006

A rigorous proof of the cavity method for counting matchings

[BibT_eX]

[DOI]

,

CoRR, 2006

A Simpler Max-Product Maximum Weight Matching Algorithm and the Auction Algorithm.

[BibT_eX]

[DOI]

,

,

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Maximum weight matching via max-product belief propagation.

[BibT_eX]

[DOI]

,

,

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Achieving stability in networks of input-queued switches using a local online scheduling policy.

[BibT_eX]

[DOI]

Shubha U. Nabar

,

,

,

Abtin Keshavarzian

Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

Loading...