activity
20092025
most citedUnsupervised Learning of Sentence Embeddings using Compositional n-Gram Features

704 citations · 4.8k across the 117 of their papers we have counts for

collaborators
Showing 2009Show all

2 papers · 1 filter

cs.LG2009★ 8 cited

A Combinatorial Algorithm to Compute Regularization Paths

Bernd Gärtner, Joachim Giesen, Martin Jaggi +1

For a wide variety of regularization methods, algorithms computing the entire solution path have been developed recently. Solution path algorithms do not only compute the solution…

cs.LG2009

An Exponential Lower Bound on the Complexity of Regularization Paths

Bernd Gärtner, Martin Jaggi, Clément Maria

For a variety of regularized optimization problems in machine learning, algorithms computing the entire solution path have been developed recently. Most of these methods are quadra…