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

2715438141,085 · Jun 202019922001200920172026
48 results for Fine Detail Generation

New method uses LLMs to generate detailed scientific hypotheses.

problem Generating detailed, actionable scientific hypotheses from coarse initial directions.
method Hierarchical search method that incrementally adds details to hypotheses.
result Hierarchical search method consistently outperforms strong baselines on expert-annotated hypotheses.

Convolutional GANs favor low spatial frequencies, affecting fine detail generation.

problem Understanding GANs' limitations in high spatial frequency learning.
method Proposed method to manipulate GANs' bias against high spatial frequencies.
result Convolutional GANs have a bias against learning high spatial frequencies.

Residual Prior Diffusion integrates coarse latent priors with diffusion models for better generative tasks.

problem Diffusion models struggle with representing both large-scale and fine-scale details in data distributions.
method Two-stage framework: first a coarse prior model captures large-scale structure, then a diffusion model represents the residual.
result RPD accurately captures fine-scale details while preserving large-scale structure, outperforming standard diffusion models.

Many practical techniques for probabilistic inference require a sequence of distributions that interpolate between a tractable distribution and an intractable distribution of interest. Usually, the sequences used are simple, e.g., based on geometric averages between distributions. When models are expressed as probabili…

2015-09-09abs ↗pdf ↗

Understanding the power of depth in feed-forward neural networks is an ongoing challenge in the field of deep learning theory. While current works account for the importance of depth for the expressive power of neural-networks, it remains an open question whether these benefits are exploited during a gradient-based opt…

2019-03-08abs ↗pdf ↗

This paper circulated previously in a draft version. Now, upon general request, it is about time to distribute the more detailed (and much longer) version. The main technical issues revolve around the fine structure of the compactification of the moduli spaces of flow lines and the obstruction bundle technique, with re…

1996-06-14abs ↗pdf ↗

DIF extends NF with stochastic discrete latent variables for better density estimation.

problem Improving density estimation with discontinuities and fine details.
method Discretely indexed flows as an extension of Normalizing Flows with stochastic latent variables.
result DIF inherit good computational behavior of NF and can capture distributions with discontinuities.

MuSiCNet tackles irregularly sampled multivariate time series by treating them as a hierarchy of relatively regular series.

problem Irregularly sampled multivariate time series with missing values.
method Gradual coarse-to-fine approach with multi-scale and multi-correlation attention network.
result MuSiCNet improves ISMTS representation quality through hierarchical learning.

We provide an online RLHF workflow for large language models.

problem Lack of online RLHF workflow for large language models.
method Construct preference models using open-source datasets, approximate human feedback, and implement online iterative RLHF.
result Our LLM achieves state-of-the-art performance on various benchmarks.

In many contexts, we have access to aggregate data, but individual level data is unavailable. For example, medical studies sometimes report only aggregate statistics about disease prevalence because of privacy concerns. Even so, many a time it is desirable, and in fact could be necessary to infer individual level chara…

2018-09-16abs ↗pdf ↗

Powerful generative adversarial networks (GAN) have been developed to automatically synthesize realistic images from text. However, most existing tasks are limited to generating simple images such as flowers from captions. In this work, we extend this problem to the less addressed domain of face generation from fine-gr…

2019-11-26abs ↗pdf ↗

Various semigroups of noninvertible supermatrices of the special (antitriangle) shape having nilpotent Berezinian which appear in supersymmetric theories are defined and investigated. A subset of them continuously represents left and right zero semigroups and rectangular bands. The ideal properties of higher order rect…

1996-09-19abs ↗pdf ↗

Fast and accurate MRI image reconstruction from undersampled data is crucial in clinical practice. Deep learning based reconstruction methods have shown promising advances in recent years. However, recovering fine details from undersampled data is still challenging. In this paper, we introduce a novel deep learning bas…

2019-12-02abs ↗pdf ↗

DiffDenoise preserves fine structures in medical images using conditional diffusion models.

problem Medical image denoising often results in loss of fine structures.
method Conditional diffusion model with stabilized reverse sampling and supervised training.
result DiffDenoise outperforms state-of-the-art methods in medical image denoising.

This paper simplifies fine-tuning for small LLMs, reducing barriers for developers.

problem Limited resources for fine-tuning large language models (LLMs) by individual developers and small organizations.
method Instruction-tuning datasets, small-sized LLMs (3B to 7B parameters), various training configurations and strategies.
result Improved model performance on benchmarks with specific training configurations, and insights into early termination and hyperparameter simplifications.

ECC Analyzer uses LLMs to predict stock volatility from ECCs.

problem Leveraging unstructured ECC data for stock volatility prediction.
method Uses large language models to extract and fuse textual and audio features from ECCs.
result ECC Analyzer outperforms traditional benchmarks in volatility prediction.

We study the geometry of the Thurston metric on the Teichmüller space T(S)\mathcal{T}(S) of hyperbolic structures on a surface SS. Some of our results on the coarse geometry of this metric apply to arbitrary surfaces SS of finite type; however, we focus particular attention on the case where the surface is a once-punct…

2016-10-24abs ↗pdf ↗

The paper introduces a Hessian-based method to improve generalization in fine-tuned deep neural networks.

problem Improving generalization in fine-tuned deep neural networks, especially in noisy conditions.
method PAC-Bayesian analysis to identify a Hessian-based distance measure, proving generalization bounds, and developing an algorithm with a generalization error guarantee.
result Hessian-based distance measure correlates well with observed generalization gaps and can match the scale of these gaps in practice.

Unsupervised pre-training improves model generalization, but lacks theoretical understanding.

problem Lack of theoretical understanding of unsupervised pre-training's impact on model generalization.
method Introduces a novel theoretical framework to analyze and enhance generalization.
result Enhances understanding of unsupervised pre-training and fine-tuning, proposing a new regularization method.

The paper develops a theory linking pretraining and fine-tuning in neural networks.

problem Understanding how initialization choices impact feature learning and generalization in neural networks.
method Analytical theory of diagonal linear networks, deriving generalization error as a function of initialization parameters and task statistics.
result Different initialization choices place networks into four fine-tuning regimes with varying abilities to support feature learning and generalization.

Adjoint Matching improves flow and diffusion models with reward fine-tuning.

problem Improving generative models with reward fine-tuning.
method Casting reward fine-tuning as stochastic optimal control (SOC) and enforcing a specific noise schedule.
result Adjoint Matching outperforms existing SOC algorithms.

Motivated by recently published methods using frequency decompositions of convolutions (e.g. Octave Convolutions), we propose a novel convolution scheme to stabilize the training and reduce the likelihood of a mode collapse. The basic idea of our approach is to split convolutional filters into additive high and low fre…

2019-05-29abs ↗pdf ↗

Improved code translation by preserving structure with composed fine-tuning.

problem Improving code translation accuracy with unlabeled code outputs.
method Pre-trained denoiser to capture output structure, composed fine-tuning to fine-tune predictor.
result Composed fine-tuning significantly improves generalization over standard fine-tuning.

LP-FT improves personalized model training in FL by balancing generalization and personalization.

problem Federated Learning struggles with balancing global generalization and local personalization due to non-identical data distributions.
method Adapting Linear Probing followed by full Fine-Tuning (LP-FT) to the FL setting.
result LP-FT outperforms standard fine-tuning in balancing personalization and generalization across various datasets and PFT variants.

New method quantifies uncertainty in fine-tuned LLMs using LoRA ensembles.

problem Uncertainty in fine-tuned LLMs and how to trust their predictions.
method Posterior approximations using low-rank adaptation ensembles.
result Unexpected retention of acquired knowledge during fine-tuning in overfitting regime.

Characterizes geometric actions on graphs with flexible stabilizers.

problem Understanding geometric actions on flexible stabilizers.
method Defining generalized fine actions and proving relative quasi-convexity criteria.
result Characterizes Bowditch boundary points in relatively geometric actions.

Transformers fine-tuned on synthetic data boost tabular data classification performance.

problem Improving tabular data classification accuracy.
method Fine-tuning ICL-transformers on synthetic datasets with complex decision boundaries.
result Fine-tuned ICL-transformers outperform regular neural networks on real-world datasets.

Abstract: Proves generic torus diffeomorphisms act parabolically and non-properly on fine curve graph and have generalized rotation sets.

problem Generic torus diffeomorphisms on fine curve graph.
method Proves generic torus diffeomorphisms act parabolically and non-properly on fine curve graph.
result Generic torus diffeomorphisms have generalized rotation sets of any point-symmetric compact convex homothety type.

Human matting, high quality extraction of humans from natural images, is crucial for a wide variety of applications. Since the matting problem is severely under-constrained, most previous methods require user interactions to take user designated trimaps or scribbles as constraints. This user-in-the-loop nature makes th…

2018-09-05abs ↗pdf ↗

BERT fine-tuning is unstable due to optimization issues, not forgetting or dataset size.

problem Stability of fine-tuning BERT-based models across different random seeds.
method Analysis of BERT, RoBERTa, and ALBERT fine-tuned on GLUE datasets, identifying optimization difficulties as the cause of instability.
result Fine-tuning instability is due to optimization difficulties leading to vanishing gradients, not forgetting or dataset size.

This research improves calorimeter simulations by creating a faster model.

problem Efficiently simulating detailed calorimeter data for high-energy physics.
method Developed a conditional normalizing flow model for superresolution.
result The model successfully reproduces reference distributions.