CMA-ME combines CMA-ES and MAP-Elites for better quality and diversity in continuous domains.
problem Finding a diverse set of high-quality solutions in complex continuous domains.
method Combines CMA-ES self-adaptation with MAP-Elites archiving and mapping.
result CMA-ME outperforms MAP-Elites in both quality and diversity of solutions.
The study maps ML quality dimensions to fairness, enhancing the QF4SA framework.
problem Ensuring fairness in ML applications at NSOs to avoid social impacts.
method Employing the QF4SA framework, the study maps quality dimensions to fairness and investigates their interactions.
result Fairness is identified as a new quality dimension in the QF4SA framework.
Improves magnetic field mapping using an array of magnetometers with noisy input.
problem Improving magnetic field maps in indoor environments with noisy magnetometer data.
method Uses Gaussian process regression with an array of magnetometers, incorporating known array positions and relative magnetometer locations.
result The method produces higher quality magnetic field maps compared to using a single magnetometer.
New method uncovers global topology through local interactions, reducing algorithm complexity.
problem Global interaction is necessary for forming feature maps that preserve global topology.
method Competing agents engage in local interactions to form feature maps without global interaction.
result Local interactions can uncover global topology, leading to consistent map quality across diverse datasets.
MAP-Elites generates diverse trading strategies for improved execution performance.
problem Optimizing trading execution schedules in volatile market conditions.
method Quality-diversity algorithm (MAP-Elites) generating a portfolio of specialized strategies.
result Diverse strategies achieve 8-10% performance improvements, validating quality-diversity methods.
NDI enables high-quality QSM without parameter tuning.
problem Quantitative Susceptibility Mapping (QSM) with regularization tuning issues.
method Nonlinear Dipole Inversion (NDI) using a physics-based forward model and a Variational Network (VN).
result NDI achieves high-quality QSM from as few as 2-direction data.
Engine predicts real-time air quality with high resolution.
problem Real-time prediction of air pollutants for health monitoring.
method Combines official data, models, land cover, traffic data for high-resolution predictions.
result Engine produces predictions with resolution of a few dozen meters.
A new method finds diverse near-optimal portfolios using quality-diversity.
problem Optimizing financial portfolios with robustness to input parameter uncertainties.
method Quality-Diversity (QD) optimization using CVT-MAP-Elites algorithm.
result Diverse set of near-optimal portfolios identified.
Improved StyleGAN model enhances image quality and invertibility.
problem Characteristics artifacts in StyleGAN's image quality.
method Redesigned generator normalization, revisited progressive growing, and introduced a capacity problem.
result Improved image quality and easier inversion of generated images.
Deep-MAPS uses machine learning for mobile air pollution sensing in Beijing.
problem Ubiquitous sensing of urban air quality.
method Machine learning framework (Deep-MAPS) based on mobile and fixed sensors.
result Deep-MAPS achieves high spatial-temporal resolution (1km-by-1km and 1 hour) with over 85% accuracy.
In this paper, wireless video transmission to multiple users under total transmission power and minimum required video quality constraints is studied. In order to provide the desired performance levels to the end-users in real-time video transmissions while using the energy resources efficiently, we assume that power c…
Novel framework monitors cardiac image segmentation models in real-time.
problem Ensuring continuous high model performance and segmentation results in clinics.
method Formulated as anomaly detection, the framework derives surrogate quality measures for segmentation.
result Demonstrated accurate, fast, and scalable quality control monitoring.
We study a natural intrinsic definition of geometric simplices in Riemannian manifolds of arbitrary dimension n, and exploit these simplices to obtain criteria for triangulating compact Riemannian manifolds. These geometric simplices are defined using Karcher means. Given a finite set of vertices in a convex set on t…
Increasing availability of vehicle GPS data has created potentially transformative opportunities for traffic management, route planning and other location-based services. Critical to the utility of the data is their accuracy. Map-matching is the process of improving the accuracy by aligning GPS data with the road netwo…
We propose a parallel-data-free voice-conversion (VC) method that can learn a mapping from source to target speech without relying on parallel data. The proposed method is general purpose, high quality, and parallel-data free and works without any extra data, modules, or alignment procedure. It also avoids over-smoothi…
Gibbs sampling is a workhorse for Bayesian inference but has several limitations when used for parameter estimation, and is often much slower than non-sampling inference methods. SAME (State Augmentation for Marginal Estimation) \cite{Doucet99,Doucet02} is an approach to MAP parameter estimation which gives improved pa…
A neural network method tackles high-dimensional diffeomorphic mapping problems.
problem High-dimensional diffeomorphic mapping struggles with the curse of dimensionality.
method Combines variational principles with quasi-conformal theory for accurate, bijective mappings.
result Validated accuracy, robustness, and effectiveness in complex registration scenarios.
Consistency models generate high-quality samples fast and without iterative sampling.
problem Slow generation in diffusion models.
method Direct mapping of noise to data, supporting fast one-step generation and multistep sampling.
result Consistency models achieve state-of-the-art FID scores and outperform diffusion models in one-step generation.
New method improves MAP inference for CGMs on path graphs, avoiding approximation and maintaining integrality.
problem Improving MAP inference for aggregated count data in CGMs with small values.
method Formulated as a minimum cost flow problem, solved using DCA with efficient subroutines.
result Outputs higher quality solutions than conventional methods.
Solves imaging inverse problems using autoencoding priors.
problem Ill-posed inverse problems in imaging.
method Joint Posterior Maximization with Autoencoding Prior (JPMAP).
result JPMAP converges to a stationary point and provides robust solutions.
Kaleidoscope matrices improve model quality and inference speed.
problem Choosing structured linear transformations for efficiency and accuracy.
method Introduce kaleidoscope matrices that can capture any structured matrix with near-optimal space and time complexity. Learn these matrices automatically within end-to-end pipelines.
result Kaleidoscope matrices can improve model quality and inference speed.
Paper proposes a method to estimate intra-observer variability in echocardiography quality assessment.
problem Intra-observer variability in echocardiography quality assessment impacts deep neural network reliability.
method Modeling intra-observer variability as aleatoric uncertainty in a regression problem.
result The proposed method reduces error from 0.11 to 0.09, improving test accuracy by 5.7%.
Recently, deep neural network (DNN) has made a breakthrough in monaural source enhancement. Through a training step by using a large amount of data, DNN estimates a mapping between mixed signals and clean signals. At this time, we use an objective function that numerically expresses the quality of a mapping by DNN. In …
OTRE uses OT to improve retinal images, outperforming existing methods.
problem Improving quality of non-mydriatic retinal images for accurate diagnoses.
method OT theory for image-to-image translation, regularization by enhancing.
result OTRE outperforms state-of-the-art methods on various retinal image tasks.
Proposes a cross-scale residual network for multiple image restoration tasks.
problem Image restoration tasks (super-resolution, denoising, deblocking) have strong correlations.
method Cross-scale residual network exploiting scale-related features and inter-task correlations.
result Outperforms state-of-the-art methods in multiple image restoration tasks.
Several methods were recently proposed for the task of translating images between domains without prior knowledge in the form of correspondences. The existing methods apply adversarial learning to ensure that the distribution of the mapped source domain is indistinguishable from the target domain, which suffers from kn…
The paper provides a concentration result and sample complexity for linear Monge mapping estimation and its application in domain adaptation.
problem Estimating the linear Monge mapping between distributions and its application in domain adaptation.
method The approach involves proving a concentration result and sample complexity for the linear mapping operator, and using it to derive a generalization bound for domain adaptation with optimal transport.
result The method achieves a sample complexity of n−1/2 and approaches the performance of theoretical Bayes predictor under mild conditions. Growing amounts of online user data motivate the need for automated processing techniques. In case of user ratings, one interesting option is to use neural networks for learning to predict ratings given an item and a user. While training for prediction, such an approach at the same time learns to map each user to a vec…
Neural approximate computing gains enormous energy-efficiency at the cost of tolerable quality-loss. A neural approximator can map the input data to output while a classifier determines whether the input data are safe to approximate with quality guarantee. However, existing works cannot maximize the invocation of the a…
Work addresses long-term accuracy issues in IoT air quality sensors.
problem Limited accuracy of IoT air quality sensors in long-term field deployments.
method Adaptive machine learning strategies for network calibration.
result Prolongs the validity of multisensor calibration models for continuous learning.
Graph Energy Matching improves generation quality for molecular graphs.
problem Discrete energy-based models struggle with efficient and high-quality sampling for graph generation.
method Inspired by transport-map optimization, Graph Energy Matching learns a permutation-invariant potential energy to guide sampling.
result GEM matches or surpasses discrete diffusion baselines on molecular graph benchmarks.
We present a new autoencoder-type architecture that is trainable in an unsupervised mode, sustains both generation and inference, and has the quality of conditional and unconditional samples boosted by adversarial learning. Unlike previous hybrids of autoencoders and adversarial networks, the adversarial game in our ap…
Study evaluates saliency maps on artificial data with different backgrounds.
problem Objective evaluation of saliency methods on artificial data with varying backgrounds.
method Developed a framework to generate artificial data with synthetic lesions and a known ground truth map, evaluated two data sets with different backgrounds (Perlin noise and 2D brain MRI slices).
result Heatmaps vary strongly between saliency methods and backgrounds.
Graph neural network predicts optimal coarse-grained mapping operators.
problem Optimal coarse-grained mapping operators selection for molecular dynamics simulations.
method Graph Neural Network (DSGPM) trained on expert-annotated data.
result DSGPM outperforms state-of-the-art methods in graph segmentation.
Generative adversarial networks (GANs) are capable of producing high quality image samples. However, unlike variational autoencoders (VAEs), GANs lack encoders that provide the inverse mapping for the generators, i.e., encode images back to the latent space. In this work, we consider adversarially learned generative mo…
The goal of personalized decision making is to map a unit's characteristics to an action tailored to maximize the expected outcome for that unit. Obtaining high-quality mappings of this type is the goal of the dynamic regime literature. In healthcare settings, optimizing policies with respect to a particular causal pat…
We propose a training method for deep neural network (DNN)-based source enhancement to increase objective sound quality assessment (OSQA) scores such as the perceptual evaluation of speech quality (PESQ). In many conventional studies, DNNs have been used as a mapping function to estimate time-frequency masks and traine…
Improved saliency maps for deep neural networks with reduced noise.
problem Noisy explanations in Integrated Gradients for deep neural networks.
method SmoothTaylor, adaptive noising, and SmoothGrad techniques.
result SmoothTaylor and adaptive noising generate better quality saliency maps.
Currently available methods for extracting saliency maps identify parts of the input which are the most important to a specific fixed classifier. We show that this strong dependence on a given classifier hinders their performance. To address this problem, we propose classifier-agnostic saliency map extraction, which fi…
The Jacobian-based Saliency Map Attack is a family of adversarial attack methods for fooling classification models, such as deep neural networks for image classification tasks. By saturating a few pixels in a given image to their maximum or minimum values, JSMA can cause the model to misclassify the resulting adversari…
This work broadens optimal transport map estimation theory to stochastic settings.
problem Existing theory for optimal transport map estimation is restricted to deterministic maps under specific conditions.
method Introduces a novel metric for evaluating stochastic maps, develops computationally efficient estimators with robust guarantees.
result First general-purpose theory for map estimation compatible with real-world stochastic applications.
Enhances speech quality in noisy environments using symbolic sequential modeling.
problem Improving speech quality in noisy conditions.
method Incorporates symbolic sequential modeling into speech enhancement framework.
result Significant improvement in speech quality metrics (PESQ, STOI) on TIMIT dataset.
SmoothGrad and VarGrad are techniques that enhance the empirical quality of standard saliency maps by adding noise to input. However, there were few works that provide a rigorous theoretical interpretation of those methods. We analytically formalize the result of these noise-adding methods. As a result, we observe two …
New method improves generative modeling on convex domains using regularized mirror maps and Student-t priors.
problem Challenges in generative modeling on convex domains with heavy-tailed targets.
method Mirror Flow Matching with regularized mirror maps and Student-t priors.
result Empirically outperforms baselines and achieves competitive sample quality.
BOP-Elites uses Bayesian Optimisation for QD search, improving efficiency and insight.
problem Finding diverse high-performing points from an objective function.
method Bayesian Optimisation and Gaussian Processes to model quality and diversity.
result Significantly more sample efficient and better at identifying niche solutions.
VFMs use noise adapters to conditionally generate images in one step.
problem Conditional image generation with iterative models is slow and requires explicit sampling paths.
method Developed a variational flow map framework that learns noise distributions for conditional sampling.
result VFMs achieve well-calibrated conditional samples in a single forward pass.
The paper proposes a novel Kernelized image segmentation scheme for noisy images that utilizes the concept of Smallest Univalue Segment Assimilating Nucleus (SUSAN) and incorporates spatial constraints by computing circular colour map induced weights. Fuzzy damping coefficients are obtained for each nucleus or center p…
Geometric Gaussian approximations capture any distribution.
problem Approximating complex probability distributions.
method Geometric Gaussian approximations through diffeomorphisms or exponential maps.
result Geometric Gaussian approximations are universal, capturing any distribution.