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.

168,695 papers · 148 categories

Trend · papers per month

15304459 · Jun 202019922001200920172026
48 results for 3D synthesis

DreamFusion uses text-to-image diffusion models to create 3D images efficiently.

problem Lack of large-scale 3D datasets and efficient architectures for 3D synthesis.
method Adapting a 2D diffusion model to 3D synthesis using a loss based on probability density distillation.
result A 3D model can be optimized from a 2D diffusion model, allowing for text-to-3D synthesis.

Worldsheet wraps a 3D mesh sheet onto a single image to synthesize novel views.

problem Synthesizing novel views from a single image with large viewpoint changes.
method Shrink-wrapping a planar mesh sheet onto the input image, consistent with learned depth.
result Worldsheet consistently outperforms prior methods on single-image view synthesis.

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.

LION generates high-quality 3D shapes using hierarchical latent diffusion models.

problem Creating high-quality 3D shapes for digital artists.
method Hierarchical Latent Point Diffusion Model (LION) with a global shape latent and point-structured latent space.
result LION achieves state-of-the-art generation performance on ShapeNet benchmarks.

Topology-GS improves 3D GS for better structural and feature integrity.

problem Compromised pixel-level and feature-level integrity in 3D GS.
method Incorporates Local Persistent Voronoi Interpolation (LPVI) and PersLoss based on persistent homology.
result Topology-GS outperforms existing methods in PSNR, SSIM, and LPIPS metrics.

A benchmark evaluates ioUS-to-MR synthesis methods for brain tumor surgery.

problem Difficult interpretation of ioUS images for brain tumor surgery.
method Six generators trained under four inference regimes and two targets on public data.
result SynDiff-2.5D best preserved downstream segmentation (U_Dice=0.55).

In this paper we explore the richness of information captured by the latent space of a vision-based generative model. The model combines unsupervised generative learning with a task-based performance predictor to learn and to exploit task-relevant object affordances given visual observations from a reaching task, invol…

2019-09-30abs ↗pdf ↗

The recent success of raw audio waveform synthesis models like WaveNet motivates a new approach for music synthesis, in which the entire process --- creating audio samples from a score and instrument information --- is modeled using generative neural networks. This paper describes a neural music synthesis model with fl…

2018-11-01abs ↗pdf ↗

Paper introduces a method for generating interlocutor-aware facial gestures in dyadic settings.

problem Generating appropriate non-verbal behavior for conversational agents in dyadic settings.
method Probabilistic method using multi-modal cues from the interlocutor to synthesize facial gestures.
result The model successfully leverages multi-modal input from the interlocutor to generate more appropriate behavior.

Inverse Drum Machine separates drum mixes using transcription and synthesis.

problem Separating individual drum tracks from mixed recordings.
method Analysis-by-synthesis framework combining deep learning and automatic transcription.
result Separation quality comparable to supervised methods requiring isolated stems.

Language models predict inorganic synthesis conditions and temperatures.

problem Limited data and heuristic approaches constrain inorganic synthesis planning.
method Language models without fine-tuning predict precursor conditions and temperatures.
result Language models achieve high accuracy in predicting synthesis conditions and temperatures.

Programming-by-example (PBE) is a synthesis paradigm that allows users to generate functions by simply providing input-output examples. While a promising interaction paradigm, synthesis is still too slow for realtime interaction and more widespread adoption. Existing approaches to PBE synthesis have used automated reas…

2020-02-07abs ↗pdf ↗

CrossBeam learns to search more efficiently in program synthesis.

problem Efficiently searching through vast program spaces.
method Trains a neural model to guide program synthesis, combining previously explored programs.
result CrossBeam explores much smaller portions of the program space compared to state-of-the-art methods.

AutoDiff combines auto-encoder and diffusion model for realistic tabular data synthesis.

problem Generating realistic synthetic tabular data with heterogeneous features.
method Employing auto-encoder architecture to handle tabular data's complexity.
result Synthetic tables from AutoDiff show good statistical fidelity and perform well in machine learning tasks.

Coupling the high-fidelity generation capabilities of label-conditional image synthesis methods with the flexibility of unconditional generative models, we propose a semantic bottleneck GAN model for unconditional synthesis of complex scenes. We assume pixel-wise segmentation labels are available during training and us…

2019-11-26abs ↗pdf ↗

Model for directed synthesis of audio textures using multi-scale RNNs.

problem Challenges in modeling complex audio textures with traditional methods.
method Combining multi-scale RNNs with a conditioning strategy for user-directed synthesis.
result Demonstrated improved performance on various audio texture datasets.

We present a program synthesis-oriented dataset consisting of human written problem statements and solutions for these problems. The problem statements were collected via crowdsourcing and the program solutions were extracted from human-written solutions in programming competitions, accompanied by input/output examples…

2018-07-06abs ↗pdf ↗

Proposes a synthesis algorithm using Conformal Prediction for improved Deep Learning performance.

problem Assessing the quality of synthesised data for high-stake domains.
method Conformal Prediction framework for generating data from high-confidence feature space regions.
result Training sets extended with confident synthesised data improved Deep Learning performance by up to 61 percentage points F1-score.

InVAErt networks use data-driven methods for system synthesis and identifiability analysis.

problem Model synthesis and identifiability analysis for complex systems.
method Deterministic encoder and decoder, normalizing flow, variational encoder, loss function penalty coefficients, latent space sampling.
result Validation through various system types, demonstrating effectiveness of the framework.

Generative adversarial networks (GANs) are a recent approach to train generative models of data, which have been shown to work particularly well on image data. In the current paper we introduce a new model for texture synthesis based on GAN learning. By extending the input noise distribution space from a single vector …

2016-11-24abs ↗pdf ↗

We study knots in 3d Chern-Simons theory with complex gauge group SL(N,C)SL(N,\mathbb{C}), in the context of its relation with 3d N=2\mathcal{N}=2 theory (the so-called 3d-3d correspondence). The defect has either co-dimension 2 or co-dimension 4 inside the 6d (2,0)(2,0) theory, which is compactified on a 3-manifold M^\hat{M}. …

2015-10-13abs ↗pdf ↗

The study examines optimal synthesis in a radially symmetric Grushin space with conditions on the weight function.

problem Optimal synthesis in a radially symmetric Grushin space with a weight function.
method Analysis of the geometry of R3\mathbb{R}^3 with a weighted Carnot-Carathéodory metric, providing conditions for Grushin-like structure, and describing optimal synthesis.
result Sufficient conditions on the weight function ensure a Grushin-like structure, and the candidate cut time coincides with the true cut time in the integrable case.