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

209418627836 · Jun 202019922001200920172026
48 results for joint training

Joint diffusion models improve data representation for both generation and prediction.

problem Inconsistent performance between generation and classification tasks in joint models.
method Extended vanilla diffusion model with a classifier for joint end-to-end training.
result Joint diffusion model outperforms state-of-the-art hybrid methods in classification and generation.

Traditionally, when generative models of data are developed via deep architectures, greedy layer-wise pre-training is employed. In a well-trained model, the lower layer of the architecture models the data distribution conditional upon the hidden variables, while the higher layers model the hidden distribution prior. Bu…

2014-05-06abs ↗pdf ↗

Deep structured-prediction energy-based models combine the expressive power of learned representations and the ability of embedding knowledge about the task at hand into the system. A common way to learn parameters of such models consists in a multistage procedure where different combinations of components are trained …

2019-02-28abs ↗pdf ↗

JoCoR improves deep learning with noisy labels by reducing network diversity.

problem Learning with noisy labels in deep learning.
method JoCoR uses two networks to make predictions, calculates a joint loss with Co-Regularization, and updates both networks simultaneously.
result JoCoR outperforms state-of-the-art approaches in learning with noisy labels.

Joint training improves model accuracy by selectively using privileged information.

problem Two-stage training can lead to model failure with noisy privileged information.
method Joint training of two models to use privileged information selectively.
result Joint training outperforms two-stage baselines on synthetic and real-world tasks.

Estimates joint causal effects using single-variable interventions on nonlinear models.

problem Estimating joint causal effects from single-variable interventions.
method Identifiability result and practical estimator for decomposing causal effects.
result Joint effects can be inferred without joint interventional data for nonlinear additive models.

Jointly tuning ensemble models improves performance and uncertainty calibration.

problem Improving both predictive performance and uncertainty calibration in deep ensembles.
method Investigated the impact of jointly tuning weight decay, temperature scaling, and early stopping.
result Jointly tuning ensemble models generally matches or improves performance, with significant variation across tasks.

Develops a framework to quantify uncertainties in multiple ML models.

problem Uncertainty in ML model predictions and model inputs.
method Develops a theoretical framework to decouple and transform uncertainties.
result Generates joint distribution of ML predictions considering uncertainties.

Paper develops a theory explaining contrastive pre-training for multimodal AI.

problem Limited theoretical understanding of contrastive pre-training for multi-modal AI.
method Introduces approximate sufficient statistics and Joint Generative Hierarchical Model.
result Near-minimizers of contrastive loss are approximately sufficient, enabling diverse downstream tasks.

We extend recent work (Brehmer, et. al., 2018) that use neural networks as surrogate models for likelihood-free inference. As in the previous work, we exploit the fact that the joint likelihood ratio and joint score, conditioned on both observed and latent variables, can often be extracted from an implicit generative m…

2018-08-02abs ↗pdf ↗

We provide a distribution-free test that can be used to determine whether any two joint distributions pp and qq are statistically different by inspection of a large enough set of samples. Following recent efforts from Long et al. [1], we rely on joint kernel distribution embedding to extend the kernel two-sample test…

2016-07-25abs ↗pdf ↗

Deep networks have been successfully applied to learn transferable features for adapting models from a source domain to a different target domain. In this paper, we present joint adaptation networks (JAN), which learn a transfer network by aligning the joint distributions of multiple domain-specific layers across domai…

2016-05-21abs ↗pdf ↗

We introduce a new method for training deep Boltzmann machines jointly. Prior methods require an initial learning pass that trains the deep Boltzmann machine greedily, one layer at a time, or do not perform well on classifi- cation tasks.

2012-12-12abs ↗pdf ↗

FreST Loss decorrelates spatio-temporal dependencies in graph signals.

problem Complex spatio-temporal dependencies in graph-structured signals are not well captured by standard forecasting models.
method FreST Loss extends supervision to the joint spatio-temporal spectrum using Joint Fourier Transform (JFT).
result FreST Loss reduces estimation bias and improves forecasting accuracy on real-world datasets.

TensorGuide improves LoRA efficiency and expressivity through joint tensor-train optimization.

problem Limited expressivity and generalization of standard LoRA.
method TensorGuide uses a unified tensor-train structure with controlled Gaussian noise to generate correlated low-rank matrices.
result TensorGuide achieves superior accuracy and scalability with fewer parameters compared to standard LoRA and TT-LoRA.

New method certifies joint adversarial robustness of model ensembles.

problem Ensuring robustness of model ensembles against adversarial attacks.
method Proposes a novel technique to certify joint robustness, building on prior work on single-model robustness certification.
result Demonstrates the effectiveness of certifying joint robustness of ensembles, improving understanding of ensemble defenses.

Deep neural networks (DNNs) trained on large-scale datasets have exhibited significant performance in image classification. Many large-scale datasets are collected from websites, however they tend to contain inaccurate labels that are termed as noisy labels. Training on such noisy labeled datasets causes performance de…

2018-03-30abs ↗pdf ↗

Generative model for joint discrete distributions using randomized assignment flows.

problem Efficiently representing and sampling from complex joint distributions of discrete variables.
method Randomized assignment flows on the statistical submanifold of factorizing distributions.
result Our model can efficiently represent and sample from any target distribution and assess likelihood of unseen data points.

AR-CSM models use derivatives of univariate log-conditionals to estimate joint distributions efficiently.

problem Scalability and stability issues in training autoregressive models.
method Parameterize joint distribution using derivatives of univariate log-conditionals and introduce Composite Score Matching (CSM) for efficient training.
result AR-CSM models are more scalable and stable compared to previous score matching algorithms.

We introduce a multimodal visual-textual search refinement method for fashion garments. Existing search engines do not enable intuitive, interactive, refinement of retrieved results based on the properties of a particular product. We propose a method to retrieve similar items, based on a query item image and textual re…

2019-06-15abs ↗pdf ↗

We investigate deep generative models that can exchange multiple modalities bi-directionally, e.g., generating images from corresponding texts and vice versa. Recently, some studies handle multiple modalities on deep generative models, such as variational autoencoders (VAEs). However, these models typically assume that…

2016-11-07abs ↗pdf ↗

Probabilistic linear discriminant analysis (PLDA) is a method used for biometric problems like speaker or face recognition that models the variability of the samples using two latent variables, one that depends on the class of the sample and another one that is assumed independent across samples and models the within-c…

2018-03-28abs ↗pdf ↗

Directed latent variable models that formulate the joint distribution as p(x,z)=p(z)p(xz)p(x,z) = p(z) p(x \mid z) have the advantage of fast and exact sampling. However, these models have the weakness of needing to specify p(z)p(z), often with a simple fixed prior that limits the expressiveness of the model. Undirected latent variabl…

2017-12-12abs ↗pdf ↗

This paper introduces the Metric-Free Natural Gradient (MFNG) algorithm for training Boltzmann Machines. Similar in spirit to the Hessian-Free method of Martens [8], our algorithm belongs to the family of truncated Newton methods and exploits an efficient matrix-vector product to avoid explicitely storing the natural g…

2013-01-16abs ↗pdf ↗

Proposes baselines for joint NAS and HPO optimization.

problem Joint optimization of neural architecture and hyperparameters for multiple objectives.
method Extends existing methods to jointly optimize with multiple objectives.
result Serves as simple baselines for future multi-objective joint NAS + HPO research.

A new method uses machine learning to optimize user pairing and association in multicell NOMA networks.

problem Optimizing user pairing and association in multicell non-orthogonal multiple access (NOMA) systems.
method Formulated as a combinatorial optimization problem, solved using a Pointer Network (PtrNet) trained with deep reinforcement learning.
result Achieves near-optimal performance in terms of aggregate data rate, outperforming random heuristics by up to 30%.

We propose JECL, a method for clustering image-caption pairs by training parallel encoders with regularized clustering and alignment objectives, simultaneously learning both representations and cluster assignments. These image-caption pairs arise frequently in high-value applications where structured training data is e…

2019-01-04abs ↗pdf ↗

Proposes novel losses for fine-grained categorical domain adaptation.

problem Fine-grained alignment of categories across domains in unsupervised domain adaptation.
method Joint category-domain classifier with adversarial training losses for both domain and category levels, and vicinal domain adaptation.
result Achieves state-of-the-art performance on benchmark datasets.

New framework improves LLM performance by avoiding forgetting during sequential training stages.

problem Forgetting during sequential training stages of LLMs.
method Proposes a joint post-training framework with theoretical convergence guarantees.
result Empirically outperforms sequential post-training framework by up to 23%.

JoLT uses LLMs to make probabilistic predictions on tabular data.

problem Making probabilistic predictions on tabular data efficiently and without preprocessing.
method JoLT leverages LLMs' in-context learning to define joint distributions over tabular data.
result JoLT outperforms other methods on tabular classification and regression tasks.

Efficiently combines autoregressive and set-based models for joint distributions.

problem Joint distributions over multiple predictions from set-based models.
method Causal autoregressive buffer that caches context and captures dependencies.
result Up to 20x faster joint sampling and density evaluation, up to 7x lower memory usage.

APQ jointly optimizes neural architecture, pruning, and quantization for efficient inference.

problem Efficient deep learning inference on resource-constrained hardware.
method Joint optimization of neural architecture, pruning, and quantization policy using a quantization-aware accuracy predictor.
result Joint optimization leads to 2.3% higher ImageNet accuracy with reduced latency and energy consumption.