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

2356 · Nov 201919922001200920172026
48 results for IDS

Many machine intelligence techniques are developed in E-commerce and one of the most essential components is the representation of IDs, including user ID, item ID, product ID, store ID, brand ID, category ID etc. The classical encoding based methods (like one-hot encoding) are inefficient in that it suffers sparsity pr…

2017-12-22abs ↗pdf ↗

Calibrated ensembles improve both ID and OOD accuracy in distribution shift.

problem Desired balance between in-distribution and out-of-distribution accuracy.
method Ensemble standard and robust models, calibrating on ID data only.
result ID-calibrated ensembles outperform state-of-the-art methods on multiple datasets.

We first analyze the integrated density of states (IDS) of periodic Schrödinger operators on an amenable covering manifold. A criterion for the continuity of the IDS at a prescribed energy is given along with examples of operators with both continuous and discontinuous IDS'. Subsequently, alloy-type perturbations of th…

2007-05-08abs ↗pdf ↗

An Intrusion Detection System (IDS) is a key cybersecurity tool for network administrators as it identifies malicious traffic and cyberattacks. With the recent successes of machine learning techniques such as deep learning, more and more IDS are now using machine learning algorithms to detect attacks faster. However, t…

2019-12-18abs ↗pdf ↗

New research shows common ID estimators in neural representations are inaccurate.

problem Inaccurate estimation of intrinsic dimensions in neural representations.
method Theoretical and empirical investigation of ID estimators in neural representations.
result Common ID estimators do not accurately reflect the true underlying ID of neural representations.

This study analyzes VAEs using ID and II, revealing a transition in behaviour and distinct training phases.

problem Understanding the hidden representations and training phases of VAEs.
method Analysis using Intrinsic Dimension (ID) and Information Imbalance (II).
result VAEs exhibit a transition in behaviour and distinct training phases when the bottleneck size exceeds the Intrinsic Dimension of the data.

IDS improves sparse linear bandits by balancing information and regret.

problem Sparse linear bandits in high-dimensional decision-making.
method Information-directed sampling (IDS) with Bayesian regret bounds and empirical Bayesian sparse posterior sampling.
result IDS nearly matches existing lower bounds and significantly reduces regret.

ProSub uses angles in feature space to classify data as in- or out-of-distribution.

problem Open-set semi-supervised learning with unknown classes.
method Probabilistic approach based on angles in feature space, estimating conditional distributions of scores.
result ProSub achieves state-of-the-art performance on benchmark problems.

New bounds on IDS for RL show how to balance computation and learning efficiency.

problem Understanding and optimizing information-directed sampling (IDS) for reinforcement learning.
method Developed novel information-theoretic tools to bound information ratio and cumulative information gain.
result Derived prior-free Bayesian regret bounds for IDS in tabular finite-horizon MDPs and improved computational efficiency.

Beta-SOD detects and corrects noisy object re-identification using cosine similarity and Beta mixtures.

problem Noisy object re-identification in image datasets.
method Reframed Re-ID as a similarity task, using Siamese networks and Beta mixture models.
result Superior performance in noisy conditions compared to state-of-the-art methods.

New IDS algorithm refines parameter norm bounds for better bandit performance.

problem Frequentist IDS requires tight norm bounds, which are often unavailable in practice.
method Iteratively refines a high-probability upper bound on true parameter norm using data.
result Regret bounds independent of assumed parameter norm, outperforming state-of-the-art algorithms.

This work introduces a protocol to automatically select the correct range of scales for meaningful Intrinsic Dimension estimation.

problem The Intrinsic Dimension (ID) varies with scale in real-world datasets, leading to erroneous results.
method The protocol selects the correct range of scales by ensuring constant density of data points.
result The method provides a robust and scale-adaptive approach to estimating meaningful Intrinsic Dimension.

Person Re-identification (re-id) faces two major challenges: the lack of cross-view paired training data and learning discriminative identity-sensitive and view-invariant features in the presence of large pose variations. In this work, we address both problems by proposing a novel deep person image generation model for…

2017-12-06abs ↗pdf ↗

LoD improves model safety by integrating unlabeled wild data, reducing OOD misclassification.

problem Improving model safety and reliability using unlabeled wild data containing both in-distribution and out-of-distribution samples.
method Intentionally label-noisifying unlabeled wild data to enable joint learning of labeled ID and OOD data, distinguishing losses between ID and OOD samples.
result LoD framework achieves superior OOD detection without requiring thresholds, improving model safety.

High-dimensional data are ubiquitous in contemporary science and finding methods to compress them is one of the primary goals of machine learning. Given a dataset lying in a high-dimensional space (in principle hundreds to several thousands of dimensions), it is often useful to project it onto a lower-dimensional manif…

2019-06-18abs ↗pdf ↗

Network embedding has proved extremely useful in a variety of network analysis tasks such as node classification, link prediction, and network visualization. Almost all the existing network embedding methods learn to map the node IDs to their corresponding node embeddings. This design principle, however, hinders the ex…

2019-04-17abs ↗pdf ↗

Out-of-domain (OOD) detection for low-resource text classification is a realistic but understudied task. The goal is to detect the OOD cases with limited in-domain (ID) training data, since we observe that training data is often insufficient in machine learning applications. In this work, we propose an OOD-resistant Pr…

2019-08-31abs ↗pdf ↗

In this paper, we study the risk bounds for samples independently drawn from an infinitely divisible (ID) distribution. In particular, based on a martingale method, we develop two deviation inequalities for a sequence of random variables of an ID distribution with zero Gaussian component. By applying the deviation ineq…

2012-02-14abs ↗pdf ↗

A Bloom filter approach combined with Transformer models improves accuracy for machine learning tasks on opaque IDs.

problem Improving accuracy for machine learning tasks on opaque IDs with large vocabulary sizes.
method Applying hash functions to map opaque IDs to multiple hash tokens, similar to a Bloom filter, and using a multi-layer Transformer to process these digests.
result Models outperform those without hashing and sampled softmax, achieving high accuracy with a smaller computational budget.

Deep neural networks progressively transform their inputs across multiple processing layers. What are the geometrical properties of the representations learned by these networks? Here we study the intrinsic dimensionality (ID) of data-representations, i.e. the minimal number of parameters needed to describe a represent…

2019-05-29abs ↗pdf ↗

The Sornette-Ide differential equation of herding and rational trader behaviour together with very small random noise is shown to lead to crashes or bubbles where the price change goes to infinity after an unpredictable time. About 100 time steps before this singularity, a few predictable roughly log-periodic oscillati…

2001-10-06abs ↗pdf ↗

Study reveals differences in medical image models' hidden representation refinement.

problem Understanding how intrinsic dimensionality changes in neural network hidden representations across different domains.
method Analysis of 11 natural and medical image datasets using 6 network architectures.
result Medical image models refine hidden representations earlier, suggesting differences in feature abstraction.

New method calibrates deep models for both in-distribution and out-of-distribution samples.

problem Ensuring calibration for deep models in safety-critical applications, especially in OOD regions.
method Geodesic distance and Gaussian kernel to calibrate deep models.
result Proposed KDF and KDN methods achieve well-calibrated posteriors for both in-distribution and out-of-distribution samples.

Proposes a new method for feature selection using Bayesian ID with intervention.

problem Feature selection in data with varying importance.
method Probabilistic model for interpolative decomposition with Bayesian inference and Gibbs sampling.
result The proposed Bayesian ID algorithm with intervention selects features with higher priority and comparable reconstructive errors.

IDS algorithm optimizes sequential decisions in various monitoring settings.

problem Optimizing sequential decisions in complex monitoring scenarios.
method Information-directed sampling (IDS) algorithm for linear partial monitoring.
result IDS achieves nearly worst-case rate optimality in finite-action games.

When training a deep neural network for image classification, one can broadly distinguish between two types of latent features of images that will drive the classification. We can divide latent features into (i) "core" or "conditionally invariant" features XcoreX^\text{core} whose distribution XcoreYX^\text{core}\vert Y, cond…

2017-10-31abs ↗pdf ↗

P-OCS detects OOD samples in a low-dimensional subspace, outperforming existing methods.

problem Efficient OOD detection for deep learning models in open-world environments.
method P-OCS operates in the orthogonal complement of the principal subspace, applying a single projected perturbation.
result P-OCS achieves state-of-the-art OOD detection with negligible computational cost and without requiring model retraining.

One of the founding paradigms of machine learning is that a small number of variables is often sufficient to describe high-dimensional data. The minimum number of variables required is called the intrinsic dimension (ID) of the data. Contrary to common intuition, there are cases where the ID varies within the same data…

2019-02-27abs ↗pdf ↗

Rigidity theorem shows massless hyperboloidal data embeds into Minkowski space.

problem Characterizing massless initial data sets in General Relativity.
method Precise decay estimates for spinors on harmonic level sets.
result Asymptotically hyperboloidal IDS with zero mass embed isometrically into Minkowski space.

Let (X,g0)(X, g_0) be a complete, simply connected Riemannian manifold with sectional curvatures Kg0K_{g_0} satisfying b2Kg01-b^2 \leq K_{g_0} \leq -1 for some b1b \geq 1. Let g1g_1 be a Riemannian metric on XX such that g1=g0g_1 = g_0 outside a compact in XX, and with sectional curvatures Kg1K_{g_1} satisfying Kg11K_{g_1} \leq -1.…

2018-12-12abs ↗pdf ↗

ASD algorithm maximizes model estimates by adaptively labeling points.

problem Maximizing model estimates through adaptive labeling of points in a sequential decision-making problem.
method Formulated a general information-directed sampling (IDS) algorithm with theoretical guarantees for linear, graph, and low-rank models.
result IDS algorithm outperforms in both simulation and real-data experiments for discovering chemical reaction conditions.