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

12243547 · Jul 202019922001200920172026
48 results for slot semantics

Typical spoken language understanding systems provide narrow semantic parses using a domain-specific ontology. The parses contain intents and slots that are directly consumed by downstream domain applications. In this work we discuss expanding such systems to handle compound entities and intents by introducing a domain…

2018-10-26abs ↗pdf ↗

A multi-task learning model for slot tagging in biomedical domains.

problem Limited labeled data, memory constraints, and domain-specific slot types.
method Multi-task learning using deep bidirectional transformers.
result Outperforms previous state-of-the-art systems in efficiency and effectiveness.

New estimator reduces risk in slate bandits by leveraging Bayes risk criterion.

problem Evaluating slate policies using logged data when policies factorize over slots.
method Developed a new estimator using a control variate approach, showing risk improvement over existing methods.
result The new estimator has lower risk than the pseudoinverse estimator in slate bandit problems.

Ranking items to be recommended to users is one of the main problems in large scale social media applications. This problem can be set up as a multi-objective optimization problem to allow for trading off multiple, potentially conflicting objectives (that are driven by those items) against each other. Most previous app…

2016-02-13abs ↗pdf ↗

Dealing with previously unseen slots is a challenging problem in a real-world multi-domain dialogue state tracking task. Other approaches rely on predefined mappings to generate candidate slot keys, as well as their associated values. This, however, may fail when the key, the value, or both, are not seen during trainin…

2019-08-26abs ↗pdf ↗

The paper classifies Killing tensor fields on Riemannian symmetric spaces.

problem Understanding Killing tensor fields on Riemannian symmetric spaces.
method Reduced study to compact irreducible spaces, introduced top slot Killing tensor fields, and classified quadratic fields.
result Quadratic Killing tensor fields on Riemannian symmetric spaces of rank one are spanned by top-slot and decomposable fields.

Algorithm minimizes loss and constraint violations in online convex optimization with smooth penalties.

problem Minimizing loss and constraint violations in online convex optimization with smooth penalties.
method Projected gradient descent over a set around the current action.
result Both dynamic regret and constraint violation are bounded by the path-length.

LGAC enhances heat transfer in turbulent boundary layers using slot jets.

problem Enhancing convective heat transfer in turbulent boundary layers.
method Artificial intelligence-based linear genetic algorithms control (LGAC) with slot jets.
result LGAC optimizes heat transfer and flow asymmetry in turbulent boundary layers.

Predicts fine-grained OD matrices for ridesharing platforms to optimize supply-demand balance.

problem Accurately predicting spatial-temporal OD demands for ridesharing platforms.
method OD-CED model combining unsupervised space coarsening and encoder-decoder architecture.
result Significant improvement in prediction accuracy (45% RMSE reduction, 60% WAPE reduction).

New algorithm reduces age of information in wireless networks with unknown channel reliability.

problem Learning optimal source-channel pairs to minimize age of information in wireless networks.
method Introduces AoI regret, novel learning algorithm with bounded AoI regret.
result Developed a learning algorithm with O(1)O(1) AoI regret, improving upon Θ(logT)Θ(\log T).

Framework for optimizing search engine rankings using observational data.

problem Optimizing ranking policies for search engines using limited observational data.
method Formulated expected reward optimization problem, estimated context value distribution, trained ranking policy via Bayesian inference.
result Demonstrated trade-offs in ranking policies trained on empirical reward estimates.

Semantic TrueLearn uses semantic graphs to improve educational recommendation systems.

problem Challenges in handling semantic and hierarchical structure in knowledge areas.
method Introduces a novel learner model that exploits semantic relatedness between knowledge components using a Wikipedia link graph.
result Achieves statistically significant improvements in predictive performance for educational engagement.

Transfer learning aims at building robust prediction models by transferring knowledge gained from one problem to another. In the semantic Web, learning tasks are enhanced with semantic representations. We exploit their semantics to augment transfer learning by dealing with when to transfer with semantic measurements an…

2019-05-31abs ↗pdf ↗

The paper shows how integrating categorical semantics can enhance unsupervised domain translation.

problem Improving unsupervised domain translation between perceptually different domains.
method Learning invariant categorical semantic features in an unsupervised manner and conditioning them on the style encoder.
result Conditioning the style encoder on learned categorical semantics improves translation and stylization.

This work provides uncertainty intervals for semantic latent variables in disentangled latent spaces.

problem Challenges in providing meaningful uncertainty quantification for semantic information in disentangled latent spaces.
method Uses quantile regression to output heuristic uncertainty intervals, calibrates these intervals to contain true latent values, and propagates them through the generator.
result Reliably communicates semantically meaningful, principled, and instance-adaptive uncertainty in image super-resolution and image completion.

New diffusion models improve counterfactual image generation with semantic control.

problem Challenges in preserving identity, maintaining quality, and ensuring causal model faithfulness in counterfactual image generation.
method Integrates semantic representations into diffusion models through Pearlian causality, introducing spatial, semantic, and dynamic abduction.
result Demonstrates high-level semantic identity preservation and principled trade-offs between faithful causal control and identity preservation.

New approach uses SPG for semantic communication without a known channel model.

problem Designing efficient semantic communication systems without a known channel model.
method Applying Stochastic Policy Gradient (SPG) for reinforcement learning.
result Achieves comparable performance to model-aware approaches with a decreased convergence rate.

Unsupervised scheme ranks sentences in text documents based on semantic importance.

problem Ranking sentences in text documents without labeled data.
method Extracts essential words and phrases, constructs semantic phrase and sentence graphs, applies PageRank, combines scores, and optimizes for topic diversity.
result SSR outperforms individual judges and compares favorably with combined rankings on benchmarks.

SPAT improves adversarial robustness by preserving semantics in adversarial training.

problem Adversarial examples often have different semantics than original data, introducing unintended biases.
method Semantics-preserving adversarial training (SPAT) that encourages pixel perturbation shared among all classes.
result SPAT improves adversarial robustness and achieves state-of-the-art results in CIFAR-10 and CIFAR-100.

Proposes CSG model to separate semantic and variation factors for OOD prediction.

problem Out-of-distribution examples cause conventional models to mix semantic and variation factors, leading to poor performance.
method Causal Semantic Generative model (CSG) based on causal reasoning, using variational Bayes for efficient learning and prediction.
result CSG can identify semantic factor and improve OOD prediction performance.

Building deep reinforcement learning agents that can generalize and adapt to unseen environments remains a fundamental challenge for AI. This paper describes progresses on this challenge in the context of man-made environments, which are visually diverse but contain intrinsic semantic regularities. We propose a hybrid …

2018-09-28abs ↗pdf ↗

New framework detects near vs. far out-of-distribution samples for AI safety.

problem Binary OOD detection fails to distinguish between semantically close and distant unknown risks.
method Ternary classification based on Low-Entropy Semantic Manifolds and Semantic Surprise Vector.
result Framework achieves state-of-the-art performance on ternary OOD detection task.

Embodied cognition states that semantics is encoded in the brain as firing patterns of neural circuits, which are learned according to the statistical structure of human multimodal experience. However, each human brain is idiosyncratically biased, according to its subjective experience history, making this biological s…

2019-06-20abs ↗pdf ↗

It is very useful to integrate human knowledge and experience into traditional neural networks for faster learning speed, fewer training samples and better interpretability. However, due to the obscured and indescribable black box model of neural networks, it is very difficult to design its architecture, interpret its …

2018-09-29abs ↗pdf ↗

Generative Adversarial Networks (GANs) have obtained extraordinary success in the generation of realistic images, a domain where a lower pixel-level accuracy is acceptable. We study the problem, not yet tackled in the literature, of generating semantic images starting from a prior distribution. Intuitively this problem…

2019-06-27abs ↗pdf ↗

Unsupervised segmentation learns features without labels, improving accuracy.

problem Discover and localize semantically meaningful categories in images without annotations.
method Separates feature learning from cluster compactification; distills unsupervised features into discrete semantic labels using a contrastive loss function.
result Significant improvement over prior state of the art on semantic segmentation challenges.

Semantic inpainting is the task of inferring missing pixels in an image given surrounding pixels and high level image semantics. Most semantic inpainting algorithms are deterministic: given an image with missing regions, a single inpainted image is generated. However, there are often several plausible inpaintings for a…

2018-10-08abs ↗pdf ↗

In iterative supervised learning algorithms it is common to reach a point in the search where no further induction seems to be possible with the available data. If the search is continued beyond this point, the risk of overfitting increases significantly. Following the recent developments in inductive semantic stochast…

2017-06-19abs ↗pdf ↗

DCoM uses deep neural networks to detect semantic data types from raw column values.

problem Detecting semantic data types from dirty and unseen data.
method DCoM employs multi-input NLP-based deep neural networks trained on 686,765 data columns.
result DCoM outperforms existing methods significantly on 78 different semantic data types.