Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,341 papers · 148 categories

Trend · papers per month

6.2%12.4%18.6%24.7% · Feb 202619922001200920182026
48 results for Photo-realistic samples

Pseudo rehearsal uses non-photo-realistic images to save resources without sacrificing performance.

problem Catastrophic forgetting in neural networks when learning new tasks.
method Synthetically generate non-photo-realistic images to rehearse previous tasks.
result Non-photo-realistic images can be used for rehearsal without sacrificing performance and significantly reduce resource consumption.

StackGAN generates photo-realistic images from text descriptions.

problem Generating high-quality images from text descriptions is challenging.
method StackGAN uses a sketch-refinement process with two GAN stages and Conditioning Augmentation.
result StackGAN generates photo-realistic images with photo-realistic details and necessary details.

Paper proposes using synthetic data to improve face recognition accuracy.

problem Improving face recognition accuracy using real data alone.
method Proposes a GAN that disentangles identity attributes and generates photo-realistic synthetic images.
result Synthetic images generated by the model are photo-realistic and can increase face recognition accuracy.

Paper proposes a new approach to improve WGAN training and achieves state-of-the-art results.

problem Difficulty in training GANs, especially Wasserstein GANs.
method Introduces a consistency term to enforce Lipschitz continuity in WGAN training.
result Achieves inception score of more than 5.0 with only 1,000 CIFAR-10 images and exceeds 90% accuracy on CIFAR-10 with 4,000 labeled images.

StackGAN++ generates high-quality images from text descriptions.

problem Generating high-quality photo-realistic images from text descriptions.
method Two-stage and multi-stage generative adversarial networks (GANs) with stacked architecture.
result StackGAN++ significantly outperforms other methods in generating photo-realistic images.

Efficiently generates high-resolution images with reduced sampling time using LEGO bricks.

problem Efficiently generating high-resolution images with reduced sampling time.
method Introduces LEGO bricks that integrate Local-feature Enrichment and Global-content Orchestration to create a test-time reconfigurable diffusion backbone.
result Significantly reduces sampling time compared to other methods.

IntroVAE synthesizes high-quality photos by self-evaluating and improving its outputs.

problem Generating high-quality photographic images with stable and realistic results.
method Introspective Variational Autoencoder (IntroVAE) that trains inference and generator models jointly, encouraging the inference model to distinguish between generated and real samples.
result Produces high-resolution photo-realistic images comparable to or better than state-of-the-art GANs.

Aims to learn from multiple unpredictable teachers with minimal interaction.

problem Learning from multiple non-deterministic teachers with low interaction cost.
method Develops a framework and an active learning algorithm to estimate a distribution over policy space.
result Significantly reduces interaction with teachers without compromising performance.

Automated testing improves deep learning model accuracy by 259.2%.

problem Ensuring robustness of deep learning models through automated testing.
method Jointly optimizing differential behaviors and neuron coverage; generating corner-cases; applying transformations and GANs.
result Deep learning model accuracy increased by 259.2% using automated generated corner cases.

FAMOS combines parametric and non-parametric methods for efficient image stylization.

problem Efficiently stylize images with limited data and compute resources.
method Fully Adversarial Mosaics (FAMOS) that integrates parametric and non-parametric approaches.
result Demonstrates the effectiveness of FAMOS in stylizing images with minimal data and compute resources.

New method controls generative models with continuous factors.

problem Lack of control over generative models and poor understanding of latent space.
method Introduces a method to find meaningful directions in latent space for precise control of generated images.
result Demonstrates effectiveness of method for GANs and variational auto-encoders.

StyleNeRF generates high-resolution images with 3D consistency and style control.

problem Generating high-resolution images with fine details and 3D consistency.
method Integrates NeRF into a style-based generator for efficient high-resolution image synthesis.
result Synthesizes high-resolution images at interactive rates with high 3D consistency and style control.

Sketch-BERT learns vector sketches using BERT-like self-supervised learning.

problem Lack of effective vector sketch representation for recognition and retrieval tasks.
method Generalized BERT to sketch domain with novel embedding networks and self-supervised sketch gestalt learning.
result Improved performance on sketch recognition, retrieval, and gestalt tasks.

Automatically infers high dynamic range illumination from a single indoor photo.

problem Predicting accurate indoor illumination from a single image.
method End-to-end deep neural network trained in three steps: lighting classifier, scene light localization, and fine-tuning for intensity prediction.
result Significantly outperforms previous methods in recovering high-quality HDR illumination.

DeepRacing uses neural networks to predict trajectories for autonomous racing in video games.

problem Training algorithms for high-speed autonomous racing in realistic environments.
method Developed a virtual testbed using F1 video games, trained neural networks to predict trajectories and control commands.
result Trajectory prediction outperforms end-to-end control methods in autonomous racing simulations.

Enhanced Sampling Scheme improves masked generative modeling.

problem Limitations of existing sampling schemes in masked non-autoregressive generative modeling.
method ESS consists of three stages: Naive Iterative Decoding, Critical Reverse Sampling, and Critical Resampling.
result ESS achieves significant performance gains in unconditional and class-conditional sampling.

This paper reviews various sampling methods from statistics and machine learning.

problem Addressing sampling methods in statistics and machine learning.
method Explains and reviews simple random sampling, bootstrapping, stratified sampling, cluster sampling, multistage sampling, network sampling, snowball sampling, and sampling from cumulative distribution function.
result Summarizes characteristics, pros, and cons of different sampling methods.

RISA improves VFL by using imputed samples with low uncertainty.

problem Limited overlapping samples constrain VFL performance.
method Imputing non-overlapping samples and using evidence theory to select reliable imputed samples.
result Significant performance gains achieved, especially with limited overlapping samples.

Improved privacy-preserving methods for estimating multiple samples from distributions.

problem Estimating multiple samples from distributions while maintaining privacy.
method Developed new multi-sampling techniques for differentially private data estimation.
result Achieved significant reduction in sample complexity for multi-sampling from finite domains and Gaussian distributions.

Paper introduces a new sampling method combining Consistency Models with importance sampling.

problem Inherent errors in samples and high NFEs for high-quality samples in Boltzmann distributions.
method Combines Consistency Models with importance sampling to produce unbiased samples with minimal NFEs.
result Produces unbiased samples using only 6-25 NFEs, comparable to 100 NFEs for DDPMs.

Wedge Sampling improves tensor completion with nearly-linear sample complexity.

problem Efficiently completing low-rank tensors from a subset of entries.
method Non-adaptive wedge sampling to promote structured connections in tensor completion.
result Polynomial-time algorithms achieve weak and exact recovery with nearly linear sample complexity.

Neural network accuracy improves with denser training samples.

problem Improving neural network accuracy on unseen test samples.
method Bounding empirical training error smoothed across activation regions and using it to discard high-risk test samples.
result Discarding high-risk test samples based on error bounds improves prediction accuracy by up to 20%.

Efficiently samples sequences without replacement for machine learning models.

problem Generating diverse outputs from sequential models without duplicates.
method Incremental sampling procedure for randomized programs, including neural models.
result Efficacy and flexibility of incremental sampling for large output spaces.