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.

169,051 papers · 148 categories

Trend · papers per month

5.0%10.0%15.0%20.0% · Aug 199419922001200920182026
48 results for motion disambiguation

This study examines how imbalanced training data affects author name disambiguation.

problem The impact of imbalanced training data on machine learning for author name disambiguation.
method Training three classifiers (Logistic Regression, Naïve Bayes, Random Forest) on multiple labeled datasets with various positive-negative training data ratios.
result Increasing negative training data can improve disambiguation performance but with diminishing returns.

Paper develops neural network for Mandarin polyphone disambiguation.

problem Homograph problem in Mandarin Chinese text-to-speech.
method Bidirectional RNN for context, prediction network for mapping embeddings to pronunciations.
result Achieves 94.69% accuracy on polyphonic character dataset.

EviTrack improves sequential prediction in delayed disambiguation scenarios.

problem Challenges in sequential prediction with delayed disambiguation where early observations are ambiguous.
method EviTrack operates over latent trajectories, applying evidence- and likelihood-ratio-based selection to delay commitment until supported by data.
result EviTrack outperforms sampling-based baselines in a controlled synthetic benchmark, achieving faster post-disambiguation recovery.

Paper proposes an algorithm to recover full supervision from weakly labeled data.

problem Machine learning requires expensive data annotation, motivating the use of weak supervision.
method The paper introduces a disambiguation principle and an empirical disambiguation algorithm for partial labelling.
result The algorithm achieves exponential convergence rates under learnability assumptions.

Model learns to discover and disambiguate entities and relations in text streams.

problem Learning to follow and resolve mentions in a continuous text stream.
method End-to-end trainable memory network for online, one-shot learning.
result Improves disambiguation and discovery skills with minimal supervision.

A new method for name disambiguation in academic networks using multi-view attention and recurrent neural networks.

problem Disambiguating authors with the same name in large-scale academic networks.
method Multi-view Attention-based Pairwise Recurrent Neural Network (MA-PairRNN) that divides papers into blocks based on author attributes and merges blocks of the same author.
result MA-PairRNN significantly improves name disambiguation performance on real-world datasets.

Improves medical note processing by training model on related concepts and global context.

problem Scarce and imbalanced labeled training data limits generalizability of automated abbreviation disambiguation models.
method Data augmentation using related medical concepts and global context information within medical notes.
result Model accuracy improved by almost 14% on CASI dataset and 4% on i2b2 dataset.

A coloring scheme improves graph neural networks for node disambiguation.

problem Improving graph neural networks' ability to distinguish identical node attributes.
method Introducing a graph neural network called Colored Local Iterative Procedure (CLIP) that uses colors to disambiguate node attributes.
result CLIP is a universal approximator of continuous functions on graphs with node attributes.

This study improves author disambiguation without supervision using feature overlap.

problem Author name homonymy in the Web of Science.
method Probabilistic similarity measure based on feature overlap for agglomerative clustering.
result Our approach outperforms the trivial baseline and is state-of-the-art.

DivDis learns diverse hypotheses from underspecified data to improve robustness.

problem Learning from underspecified datasets leads to multiple equally viable solutions, causing out-of-distribution issues.
method DivDis framework: 1) learns diverse hypotheses using unlabeled test data, 2) selects one hypothesis with minimal additional supervision.
result DivDis finds robust features in image and natural language processing problems.

Vector representations of words have heralded a transformational approach to classical problems in NLP; the most popular example is word2vec. However, a single vector does not suffice to model the polysemous nature of many (frequent) words, i.e., words with multiple meanings. In this paper, we propose a three-fold appr…

2016-10-24abs ↗pdf ↗

PML-GAN tackles noisy multi-label annotations using adversarial learning.

problem Learning multi-label models from noisy, overcomplete annotations.
method PML-GAN uses a disambiguation network and a generative adversarial network to map noisy labels to clean labels and data samples.
result PML-GAN achieves state-of-the-art performance on partial multi-label learning datasets.

Efficient autoregressive entity linking with correction for faster, more accurate results.

problem High computational cost and non-parallelizable decoding in autoregressive entity linking.
method Parallelizes autoregressive linking across all mentions, uses a shallow decoder, and adds a discriminative correction term.
result 70 times faster and more accurate than previous methods, outperforming state-of-the-art approaches.

The study quantifies uncertainty to improve model calibration and disambiguate annotator and data bias in emotion recognition.

problem Improving model interpretability and disambiguating bias in complex tasks like emotion recognition.
method Used a modified Monte Carlo dropout approach to quantify epistemic and aleatoric uncertainty.
result Identified a significant correlation between aleatoric uncertainty and human annotator disagreement.

Active inference selects actions to maximize information gain, aiding structure learning.

problem Learning the structure of underlying world models.
method Active inference selects actions based on expected free energy, which includes information gain and value.
result Actions that maximize information gain help disambiguate among alternative models.

We present an LDA approach to entity disambiguation. Each topic is associated with a Wikipedia article and topics generate either content words or entity mentions. Training such models is challenging because of the topic and vocabulary size, both in the millions. We tackle these problems using a novel distributed infer…

2013-09-02abs ↗pdf ↗

Introduces Motion Programs for better video analysis of human motion.

problem Current video analysis focuses on raw pixels or keypoints, missing higher-level motion primitives.
method Introduces Motion Programs as a neuro-symbolic representation of motions as a composition of high-level primitives.
result Motion Programs accurately describe diverse human motions and improve downstream tasks.

We describe our language-independent unsupervised word sense induction system. This system only uses topic features to cluster different word senses in their global context topic space. Using unlabeled data, this system trains a latent Dirichlet allocation (LDA) topic model then uses it to infer the topics distribution…

2013-02-28abs ↗pdf ↗

Unified framework for human motion generation on Riemannian manifolds.

problem Learning valid human motion in Euclidean spaces.
method Riemannian Motion Generation (RMG) on product manifolds, Riemannian flow matching.
result Achieves state-of-the-art FID (0.043) on HumanML3D and surpasses strong baselines on MotionMillion.

Study on determinants of unitary Brownian motion and their asymptotic laws.

problem Understanding determinants of unitary Brownian motion and their behavior over time.
method Using Stiefel fibration and skew-product decomposition of the Stiefel Brownian motion.
result Prove asymptotic laws for determinants of block entries of unitary Brownian motion.

New framework predicts diverse, contextually plausible 3D human motions.

problem Predicting multiple plausible future 3D poses given observed poses.
method Developed a new variational framework that conditions latent variable on past observation to encourage relevant information.
result Our approach generates motions of higher quality and preserves contextual information.

Transparency, user trust, and human comprehension are popular ethical motivations for interpretable machine learning. In support of these goals, researchers evaluate model explanation performance using humans and real world applications. This alone presents a challenge in many areas of artificial intelligence. In this …

2017-11-20abs ↗pdf ↗

Neural network predicts vessel motions with high accuracy.

problem Real-time prediction of heave and surge motions for improved performance and safety.
method Developed an LSTM-based machine learning model trained on measured waves and motion data.
result The model predicts vessel motions up to 46.5 seconds into the future with an average accuracy of 90%.

Let EE be a closed set in the Riemann sphere C^\widehat{\mathbb{C}}. We consider a holomorphic motion φφ of EE over a complex manifold MM, that is, a holomorphic family of injections on EE parametrized by MM. It is known that if MM is the unit disk ΔΔ in the complex plane, then any holomorphic motion of EE ove…

2017-09-22abs ↗pdf ↗

Study cohomological equation for robotic screw motions on SE(3).

problem Understanding obstruction phenomena in robotic rigid-body motion.
method Combining Fourier analysis and Peter-Weyl theory, reduce to finite-dimensional linear transport systems.
result Explicit screw motion illustrates resonance conditions and finite-dimensional obstructions.

Sparse principal component analysis (SPCA) has emerged as a powerful technique for modern data analysis, providing improved interpretation of low-rank structures by identifying localized spatial structures in the data and disambiguating between distinct time scales. We demonstrate a robust and scalable SPCA algorithm b…

2018-04-01abs ↗pdf ↗

New approach for obstacle avoidance in robotics using learned representations.

problem Challenges in sensor-based motion planning for new and dynamic environments.
method Proposes a new obstacle representation using PointNet architecture trained jointly with policies for obstacle avoidance.
result Significant improvements in accuracy and efficiency compared to state of the art.