Concept

Poids (théorie des représentations)

Publications associées (27)

Multiplicity-free Representations of Algebraic Groups

Let K be an algebraically closed field of characteristic zero, and let G be a connected reductive algebraic group over K. We address the problem of classifying triples (G, H, V ), where H is a proper connected subgroup of G, and V is a finitedimensional ir ...

Amer Mathematical Soc2024

Koopman-based Data-driven Robust Control of Nonlinear Systems Using Integral Quadratic Constraints

Alireza Karimi, Mert Eyuboglu

This paper introduces a novel method for data-driven robust control of nonlinear systems based on the Koopman operator, utilizing Integral Quadratic Constraints (IQCs). The Koopman operator theory facilitates the linear representation of nonlinear system d ...

2024

Mean value theorems for collections of lattices with a prescribed group of symmetries

Nihar Prakash Gargava

Euclidean lattices are mathematical objects of increasing interest in the fields of cryptography and error-correcting codes. This doctoral thesis is a study on high-dimensional lattices with the motivation to understand how efficient they are in terms of b ...

EPFL2024

Price Discrimination with Robust Beliefs

Thomas Alois Weber, Jun Han

This paper considers the problem of second-degree price discrimination when the type distribution is unknown or imperfectly specified by means of an ambiguity set. As robustness measure we use a performance index, equivalent to relative regret, which quant ...

Elsevier2023

Cohomology in singular blocks of parabolic category O

Jonathan Gruber

We determine the dimensions of Ext -groups between simple modules and dual generalized Verma modules in singular blocks of parabolic versions of category O for complex semisimple Lie algebras and affine Kac-Moody algebras. ...

2023

4M: Massively Multimodal Masked Modeling

Amir Roshan Zamir, Shuqing Teresa Yeo, Oguzhan Fatih Kar, Roman Christian Bachmann, David Mizrahi

Current machine learning models for vision are often highly specialized and limited to a single modality and task. In contrast, recent large language models exhibit a wide range of capabilities, hinting at a possibility for similarly versatile models in co ...

Neural Information Processing Systems (Nips)2023

Data-driven fixed-structure frequency-based H2 and H∞ controller design

Alireza Karimi, Philippe Louis Schuchert, Vaibhav Gupta

The frequency response data of a generalized system is used to design fixed-structure controllers for the H2 and H∞ synthesis problem. The minimization of the two and infinity norm of the transfer function between the exogenous inputs and performance outpu ...

Elsevier BV2024

Coxeter Combinatorics For Sum Formulas In The Representation Theory Of Algebraic Groups

Jonathan Gruber

Let G be a simple algebraic group over an algebraically closed field F of characteristic p >= h, the Coxeter number of G. We observe an easy 'recursion formula' for computing the Jantzen sum formula of a Weyl module with p-regular highest weight. We also d ...

AMER MATHEMATICAL SOC2022

Algebra and geometry of link homology Lecture notes from the IHES 2021 Summer School

Oscar Salomon Kivinen

These notes cover the lectures of the first named author at 2021 IHES Summer School on "Enumerative Geometry, Physics and Representation Theory" with additional details and references. They cover the definition of Khovanov-Rozansky triply graded homology, ...

WILEY2022

Learning V1 Simple Cells with Vector Representation of Local Content and Matrix Representation of Local Motion

Yufan Ren

This paper proposes a representational model for image pairs such as consecutive video frames that are related by local pixel displacements, in the hope that the model may shed light on motion perception in primary visual cortex (V1). The model couples the ...

ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE2022

From Undercomplete to Sparse Overcomplete Autoencoders to Improve LF-MMI Speech Recognition

Hervé Bourlard, Selen Hande Kabil

Starting from a strong Lattice-Free Maximum Mutual Information (LF-MMI) baseline system, we explore different autoencoder configurations to enhance Mel-Frequency Cepstral Coefficients (MFCC) features. Autoencoders are expected to generate new MFCC features ...

ISCA-INT SPEECH COMMUNICATION ASSOC2022

Generic direct summands of tensor products for simple algebraic groups and quantum groups at roots of unity

Jonathan Gruber

Let G be either a simple linear algebraic group over an algebraically closed field of characteristic l>0 or a quantum group at an l-th root of unity. The category Rep(G) of finite-dimensional G-modules is non-semisimple. In this thesis, we develop new tech ...

EPFL2022

Graph Representation Learning with Optimal Transport: Analysis and Applications

Effrosyni Simou

In several machine learning settings, the data of interest are well described by graphs. Examples include data pertaining to transportation networks or social networks. Further, biological data, such as proteins or molecules, lend themselves well to graph- ...

EPFL2022

Home, Spatial Familiarity And Routines In Mobility Behaviours

Marc-Edouard Baptiste Grégoire Schultheiss

This research explores the unreasoned influences of locational behaviour – i.e. locational habits – in Activity- Travel-Behaviour (ATB). In particular, the interrelations between Activity Space characteristics and mobility patterns. In a wider research eff ...

2021

On complete reducibility of tensor products of simple modules over simple algebraic groups

Jonathan Gruber

Let G be a simply connected simple algebraic group over an al- gebraically closed ﬁeld k of characteristic p > 0. The category of rationalG-modules is not semisimple. We consider the question of when the tensorproduct of two simple G-modules L(λ) and L(μ) ...

2021

Scalable Robust Graph Embedding with Spark

Karl Aberer, Quoc Viet Hung Nguyen, Chi Thang Duong

Graph embedding aims at learning a vector-based representation of vertices that incorporates the structure of the graph. This representation then enables inference of graph properties. Existing graph embedding techniques, however, do not scale well to larg ...

ASSOC COMPUTING MACHINERY2021

Learning computationally efficient static word and sentence representations

Prakhar Gupta

Most of the Natural Language Processing (NLP) algorithms involve use of distributed vector representations of linguistic units (primarily words and sentences) also known as embeddings in one way or another. These embeddings come in two flavours namely, sta ...

EPFL2021

A quantum algorithm for the direct estimation of the steady state of open quantum systems

Vincenzo Savona

Simulating the dynamics and the non-equilibrium steady state of an open quantum system are hard computational tasks on conventional computers. For the simulation of the time evolution, several efficient quantum algorithms have recently been developed. Howe ...

2021

Generalized Mullineux Involution And Perverse Equivalences

Thomas Gerber

We define a generalization of the Mullineux involution on multipartitions using the theory of crystals for higher-level Fock spaces. Our generalized Mullineux involution turns up in representation theory via two important derived functors on cyclotomic Che ...

2020

Oclussion-Aware Motion Planning at Roundabouts

Denis Gillet

In this work, we present a motion planning framework for automated vehicles to drive safely through intersections despite occlusions and the uncertain behavior of the surrounding vehicles. A context representation based on probably-free gaps is proposed as ...

2021