James Bailey

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	On the Uniqueness of Nash Equilibria in Multiagent Matrix Games	2024	James Bailey
+ PDF Chat	On the Approximability of the Yolk in the Spatial Model of Voting	2024	Ran Hu James Bailey
+ PDF Chat	Segmenting sea ice floes in close-range optical imagery with active contour and foundation models	2024	Giulio Passerotti Alberto Alberello Marcello Vichi Luke G. Bennetts James Bailey Alessandro Toffoli
+	Octanary polyhedral branch and bound for integer programs	2022	James Bailey Todd Easton Fabio Vitor
+	Conditions for Stability in Strategic Matching	2021	James Bailey Craig A. Tovey
+	$O\left(1/T\right)$ Time-Average Convergence in a Generalization of Multiagent Zero-Sum Games	2021	James Bailey
+	Stochastic Multiplicative Weights Updates in Zero-Sum Games	2021	James Bailey Sai Ganesh Nagarajan Georgios Piliouras
+	Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System	2019	James Bailey Georgios Piliouras
+	Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes	2019	James Bailey Georgios Piliouras
+	Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System	2019	James Bailey Georgios Piliouras
+	Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent	2019	James Bailey Gauthier Gidel Georgios Piliouras
+	Online Cluster Validity Indices for Streaming Data	2018	Masud Moshtaghi James C. Bezdek Sarah M. Erfani Christopher Leckie James Bailey
+ PDF Chat	On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions	2012	James Bailey Mark Iwen Craig Spencer
+	On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions	2011	James Bailey Mark Iwen Craig Spencer

Common Coauthors

Coauthor	Papers Together
Georgios Piliouras	5
Craig Spencer	2
Mark Iwen	2
Alessandro Toffoli	1
James C. Bezdek	1
Todd Easton	1
Marcello Vichi	1
Ran Hu	1
Sarah M. Erfani	1
Christopher Leckie	1
Craig A. Tovey	1
Luke G. Bennetts	1
Alberto Alberello	1
Sai Ganesh Nagarajan	1
Fabio Vitor	1
Giulio Passerotti	1
Gauthier Gidel	1
Masud Moshtaghi	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Cycles in adversarial regularized learning	2018	Panayotis Mertikopoulos Christos H. Papadimitriou Georgios Piliouras	4
+	Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System	2019	James Bailey Georgios Piliouras	3
+ PDF Chat	Explicit Non-adaptive Combinatorial Group Testing Schemes	2008	Ely Porat Amir Rothschild	2
+ PDF Chat	Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm	2008	Mark Iwen Craig Spencer	2
+ PDF Chat	Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit	2008	Deanna Needell Roman Vershynin	2
+	Compressed sensing and best 𝑘-term approximation	2008	Albert Cohen Wolfgang Dahmen Ronald DeVore	2
+	Uncertainty Principles and Signal Recovery	1989	David L. Donoho Philip B. Stark	2
+ PDF Chat	A Simple Proof of the Restricted Isometry Property for Random Matrices	2008	Richard G. Baraniuk Mark A. Davenport Ronald DeVore Michael B. Wakin	2
+ PDF Chat	Decoding by Linear Programming	2005	Emmanuel J. Candès Terence Tao	2
+	Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms	2010	Mark Iwen	2
+ PDF Chat	Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?	2006	Emmanuel J. Candès Terence Tao	2
+	Simple deterministically constructible RIP matrices with sublinear fourier sampling requirements	2009	Mark Iwen	2
+	Optimization, Learning, and Games with Predictable Sequences	2013	Sasha Rakhlin Karthik Sridharan	2
+ PDF Chat	General Deviants: An Analysis of Perturbations in Compressed Sensing	2010	M.A. Herman Thomas Strohmer	2
+ PDF Chat	New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property	2011	Felix Krahmer Rachel Ward	2
+	Iterative hard thresholding for compressed sensing	2009	Thomas Blumensath Mike E. Davies	2
+ PDF Chat	Stable signal recovery from incomplete and inaccurate measurements	2006	Emmanuel J. Candès Justin Romberg Terence Tao	2
+ PDF Chat	Learning in Games via Reinforcement and Regularization	2016	Panayotis Mertikopoulos William H. Sandholm	2
+	Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games	2019	Yun Kuen Cheung Georgios Piliouras	2
+	CoSaMP: Iterative signal recovery from incomplete and inaccurate samples	2008	Deanna Needell Joel A. Tropp	2
+	Combinatorial Sublinear-Time Fourier Algorithms	2010	Mark Iwen	2
+ PDF Chat	Introduction to Online Convex Optimization	2016	Elad Hazan	2
+ PDF Chat	Explicit constructions of RIP matrices and related problems	2011	Jean Bourgain S. J. Dilworth Kevin Ford Sergeĭ Konyagin Denka Kutzarova	2
+	Poincaré recurrence: old and new	2006	Luís Barreira	2
+	Training GANs with Optimism	2017	Constantinos Daskalakis Andrew Ilyas Vasilis Syrgkanis Haoyang Zeng	2
+	Grassmannian frames with applications to coding and communication	2003	Thomas Strohmer Robert W. Heath	2
+	The Mechanics of n-Player Differentiable Games	2018	David Balduzzi Sébastien Racanière James Martens Jakob Foerster Karl Tuyls Thore Graepel	2
+	Communication complexity of approximate Nash equilibria	2017	Yakov Babichenko Aviad Rubinstein	1
+	A Variational Inequality Perspective on Generative Adversarial Networks	2018	Gauthier Gidel Hugo Berard Gaëtan Vignoud Pascal Vincent Simon Lacoste-Julien	1
+ PDF Chat	Fast Algorithms for Rank-1 Bimatrix Games	2020	Bharat Adsul Jugal Garg Ruta Mehta Milind Sohoni Bernhard von Stengel	1
+ PDF Chat	Family of chaotic maps from game theory	2020	Thiparat Chotibut Fryderyk Falniowski Michał Misiurewicz Georgios Piliouras	1
+	Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems	2020	Noah Golowich Sarath Pattathil Constantinos Daskalakis Asuman Ozdaglar	1
+ PDF Chat	Games of fixed rank: a hierarchy of bimatrix games	2009	Ravi Kannan Thorsten Theobald	1
+	The extragradient method for finding saddle points and other problems	1976	G. M. Korpelevich	1
+	Near-Optimal No-Regret Learning in General Games	2021	Constantinos Daskalakis Maxwell Fishelson Noah Golowich	1
+	Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations	2009	Ernst Hairer Christian Lubich Gerhard Wanner	1
+ PDF Chat	Combining geometry and combinatorics: A unified approach to sparse signal recovery	2008	Radu Berinde Anna C. Gilbert Piotr Indyk Howard Karloff Michael Strauss	1
+ PDF Chat	Inapproximability of Nash Equilibrium	2015	Aviad Rubinstein	1
+	Evolving Takagi‐Sugeno Fuzzy Systems from Streaming Data (eTS+)	2010	Plamen Angelov	1
+	On sparse reconstruction from Fourier and Gaussian measurements	2007	Mark Rudelson Roman Vershynin	1
+ PDF Chat	Settling the complexity of computing two-player Nash equilibria	2009	Xi Chen Xiaotie Deng Shang‐Hua Teng	1
+ PDF Chat	Hamiltonian flows with random-walk behaviour originating from zero-sum games and fictitious play	2011	Sebastian van Strien	1
+ PDF Chat	Constant rank bimatrix games are PPAD-hard	2014	Ruta Mehta	1
+ PDF Chat	Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit	2010	Deanna Needell Roman Vershynin	1
+ PDF Chat	Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements	2006	Mark Rudelson Roman Vershynin	1
+	A Generic Construction of Complex Codebooks Meeting the Welch Bound	2007	Cunsheng Ding Tao Feng	1
+	Some methods for classification and analysis of multivariate observations	1967	James B. MacQueen	1
+	Learning in concave games with imperfect information.	2016	Panayotis Mertikopoulos	1
+	Compressive Sensing with structured random matrices	2010	Holger Rauhut	1
+ PDF Chat	Cycles in adversarial regularized learning	2018	Panayotis Mertikopoulos Christos H. Papadimitriou Georgios Piliouras	1