Graph-based Transform Coding with Application to Image Compression

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Integer linear programming (ILP) is an elegant approach to solve linear optimization problems, naturally described using integer decision variables. Within the context of physics-inspired machine learning (ML) applied to chemistry, we demonstrate the relev ...

In this work, we develop first-order (Hessian-free) and zeroth-order (derivative-free) implementations of the Cubically Regularized Newton Method for solving general non-convex optimization problems. For that, we employ finite difference approximations of ...

Context. Imaging in radio interferometry requires solving an ill-posed noisy inverse problem, for which the most adopted algorithm is the original CLEAN algorithm and its variants. Alternative explicit optimization methods have gained increasing attention, ...

We develop new tools to study landscapes in nonconvex optimization. Given one optimization problem, we pair it with another by smoothly parametrizing the domain. This is either for practical purposes (e.g., to use smooth optimization algorithms with good g ...

This paper develops a fast algorithm for computing the equilibrium assignment with the perturbed utility route choice (PURC) model. Without compromise, this allows the significant advantages of the PURC model to be used in large-scale applications. We form ...

Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models c ...

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

We introduce and derive the Fourier -enhanced 3D electrostatic field solver of the gyrokinetic full -f PIC code PICLS. The solver makes use of a Fourier representation in one periodic direction of the domain to make the solving of the system easily paralle ...

Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...

We formulate computed-tomography reconstruction as a continuous-domain optimization problem with Hessian total variation (HTV) as the regularizer. HTV is a sparsity-promoting regularizer that favors continuous and piecewise-linear functions with few affine ...

Situational awareness strategies are essential for the reliable and secure operation of the electric power grid which represents critical infrastructure in modern society. With the rise of converter-interfaced renewable generation and the consequent shift ...

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. We establish communication lower bounds that determine ...

We consider a network of agents that must solve an online optimization problem from continual observation of streaming data. To this end, the agents implement a distributed cooperative strategy where each agent is allowed to perform local exchange of infor ...

Electronic devices play an irreplaceable role in our lives. With the tightening time to market, exploding demand for computing power, and continuous desire for smaller, faster, less energy-consuming, and lower-cost chips, computer-aided design for electron ...

Deep learning has revolutionized the field of computer vision, a success largely attributable to the growing size of models, datasets, and computational power. Simultaneously, a critical pain point arises as several computer vision applications are deploye ...

A method for optimizing at least one of a geometry, an implantation procedure, and/or stimulation protocol of one or more electrodes for an electrical stimulation of a target structure in a nervous system of a living being by a computer device, the method ...

In this paper, we present a new parameterization and optimization procedure for minimizing the weight of ribbed plates. The primary goal is to reduce embodied CO2 in concrete floors as part of the effort to diminish the carbon footprint of the construction ...

Graph-based Transform Coding with Application to Image Compression

Chattez avec Graph Search

Integer Linear Programming for Unsupervised Training Set Selection in Molecular Machine Learning

First and Zeroth-Order Implementations of the Regularized Newton Method with Lazy Approximated Hessians

PolyCLEAN: Atomic optimization for super-resolution imaging and uncertainty estimation in radio interferometry

The effect of smooth parametrizations on nonconvex optimization landscapes

Perturbed Utility Stochastic Traffic Assignment

The complexity of quantum support vector machines

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Scalable constrained optimization

A ride time-oriented scheduling algorithm for dial-a-ride problems

Verification of the Fourier-enhanced 3D finite element Poisson solver of the gyrokinetic full-f code PICLS

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

A Continuous-Domain Solution for Computed Tomography with Hessian Total-Variation Regularization

Functional-Basis Analysis of Non-Stationary Signals in Modern Power Grids: Theory and Implementation in Embedded Systems

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

COMMUNICATION LOWER BOUNDS AND OPTIMAL ALGORITHMS FOR MULTIPLE TENSOR-TIMES-MATRIX COMPUTATION

Distributed Adaptive Learning Under Communication Constraints

Contemporary Logic Synthesis: with an Application to AQFP Circuit Optimization

Fast and Future: Towards Efficient Forecasting in Video Semantic Segmentation

A method and system for optimizing design, implantation, and stimulation protocols of electrodes stimulating the nervous system

Mesh-based topology, shape and sizing optimization of ribbed plates