Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Problèmes de Hilbert

Publications associées (24)

Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment

Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Thanh Trung Huynh

The task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entiti ...

Wiley-Hindawi2023

Hands-on tasks make learning visible: a learning analytics lens on the development of mechanistic problem-solving expertise in makerspaces

Richard Lee Davis, Bertrand Roland Schneider

This study investigated the impact of participating in a year-long digital-fabrication course on high-school seniors' problem-solving skills, with a focus on problems involving mechanistic systems. The research questions centered on whether working in a ma ...

Springer2023

Mean Field Type Control With Species Dependent Dynamics via Structured Tensor Optimization

Isabel Haasler

In this letter we consider mean field type control problems with multiple species that have different dynamics. We formulate the discretized problem using a new type of entropy-regularized multimarginal optimal transport problems where the cost is a decomp ...

2023

Continuation Methods For Riemannian Optimization

Daniel Kressner, Axel Elie Joseph Séguin

Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target function on a Riemann ...

SIAM PUBLICATIONS2022

Blind as a bat: spatial perception without sight

Frederike Dümbgen

Among our five senses, we rely mostly on audition and vision to perceive an environment. Our ears are able to detect stimuli from all directions, especially from obstructed and far-away objects. Even in smoke, harsh weather conditions, or at night â situ ...

EPFL2021

Automated Design: A Journey Across Modelling, Optimization, and Education

Cyril Picard

Machine intelligence greatly impacts almost all domains of our societies. It is profoundly changing the field of mechanical engineering with new technical possibilities and processes. The education of future engineers also needs to adapt in terms of techni ...

EPFL2021

From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming

Daniel Kuhn, John Lygeros, Peyman Mohajerin Esfahani, Tobias Sutter

We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite-dimensional LP to tractable finite convex programs ...

SIAM Publications2018

Improving the control of prosthetic hands with tactile sensing

Sylvain Calinon, Noémie Laure Gwendoline Jaquier

Despite recent advances in prostheses, intuitive and robust control of poly-articulated prosthetic hands remains an unsolved problem. The TACT-HAND project aims at providing hand amputees with improved dexterous capabilities by exploiting tactile sensing a ...

2018

Erdos Distinct Distances Problem and Extensions over Finite Spaces

Van Thang Pham

In this thesis we study a number of problems in Discrete Combinatorial Geometry in finite spaces. The contents in this thesis are structured as follows: In Chapter 1 we will state the main results and the notations which will be used throughout the thesis. ...

EPFL2017

A New Framework for Distributed Submodular Maximization

Justin Dean Ward

A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing distributed algo ...

Ieee2016

On the born approximation for differential microwave imaging using volume integral equation formulation

Juan Ramon Mosig, Michael Mattes, Benjamin Fuchs, Benjamin Fuchs, Mina Bjelogrlic

The Degree of Non-Linearity (DNL) of scattering problems and specifically of differential Microwave Imaging (dMWI) problems is addressed in this paper. The quantification of the DNL amounts to evaluate the validity range of the Born first order (linear) ap ...

2016

Local discontinuous Galerkin methods for fractional ordinary differential equations

Jan Sickmann Hesthaven

This paper discusses the upwinded local discontinuous Galerkin methods for the one-term/multi-term fractional ordinary differential equations (FODEs). The natural upwind choice of the numerical fluxes for the initial value problem for FODEs ensures stabili ...

2015

Enumeration-based approach to solving parametric linear complementarity problems

Colin Neil Jones

This paper presents a solution method for parametric linear complementarity problems (PLCP) that relies on an enumeration technique to discover all feasible bases. The enumeration procedure is based on evaluating all possible combinations of active constra ...

Elsevier2015

K-Adaptability in Two-Stage Robust Binary Programming

Daniel Kuhn, Wolfram Wiesemann, Grani Adiwena Hanasusanto

Over the last two decades, robust optimization has emerged as a computationally attractive approach to formulate and solve single-stage decision problems affected by uncertainty. More recently, robust optimization has been successfully applied to multi-sta ...

Informs2015

Optimal expulsion and optimal confinement of a Brownian particle with a switching cost

Robert Dalang, Laura Claudia Catherine Vinckenbosch

We solve two stochastic control problems in which a player tries to minimize or maximize the exit time from an interval of a Brownian particle, by controlling its drift. The player can change from one drift to another but is subject to a switching cost. In ...

Elsevier Science Bv2014

Learning with tensors: a framework based on convex optimization and spectral regularization

Quoc Tran Dinh

We present a framework based on convex optimization and spectral regularization to perform learning when feature observations are multidimensional arrays (tensors). We give a mathematical characterization of spectral penalties for tensors and analyze a uni ...

Springer2014

Efficient geometrical parametrisation techniques of interfaces for reduced-order modelling: application to fluid-structure interaction coupling problems

Gianluigi Rozza, Davide Forti

We present some recent advances and improvements in shape parametrisation techniques of interfaces for reduced-order modelling with special attention to fluid-structure interaction problems and the management of structural deformations, namely, to represen ...

Taylor & Francis2014

Extended Reverse Convex Programming: An Active-Set Approach to Global Optimization

Gene Bunin

Reverse convex programming (RCP) represents an important class of global optimization problems consisting of concave cost and inequality constraint functions. While useful in many practical scenarios due to the frequent appearance of concave models, a more ...

Springer Verlag2016

Tight Approximation Algorithms for Scheduling with Fixed Jobs and Nonavailability

Ola Nils Anders Svensson

We study two closely related problems in nonpreemptive scheduling of jobs on identical parallel machines. In these two settings there are either fixed jobs or nonavailability intervals during which the machines are not available; in both cases, the objecti ...

Assoc Computing Machinery2012

Tight Bounds on the Redundancy of Huffman Codes

In this paper, we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman c ...

Ieee-Inst Electrical Electronics Engineers Inc2012