Aled Williams

I'm very grateful for this at the end of a rather different yet rewarding academic year at the LSE 😀 Despite the difficulties that were thrown up due to the covid pandemic, @LSEMaths did a truly amazing job ensuring that staff and students received the necessary support 😀

1/6 Excited to announce that a draft of my book Algorithms for Convex Optimization (to be published by Cambridge) is available for download: convex-optimization.github.io Intended audience includes undergraduates, graduates and researches from TCS, optimization, and machine learning

This is one very interesting and thought provoking thread

1. Ofqual has released information on accuracy of grading: roughly 45-65% at A level depending on subject. See graph - each blob is a subject: middle top is biology- most accurate at ~67%. Even here a third of grades likely to be inaccurate.

HOW FAKE NEWS SPREADS. On Weds night, at 9.49pm, @Telegraph tweeted this. twitter.com/Telegraph/stat…

@littmath Also this...

@littmath This is my try 😀

What happened in 2003?

Webinar: The science of teaching and learning, and the design of an online Discrete Math course, including lectures, assessments, student interaction, and more. July 30, 2 pm ET. buff.ly/2WAYZT2 @tpsemath @maanow @MathAMATYC @siamnewsnetwork @chadtopaz

Very interesting first keynote talk of #BECMC20 from Jaroslav Fowkes (@OxUniMaths) who is presenting about some of the fascinating "Optimization Challenges in the Commercial Aviation Sector"

I think my favourite thing on this photo is definitely the cat who is on the penultimate row 😀 #BECMC20

The first pure talk of #BECMC20 is from Jonathon Hickman (@UoEMaths) who is giving a talk entitled "On convergence of Fourier integrals"

Let's be real, teaching remotely is essentially a form of live streaming/video creation. As such, a number of teachers and profs have reached out to ask about the setup behind the lockdown math live streams, so I wanted to share the answer in one place. 3blue1brown.com/blog/livestrea…

where the relation allows one to strengthen the best-known distance bound when integer points in the knapsack polytope are not sparse and, vice versa, strengthening the best-known sparsity bound if feasible integer points are sufficiently far from a vertex of the polytope 2/2

This new preprint shows that a rather surprising relation links two long standing areas of research, namely proximity and sparsity of solutions to integer programs. In the knapsack scenario, this relation provides an exponential improvement to the best-known proximity bound, 1/2

Really interesting talk from Timm Oertel entitled “Optimizing Sparsity over Lattices and Semigroups” at #ipco2020

Joseph Paat talking about “Constructing Lattice-Free Gradient Polyhedra in Dimension Two” on the second day of #ipco2020

Dabeen Lee opens day two of #ipco2020 with an interesting talk entitled “On a Generalization of the Chvátal-Gomory Closure” 😊

Joseph Paat just outlined some great new research on “the Integrality number of an integer program” and it really will be interesting to see if sparsity really can play a role in improving bounds on this number moving forward #ipco2020