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

107213320426 · Jun 202019922001200920172026
48 results for reference classes

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.

A major source of risk in project management is inaccurate forecasts of project costs, demand, and other impacts. The paper presents a promising new approach to mitigating such risk, based on theories of decision making under uncertainty which won the 2002 Nobel prize in economics. First, the paper documents inaccuracy…

2013-02-14abs ↗pdf ↗

The paper proposes a method to improve sales forecasts by selecting optimal reference classes.

problem Improving forecasts of sales growth exposed to behavioural bias.
method Finding optimal reference classes for each company based on specific predictors and matching forecast distributions to actual sales.
result The past operating margins are strong predictors for future sales distributions.

Reference class forecasting is a method to remove optimism bias and strategic misrepresentation in infrastructure projects and programmes. In 2012 the Hong Kong government's Development Bureau commissioned a feasibility study on reference class forecasting in Hong Kong - a first for the Asia-Pacific region. This study …

2017-10-03abs ↗pdf ↗

Associated to a differential character is an integral cohomology class, referred to as the characteristic class, and a closed differential form, referred to as the curvature. The characteristic class and curvature are equal in de Rham cohomology, and this is encoded in a commutative square. In the Hopkins--Singer model…

2012-01-13abs ↗pdf ↗

Proposes a robust VIB approach using soft labels and mutual info estimation.

problem Improving robustness of VIB to adversarial perturbations.
method Refines categorical class information with soft labels from a reference network, relaxes Gaussian posterior assumption.
result Significantly outperforms benchmarked models on MNIST and CIFAR-10.

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.

This study provides an independent, outside-in estimate of the cost and schedule risks of nuclear waste storage projects. Based on a reference class of 216 past, comparable projects, risk of cost overrun was found to be 202% or less, with 80% certainty, i.e., 20% risk of an overrun above 202%. Based on a reference clas…

2019-01-13abs ↗pdf ↗

This paper shows that there are symplectic four-manifolds M with the following property: a single isotopy class of smooth embedded two-spheres in M contains infinitely many Lagrangian submanifolds, no two of which are isotopic as Lagrangian submanifolds. The examples are constructed using a special class of symplectic …

1998-03-19abs ↗pdf ↗

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 ↗

This paper proposes a novel generic one-class feature learning method based on intra-class splitting. In one-class classification, feature learning is challenging, because only samples of one class are available during training. Hence, state-of-the-art methods require reference multi-class datasets to pretrain feature …

2018-12-20abs ↗pdf ↗

KL-regularized RL from expert demos can lead to slow, unstable learning.

problem Pathological training dynamics in KL-regularized RL from expert demonstrations.
method Empirical analysis and non-parametric behavioral reference policies.
result KL-regularized RL can be significantly improved by using non-parametric behavioral policies.

In current paper we refer to the geometrical classification of the Einstein equations which has been developed by one of the authors of this paper. This classification was based on the classical theory for decomposition of the tensor product of representations into irreducible components, which is studied in the elemen…

2010-01-26abs ↗pdf ↗

New method improves classification accuracy in imbalanced high-dimensional data.

problem Imbalanced classification in high-dimensional data.
method Data splitting and hard-thresholding rules for LDA.
result Proposed method reduces misclassification rates in minority class.

We investigate a variety of stability properties of Haezendonck-Goovaerts premium principles on their natural domain, namely Orlicz spaces. We show that such principles always satisfy the Fatou property. This allows to establish a tractable dual representation without imposing any condition on the reference Orlicz func…

2019-09-24abs ↗pdf ↗

Geometric variations of objects, which do not modify the object class, pose a major challenge for object recognition. These variations could be rigid as well as non-rigid transformations. In this paper, we design a framework for training deformable classifiers, where latent transformation variables are introduced, and …

2017-12-18abs ↗pdf ↗

This research uses Siamese networks to identify partial mouse brain images from the Allen atlas.

problem Identifying precise mouse brain microscopy images from the Allen atlas.
method Siamese Networks with contrastive learning to find corresponding atlas plates for partial images.
result Siamese CNNs achieved 25% TOP-1 and 100% TOP-5 accuracy in identifying brain slices from the Allen atlas.

The paper connects function theory, dynamics, and ergodic theory via Thurston's theory.

problem Function theory on Teichmüller space and dynamics of mapping class groups.
method Utilizes Thurston's theory and Sullivan's theory on discrete subgroups of hyperbolic space.
result Establishes connections between function theory, dynamics, and ergodic theory.

New method tackles label noise on imbalanced datasets by considering class-specific uncertainty.

problem Label noise and class imbalance in imbalanced datasets.
method Epistemic and aleatoric uncertainty-aware class-specific noise modeling.
result Proposed ULC framework improves performance on imbalanced datasets.

Equivariant neural networks are a class of neural networks designed to preserve symmetries inherent in the data. In this paper, we introduce a general method for modifying a neural network to enforce equivariance, a process we refer to as equivarification. We further show that group convolutional neural networks (G-CNN…

2019-06-16abs ↗pdf ↗

New DEC variant improves sample complexity bounds in decision making.

problem Understanding sample-efficient learning guarantees in decision making.
method Introducing a new Constrained Decision-Estimation Coefficient (DEC) and using it to derive improved lower bounds.
result New lower bounds improve upon prior work in three aspects: expectation, global applicability, and improper reference models.

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.

This paper has two purposes. First it partially extends the result in the author's previous work concerning the asymptotic expansion of the Tian-Yau metrics, by considering a slightly larger class of quasi-projective manifolds. This text is also intended to provide a quick introductory reference to the study of Ricci-f…

2012-05-04abs ↗pdf ↗

We use partial class memberships in soft classification to model uncertain labelling and mixtures of classes. Partial class memberships are not restricted to predictions, but may also occur in reference labels (ground truth, gold standard diagnosis) for training and validation data. Classifier performance is usually ex…

2013-01-02abs ↗pdf ↗

Area and orientation preserving diffeomorphisms of the standard 2-disc, referred to as symplectomorphisms of D2\mathbb{D}^{2}, allow decompositions in terms of positive twist diffeomorphisms. Using the latter decomposition we utilize the Conley index theory of discrete braid classes as introduced in [Ghrist et al., C. …

2016-05-30abs ↗pdf ↗

Efficient label acquisition processes are key to obtaining robust classifiers. However, data labeling is often challenging and subject to high levels of label noise. This can arise even when classification targets are well defined, if instances to be labeled are more difficult than the prototypes used to define the cla…

2018-03-26abs ↗pdf ↗

Proposes QQE for transforming and embedding data distributions.

problem Transforming and embedding data distributions for better representation or visualization.
method Quantile-Quantile Embedding (QQE) using quantile-quantile plot concept.
result QQE allows for better discrimination of classes in some cases.

We study the pricing and hedging of derivative securities with uncertainty about the volatility of the underlying asset. Rather than taking all models from a prespecified class equally seriously, we penalise less plausible ones based on their "distance" to a reference local volatility model. In the limit for small unce…

2016-05-20abs ↗pdf ↗

Methods for learning to search for structured prediction typically imitate a reference policy, with existing theoretical guarantees demonstrating low regret compared to that reference. This is unsatisfactory in many applications where the reference policy is suboptimal and the goal of learning is to improve upon it. Ca…

2015-02-08abs ↗pdf ↗

The paper proposes a deep learning technique for structured and composable representations.

problem Learning structured and composable representations from input images and discrete labels.
method End-to-end deep learning to learn representations based on distance estimates between class label and contextual information.
result The representations have a clear structure allowing for class and environment decomposition.