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,657 papers · 148 categories

Trend · papers per month

371013 · Apr 201919922001200920172026
48 results for novelty

Proposes a novel method for detecting novelty in multi-modal data.

problem Challenges in detecting novelty in high-dimensional, multi-modal data.
method Orthogonalized latent space for disentangling features and defining novelty score.
result Proposed method outperforms state-of-the-art algorithms in novelty detection.

This paper introduces CENIE to quantify environment novelty for better UED.

problem Challenges in measuring environment novelty for effective UED.
method CENIE framework using state-action space coverage and Gaussian Mixture Models.
result CENIE improves UED performance across multiple benchmarks.

Generatability in metric spaces studied with novel novelty parameters.

problem Understanding generatability in metric spaces with asymmetric novelty parameters.
method Introducing (ε,ε)(\varepsilon,\varepsilon')-closure dimension to characterize uniform and non-uniform generatability.
result Generatability is stable across novelty scales in doubling spaces but can be highly scale-sensitive in general metric spaces.

As more and more people shift their movie watching online, competition between movie viewing websites are getting more and more intense. Therefore, it has become incredibly important to accurately predict a given user's watching list to maximize the chances of keeping the user on the platform. Recent studies have sugge…

2019-09-02abs ↗pdf ↗

This work introduces a novel method to evaluate generative model novelty.

problem Evaluating the novelty of generative models compared to a reference model.
method Spectral approach to differential clustering and Kernel-based Entropic Novelty (KEN) score.
result The KEN score effectively detects novel modes and compares generative models.

In machine learning, novelty detection is the task of identifying novel unseen data. During training, only samples from the normal class are available. Test samples are classified as normal or abnormal by assignment of a novelty score. Here we propose novelty detection methods based on training variational autoencoders…

2018-06-08abs ↗pdf ↗

CSI detects novelty by contrasting shifted instances, outperforming existing methods.

problem Detecting samples from outside the training distribution.
method Contrastive learning with distributionally shifted augmentations.
result CSI outperforms existing methods in various novelty detection scenarios.

Novelty search in low-dimensional space improves sample efficiency in exploration tasks.

problem Efficient exploration in complex environments with sparse rewards.
method Combines model-based and model-free objectives to learn a low-dimensional representation. Uses intrinsic novelty rewards based on nearest neighbor distances in this space.
result Our approach achieves more sample-efficient exploration compared to strong baselines on various tasks.

News novelty predicts negative stock market returns.

problem Negative stock market returns due to increased news novelty.
method Quantified news novelty using entropy measure from recurrent neural network applied to a large news corpus.
result Entropy exposure carries a negative risk premium, indicating that assets positively correlated with entropy hedge aggregate news risk.

Flow-based deep generative models learn data distributions by transforming a simple base distribution into a complex distribution via a set of invertible transformations. Due to the invertibility, such models can score unseen data samples by computing their exact likelihood under the learned distribution. This makes fl…

2019-06-17abs ↗pdf ↗

Proposes UICR to improve novelty in recommendation systems without sacrificing relevance.

problem Balancing relevance and novelty in recommendation systems is challenging, especially for long-tail items.
method Introduces uncertainty modeling in the matching stage and multi-task modeling of model and index uncertainty.
result Improves novelty without sacrificing relevance, as shown by experimental results and online A/B tests.

Study on robustness of learning-based novelty detection methods under adversarial attacks.

problem Understanding how learning-based novelty detection methods perform under adversarial perturbations.
method Formulated an oracle attack setup and evaluated vulnerability using black-box adversarial algorithms.
result Adversarial perturbations can significantly increase FDR while maintaining high detection power.

The paper develops methods for novelty detection on path space using signature-based statistics.

problem Novelty detection on path space as a hypothesis testing problem.
method Signature-based test statistics, transportation-cost inequalities, CVaR, one-class SVM algorithms.
result Established lower bounds on type-II\mathrm{II} error and general power bounds.

A new method for student-initiated action advice using novelty detection.

problem Exploration and sample inefficiency in RL, especially with teacher absence.
method Random Network Distillation (RND) to measure advice novelty, updates only for advised states.
result Significant performance improvement over state-of-the-art methods, especially in challenging scenarios.

Decentralized detection avoids sharing data, controls false discoveries.

problem Global false discovery rate control in decentralized novelty detection.
method Quantized surrogate models for low-precision sharing, preserving exchangeability.
result Quantized composite scores maintain competitive statistical power with reduced communication.

New methods control false discoveries near the boundary in conformal novelty detection.

problem Over-optimistic assessments near the rejection threshold in conformal novelty detection.
method Support line (SL) correction and alternative procedures to control boundary false discovery rate (bFDR).
result New procedures control the boundary false discovery rate (bFDR) in the conformal setting.

In this paper, we focus on a prediction-based novelty estimation strategy upon the deep reinforcement learning (DRL) framework, and present a flow-based intrinsic curiosity module (FICM) to exploit the prediction errors from optical flow estimation as exploration bonuses. We propose the concept of leveraging motion fea…

2019-05-24abs ↗pdf ↗

AutoSciDACT detects scientific anomalies in noisy data.

problem Detecting anomalies in large, noisy scientific datasets.
method Contrastive pre-training for low-dimensional data representations, two-sample test using NPLM.
result Strong sensitivity to small anomalies across various scientific domains.

One-Shot Neural architecture search (NAS) attracts broad attention recently due to its capacity to reduce the computational hours through weight sharing. However, extensive experiments on several recent works show that there is no positive correlation between the validation accuracy with inherited weights from the supe…

2019-07-22abs ↗pdf ↗

BEACON optimizes discovery by efficiently finding novel behaviors.

problem Discovering diverse system behaviors without a scalar objective.
method Bayesian optimization inspired strategy using multi-output Gaussian processes.
result BEACON discovers broader sets of distinct behaviors than competing methods.

SAGE improves memory efficiency by selectively adding, merging, or ignoring new facts.

problem Efficiently managing new facts in agentic LLMs to avoid costly write-time reasoning.
method SAGE uses a von Mises-Fisher-based density estimator to score and route candidate facts.
result SAGE achieves the best average token-F1 on LoCoMo and reduces add-phase API cost by 3.4x on GPT-4o-mini.

Plan2Explore learns new tasks efficiently through self-supervised planning.

problem Challenges in reinforcement learning, especially task-specific learning and sample efficiency.
method Self-supervised exploration and fast adaptation to new tasks through efficient planning.
result Plan2Explore outperforms prior methods in learning new tasks without supervision.

(ABRIDGED) In previous work, two platforms have been developed for testing computer-vision algorithms for robotic planetary exploration (McGuire et al. 2004b,2005; Bartolo et al. 2007). The wearable-computer platform has been tested at geological and astrobiological field sites in Spain (Rivas Vaciamadrid and Riba de S…

2009-10-28abs ↗pdf ↗

Generative Kernel PCA explores latent spaces for data interpretation and novelty detection.

problem Exploring latent spaces of datasets for better data interpretation.
method Generative Kernel PCA using hidden and visible units similar to Restricted Boltzmann Machines.
result Gradually moving in the latent space allows for interpretation of components and detection of novel patterns.

Conventional out-of-distribution (OOD) detection schemes based on variational autoencoder or Random Network Distillation (RND) have been observed to assign lower uncertainty to the OOD than the target distribution. In this work, we discover that such conventional novelty detection schemes are also vulnerable to the blu…

2019-11-27abs ↗pdf ↗

One of the most ambitious use cases of computer-assisted learning is to build a recommendation system for lifelong learning. Most recommender algorithms exploit similarities between content and users, overseeing the necessity to leverage sensible learning trajectories for the learner. Lifelong learning thus presents un…

2019-12-03abs ↗pdf ↗

A major challenge in reinforcement learning is exploration, when local dithering methods such as epsilon-greedy sampling are insufficient to solve a given task. Many recent methods have proposed to intrinsically motivate an agent to seek novel states, driving the agent to discover improved reward. However, while state-…

2019-06-19abs ↗pdf ↗

Machine-learning driven safety-critical autonomous systems, such as self-driving cars, must be able to detect situations where its trained model is not able to make a trustworthy prediction. Often viewed as a black-box, it is non-obvious to determine when a model will make a safe decision and when it will make an erron…

2019-06-09abs ↗pdf ↗

Extends Mahalanobis distance to Banach spaces for anomaly detection.

problem Anomaly detection in infinite-dimensional spaces.
method Generalizes Mahalanobis distance to Banach spaces via Cameron-Martin norm and variance norm.
result Kernelized nearest-neighbour Mahalanobis distance outperforms traditional methods for time series novelty detection.