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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Multiple Reference Models

This paper solves the multiple reference model problem in RLHF with exact solutions and sample complexity guarantees.

problem Limitations of single reference models in aligning LLMs with human feedback.
method Integrates multiple reference models into RLHF frameworks, addressing theoretical challenges with exact solutions and sample complexity guarantees.
result First exact solution to the multiple reference model problem in reverse KL-regularized RLHF.

New methods improve LLM preference optimization by intelligently weighting multiple reference models.

problem Improving LLM preference optimization with multiple reference models.
method Introducing four new weighting strategies for multiple-reference preference optimization.
result All four new weighting strategies outperform current methods on preference accuracy.

The paper introduces a method for forecasting corporate sales growth using multiple reference variables.

problem Forecasting corporate sales growth with multiple reference variables.
method Reference class selection using rank-based algorithms and principal components analysis for data dimension reduction.
result Dimension reduced variables with past sales growth rates and operating margins perform well in forecasting.

Framework for sorting with diverse value models and valued assignment examples.

problem Sorting with diverse value models and valued assignment examples.
method Optimization model for constructing preference model from valued examples, regularization techniques, and efficient algorithm.
result Improved predictive ability and flexibility in classification performance.

Study measures gender bias in machine translation using multiple reference points.

problem Measuring and identifying gender bias in machine translation.
method Used an optimal non-biased translator, reference points from occupational statistics and survey.
result Found bias against both genders, but more against women, and found occupations have a greater effect than adjectives.

Recently, there has been interest in multiplicative recurrent neural networks for language modeling. Indeed, simple Recurrent Neural Networks (RNNs) encounter difficulties recovering from past mistakes when generating sequences due to high correlation between hidden states. These challenges can be mitigated by integrat…

2019-06-30abs ↗pdf ↗

This paper develops a method to select a reference contract for multi-contract quoting to minimize execution risk.

problem Minimizing execution risk in multi-contract quoting sequences.
method Develops a diagnostic framework using order-flow Hawkes forecasts and CLF to select a stable reference contract.
result Event-history and LOB-state signals offer complementary views for reference-contract selection.

Framework uses dropout to efficiently explore Rashomon set for multiplicity estimation.

problem Efficiently measuring and mitigating conflicting model outputs in classification tasks.
method Dropout-based exploration of Rashomon set for multiplicity estimation.
result Framework outperforms baselines in multiplicity metric estimation with significant runtime speedup.

We study multiple defaults where the global market information is modelled as progressive enlargement of filtrations. We shall provide a general pricing formula by establishing a relationship between the enlarged filtration and the reference default-free filtration in the random measure framework. On each default scena…

2009-12-16abs ↗pdf ↗

In this paper, we study the dual representation for generalized multiple stopping problems, hence the pricing problem of general multiple exercise options. We derive a dual representation which allows for cashflows which are subject to volume constraints modeled by integer valued adapted processes and refraction period…

2011-12-12abs ↗pdf ↗

Researchers develop a method to infer reference measures from observed functionals.

problem Tackles the challenge of identifying or recovering a reference measure from observed functionals.
method Uses the property of law-invariant functionals defining lower or upper supporting sets in dual spaces of signed measures.
result Illustrates the methodology with examples and develops a modification for Value-at-Risk.

Triangulation filters spurious circuits in multilingual models.

problem Unreliable explanations of multilingual models across languages.
method Formalizes reference families and introduces triangulation as a causal acceptance rule.
result Triangulation provides a falsifiable standard for mechanistic claims.

New method calibrates reference distributions for bounded support.

problem Lack of principled method for bounded-support statistical reference distributions.
method Formulated maximum entropy on projective space of nonnegative measures.
result Prescribed acceptance region uniquely determines deformation parameter.

Global fixed income returns span across multiple maturities and economies, that is, they naturally reside on multi-dimensional data structures referred to as tensors. In contrast to standard "flat-view" multivariate models that are agnostic to data structure and only describe linear pairwise relationships, we introduce…

2019-08-06abs ↗pdf ↗

New method assesses prediction intervals across different operating points.

problem Difficulty in comparing prediction intervals across studies.
method Operating characteristics curves and gain over a simple reference.
result A novel operating point agnostic assessment methodology for prediction intervals.

This paper uses probability tensors for efficient path planning in complex scenarios.

problem Efficient path planning in complex environments with obstacles and multiple goals.
method Probability tensors are used to model agent motion and decision-making, incorporating past and future information.
result The model finds solutions in complex scenarios, demonstrating realistic emergent behaviors.

We introduce a new class of nonstationary kernels, which we derive as covariance functions of a novel family of stochastic processes we refer to as string Gaussian processes (string GPs). We construct string GPs to allow for multiple types of local patterns in the data, while ensuring a mild global regularity condition…

2015-06-07abs ↗pdf ↗

InfoTuple efficiently selects larger tuple queries for ranking multiple objects, improving efficiency and consistency.

problem Efficiently selecting and ranking multiple objects for similarity learning.
method Adaptive selection method using mutual information maximization.
result InfoTuple outperforms state-of-the-art methods on synthetic and human response datasets.

Automatically detects and down-weights noisy samples in machine learning training.

problem Numerical noise in reference data hampers the accuracy of machine learning models.
method On-the-fly outlier detection using exponential moving average to identify and down-weight noisy samples.
result The method prevents overfitting and matches the performance of iterative refinement with reduced overhead.

ReQuestNet simplifies 5G channel estimation with a unified model.

problem Complex channel estimation in 5G systems with varying conditions.
method Unified neural architecture that handles dynamic resource blocks and transmit layers.
result Significantly outperforms legacy methods, achieving up to 10dB gain at high SNRs.

A theoretical study is presented for a simple linear classifier called reference distance estimator (RDE), which assigns the weight of each feature j as P(r|j)-P(r), where r is a reference feature relevant to the target class y. The analysis shows that if r performs better than random guess in predicting y and is condi…

2013-08-18abs ↗pdf ↗

A new framework for deep learning from multiple experts tackles long-tailed data issues.

problem Training deep networks on imbalanced data distributions.
method Learning From Multiple Experts (LFME) framework, involving self-paced expert selection and curriculum instance selection.
result LFME achieves superior performance compared to state-of-the-art methods.

Proposes a defense method against multiple adversarial video types.

problem Lack of multi-perturbation robustness in existing defense approaches.
method Adversarial training with multiple independent BN layers and a BN selection module.
result Demonstrates stronger multi-perturbation robustness against different adversarial video types.

A large collection of daily time series for 60 world currencies' exchange rates is considered. The correlation matrices are calculated and the corresponding Minimal Spanning Tree (MST) graphs are constructed for each of those currencies used as reference for the remaining ones. It is shown that multiplicity of the MST …

2008-10-07abs ↗pdf ↗

We identify a phenomenon, which we refer to as multi-model forgetting, that occurs when sequentially training multiple deep networks with partially-shared parameters; the performance of previously-trained models degrades as one optimizes a subsequent one, due to the overwriting of shared parameters. To overcome this, w…

2019-02-21abs ↗pdf ↗

We study coherent risk measures which are time-consistent for multiple filtrations. We show that a coherent risk measure is time-consistent for every filtration if and only if it is one of four main types. Furthermore, if the risk measure is strictly monotone it is linear, and if the reference probability space is not …

2010-07-05abs ↗pdf ↗

A framework for robust exploration in reinforcement learning under ambiguity.

problem Optimal stopping under ambiguity in reinforcement learning.
method Continuous-time robust reinforcement learning framework using gg-expectation and backward stochastic differential equations.
result Constructs a robust exploratory stopping time approximating the optimal stopping time under ambiguity.

New algorithms detect and react to multiple change points in online learning.

problem Learning under multiple change points in environments with unknown and frequent shifts.
method Proposed Anytime Tracking CUSUM (ATC) algorithms that balance detection of significant shifts.
result Properly tuned ATC algorithms achieve nearly minimax-optimal performance.

This paper uses reference priors to improve deep learning models with unlabeled and labeled data.

problem Improving deep learning models with limited labeled data and unlabeled data from the same or related tasks.
method Develops and applies generalizations of reference priors for deep networks to exploit unlabeled and labeled data.
result Demonstrates new semi-supervised learning and pretraining methods for transfer learning.