The Myers-Steenrod Theorem For Finsler Manifolds Of Low Regularity

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...

By juxtaposing ideas from fractal geometry and dynamical systems, Furstenberg proposed a series of conjectures in the late 1960's that explore the relationship between digit expansions with respect to multiplicatively independent bases. In this work, we in ...

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 ...

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 ...

Meta-learning is the core capability that enables intelligent systems to rapidly generalize their prior ex-perience to learn new tasks. In general, the optimization-based methods formalize the meta-learning as a bi-level optimization problem, that is a nes ...

Daily manipulation tasks are characterized by regular features associated with the task structure, which can be described by multiple geometric primitives related to actions and object shapes. Only using Cartesian coordinate systems cannot fully represent ...

Factored form is a powerful multi-level representation of a Boolean function that readily translates into an implementation of the function in CMOS technology. In particular, the number of literals in a factored form correlates strongly with the number of ...

We present LISA, a proof system and proof assistant for constructing proofs in schematic first-order logic and axiomatic set theory. The logical kernel of the system is a proof checker for first-order logic with equality and schematic predicate and fun ...

This data set provides a computer-assisted proof for the kernel inequalities needed to prove universal optimality in the paper "Universal optimality of the E_8 and Leech lattices and interpolation formulas" (by Cohn, Kumar, Miller, Radchenko, and Viazovska ...

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 ...

We consider the problem of provably finding a stationary point of a smooth function to be minimized on the variety of bounded-rank matrices. This turns out to be unexpectedly delicate. We trace the difficulty back to a geometric obstacle: On a nonsmooth se ...

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

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 ...

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

For compact, isometrically embedded Riemannian manifolds N -> R-L, we introduce a fourth-order version of the wave maps equation. By energy estimates, we prove an a priori estimate for smooth local solutions in the energy subcritical dimension n = 1, 2. Th ...

We describe the first gradient methods on Riemannian manifolds to achieve accelerated rates in the non-convex case. Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical ...

Representing and reconstructing 3D deformable shapes are two tightly linked problems that have long been studied within the computer vision field. Deformable shapes are truly ubiquitous in the real world, whether be it specific object classes such as human ...

Most logic synthesis algorithms work on graph representations of logic functions with nodes associated with arbitrary logic expressions or simple logic functions and iteratively optimize such graphs. While recent multilevel logic synthesis efforts focused ...

We show that computing the majority of n copies of a boolean function g has randomised query complexity R(Maj∘gⁿ) = Θ(n⋅R ̅_{1/n}(g)). In fact, we show that to obtain a similar result for any composed function f∘gⁿ, it suffices to prove a sufficiently stro ...

We prove equidistribution at shrinking scales for the monochromatic ensemble on a compact Riemannian manifold of any dimension. This ensemble on an arbitrary manifold takes a slowly growing spectral window in order to synthesize a random function. With hig ...

The Myers-Steenrod Theorem For Finsler Manifolds Of Low Regularity

Chat with Graph Search

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Additive and geometric transversality of fractal sets in the integers

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

A structured prediction approach for robot imitation learning

RMAML: Riemannian meta-learning with orthogonality constraints

A geometric optimal control approach for imitation and generalization of manipulation skills

Improving Standard-Cell Design Flow using Factored Form Optimization

LISA – A Modern Proof System

Computer-assisted proof of kernel inequalities

Continuation Methods For Riemannian Optimization

Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

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

Formula Normalizations in Verification

Energy Bounds For A Fourth-Order Equation In Low Dimensions Related To Wave Maps

An Accelerated First-Order Method for Non-convex Optimization on Manifolds

Learning to Represent and Reconstruct 3D Deformable Objects

Three-Input Gates for Logic Synthesis

A Majority Lemma for Randomised Query Complexity

Shrinking Scale Equidistribution for Monochromatic Random Waves on Compact Manifolds