Goto

Collaborating Authors

 Statistical Learning




Banded Square Root Matrix Factorization for Differentially Private Model Training

Neural Information Processing Systems

However, these methods suffer from high computational overhead because they require numerically solving a demanding optimization problem to determine an approximately optimal factorization prior to the actual model training. In this work, we present a new matrix factorization approach, BSR, which overcomes this computational bottleneck. By exploiting properties of the standard matrix square root, BSR allows to efficiently handle also large-scale problems.






Supra-Laplacian Encoding for Transformer on Dynamic Graphs

Neural Information Processing Systems

Fully connected Graph Transformers (GT) have rapidly become prominent in the static graph community as an alternative to Message-Passing models, which suffer from a lack of expressivity, oversquashing, and under-reaching.