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,742 papers · 148 categories

Trend · papers per month

0111 · Jun 201919922001200920172026
10 results for gradient-guided

Gradient-guided nested sampling improves posterior inference efficiency.

problem Efficiently sampling from complex posterior distributions.
method Gradient-guided nested sampling combining differentiable programming, Hamiltonian slice sampling, clustering, mode separation, dynamic nested sampling, and parallelization.
result Significantly faster mode discovery and more accurate partition function estimates.

Recent breakthroughs in defenses against adversarial examples, like adversarial training, make the neural networks robust against various classes of attackers (e.g., first-order gradient-based attacks). However, it is an open question whether the adversarially trained networks are truly robust under unknown attacks. In…

2019-06-05abs ↗pdf ↗

Paper proposes an alternative to set losses for predicting unordered variables without imposing structure.

problem Learning unordered variables with unknown interrelations without imposing structure.
method Viewing set prediction as conditional density estimation and using deep energy-based models with gradient-guided sampling.
result Empirically demonstrates capability to learn multi-modal densities and produce different plausible predictions.

Gradient guidance improves diffusion models for optimizing specific objectives.

problem Improving diffusion models for specific optimization tasks.
method Established a mathematical framework for gradient-guided diffusion, linking it to optimization theory. Developed a modified gradient guidance method and iteratively fine-tuned version.
result Gradient-guided diffusion models are essentially solutions to regularized optimization problems, preserving latent structure.

GGFPS improves model performance by sampling molecules more efficiently.

problem Improving model performance and reducing data costs in chemistry problems.
method Gradient-Guided Furthest Point Sampling (GGFPS) that leverages molecular force norms.
result GGFPS leads to superior data efficiency and model robustness compared to other sampling methods.

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.