Sören Laue

Orcid: 0000-0003-4351-9868

Affiliations:
  • Friedrich Schiller University Jena, Faculty of Mathematics and Computer Science, Germany


According to our database1, Sören Laue authored at least 47 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Mixed membership Gaussians.
J. Multivar. Anal., May, 2023

Efficient and Portable Einstein Summation in SQL.
Proc. ACM Manag. Data, 2023

Why Capsule Neural Networks Do Not Scale: Challenging the Dynamic Parse-Tree Assumption.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Convexity Certificates from Hessians.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Machine Learning, Linear Algebra, and More: Is SQL All You Need?
Proceedings of the 12th Conference on Innovative Data Systems Research, 2022

Optimization for Classical Machine Learning Problems on the GPU.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

The GENO Software Stack.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021
Method of Moments for Topic Models with Mixed Discrete and Continuous Features.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
Optimization frameworks for machine learning: Examples and case study.
it Inf. Technol., 2020

A Simple and Efficient Tensor Calculus for Machine Learning.
Fundam. Informaticae, 2020

Fast Entity Resolution With Mock Labels and Sorted Integer Sets.
Proceedings of the 2nd International Workshop on Challenges and Experiences from Data Integration to Knowledge Graphs co-located with 46th International Conference on Very Large Data Bases, 2020

A Simple and Efficient Tensor Calculus.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

GENO - Optimization for Classical Machine Learning Made Fast and Easy.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
On the Equivalence of Forward Mode Automatic Differentiation and Symbolic Differentiation.
CoRR, 2019

Visualization Support for Developing a Matrix Calculus Algorithm: A Case Study.
Comput. Graph. Forum, 2019

Dynamic Pseudo-time Warping of Complex Single-Cell Trajectories.
Proceedings of the Research in Computational Molecular Biology, 2019

MatrixCalculus.org - Computing Derivatives of Matrix and Tensor Expressions.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

GENO - GENeric Optimization for Classical Machine Learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Combining ADMM and the Augmented Lagrangian Method for Efficiently Handling Many Constraints.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Using Benson's Algorithm for Regularization Parameter Tracking.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane.
IEEE/ACM Trans. Netw., 2018

Computing Higher Order Derivatives of Matrix and Tensor Expressions.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Personal Routes with High-Dimensional Costs and Dynamic Approximation Guarantees.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

2016
Distributed Convex Optimization with Many Convex Constraints.
CoRR, 2016

Generating massive complex networks with hyperbolic geometry faster in practice.
Proceedings of the 2016 IEEE High Performance Extreme Computing Conference, 2016

Deducing individual driving preferences for user-aware navigation.
Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

2015
A Fast Parallel Implementation of a PTAS for Fractional Packing and Covering Linear Programs.
Int. J. Parallel Program., 2015

Reconstructing a Sparse Solution from a Compressed Support Vector Machine.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Tracking Approximate Solutions of Parameterized Optimization Problems over Multi-Dimensional (Hyper-)Parameter Domains.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Robust and Efficient Kernel Hyperparameter Paths with Guarantees.
Proceedings of the 31th International Conference on Machine Learning, 2014

Sketching the Support of a Probability Measure.
Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

2012
Approximating parameterized convex optimization problems.
ACM Trans. Algorithms, 2012

Regularization Paths with Guarantees for Convex Semidefinite Optimization.
Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, 2012

Approximating Concavely Parameterized Optimization Problems.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

A comparison of models of word meaning in context.
Proceedings of the Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, 2012

A Hybrid Algorithm for Convex Semidefinite Optimization.
Proceedings of the 29th International Conference on Machine Learning, 2012

Optimizing over the Growing Spectrahedron.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours.
Ad Hoc Networks, 2011

2008
Approximation algorithms for geometric optimization problems.
PhD thesis, 2008

Approximating k-hop minimum spanning trees in Euclidean metrics.
Inf. Process. Lett., 2008

Geometric Set Cover and Hitting Sets for Polytopes in $R^3$
CoRR, 2008

Geometric Set Cover and Hitting Sets for Polytopes in R<sup>3</sup>.
Proceedings of the STACS 2008, 2008

2007
Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets.
Proceedings of the STACS 2007, 2007

Minimum-Energy Broadcast with Few Senders.
Proceedings of the Distributed Computing in Sensor Systems, 2007

2006
Power Assignment Problems in Wireless Communication
CoRR, 2006

2005
A linear algorithm for integer programming in the plane.
Math. Program., 2005

2003
A Faster Algorithm for Two-Variable Integer Programming.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003


  Loading...