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

3569104138 · Jun 202019922001200920172026
48 results for temperature tuning

We introduce a temperature into the exponential function and replace the softmax output layer of neural nets by a high temperature generalization. Similarly, the logarithm in the log loss we use for training is replaced by a low temperature logarithm. By tuning the two temperatures we create loss functions that are non…

2019-06-08abs ↗pdf ↗

Meta-SAC automatically tunes SAC's entropy temperature for better exploration.

problem Exploration-exploitation dilemma in reinforcement learning.
method Meta-SAC uses metagradient and a novel meta objective to automatically adjust SAC's entropy temperature.
result Meta-SAC outperforms SAC-v2 by 10% on the humanoid-v2 task.

HET-XL improves heteroscedastic classifiers for large-scale image classification.

problem Scaling heteroscedastic classifiers to handle large numbers of classes and tuning the temperature hyperparameter.
method HET-XL, a heteroscedastic classifier with independent parameter count from the number of classes, learns the temperature hyperparameter directly from training data.
result HET-XL requires 14X fewer additional parameters and performs better than baseline heteroscedastic classifiers on large image classification datasets.

The paper analyzes the InfoNCE loss under different temperature schedules using Langevin dynamics.

problem Understanding the dynamics of InfoNCE loss under fixed versus annealed temperature schedules.
method Modeling embedding evolution under Langevin dynamics on a compact Riemannian manifold, with theoretical guarantees for convergence.
result Slow logarithmic inverse-temperature schedules ensure convergence to globally optimal representations, while faster schedules risk suboptimal minima.

Hyperfitting improves LLM generation quality by enhancing diversity, contrary to simple temperature scaling.

problem Improving open-ended generation quality of LLMs with minimal fine-tuning effort.
method Demonstrates that hyperfitting, a phenomenon where LLMs are fine-tuned to near-zero training loss, enhances generation quality and mitigates repetition.
result Hyperfitting is distinct from temperature scaling and involves a dynamic, context-dependent rank reordering mechanism in the final transformer block.

DISTANA improves weather prediction by inferring hidden factors from temperature data.

problem Inferring hidden factors in spatiotemporal processes without supervision.
method Enhanced DISTANA architecture for spatiotemporal data, active tuning for latent state inference.
result DISTANA achieves more accurate predictions than other methods, inferring hidden factors from temperature data.

Temperature scaling improves model uncertainty but not diversity in LLMs.

problem Improving the calibration and stochasticity of probabilistic models.
method Investigates theoretical properties of temperature scaling in classification and LLMs.
result Temperature scaling increases model uncertainty but not diversity in LLMs.

We develop a variant of multiclass logistic regression that is significantly more robust to noise. The algorithm has one weight vector per class and the surrogate loss is a function of the linear activations (one per class). The surrogate loss of an example with linear activation vector a\mathbf{a} and class cc has t…

2017-05-19abs ↗pdf ↗

FlowVAT improves variational inference for multi-modal distributions.

problem Mode-seeking behavior and collapse in variational inference for complex posteriors.
method Conditional tempering approach for normalizing flow variational inference.
result FlowVAT outperforms traditional and adaptive annealing methods in multi-modal distributions, finding more modes and achieving better ELBO values.

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.

Softmax temperature influences model representation rank and performance.

problem Understanding and optimizing softmax function's impact on model representations.
method Investigated softmax function's role in deep neural networks, introduced rank deficit bias.
result Softmax temperature affects model representation rank and can improve performance.

New method calibrates classifier probabilities with guaranteed coverage.

problem Inaccurate probability estimates by classifiers in high-risk applications.
method Adaptive temperature scaling algorithm for conformal prediction.
result Improves calibration error measures and standard metrics across various tasks.

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.

New tools evaluate and optimize conditional sequence models in bioinformatics.

problem Evaluating and optimizing conditional sequence models in bioinformatics.
method Kernel-based discrepancy measure (ACMMD) to estimate model fit and tune hyperparameters.
result Rejects the hypothesis that ProteinMPNN fits its data for various protein families and optimizes model temperature.

New method improves sampling from complex, multi-peaked distributions.

problem Sampling from high-dimensional, multimodal distributions using HMC.
method Combines tempered HMC with automatic tuning strategies.
result Demonstrates more effective scaling with dimension than adaptive methods.

Enhances RL by controlling policy stochasticity through trajectory entropy constraints.

problem Non-stationary Q-value estimation and short-sighted entropy tuning in maximum entropy RL.
method Proposes TECRL framework with separate Q-functions for reward and entropy, enforcing a trajectory entropy constraint.
result DSAC-E algorithm achieves higher returns and better stability on OpenAI Gym benchmarks.

Thermal dynamics modeling has been a critical issue in building heating, ventilation, and air-conditioning (HVAC) systems, which can significantly affect the control and maintenance strategies. Due to the uniqueness of each specific building, traditional thermal dynamics modeling approaches heavily depending on physics…

2019-11-08abs ↗pdf ↗

Study local sensitivity of HDD and CDD temperature derivatives prices.

problem Understanding how temperature derivatives prices change with small temperature changes.
method Analyzes sensitivity of HDD and CDD futures and options prices to temperature perturbations using a CAR process.
result Identifies the order of the CAR process and its impact on temperature derivatives prices.

We present a novel Metropolis-Hastings method for large datasets that uses small expected-size minibatches of data. Previous work on reducing the cost of Metropolis-Hastings tests yield variable data consumed per sample, with only constant factor reductions versus using the full dataset for each sample. Here we present…

2016-10-19abs ↗pdf ↗

Enhances gradient-based discrete samplers with parallel tempering for multimodal distributions.

problem Local minima in high-dimensional, multimodal discrete distributions.
method Combines parallel tempering with discrete Langevin proposal, using Metropolis criterion for swaps.
result Significantly faster mixing and better sampling from complex distributions.

A new method selects optimal temperature for Bayesian Deep Learning.

problem Finding the optimal temperature for improving predictive performance in Bayesian Deep Learning.
method Data-driven approach to estimate temperature as a model parameter.
result Our method performs comparably to grid search but at a fraction of the cost.

New adaptive temperature selection improves parallel tempering efficiency.

problem Enhancing mixing in multi-modal distributions using parallel tempering.
method Adaptive temperature selection using policy gradient approach.
result Lower integrated autocorrelation times achieved compared to traditional methods.

This paper measures temperature in agent systems using volatility.

problem How to measure temperature in agent systems.
method Examined an agent system with two decision options in a news environment, established the measurement equation, and outlined the concept of temperature measurement.
result Illustrated a strategy for influencing average opinion in competing subsystems.

Attention temperature improves robustness of ICL in high-dimensional settings.

problem ICL robustness failure under distribution shift in high dimensions.
method Analyzed a Transformer with approximate softmax attention, derived a closed-form error expression, and showed optimal temperature minimizes error.
result Optimal attention temperature minimizes ICL generalization error under distribution shift.

Trends in terrestrial temperature variability are perhaps more relevant for species viability than trends in mean temperature. In this paper, we develop methodology for estimating such trends using multi-resolution climate data from polar orbiting weather satellites. We derive two novel algorithms for computation that …

2018-05-18abs ↗pdf ↗

The paper analyzes extreme temperature forecasting using machine learning models.

problem Forecasting extreme temperatures in U.S. cities.
method Auto-Regressive Integrated Moving Average, Exponential Smoothing, Multilayer Perceptrons, Gaussian Processes.
result Multilayer Perceptrons were found to be the most effective approach for forecasting extreme temperatures.

New methods for tuning alpha in Gibbs posteriors improve speed and accuracy.

problem Inconsistency in Bayesian inference and lack of fast tuning methods for alpha.
method Proposed two data-driven methods: sample-splitting and bootstrapping. Formulated alpha-posteriors for three models.
result Sample-splitting outperforms SafeBayes in speed and accuracy, especially in complex models.

The Gibbs algorithm's generalization error is bounded, improving with prior volume in low temperatures.

problem Bounding the generalization error of the Gibbs algorithm in low temperature regimes.
method Analyzes the Gibbs algorithm's performance, extending known high-temperature bounds to low-temperature scenarios.
result With high probability, the generalization error decreases with the total prior volume of similar hypotheses.

Optimizes contrastive learning with individualized temperatures for better performance on imbalanced datasets.

problem The common practice of using a global temperature parameter ignores the varying semantic similarity across different anchor data.
method Proposes a new robust contrastive loss inspired by distributionally robust optimization (DRO) and an efficient stochastic algorithm for automatic temperature individualization.
result Our method automatically learns a suitable temperature for each sample, improving performance on imbalanced datasets.

Improved similarity search in embeddings using InfoNCE loss.

problem Improving similarity search in embedding models trained by contrastive learning.
method Introduced a new continuity bound for InfoNCE loss via Gâteaux differentiation, preserving the averaging effect of negative samples.
result Demonstrated that the averaging effect of kk negative samples in InfoNCE loss carries over to stabilisation of generalisation error as kk grows.

New method uses RBM flows to find critical temperatures in Ising models.

problem Detecting critical temperatures in RBM flows without model topology information.
method Iterative sampling from RBM mapped on Ising model temperature space using a neural network thermometer.
result Flow of RBM trained on Ising spin configurations approaches critical temperature around kBTc/J2.269k_B T_c / J \approx 2.269.

Algorithm learns Sherrington-Kirkpatrick model parameters at low temperatures.

problem Learning parameters of random graphical models at low temperatures.
method Multiplicative-weight update algorithm for polynomial time learning.
result Algorithm learns SK model parameters at βlognβ\leq \sqrt{\log n}.