6 papers
Robust Predictive Uncertainty and Double Descent in Contaminated Bayesian Random Features
Michele Caprio, Katerina Papagiannouli, Siu Lun Chau +1
We propose a robust Bayesian formulation of random feature (RF) regression that accounts explicitly for prior and likelihood misspecification via Huber-style contamination sets. St…
Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
Sayan Mukherjee, Shinichiro Akiyama
Embedding the vertices of arbitrary graphs into trees while minimizing some measure of overlap is an important problem with applications in computer science and physics. In this wo…
Approximately Optimal Search on a Higher-dimensional Sliding Puzzle
Nono SC Merleau, Miguel O'Malley, Érika Roldán +1
Higher-dimensional sliding puzzles are constructed on the vertices of a -dimensional hypercube, where vertices are distinctly coloured. Rings with the same colours are i…
Higher Order Bipartiteness vs Bi-Partitioning in Simplicial Complexes
Marzieh Eidi, Sayan Mukherjee
Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implication…
Uniform Consistency of Generalized Fréchet Means
Andrea Aveni, Martin Bladt, Sayan Mukherjee
Loss-based notions of centre on nonlinear spaces range from the Fréchet mean and power means to the geometric median and, in a limiting sense, the Chebyshev centre. To use such sum…
Irreducibility of Markov Chains on simplicial complexes, the Spectrum of the Discrete Hodge Laplacian and Homology
Marzieh Eidi, Sayan Mukherjee
Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability,…