The paper enhances a virtual assistant's humor to improve user satisfaction.
problem Improving a virtual assistant's ability to deliver humorous responses.
method Combines traditional NLP techniques with self-attentional networks and multi-task learning, using implicit feedback for labeling.
result Deep-learning models outperform heuristic methods in real-world user satisfaction.
System helps engineers with concept recognition for SEVA.
problem Recognizing systems engineering concepts for SEVA.
method Token classification task, domain expert labeling, pre-trained model fine-tuning, essential datasets creation, knowledge graph construction.
result System successfully recognizes systems engineering concepts.
Improves semantic parsing with human feedback in a counterfactual setup.
problem Expensive gold parses or answers for training semantic parsers.
method Convert model outputs to human-understandable statements for feedback.
result Significant improvement in semantic parsing through counterfactual learning.
Survey examines challenges of ML in avionic systems certification.
problem Challenges in current certification standards for ML in avionic systems.
method Literature review focusing on robustness and explainability of ML results.
result Current certification standards do not support ML in avionic systems.
Bayesian framework infers personalized embeddings for diverse human demonstrations.
problem Lack of personalized models for diverse human behaviors.
method Bayesian LfD framework inferring human-specific embeddings.
result Outperforms state-of-the-art techniques on synthetic and real-world data.
Model improves email-based conversational agents' ability to extract relevant information.
problem Asynchronous email communication makes it hard for agents to detect intents and extract relevant entities.
method Neural model for scoping relevant information from large queries.
result Improves performance of intent detection and entity extraction tasks by 35% in precision.
Efficiently allocate budgets for LLM-assisted virtual screening to reduce costs.
problem Reducing the cost of evaluating alternatives in large-scale screening tasks.
method Propose a top-m greedy evaluation mechanism and the EFG-m algorithm for efficient budget allocation. result Prove that EFG-m is both sample-optimal and consistent in large-scale virtual screening. Paper uses user engagement signals to automatically label training data for AI assistants.
problem Lack of annotated training data for AI assistants.
method Leverages user engagement signals for unsupervised entity labeling and data augmentation.
result Significant accuracy gains in sequence labeling tasks and user-facing results.
This research improves EEG-based MI-BCI systems to be more resilient to emotional arousal.
problem Lack of robustness in EEG-based MI-BCI systems due to emotional arousal.
method Subjects were exposed to VR environments to induce high and low arousal states. Machine learning models were trained on proxy subjects instead of arousal states. MI models were trained for each subject.
result MI-BCI systems are made more resilient to emotional perturbations.
A novel controller for wheeled robots handles joystick inputs for smooth steering.
problem Steering control for differential-drive wheeled robots from indirect joystick inputs.
method Developed a geometric controller based on Darboux frame kinematics.
result Smooth trajectories achieved with safety constraints and no desired states.
GOLOMB improves dialogue state tracking for unseen services.
problem Improving dialogue state tracking for multiple services and APIs.
method GOLOMB uses a BERT-based model that queries dialogue history with slot descriptions and values.
result GOLOMB achieves a joint goal accuracy of 53.97% on the SGD dataset.
Future autonomous systems need reliable world models and complex action sequences.
problem Current automated systems lack reliable world models and complex action sequences.
method Introduce energy-based and latent variable models combined in a hierarchical joint embedding predictive architecture (H-JEPA).
result Combining energy-based and latent variable models in H-JEPA can lead to reliable world models and complex action sequences.
Deep learning powers automotive innovations like self-driving cars.
problem Improving vehicle safety and functionality.
method Deployment of deep learning models in ADAS systems.
result Deep learning enhances performance and functionality of ADAS solutions.
This paper improves route choice models by incorporating contextual factors.
problem Existing route choice models lack consideration of dynamic contextual conditions.
method Knowledge distillation from Stated Choice Experiments in Immersive Virtual Environment.
result High-fidelity route choice models with increased predictive power.
Machine learning automates proof generation in Coq proof assistant.
problem Automating proof construction in proof assistants.
method Developed ASTactic, a deep learning model generating tactics as ASTs.
result ASTactic can generate effective tactics and prove new theorems.
New AI assistant for power grid operators simplifies complex decision-making.
problem Complexity and uncertainty in power grid operations.
method Unified human-machine interface and AI integration.
result Development of a new assistant framework for power grid operators.
Paper uses clustering to identify food assistance deserts in Ohio.
problem Food insecurity and accessibility issues in Ohio.
method Gaussian Mixture Model (GMM) clustering technique.
result Identifies food assistance deserts within Ohio.
Framework allows organizations to collaborate on learning tasks securely.
problem Limited collaboration due to security constraints.
method Assisted Learning framework for supervised learning tasks.
result Near-oracle learning performance achieved without revealing sensitive information.
A robot assists a human in a bandit task to learn and improve performance.
problem Learning preferences in humans when they are also learning.
method Introduces assistive multi-armed bandit, where a robot helps a human maximize cumulative reward.
result Human performance can be better when effectively communicating observed rewards to the robot, not just by learning optimally.
New virtualized Δ-move simplifies virtual knots and links.
problem Simplifying virtual knots and links.
method Introducing a new local deformation called the virtualized Δ-move.
result Virtualized Δ-move is an unknotting operation for virtual knots.
Virtual index cocycles reformulate virtual link invariants.
problem No specific problem stated; focuses on reformulation.
method Using virtual index cocycles to reformulate invariants.
result Unified reformulation of virtual link invariants.
The paper studies strict equivalence in multi-virtual linkoids with new invariants.
problem Understanding strict equivalence in multi-virtual linkoids.
method Utilizing multi-virtual knot theory, defining strict virtual linkoids, and studying invariants.
result New invariants for strict virtual linkoids are defined.
Improved accuracy in a commercial assistant by smartly selecting new training data.
problem Expensive and time-consuming to annotate new data for ML systems.
method Automatically identifies new helpful examples suitable for human annotation.
result The proposed method leads to higher accuracy improvements with a fixed annotation budget.
Improves survey sampling with unbiased machine learning methods.
problem Design-consistent model-assisted estimation lacks a general theory for machine learning.
method Proposes a subsampling Rao-Blackwell method for design-unbiased estimation.
result Yields efficiency gains over standard methods while ensuring valid estimation.
The study enumerates virtual quandles up to isomorphism.
problem Classifying virtual quandles up to isomorphism.
method Computer search and classification based on conjugacy class structures of rack automorphism groups.
result Classifications of virtual racks and quandles up to order 8.
New virtual version of Thompson's group created to handle virtual knots.
problem Creating a mathematical framework for virtual knots.
method Defining a virtual version of Thompson's group and proving its properties.
result Any virtual link can be constructed from an element of the new virtual Thompson's group.
The paper extends CF-moves to classify virtual links of any number of components.
problem Classifying virtual links using CF-moves.
method Extending CF-moves to classify virtual links of arbitrary number of components using the virtual linking number and invariants.
result Classification of 3-component even virtual links up to CF-moves.
Refines virtual link equality criterion for diagrams with one virtual crossing.
problem Determining when a virtual link diagram represents a properly virtual link.
method Refines the Kauffman-Murasugi-Thislethwaite type inequality for virtual links.
result Criterion for virtual link diagrams with exactly one virtual crossing to represent a properly virtual link.
Extend writhe polynomial from virtual knots to multi-virtual knots
problem Extend writhe polynomial from virtual knots to multi-virtual knots
method Extend writhe polynomial from virtual knots to multi-virtual knots
result Several questions asked in [16] have been answered
New invariants for virtual knots and links defined via quiver representations.
problem Defining new invariants for virtual knots and links.
method Quiver representations associated to virtual biquandles and rings.
result New polynomial invariants for virtual knots and links.
Study virtualized Delta, Sharp, and Pass moves for oriented virtual knots and links.
problem Conditions for unknotting oriented virtual knots and links.
method Local moves (Delta, Sharp, Pass) for oriented virtual links.
result Lower bounds for the unknotting numbers are proven and shown to be best possible.
The virtual unknotting number of a virtual knot is the minimal number of crossing changes that makes the virtual knot to be the unknot, which is defined only for virtual knots virtually homotopic to the unknot. We focus on the virtual knot obtained from the standard (p,q)-torus knot diagram by replacing all crossings o…
This paper connects virtual biquandles to biquandles for virtual link colorings.
problem Extending invariants from biquandles to virtual biquandles.
method Establishing equivalence between two representations of virtual braid groups and introducing new labeling rules.
result The number of colorings of a virtual link by virtual biquandles can be recovered from colorings by biquandles.
This paper evaluates ASR models on various co-processors, showing hardware acceleration benefits.
problem Lack of detailed training efficiency analysis for modern ASR systems.
method Developed a deep neural network ASR model and evaluated it on three co-processor platforms.
result Hardware acceleration yields good results even with less expensive equipment.
Virtual knots and links get multicrossings and petal diagrams.
problem Defining multicrossings for virtual knots and links.
method Extending multicrossings to virtual knots and links, showing petal diagrams exist.
result Petal diagrams exist for all virtual knots.
Computer-assisted method finds new Einstein metrics on spheres.
problem Finding new Einstein metrics on spheres.
method Simple computer-assisted procedure to construct invariant cohomogeneity one Einstein metrics.
result New Einstein metrics on S11, S12, S13 and S7imesS3. A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …
A virtual n-string is a chord diagram with n core circles and a collection of arrows between core circles. We consider virtual n-strings up to virtual homotopy, compositions of flat virtual Reidemeister moves on chord diagrams. Given a virtual 1-string α, Turaev associated a based matrix that encodes invariants…
The paper defines a chord index for virtual knots and links.
problem Defining a chord index for virtual knots and links.
method Smoothing real crossing points of virtual knot diagrams to construct a chord index.
result Several polynomial invariants can be derived from this construction.
New invariant for virtual n-links defined and studied.
problem Detecting virtual trefoil and other virtual links.
method Defining a new virtual link invariant VD(K) and studying its geometric properties. result The Dehn space DD(K) is an invariant of K and can detect the virtual trefoil. Given a virtual knot K, we construct a group VGK called the virtual knot group, and we use the elementary ideals of VGK to define invariants of K called the virtual Alexander invariants. For instance, associated to the k=0 ideal is a polynomial HK(s,t,q) in three variables which we call the virtual Alexa…
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…
New polynomial invariants for virtual links are stronger than F-polynomials.
problem Defining new invariants for virtual links.
method Introducing weight functions and a recurrent construction for new invariants.
result New polynomial invariants are stronger than F-polynomials.
Improves Bayesian neural learning efficiency with surrogate-assisted parallel tempering.
problem Challenges in Bayesian neural learning due to large models and data.
method Combines parallel tempering MCMC with surrogate-assisted optimization for computationally expensive models.
result Significantly lowers computational cost while maintaining quality in decision making.
Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also show that the virtual singular braid monoid has another presentation with fewer g…
Paper detects checkerboard colorability of virtual links using odd writhe and arrow polynomial.
problem Detecting checkerboard colorability of virtual links.
method Using odd writhe and arrow polynomial.
result Proves 6 virtual knots are not checkerboard colorable.
Study algebraic invariants of multi-virtual links.
problem Algebraic invariants of multi-virtual links.
method Determining moves, introducing operator quandles, constructing invariants.
result Established new invariants for multi-virtual links.
Virtual knot theory, introduced by Kauffman, is a generalization of classical knot theory of interest because its finite-type invariant theory is potentially a topological interpretation of Etingof and Kazhdan's theory of quantization of Lie bi-algebras. Classical knots inject into virtual knots, and flat virtual knots…