Paper proposes embedding framework to efficiently represent IDs in e-commerce.
problem Efficient representation of IDs with consideration of relationships among different types of IDs.
method Embedding based framework using item ID sequences and structural connections.
result Effective representation and transfer of IDs across different scenarios in e-commerce.
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.
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.
Deep networks learn low-dimensional yet complex data representations.
problem Understanding the intrinsic dimensionality of deep neural network representations.
method Analysis of intrinsic dimensionality across multiple layers of trained networks.
result The intrinsic dimensionality of data representations in deep networks is significantly lower than the number of units in each layer.
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.
Study shows how to detect representation extendability using conformal measures.
problem Detecting extendability of representations using conformal measures.
method Using higher rank conformal measures and self-joinings of groups.
result Affirmative answer to detect extendability of representations.
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.
Researchers analyze the geometric and statistical properties of transformer model representations.
problem Understanding the semantic structure of large transformer models across various data types.
method Characterization of geometric and statistical properties through analysis of intrinsic dimension and neighbor composition.
result The semantic information of the dataset is better expressed at the end of the first peak in transformer models.
Compositional Network Embedding learns node embeddings from node features.
problem Cold-start problem and lack of robustness to noise in existing network embedding methods.
method Generative framework that combines node attribute embeddings through a graph-based loss.
result Effectiveness and generalization of compositional network embeddings, especially on unseen nodes.
Deep learning models improve talent search at LinkedIn.
problem Match candidates to hiring needs using complex feature interactions.
method Deep and representation learning models, including neural network models and learning to rank approaches.
result Improved offline and online evaluation results for talent search systems.
The objective of this paper is to determine the finite dimensional, indecomposable representations of the algebra that is generated by two complex structures over the real numbers. Since the generators satisfy relations that are similar to those of the infinite dihedral group, we give the algebra the name iD-infinity.
Meta-Embedding improves CTR predictions for new ads, addressing cold-start and warm-up issues.
problem Improving CTR predictions for new ads with little logging data.
method Meta-learning approach to generate initial embeddings for new ad IDs.
result Meta-Embedding significantly improves CTR predictions for various models, including lightweight and deep learning.
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.
Improved OOD detection across various shifts using multi-encoder fusion of RDMs.
problem Out-of-distribution detection across multiple types of distribution shifts.
method Statistical identification of encoder sensitivity, EncMin2L fusion, and Tippett minimum combination.
result Achieves AUROC ≥ 0.94 across four shift types, outperforming state-of-the-art detectors.
IDS improves reinforcement learning with contextual information.
problem Optimizing IDS for contextual reinforcement learning.
method Investigated contextual bandit problems and proposed a computationally-efficient IDS.
result Contextual IDS outperforms conditional IDS by considering future contexts.
SIGMA improves IDS robustness against new attacks using GAN and metaheuristics.
problem Lack of robustness in IDS against new, unseen attacks.
method SIGMA uses GAN and metaheuristics to generate adversarial examples and retrain IDS.
result SIGMA can improve IDS performance up to 100% after two rounds of improvement.
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…
ASTPN improves video-based person re-identification by jointly attending to spatial and temporal features.
problem Video-based person re-identification in surveillance and HCI.
method Joint Spatial and Temporal Attention Pooling Network (ASTPN).
result ASTPN outperforms state-of-the-art methods on multiple datasets.
New local ID estimators based on data separability.
problem Estimating intrinsic dimensionality locally in multi-dimensional data.
method Local estimators based on concentration of measure.
result Empirical comparison with other ID estimators.
The Jones-Witten theory gives rise to representations of the (extended) mapping class group of any closed surface Y indexed by a semi-simple Lie group G and a level k. In the case G=SU(2) these representations (denoted V_A(Y)) have a particularly simple description in terms of the Kauffman skein modules with parameter …
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.
DeepHGNN detects program identity changes using system behaviors.
problem Detecting program identity changes to prevent malware.
method Attentional heterogeneous graph neural network (DeepHGNN) for graph classification.
result DeepHGNN effectively identifies program identities across various metrics.
IDS optimizes regret in stochastic partial monitoring with linear rewards.
problem Optimizing decision-making in uncertain environments with linear rewards.
method Information Directed Sampling (IDS) for stochastic partial monitoring.
result Achieves optimal regret rates in all observable game regimes.
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.
Generative adversarial networks enable distributed IoT IDS without central controller.
problem Detecting cyber attacks in IoT systems with privacy preservation.
method Proposes a fully distributed GAN-based IDS for IoT.
result Higher accuracy and lower false positive rate compared to standalone IDS.
Photo-identification technique improved for new dolphin individuals.
problem Traditional photo-identification of dolphins is laborious and manual.
method Metric embedding learning using triplet loss function in Euclidean space.
result Compact representation of fin images generalizes well to new identities.
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.
Generates realistic person images for re-id, overcoming pose variations.
problem Lack of cross-view paired training data and pose variations in person re-identification.
method Pose-normalization GAN (PN-GAN) for generating images conditioned on pose.
result Synthesized images enable learning invariant features free of pose variations.
Study complex reflections in infinite Coxeter tetrahedron moduli space.
problem Characterize representations of Coxeter group in complex hyperbolic space.
method Type-preserving representations of Coxeter group G to PU(3,1), parameterized by θ. result Discrete and faithful representations for θ∈[65π,π]. First nontrivial moduli space in complex hyperbolic space. 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.
Let q be a 2Nth root of unity where N is odd. Let Uq(sl2) denote the quantum group with large center corresponding to the lie algebra sl2 with generators E,F,K, and K−1. A semicyclic representation of Uq(sl2) is an N-dimensional irreducible representation $ρ:U_q(sl_2)\rightarrow M_N(\mathbb{C}…
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.
AutoIDS uses auto-encoders to detect network intrusions efficiently.
problem Detecting network intrusions with high accuracy and efficiency.
method Semi-supervised machine learning with cascading encoder-decoder neural networks.
result AutoIDS achieves 90.17% accuracy on NSL-KDD dataset, superior to other methods.
Knoto-ID studies the entanglement of open protein chains without closing them.
problem Analyzing the entanglement of open protein chains without altering their geometry.
method Using knotoids, a generalization of knot theory for open curves, to evaluate entanglement without closing the curve.
result Knoto-ID can analyze both global and local topologies of protein chains, identifying non-trivial folds.
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.
Optimizes stochastic linear bandits with efficient, asymptotically optimal algorithm.
problem Optimizing stochastic linear bandits with multiple actions.
method Frequentist information-directed sampling (IDS) with a surrogate for information gain.
result Asymptotically optimal and nearly worst-case optimal in finite time.
Paper tackles SCOD problem with optimal strategy and empirical validation.
problem Designing reliable prediction models abstaining from uncertain predictions.
method Bayes classifier for ID data and stochastic linear selector in 2D space.
result POSCOD method outperforms existing OOD methods.
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.
Paper tackles causal effect identification in sub-population with latent variables.
problem Identify causal effects in a sub-population with latent variables.
method Extend relevant graphical definitions and propose an algorithm for the s-ID problem.
result Sound algorithm for s-ID problem with latent variables.
IDS improves exploration in deep reinforcement learning.
problem Efficient exploration in reinforcement learning, especially with heteroscedastic returns.
method Information-Directed Sampling (IDS) for deep Q-learning.
result Significant improvement in Atari game performance over alternative approaches.
A nonlinear differential equation of Sornette-Ide type with noise, for a complex variable, yields endogenous crashes, preceded by roughly log-periodic oscillations in the real part, and a strong increase in the imaginary part. The latter is interpreted as the trader expectation.
Python package for SPD matrix distances, reproducible and extensible.
problem Computing distances between SPD matrices for various applications.
method Unified, extensible framework supporting multiple SPD metrics.
result Reproducible and accessible SPD matrix comparison tool.
New method estimates intrinsic dimensionality in undersampled data.
problem Challenges in estimating intrinsic dimensionality in high-dimensional, undersampled data.
method Uses tangent space properties and full correlation integral for accurate estimation.
result Capable of estimating ID in extremely undersampled regimes and curved manifolds.
Study complex reflections in 3D hyperbolic geometry, finding new representations.
problem Deforming groups in 3D complex hyperbolic geometry.
method Representations of abstract groups in PU(3,1), using Ford domains as guides.
result First nontrivial example of a discrete and faithful representation of a subgroup in PU(3,1).
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…
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.
Study on deep learning IDS resistance against adversarial attacks.
problem Vulnerabilities in deep learning-based IDS against adversarial attacks.
method Apply min-max optimization to train IDS against adversarial samples.
result Adversarial attack methods can be used in continuous domains and boost IDS robustness.
Estimates intrinsic dimensionality from minimal neighbor distances.
problem Analyzing high-dimensional datasets with complex manifolds.
method Minimal neighborhood information approach to estimate intrinsic dimensionality.
result The method provides consistent measures of intrinsic dimensionality.