Search Results for author: George V. Moustakides

Found 8 papers, 0 papers with code

Query-Based Selection of Optimal Candidates under the Mallows Model

no code implementations18 Jan 2021 Xujun Liu, Olgica Milenkovic, George V. Moustakides

We study the secretary problem in which rank-ordered lists are generated by the Mallows model and the goal is to identify the highest-ranked candidate through a sequential interview process which does not allow rejected candidates to be revisited.

Methodology Discrete Mathematics Information Theory Combinatorics Information Theory 05A

Image De-Quantization Using Generative Models as Priors

no code implementations15 Jul 2020 Kalliopi Basioti, George V. Moustakides

Image quantization is used in several applications aiming in reducing the number of available colors in an image and therefore its size.

Quantization

Image Restoration from Parametric Transformations using Generative Models

no code implementations27 May 2020 Kalliopi Basioti, George V. Moustakides

When images are statistically described by a generative model we can use this information to develop optimum techniques for various image restoration problems as inpainting, super-resolution, image coloring, generative model inversion, etc.

Blind Image Deblurring Colorization +2

Training Neural Networks for Likelihood/Density Ratio Estimation

no code implementations1 Nov 2019 George V. Moustakides, Kalliopi Basioti

In classical approaches the two densities are assumed known or to belong to some known parametric family.

Density Ratio Estimation Two-sample testing

Optimizing Shallow Networks for Binary Classification

no code implementations24 May 2019 Kalliopi Basioti, George V. Moustakides

Data driven classification that relies on neural networks is based on optimization criteria that involve some form of distance between the output of the network and the desired label.

Binary Classification Classification +1

Kernel-Based Training of Generative Networks

no code implementations23 Nov 2018 Kalliopi Basioti, George V. Moustakides, Emmanouil Z. Psarakis

Generative adversarial networks (GANs) are designed with the help of min-max optimization problems that are solved with stochastic gradient-type algorithms which are known to be non-robust.

Cannot find the paper you are looking for? You can Submit a new open access paper.