Publications associées à An Improved Analysis of Local Search for Max-Sum Diversification

Publications associées (36)

Better Approximation for Weighted 𝑘-Matroid Intersection

We consider the problem of finding an independent set of maximum weight simultaneously contained in k matroids over a common ground set. This k-matroid intersection problem appears naturally in many contexts, for example in generalizing graph and hypergrap ...

ACM2025

Search for Ηc (2s) →ωω and Ωφ and Measurements of Χcj → Ωω and Ωφ in Ψ(2s) Radiative Processes

Yunxuan Song

Using (2712 +/- 14) x 10(6) psi(2S) events collected with the BESIII detector at the BEPCII collider, we search for the decays eta(c) (2S) -> omega omega and eta(c) (2S) -> omega phi via the process psi(2S) -> gamma eta(c)(2S). No statistically significant ...

AMER PHYSICAL SOC2025

Geometric Learning: Leveraging differential geometry for learning and control

Bernardo Fichera

In this thesis, we concentrate on advancing high-level behavioral control policies for robotic systems within the framework of Dynamical Systems (DS). Throughout the course of this research, a unifying thread weaving through diverse fields emerges, and tha ...

EPFL2024

Anomalous and Chern topological waves in hyperbolic networks

Romain Christophe Rémy Fleury, Haoye Qin, Zhe Zhang, Aleksi Antoine Bossart, Zhechen Zhang

Hyperbolic lattices are a new type of synthetic materials based on regular tessellations in non-Euclidean spaces with constant negative curvature. While so far, there has been several theoretical investigations of hyperbolic topological media, experimental ...

Nature Research2024

Cochains are all you need

Kelly Spry Maggs

In this thesis, we apply cochain complexes as an algebraic model of space in a diverse range of mathematical and scientific settings. We begin with an algebraic-discrete Morse theory model of auto-encoding cochain data, connecting the homotopy theory of d ...

EPFL2024

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Yingying Ren

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

Association for Computing Machinery2024

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

A structured prediction approach for robot imitation learning

Aude Billard, Iason Batzianoulis

We propose a structured prediction approach for robot imitation learning from demonstrations. Among various tools for robot imitation learning, supervised learning has been observed to have a prominent role. Structured prediction is a form of supervised le ...

Sage Publications Ltd2023

Towards Stable and Efficient Adversarial Training against $l_1$ Bounded Adversarial Attacks

Sabine Süsstrunk, Mathieu Salzmann, Chen Liu, Yulun Jiang

We address the problem of stably and efficiently training a deep neural network robust to adversarial perturbations bounded by an

l_1

norm. We demonstrate that achieving robustness against

l_1

-bounded perturbations is more challenging than in the

l_2

...

2023

Hybrid Quadratic Programming - Pullback Bundle Dynamical Systems Control

Aude Billard, Bernardo Fichera

Dynamical System (DS)-based closed-loop control is a simple and effective way to generate reactive motion policies that well generalize to the robotic workspace, while retaining stability guarantees. Lately the formalism has been expanded in order to handl ...

SPRINGER INTERNATIONAL PUBLISHING AG2023

Retraction-based numerical methods for continuation, interpolation and time integration on manifolds

Axel Elie Joseph Séguin

The goal of this thesis is the development and the analysis of numerical methods for problems where the unknown is a curve on a smooth manifold. In particular, the thesis is structured around the three following problems: homotopy continuation, curve inter ...

EPFL2023

A Large-Scale Characterization of How Readers Browse Wikipedia

Robert West, Tiziano Piccardi, Akhil Arora

Despite the importance and pervasiveness of Wikipedia as one of the largest platforms for open knowledge, surprisingly little is known about how people navigate its content when seeking information. To bridge this gap, we present the first systematic large ...

ASSOC COMPUTING MACHINERY2023

Elastocapillary menisci mediate interaction of neighboring structures at the surface of a compliant solid

John Martin Kolinski, Lebohang Molefe

Surface stress drives long-range elastocapillary interactions at the surface of compliant solids, where it has been observed to mediate interparticle interactions and to alter the transport of liquid drops. We show that such an elastocapillary interaction ...

2023

Streaming and Matching Problems with Submodular Functions

Paritosh Garg

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

EPFL2022

Lamplighters and the bounded cohomology of Thompson's group

Nicolas Monod

We prove the vanishing of the bounded cohomology of lamplighter groups for a wide range of coefficients. This implies the same vanishing for a number of groups with self-similarity properties, such as Thompson's group F. In particular, these groups are bou ...

SPRINGER BASEL AG2022

On discrete Fourier uniqueness sets in Euclidean space

Maryna Viazovska

In this paper we present a new construction of a discrete Fourier uniqueness set in Euclidean space. ...

ICM2022

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Ralf Seifert, Anna Timonina-Farkas

Internet ranking algorithms play a crucial role in information technologies and numerical analysis due to their efficiency in high dimensions and wide range of possible applications, including scientometrics and systemic risk in finance (SinkRank, DebtRank ...

2023

Stabilized isogeometric discretizations on trimmed and union geometries, and weak imposition of the boundary conditions for the Darcy flow

Riccardo Puppi

Modern manufacturing engineering is based on a ``design-through-analysis'' workflow. According to this paradigm, a prototype is first designed with Computer-aided-design (CAD) software and then finalized by simulating its physical behavior, which usually i ...

EPFL2022

Fourier uniqueness and interpolation in Euclidean space

Martin Peter Stoller

We prove that every Schwartz function in Euclidean space can be completely recovered given only its restrictions and the restrictions of its Fourier transform to all origin-centered spheres whose radii are square roots of integers. In particular, the only ...

EPFL2022

Graph Embedding for Retrieval

Chi Thang Duong

Information retrieval (IR) systems such as search engines are important for people to find what they need among the tremendous amount of data available in their organization or on the Internet. These IR systems enable users to search in a large data collec ...

EPFL2022