Publications related to Faster Algorithms for Integer Programs with Block Structure

Spectral Estimators for High-Dimensional Matrix Inference

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

EPFL2024

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation

Alice Cortinovis

In this thesis we propose and analyze algorithms for some numerical linear algebra tasks: finding low-rank approximations of matrices, computing matrix functions, and estimating the trace of matrices.In the first part, we consider algorithms for building l ...

EPFL2022

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Sub-Matrix Factorization for Real-Time Vote Prediction

Patrick Thiran, Matthias Grossglauser, Victor Kristof

We address the problem of predicting aggregate vote outcomes (e.g., national) from partial outcomes (e.g., regional) that are revealed sequentially. We combine matrix factorization techniques and generalized linear models (GLMs) to obtain a flexible, effic ...

2020

Nonlinear Finite Elements in Dynamics

This report focuses on the implementation of the finite element method for nonlinear dynamical problems arising in solid mechanics. The theory of continuum mechanics is extensively covered in the literature and it is assumed the reader is already familiar ...

2020

Non-filamentary non-volatile memory elements as synapses in neuromorphic systems

Yusuf Leblebici, Alessandro Fumarola, Severin Sidler

Crossbar arrays of non-volatile memory (NVM) devices represent one possible path for implementing highly energy-efficient neuromorphic computing systems. For Deep Neural Networks (DNN), where information can be encoded as analog voltage and current levels, ...

IEEE2019

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

Faster Algorithms for Integer Programs with Block Structure

Graph Chatbot

Chat with Graph Search

Spectral Estimators for High-Dimensional Matrix Inference

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

The double exponential runtime is tight for 2-stage stochastic ILPs

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

New Results in Integer and Lattice Programming

Sub-Matrix Factorization for Real-Time Vote Prediction

Nonlinear Finite Elements in Dynamics

Non-filamentary non-volatile memory elements as synapses in neuromorphic systems

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

New Results in Integer and Lattice Programming

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

The double exponential runtime is tight for 2-stage stochastic ILPs

Spectral Estimators for High-Dimensional Matrix Inference

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Nonlinear Finite Elements in Dynamics

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Sub-Matrix Factorization for Real-Time Vote Prediction

Non-filamentary non-volatile memory elements as synapses in neuromorphic systems

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation