https://openreview.net/forum?id=5QMJZiHuGn&referrer=%5Bthe%20profile%20of%20Anders%20Aamand%5D(%2Fprofile%3Fid%3D~Anders_Aamand1)
We design improved approximation algorithms for NP-hard graph problems by incorporating predictions (e.g., learned from past data). Our prediction model builds...
improvedapproximationshardgraphproblems
https://deepai.org/publication/ergodic-numerical-approximations-for-stochastic-maxwell-equations
10/12/22 - In this paper, we propose a novel kind of numerical approximations to inherit the ergodicity of stochastic Maxwell equations. The ...
maxwell equationsergodicnumericalapproximationsstochastic
https://openreview.net/forum?id=FpbKoIPHxb&referrer=%5Bthe%20profile%20of%20Vicente%20Balmaseda%5D(%2Fprofile%3Fid%3D~Vicente_Balmaseda1)
Cluster deletion is an NP-hard graph clustering objective with applications in computational biology and social network analysis, where the goal is to delete a...
combinatorialapproximationsclusterdeletionsimpler
https://arxiv.org/abs/1607.01981
Abstract page for arXiv paper 1607.01981: Nesterov's Accelerated Gradient and Momentum as approximations to Regularised Update Descent
nesterovgradientmomentumapproximations