Mohsen Bayati

Orcid: 0000-0002-7280-912X

According to our database1, Mohsen Bayati authored at least 52 papers between 2005 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Probabilistic Approach for Alignment with Human Comparisons.
CoRR, 2024

2023
Technical Note - The Elliptical Potential Lemma for General Distributions with an Application to Linear Thompson Sampling.
Oper. Res., July, 2023

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

2022
On Low-rank Trace Regression under General Sampling Distribution.
J. Mach. Learn. Res., 2022

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

Thompson Sampling Efficiently Learns to Control Diffusion Processes.
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.
Manag. Sci., 2021

Learning to Recommend Using Non-Uniform Data.
CoRR, 2021

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

PatientFlowNet: A Deep Learning Approach to Patient Flow Prediction in Emergency Departments.
IEEE Access, 2021

2020
Online Decision Making with High-Dimensional Covariates.
Oper. Res., 2020

On Worst-case Regret of Linear Thompson Sampling.
CoRR, 2020

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

A General Framework to Analyze Stochastic Linear Bandit.
CoRR, 2020

Unreasonable Effectiveness of Greedy Algorithms in Multi-Armed Bandit with Many Arms.
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.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Evidence of Upcoding in Pay-for-Performance Programs.
Manag. Sci., 2019

Scalable Approximations for Generalized Linear Problems.
J. Mach. Learn. Res., 2019

Personalizing Many Decisions with High-Dimensional Covariates.
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.
Oper. Res., 2018

Generating Random Networks Without Short Cycles.
Oper. Res., 2018

2017
Exploiting the Natural Exploration In Contextual Bandits.
CoRR, 2017

2016
Accurate Emergency Department Wait Time Prediction.
Manuf. Serv. Oper. Manag., 2016

Scaled Least Squares Estimator for GLMs in Large-Scale Problems.
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.
J. Econ. Theory, 2015

Active Postmarketing Drug Surveillance for Multiple Adverse Events.
Oper. Res., 2015

Matrix Completion Methods and Imputation for EMR-Based Prediction.
Proceedings of the AMIA 2015, 2015

A Low-Cost Method for Multiple Disease Prediction.
Proceedings of the AMIA 2015, 2015

2013
Message-Passing Algorithms for Sparse Network Alignment.
ACM Trans. Knowl. Discov. Data, 2013

Estimating LASSO Risk and Noise Level.
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.
IEEE Trans. Inf. Theory, 2012

Universality in Polytope Phase Transitions and Message Passing Algorithms
CoRR, 2012

Universality in polytope phase transitions and iterative algorithms.
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.
IEEE Trans. Inf. Theory, 2011

Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions.
SIAM J. Discret. Math., 2011

Fast Convergence of Natural Bargaining Dynamics in Exchange Networks.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Session MA3b: Graphical models in signal processing I.
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011

2010
A Sequential Algorithm for Generating Random Graphs.
Algorithmica, 2010

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

The LASSO risk: asymptotic results and real world examples.
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
CoRR, 2009

A rigorous analysis of the cavity equations for the minimum spanning tree
CoRR, 2009

Generating random graphs with large girth.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Algorithms for Large, Sparse Network Alignment Problems.
Proceedings of the ICDM 2009, 2009

2008
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality.
IEEE Trans. Inf. Theory, 2008

2007
Simple deterministic approximation algorithms for counting matchings.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

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

2006
Optimal scheduling in a multiserver stochastic network.
SIGMETRICS Perform. Evaluation Rev., 2006

A rigorous proof of the cavity method for counting matchings
CoRR, 2006

A Simpler Max-Product Maximum Weight Matching Algorithm and the Auction Algorithm.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Maximum weight matching via max-product belief propagation.
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.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005


  Loading...