Instruction: What field is the article from?

Prompt:
Title: Modifying RL Policies with Imagined Actions: How Predictable Policies Can Enable Users to Perform Novel Tasks
Abstract: It is crucial that users are empowered to use the functionalities of a robot
to creatively solve problems on the fly. A user who has access to a
Reinforcement Learning (RL) based robot may want to use the robot's autonomy
and their knowledge of its behavior to complete new tasks. One way is for the
user to take control of some of the robot's action space through teleoperation
while the RL policy simultaneously controls the rest. However, an
out-of-the-box RL policy may not readily facilitate this. For example, a user's
control may bring the robot into a failure state from the policy's perspective,
causing it to act in a way the user is not familiar with, hindering the success
of the user's desired task. In this work, we formalize this problem and present
Imaginary Out-of-Distribution Actions, IODA, an initial algorithm for
addressing that problem and empowering user's to leverage their expectation of
a robot's behavior to accomplish new tasks.

Output: Robotics


Instruction: What field is the article from?

Prompt:
Title: Explainable Artificial Intelligence (XAI) 2.0: A Manifesto of Open Challenges and Interdisciplinary Research Directions
Abstract: As systems based on opaque Artificial Intelligence (AI) continue to flourish
in diverse real-world applications, understanding these black box models has
become paramount. In response, Explainable AI (XAI) has emerged as a field of
research with practical and ethical benefits across various domains. This paper
not only highlights the advancements in XAI and its application in real-world
scenarios but also addresses the ongoing challenges within XAI, emphasizing the
need for broader perspectives and collaborative efforts. We bring together
experts from diverse fields to identify open problems, striving to synchronize
research agendas and accelerate XAI in practical applications. By fostering
collaborative discussion and interdisciplinary cooperation, we aim to propel
XAI forward, contributing to its continued success. Our goal is to put forward
a comprehensive proposal for advancing XAI. To achieve this goal, we present a
manifesto of 27 open problems categorized into nine categories. These
challenges encapsulate the complexities and nuances of XAI and offer a road map
for future research. For each problem, we provide promising research directions
in the hope of harnessing the collective intelligence of interested
stakeholders.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: A Multifidelity Sim-to-Real Pipeline for Verifiable and Compositional Reinforcement Learning
Abstract: We propose and demonstrate a compositional framework for training and
verifying reinforcement learning (RL) systems within a multifidelity
sim-to-real pipeline, in order to deploy reliable and adaptable RL policies on
physical hardware. By decomposing complex robotic tasks into component subtasks
and defining mathematical interfaces between them, the framework allows for the
independent training and testing of the corresponding subtask policies, while
simultaneously providing guarantees on the overall behavior that results from
their composition. By verifying the performance of these subtask policies using
a multifidelity simulation pipeline, the framework not only allows for
efficient RL training, but also for a refinement of the subtasks and their
interfaces in response to challenges arising from discrepancies between
simulation and reality. In an experimental case study we apply the framework to
train and deploy a compositional RL system that successfully pilots a Warthog
unmanned ground robot.

Output: Robotics


Instruction: What field is the article from?

Prompt:
Title: RelVAE: Generative Pretraining for few-shot Visual Relationship Detection
Abstract: Visual relations are complex, multimodal concepts that play an important role
in the way humans perceive the world. As a result of their complexity,
high-quality, diverse and large scale datasets for visual relations are still
absent. In an attempt to overcome this data barrier, we choose to focus on the
problem of few-shot Visual Relationship Detection (VRD), a setting that has
been so far neglected by the community. In this work we present the first
pretraining method for few-shot predicate classification that does not require
any annotated relations. We achieve this by introducing a generative model that
is able to capture the variation of semantic, visual and spatial information of
relations inside a latent space and later exploiting its representations in
order to achieve efficient few-shot classification. We construct few-shot
training splits and show quantitative experiments on VG200 and VRD datasets
where our model outperforms the baselines. Lastly we attempt to interpret the
decisions of the model by conducting various qualitative experiments.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Pearl: A Production-ready Reinforcement Learning Agent
Abstract: Reinforcement Learning (RL) offers a versatile framework for achieving
long-term goals. Its generality allows us to formalize a wide range of problems
that real-world intelligent systems encounter, such as dealing with delayed
rewards, handling partial observability, addressing the exploration and
exploitation dilemma, utilizing offline data to improve online performance, and
ensuring safety constraints are met. Despite considerable progress made by the
RL research community in addressing these issues, existing open-source RL
libraries tend to focus on a narrow portion of the RL solution pipeline,
leaving other aspects largely unattended. This paper introduces Pearl, a
Production-ready RL agent software package explicitly designed to embrace these
challenges in a modular fashion. In addition to presenting preliminary
benchmark results, this paper highlights Pearl's industry adoptions to
demonstrate its readiness for production usage. Pearl is open sourced on Github
at github.com/facebookresearch/pearl and its official website is located at
pearlagent.github.io.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Weakly-Supervised Audio-Visual Segmentation
Abstract: Audio-visual segmentation is a challenging task that aims to predict
pixel-level masks for sound sources in a video. Previous work applied a
comprehensive manually designed architecture with countless pixel-wise accurate
masks as supervision. However, these pixel-level masks are expensive and not
available in all cases. In this work, we aim to simplify the supervision as the
instance-level annotation, i.e., weakly-supervised audio-visual segmentation.
We present a novel Weakly-Supervised Audio-Visual Segmentation framework,
namely WS-AVS, that can learn multi-scale audio-visual alignment with
multi-scale multiple-instance contrastive learning for audio-visual
segmentation. Extensive experiments on AVSBench demonstrate the effectiveness
of our WS-AVS in the weakly-supervised audio-visual segmentation of
single-source and multi-source scenarios.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Alignment and Outer Shell Isotropy for Hyperbolic Graph Contrastive Learning
Abstract: Learning good self-supervised graph representations that are beneficial to
downstream tasks is challenging. Among a variety of methods, contrastive
learning enjoys competitive performance. The embeddings of contrastive learning
are arranged on a hypersphere that enables the Cosine distance measurement in
the Euclidean space. However, the underlying structure of many domains such as
graphs exhibits highly non-Euclidean latent geometry. To this end, we propose a
novel contrastive learning framework to learn high-quality graph embedding.
Specifically, we design the alignment metric that effectively captures the
hierarchical data-invariant information, as well as we propose a substitute of
uniformity metric to prevent the so-called dimensional collapse. We show that
in the hyperbolic space one has to address the leaf- and height-level
uniformity which are related to properties of trees, whereas in the ambient
space of the hyperbolic manifold, these notions translate into imposing an
isotropic ring density towards boundaries of Poincar\'e ball. This ring density
can be easily imposed by promoting the isotropic feature distribution on the
tangent space of manifold. In the experiments, we demonstrate the efficacy of
our proposed method across different hyperbolic graph embedding techniques in
both supervised and self-supervised learning settings.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: A Stability Principle for Learning under Non-Stationarity
Abstract: We develop a versatile framework for statistical learning in non-stationary
environments. In each time period, our approach applies a stability principle
to select a look-back window that maximizes the utilization of historical data
while keeping the cumulative bias within an acceptable range relative to the
stochastic error. Our theory showcases the adaptability of this approach to
unknown non-stationarity. The regret bound is minimax optimal up to logarithmic
factors when the population losses are strongly convex, or Lipschitz only. At
the heart of our analysis lie two novel components: a measure of similarity
between functions and a segmentation technique for dividing the non-stationary
data sequence into quasi-stationary pieces.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Analysis of the User Perception of Chatbots in Education Using A Partial Least Squares Structural Equation Modeling Approach
Abstract: The integration of Artificial Intelligence (AI) into education is a recent
development, with chatbots emerging as a noteworthy addition to this
transformative landscape. As online learning platforms rapidly advance,
students need to adapt swiftly to excel in this dynamic environment.
Consequently, understanding the acceptance of chatbots, particularly those
employing Large Language Model (LLM) such as Chat Generative Pretrained
Transformer (ChatGPT), Google Bard, and other interactive AI technologies, is
of paramount importance. However, existing research on chatbots in education
has overlooked key behavior-related aspects, such as Optimism, Innovativeness,
Discomfort, Insecurity, Transparency, Ethics, Interaction, Engagement, and
Accuracy, creating a significant literature gap. To address this gap, this
study employs Partial Least Squares Structural Equation Modeling (PLS-SEM) to
investigate the determinant of chatbots adoption in education among students,
considering the Technology Readiness Index (TRI) and Technology Acceptance
Model (TAM). Utilizing a five-point Likert scale for data collection, we
gathered a total of 185 responses, which were analyzed using R-Studio software.
We established 12 hypotheses to achieve its objectives. The results showed that
Optimism and Innovativeness are positively associated with Perceived Ease of
Use (PEOU) and Perceived Usefulness (PU). Conversely, Discomfort and Insecurity
negatively impact PEOU, with only Insecurity negatively affecting PU. These
findings provide insights for future technology designers, elucidating critical
user behavior factors influencing chatbots adoption and utilization in
educational contexts.

Output: Human-Computer Interaction


Instruction: What field is the article from?

Prompt:
Title: Grounding Everything: Emerging Localization Properties in Vision-Language Transformers
Abstract: Vision-language foundation models have shown remarkable performance in
various zero-shot settings such as image retrieval, classification, or
captioning. But so far, those models seem to fall behind when it comes to
zero-shot localization of referential expressions and objects in images. As a
result, they need to be fine-tuned for this task. In this paper, we show that
pretrained vision-language (VL) models allow for zero-shot open-vocabulary
object localization without any fine-tuning. To leverage those capabilities, we
propose a Grounding Everything Module (GEM) that generalizes the idea of
value-value attention introduced by CLIPSurgery to a self-self attention path.
We show that the concept of self-self attention corresponds to clustering, thus
enforcing groups of tokens arising from the same object to be similar while
preserving the alignment with the language space. To further guide the group
formation, we propose a set of regularizations that allows the model to finally
generalize across datasets and backbones. We evaluate the proposed GEM
framework on various benchmark tasks and datasets for semantic segmentation. It
shows that GEM not only outperforms other training-free open-vocabulary
localization methods, but also achieves state-of-the-art results on the
recently proposed OpenImagesV7 large-scale segmentation benchmark.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Leveraging generative artificial intelligence to simulate student learning behavior
Abstract: Student simulation presents a transformative approach to enhance learning
outcomes, advance educational research, and ultimately shape the future of
effective pedagogy. We explore the feasibility of using large language models
(LLMs), a remarkable achievement in AI, to simulate student learning behaviors.
Unlike conventional machine learning based prediction, we leverage LLMs to
instantiate virtual students with specific demographics and uncover intricate
correlations among learning experiences, course materials, understanding
levels, and engagement. Our objective is not merely to predict learning
outcomes but to replicate learning behaviors and patterns of real students. We
validate this hypothesis through three experiments. The first experiment, based
on a dataset of N = 145, simulates student learning outcomes from demographic
data, revealing parallels with actual students concerning various demographic
factors. The second experiment (N = 4524) results in increasingly realistic
simulated behaviors with more assessment history for virtual students
modelling. The third experiment (N = 27), incorporating prior knowledge and
course interactions, indicates a strong link between virtual students' learning
behaviors and fine-grained mappings from test questions, course materials,
engagement and understanding levels. Collectively, these findings deepen our
understanding of LLMs and demonstrate its viability for student simulation,
empowering more adaptable curricula design to enhance inclusivity and
educational effectiveness.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: Foundational Moral Values for AI Alignment
Abstract: Solving the AI alignment problem requires having clear, defensible values
towards which AI systems can align. Currently, targets for alignment remain
underspecified and do not seem to be built from a philosophically robust
structure. We begin the discussion of this problem by presenting five core,
foundational values, drawn from moral philosophy and built on the requisites
for human existence: survival, sustainable intergenerational existence,
society, education, and truth. We show that these values not only provide a
clearer direction for technical alignment work, but also serve as a framework
to highlight threats and opportunities from AI systems to both obtain and
sustain these values.

Output: Computers and Society


Instruction: What field is the article from?

Prompt:
Title: General Policies, Subgoal Structure, and Planning Width
Abstract: It has been observed that many classical planning domains with atomic goals
can be solved by means of a simple polynomial exploration procedure, called IW,
that runs in time exponential in the problem width, which in these cases is
bounded and small. Yet, while the notion of width has become part of
state-of-the-art planning algorithms such as BFWS, there is no good explanation
for why so many benchmark domains have bounded width when atomic goals are
considered. In this work, we address this question by relating bounded width
with the existence of general optimal policies that in each planning instance
are represented by tuples of atoms of bounded size. We also define the notions
of (explicit) serializations and serialized width that have a broader scope as
many domains have a bounded serialized width but no bounded width. Such
problems are solved non-optimally in polynomial time by a suitable variant of
the Serialized IW algorithm. Finally, the language of general policies and the
semantics of serializations are combined to yield a simple, meaningful, and
expressive language for specifying serializations in compact form in the form
of sketches, which can be used for encoding domain control knowledge by hand or
for learning it from small examples. Sketches express general problem
decompositions in terms of subgoals, and sketches of bounded width express
problem decompositions that can be solved in polynomial time.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: EQ-Bench: An Emotional Intelligence Benchmark for Large Language Models
Abstract: We introduce EQ-Bench, a novel benchmark designed to evaluate aspects of
emotional intelligence in Large Language Models (LLMs). We assess the ability
of LLMs to understand complex emotions and social interactions by asking them
to predict the intensity of emotional states of characters in a dialogue. The
benchmark is able to discriminate effectively between a wide range of models.
We find that EQ-Bench correlates strongly with comprehensive multi-domain
benchmarks like MMLU (Hendrycks et al., 2020) (r=0.97), indicating that we may
be capturing similar aspects of broad intelligence. Our benchmark produces
highly repeatable results using a set of 60 English-language questions. We also
provide open-source code for an automated benchmarking pipeline at
https://github.com/EQ-bench/EQ-Bench and a leaderboard at
https://www.eqbench.com

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: LLaVA-Plus: Learning to Use Tools for Creating Multimodal Agents
Abstract: LLaVA-Plus is a general-purpose multimodal assistant that expands the
capabilities of large multimodal models. It maintains a skill repository of
pre-trained vision and vision-language models and can activate relevant tools
based on users' inputs to fulfill real-world tasks. LLaVA-Plus is trained on
multimodal instruction-following data to acquire the ability to use tools,
covering visual understanding, generation, external knowledge retrieval, and
compositions. Empirical results show that LLaVA-Plus outperforms LLaVA in
existing capabilities and exhibits new ones. It is distinct in that the image
query is directly grounded and actively engaged throughout the entire human-AI
interaction sessions, significantly improving tool use performance and enabling
new scenarios.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: An advantage based policy transfer algorithm for reinforcement learning with metrics of transferability
Abstract: Reinforcement learning (RL) can enable sequential decision-making in complex
and high-dimensional environments if the acquisition of a new state-action pair
is efficient, i.e., when interaction with the environment is inexpensive.
However, there are a myriad of real-world applications in which a high number
of interactions are infeasible. In these environments, transfer RL algorithms,
which can be used for the transfer of knowledge from one or multiple source
environments to a target environment, have been shown to increase learning
speed and improve initial and asymptotic performance. However, most existing
transfer RL algorithms are on-policy and sample inefficient, and often require
heuristic choices in algorithm design. This paper proposes an off-policy
Advantage-based Policy Transfer algorithm, APT-RL, for fixed domain
environments. Its novelty is in using the popular notion of ``advantage'' as a
regularizer, to weigh the knowledge that should be transferred from the source,
relative to new knowledge learned in the target, removing the need for
heuristic choices. Further, we propose a new transfer performance metric to
evaluate the performance of our algorithm and unify existing transfer RL
frameworks. Finally, we present a scalable, theoretically-backed task
similarity measurement algorithm to illustrate the alignments between our
proposed transferability metric and similarities between source and target
environments. Numerical experiments on three continuous control benchmark tasks
demonstrate that APT-RL outperforms existing transfer RL algorithms on most
tasks, and is $10\%$ to $75\%$ more sample efficient than learning from
scratch.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Self Model for Embodied Intelligence: Modeling Full-Body Human Musculoskeletal System and Locomotion Control with Hierarchical Low-Dimensional Representation
Abstract: Modeling and control of the human musculoskeletal system is important for
understanding human motion, developing embodied intelligence, and optimizing
human-robot interaction systems. However, current open-source models are
restricted to a limited range of body parts and often with a reduced number of
muscles. There is also a lack of algorithms capable of controlling over 600
muscles to generate reasonable human movements. To fill this gap, we build a
comprehensive musculoskeletal model with 90 body segments, 206 joints, and 700
muscle-tendon units, allowing simulation of full-body dynamics and interaction
with various devices. We develop a new algorithm using low-dimensional
representation and hierarchical deep reinforcement learning to achieve
state-of-the-art full-body control. We validate the effectiveness of our model
and algorithm in simulations and on real human locomotion data. The
musculoskeletal model, along with its control algorithm, will be made available
to the research community to promote a deeper understanding of human motion
control and better design of interactive robots.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: An Extensive Study on Adversarial Attack against Pre-trained Models of Code
Abstract: Transformer-based pre-trained models of code (PTMC) have been widely utilized
and have achieved state-of-the-art performance in many mission-critical
applications. However, they can be vulnerable to adversarial attacks through
identifier substitution or coding style transformation, which can significantly
degrade accuracy and may further incur security concerns. Although several
approaches have been proposed to generate adversarial examples for PTMC, the
effectiveness and efficiency of such approaches, especially on different code
intelligence tasks, has not been well understood. To bridge this gap, this
study systematically analyzes five state-of-the-art adversarial attack
approaches from three perspectives: effectiveness, efficiency, and the quality
of generated examples. The results show that none of the five approaches
balances all these perspectives. Particularly, approaches with a high attack
success rate tend to be time-consuming; the adversarial code they generate
often lack naturalness, and vice versa. To address this limitation, we explore
the impact of perturbing identifiers under different contexts and find that
identifier substitution within for and if statements is the most effective.
Based on these findings, we propose a new approach that prioritizes different
types of statements for various tasks and further utilizes beam search to
generate adversarial examples. Evaluation results show that it outperforms the
state-of-the-art ALERT in terms of both effectiveness and efficiency while
preserving the naturalness of the generated adversarial examples.

Output: Cryptography and Security


Instruction: What field is the article from?

Prompt:
Title: Personalized Path Recourse
Abstract: This paper introduces Personalized Path Recourse, a novel method that
generates recourse paths for an agent. The objective is to achieve desired
goals (e.g., better outcomes compared to the agent's original paths of action),
while ensuring a high similarity to the agent's original paths and being
personalized to the agent. Personalization refers to the extent to which the
new path is tailored to the agent's observed behavior patterns from their
policy function. We train a personalized recourse agent to generate such
personalized paths, which are obtained using reward functions that consider the
goal, similarity, and personalization. The proposed method is applicable to
both reinforcement learning and supervised learning settings for correcting or
improving sequences of actions or sequences of data to achieve a pre-determined
goal. The method is evaluated in various settings and demonstrates promising
results.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Exploring Lip Segmentation Techniques in Computer Vision: A Comparative Analysis
Abstract: Lip segmentation is crucial in computer vision, especially for lip reading.
Despite extensive face segmentation research, lip segmentation has received
limited attention. The aim of this study is to compare state-of-the-art lip
segmentation models using a standardized setting and a publicly available
dataset. Five techniques, namely EHANet, Mask2Former, BiSeNet V2, PIDNet, and
STDC1, are qualitatively selected based on their reported performance,
inference time, code availability, recency, and popularity. The CelebAMask-HQ
dataset, comprising manually annotated face images, is used to fairly assess
the lip segmentation performance of the selected models. Inference experiments
are conducted on a Raspberry Pi4 to emulate limited computational resources.
The results show that Mask2Former and EHANet have the best performances in
terms of mIoU score. BiSeNet V2 demonstrate competitive performance, while
PIDNet excels in recall but has lower precision. Most models present inference
time ranging from 1000 to around 3000 milliseconds on a Raspberry Pi4, with
PIDNet having the lowest mean inference time. This study provides a
comprehensive evaluation of lip segmentation models, highlighting their
performance and inference times. The findings contribute to the development of
lightweight techniques and establish benchmarks for future advances in lip
segmentation, especially in IoT and edge computing scenarios.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: TST$^\mathrm{R}$: Target Similarity Tuning Meets the Real World
Abstract: Target similarity tuning (TST) is a method of selecting relevant examples in
natural language (NL) to code generation through large language models (LLMs)
to improve performance. Its goal is to adapt a sentence embedding model to have
the similarity between two NL inputs match the similarity between their
associated code outputs. In this paper, we propose different methods to apply
and improve TST in the real world. First, we replace the sentence transformer
with embeddings from a larger model, which reduces sensitivity to the language
distribution and thus provides more flexibility in synthetic generation of
examples, and we train a tiny model that transforms these embeddings to a space
where embedding similarity matches code similarity, which allows the model to
remain a black box and only requires a few matrix multiplications at inference
time. Second, we show how to efficiently select a smaller number of training
examples to train the TST model. Third, we introduce a ranking-based evaluation
for TST that does not require end-to-end code generation experiments, which can
be expensive to perform.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: Touring sampling with pushforward maps
Abstract: The number of sampling methods could be daunting for a practitioner looking
to cast powerful machine learning methods to their specific problem. This paper
takes a theoretical stance to review and organize many sampling approaches in
the ``generative modeling'' setting, where one wants to generate new data that
are similar to some training examples. By revealing links between existing
methods, it might prove useful to overcome some of the current challenges in
sampling with diffusion models, such as long inference time due to diffusion
simulation, or the lack of diversity in generated samples.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: The Quest for Content: A Survey of Search-Based Procedural Content Generation for Video Games
Abstract: Video games demand is constantly increasing, which requires the costly
production of large amounts of content. Towards this challenge, researchers
have developed Search-Based Procedural Content Generation (SBPCG), that is, the
(semi-)automated creation of content through search algorithms. We survey the
current state of SBPCG, reporting work appeared in the field between 2011-2022
and identifying open research challenges. The results lead to recommendations
for practitioners and to the identification of several potential future
research avenues for SBPCG.

Output: Software Engineering


Instruction: What field is the article from?

Prompt:
Title: Sim-to-Real Causal Transfer: A Metric Learning Approach to Causally-Aware Interaction Representations
Abstract: Modeling spatial-temporal interactions among neighboring agents is at the
heart of multi-agent problems such as motion forecasting and crowd navigation.
Despite notable progress, it remains unclear to which extent modern
representations can capture the causal relationships behind agent interactions.
In this work, we take an in-depth look at the causal awareness of these
representations, from computational formalism to real-world practice. First, we
cast doubt on the notion of non-causal robustness studied in the recent
CausalAgents benchmark. We show that recent representations are already
partially resilient to perturbations of non-causal agents, and yet modeling
indirect causal effects involving mediator agents remains challenging. To
address this challenge, we introduce a metric learning approach that
regularizes latent representations with causal annotations. Our controlled
experiments show that this approach not only leads to higher degrees of causal
awareness but also yields stronger out-of-distribution robustness. To further
operationalize it in practice, we propose a sim-to-real causal transfer method
via cross-domain multi-task learning. Experiments on pedestrian datasets show
that our method can substantially boost generalization, even in the absence of
real-world causal annotations. We hope our work provides a new perspective on
the challenges and potential pathways towards causally-aware representations of
multi-agent interactions. Our code is available at
https://github.com/socialcausality.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Controlled Decoding from Language Models
Abstract: We propose controlled decoding (CD), a novel off-policy reinforcement
learning method to control the autoregressive generation from language models
towards high reward outcomes. CD solves an off-policy reinforcement learning
problem through a value function for the reward, which we call a prefix scorer.
The prefix scorer is used at inference time to steer the generation towards
higher reward outcomes. We show that the prefix scorer may be trained on
(possibly) off-policy data to predict the expected reward when decoding is
continued from a partially decoded response. We empirically demonstrate that CD
is effective as a control mechanism on Reddit conversations corpus. We also
show that the modularity of the design of CD makes it possible to control for
multiple rewards, effectively solving a multi-objective reinforcement learning
problem with no additional complexity. Finally, we show that CD can be applied
in a novel blockwise fashion at inference-time, again without the need for any
training-time changes, essentially bridging the gap between the popular
best-of-$K$ strategy and token-level reinforcement learning. This makes CD a
promising approach for alignment of language models.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: RoboSense At Edge: Detecting Slip, Crumple and Shape of the Object in Robotic Hand for Teleoprations
Abstract: Slip and crumple detection is essential for performing robust manipulation
tasks with a robotic hand (RH) like remote surgery. It has been one of the
challenging problems in the robotics manipulation community. In this work, we
propose a technique based on machine learning (ML) based techniques to detect
the slip, and crumple as well as the shape of an object that is currently held
in the robotic hand. We proposed ML model will detect the slip, crumple, and
shape using the force/torque exerted and the angular positions of the actuators
present in the RH. The proposed model would be integrated into the loop of a
robotic hand(RH) and haptic glove(HG). This would help us to reduce the latency
in case of teleoperation

Output: Robotics


Instruction: What field is the article from?

Prompt:
Title: GreenLightningAI: An Efficient AI System with Decoupled Structural and Quantitative Knowledge
Abstract: The number and complexity of artificial intelligence (AI) applications is
growing relentlessly. As a result, even with the many algorithmic and
mathematical advances experienced over past decades as well as the impressive
energy efficiency and computational capacity of current hardware accelerators,
training the most powerful and popular deep neural networks comes at very high
economic and environmental costs. Recognising that additional optimisations of
conventional neural network training is very difficult, this work takes a
radically different approach by proposing GreenLightningAI, a new AI system
design consisting of a linear model that is capable of emulating the behaviour
of deep neural networks by subsetting the model for each particular sample. The
new AI system stores the information required to select the system subset for a
given sample (referred to as structural information) separately from the linear
model parameters (referred to as quantitative knowledge). In this paper we
present a proof of concept, showing that the structural information stabilises
far earlier than the quantitative knowledge. Additionally, we show
experimentally that the structural information can be kept unmodified when
re-training the AI system with new samples while still achieving a validation
accuracy similar to that obtained when re-training a neural network with
similar size. Since the proposed AI system is based on a linear model, multiple
copies of the model, trained with different datasets, can be easily combined.
This enables faster and greener (re)-training algorithms, including incremental
re-training and federated incremental re-training.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Rapid Motor Adaptation for Robotic Manipulator Arms
Abstract: Developing generalizable manipulation skills is a core challenge in embodied
AI. This includes generalization across diverse task configurations,
encompassing variations in object shape, density, friction coefficient, and
external disturbances such as forces applied to the robot. Rapid Motor
Adaptation (RMA) offers a promising solution to this challenge. It posits that
essential hidden variables influencing an agent's task performance, such as
object mass and shape, can be effectively inferred from the agent's action and
proprioceptive history. Drawing inspiration from RMA in locomotion and in-hand
rotation, we use depth perception to develop agents tailored for rapid motor
adaptation in a variety of manipulation tasks. We evaluated our agents on four
challenging tasks from the Maniskill2 benchmark, namely pick-and-place
operations with hundreds of objects from the YCB and EGAD datasets, peg
insertion with precise position and orientation, and operating a variety of
faucets and handles, with customized environment variations. Empirical results
demonstrate that our agents surpass state-of-the-art methods like automatic
domain randomization and vision-based policies, obtaining better generalization
performance and sample efficiency.

Output: Robotics


Instruction: What field is the article from?

Prompt:
Title: OMNIINPUT: A Model-centric Evaluation Framework through Output Distribution
Abstract: We propose a novel model-centric evaluation framework, OmniInput, to evaluate
the quality of an AI/ML model's predictions on all possible inputs (including
human-unrecognizable ones), which is crucial for AI safety and reliability.
Unlike traditional data-centric evaluation based on pre-defined test sets, the
test set in OmniInput is self-constructed by the model itself and the model
quality is evaluated by investigating its output distribution. We employ an
efficient sampler to obtain representative inputs and the output distribution
of the trained model, which, after selective annotation, can be used to
estimate the model's precision and recall at different output values and a
comprehensive precision-recall curve. Our experiments demonstrate that
OmniInput enables a more fine-grained comparison between models, especially
when their performance is almost the same on pre-defined datasets, leading to
new findings and insights for how to train more robust, generalizable models.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: SynFundus: A synthetic fundus images dataset with millions of samples and multi-disease annotations
Abstract: In the field of medical imaging, there are seldom large-scale public datasets
with high-quality annotations due to data privacy and annotation cost. To
address this issue, we release SynFundus-1M, a high-quality synthetic dataset
containing over \textbf{1 million} fundus images w.r.t. 11 disease types.
Moreover, we intentionally diversify the readability of the images and
accordingly provide 4 types of the quality score for each image. To the best of
our knowledge, SynFundus-1M is currently the largest fundus dataset with the
most sophisticated annotations. All the images are generated by a Denoising
Diffusion Probabilistic Model, named SynFundus-Generator. Trained with over 1.3
million private fundus images, our SynFundus-Generator achieves significant
superior performance in generating fundus images compared to some recent
related works. Furthermore, we blend some synthetic images from SynFundus-1M
with real fundus images, and ophthalmologists can hardly distinguish the
synthetic images from real ones. Through extensive experiments, we demonstrate
that both convolutional neural networs (CNN) and Vision Transformer (ViT) can
benefit from SynFundus-1M by pretraining or training directly. Compared to
datasets like ImageNet or EyePACS, models trained on SynFundus-1M not only
achieve better performance but also faster convergence on various downstream
tasks.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: UTBoost: A Tree-boosting based System for Uplift Modeling
Abstract: Uplift modeling refers to the set of machine learning techniques that a
manager may use to estimate customer uplift, that is, the net effect of an
action on some customer outcome. By identifying the subset of customers for
whom a treatment will have the greatest effect, uplift models assist
decision-makers in optimizing resource allocations and maximizing overall
returns. Accurately estimating customer uplift poses practical challenges, as
it requires assessing the difference between two mutually exclusive outcomes
for each individual. In this paper, we propose two innovative adaptations of
the well-established Gradient Boosting Decision Trees (GBDT) algorithm, which
learn the causal effect in a sequential way and overcome the counter-factual
nature. Both approaches innovate existing techniques in terms of ensemble
learning method and learning objectives, respectively. Experiments on
large-scale datasets demonstrate the usefulness of the proposed methods, which
often yielding remarkable improvements over base models. To facilitate the
application, we develop the UTBoost, an end-to-end tree boosting system
specifically designed for uplift modeling. The package is open source and has
been optimized for training speed to meet the needs of real industrial
applications.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Mitigating Object Hallucinations in Large Vision-Language Models through Visual Contrastive Decoding
Abstract: Large Vision-Language Models (LVLMs) have advanced considerably, intertwining
visual recognition and language understanding to generate content that is not
only coherent but also contextually attuned. Despite their success, LVLMs still
suffer from the issue of object hallucinations, where models generate plausible
yet incorrect outputs that include objects that do not exist in the images. To
mitigate this issue, we introduce Visual Contrastive Decoding (VCD), a simple
and training-free method that contrasts output distributions derived from
original and distorted visual inputs. The proposed VCD effectively reduces the
over-reliance on statistical bias and unimodal priors, two essential causes of
object hallucinations. This adjustment ensures the generated content is closely
grounded to visual inputs, resulting in contextually accurate outputs. Our
experiments show that VCD, without either additional training or the usage of
external tools, significantly mitigates the object hallucination issue across
different LVLM families. Beyond mitigating object hallucinations, VCD also
excels in general LVLM benchmarks, highlighting its wide-ranging applicability.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Generative AI for Hate Speech Detection: Evaluation and Findings
Abstract: Automatic hate speech detection using deep neural models is hampered by the
scarcity of labeled datasets, leading to poor generalization. To mitigate this
problem, generative AI has been utilized to generate large amounts of synthetic
hate speech sequences from available labeled examples, leveraging the generated
data in finetuning large pre-trained language models (LLMs). In this chapter,
we provide a review of relevant methods, experimental setups and evaluation of
this approach. In addition to general LLMs, such as BERT, RoBERTa and ALBERT,
we apply and evaluate the impact of train set augmentation with generated data
using LLMs that have been already adapted for hate detection, including
RoBERTa-Toxicity, HateBERT, HateXplain, ToxDect, and ToxiGen. An empirical
study corroborates our previous findings, showing that this approach improves
hate speech generalization, boosting recall performance across data
distributions. In addition, we explore and compare the performance of the
finetuned LLMs with zero-shot hate detection using a GPT-3.5 model. Our results
demonstrate that while better generalization is achieved using the GPT-3.5
model, it achieves mediocre recall and low precision on most datasets. It is an
open question whether the sensitivity of models such as GPT-3.5, and onward,
can be improved using similar techniques of text generation.

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: Evaluating Large Language Models in Ophthalmology
Abstract: Purpose: The performance of three different large language models (LLMS)
(GPT-3.5, GPT-4, and PaLM2) in answering ophthalmology professional questions
was evaluated and compared with that of three different professional
populations (medical undergraduates, medical masters, and attending
physicians). Methods: A 100-item ophthalmology single-choice test was
administered to three different LLMs (GPT-3.5, GPT-4, and PaLM2) and three
different professional levels (medical undergraduates, medical masters, and
attending physicians), respectively. The performance of LLM was comprehensively
evaluated and compared with the human group in terms of average score,
stability, and confidence. Results: Each LLM outperformed undergraduates in
general, with GPT-3.5 and PaLM2 being slightly below the master's level, while
GPT-4 showed a level comparable to that of attending physicians. In addition,
GPT-4 showed significantly higher answer stability and confidence than GPT-3.5
and PaLM2. Conclusion: Our study shows that LLM represented by GPT-4 performs
better in the field of ophthalmology. With further improvements, LLM will bring
unexpected benefits in medical education and clinical decision making in the
near future.

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: Education distillation:getting student models to learn in shcools
Abstract: Knowledge distillation is one of the methods for model compression, and
existing knowledge distillation techniques focus on how to improve the
distillation algorithm so as to enhance the distillation efficiency. This paper
introduces dynamic incremental learning into knowledge distillation and
proposes a distillation strategy for education distillation. Specifically, it
is proposed to take fragmented student models divided from the complete student
model as lower-grade models. As the grade level rises, fragmented student
models deepen in conjunction with designed teaching reference layers, while
learning and distilling from more teacher models. By moving from lower to
higher grades, fragmented student models were gradually integrated into a
complete target student model, and the performance of the student models
gradually improved from lower to higher grades of the stage. Education
distillation strategies combined with distillation algorithms outperform the
results of single distillation algorithms on the public dataset
CIFAR100,Caltech256, Food-101 dataset.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: "Close...but not as good as an educator." -- Using ChatGPT to provide formative feedback in large-class collaborative learning
Abstract: Delivering personalised, formative feedback to multiple problem-based
learning groups in a short time period can be almost impossible. We employed
ChatGPT to provide personalised formative feedback in a one-hour Zoom break-out
room activity that taught practicing health professionals how to formulate
evaluation plans for digital health initiatives. Learners completed an
evaluation survey that included Likert scales and open-ended questions that
were analysed. Half of the 44 survey respondents had never used ChatGPT before.
Overall, respondents found the feedback favourable, described a wide range of
group dynamics, and had adaptive responses to the feedback, yet only three
groups used the feedback loop to improve their evaluation plans. Future
educators can learn from our experience including engineering prompts,
providing instructions on how to use ChatGPT, and scaffolding optimal group
interactions with ChatGPT. Future researchers should explore the influence of
ChatGPT on group dynamics and derive design principles for the use of ChatGPT
in collaborative learning.

Output: Human-Computer Interaction


Instruction: What field is the article from?

Prompt:
Title: On Task-personalized Multimodal Few-shot Learning for Visually-rich Document Entity Retrieval
Abstract: Visually-rich document entity retrieval (VDER), which extracts key
information (e.g. date, address) from document images like invoices and
receipts, has become an important topic in industrial NLP applications. The
emergence of new document types at a constant pace, each with its unique entity
types, presents a unique challenge: many documents contain unseen entity types
that occur only a couple of times. Addressing this challenge requires models to
have the ability of learning entities in a few-shot manner. However, prior
works for Few-shot VDER mainly address the problem at the document level with a
predefined global entity space, which doesn't account for the entity-level
few-shot scenario: target entity types are locally personalized by each task
and entity occurrences vary significantly among documents. To address this
unexplored scenario, this paper studies a novel entity-level few-shot VDER
task. The challenges lie in the uniqueness of the label space for each task and
the increased complexity of out-of-distribution (OOD) contents. To tackle this
novel task, we present a task-aware meta-learning based framework, with a
central focus on achieving effective task personalization that distinguishes
between in-task and out-of-task distribution. Specifically, we adopt a
hierarchical decoder (HC) and employ contrastive learning (ContrastProtoNet) to
achieve this goal. Furthermore, we introduce a new dataset, FewVEX, to boost
future research in the field of entity-level few-shot VDER. Experimental
results demonstrate our approaches significantly improve the robustness of
popular meta-learning baselines.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: CGS-Mask: Making Time Series Predictions Intuitive for Al
Abstract: Artificial intelligence (AI) has immense potential in time series prediction,
but most explainable tools have limited capabilities in providing a systematic
understanding of important features over time. These tools typically rely on
evaluating a single time point, overlook the time ordering of inputs, and
neglect the time-sensitive nature of time series applications. These factors
make it difficult for users, particularly those without domain knowledge, to
comprehend AI model decisions and obtain meaningful explanations. We propose
CGS-Mask, a post-hoc and model-agnostic cellular genetic strip mask-based
saliency approach to address these challenges. CGS-Mask uses consecutive time
steps as a cohesive entity to evaluate the impact of features on the final
prediction, providing binary and sustained feature importance scores over time.
Our algorithm optimizes the mask population iteratively to obtain the optimal
mask in a reasonable time. We evaluated CGS-Mask on synthetic and real-world
datasets, and it outperformed state-of-the-art methods in elucidating the
importance of features over time. According to our pilot user study via a
questionnaire survey, CGS-Mask is the most effective approach in presenting
easily understandable time series prediction results, enabling users to
comprehend the decision-making process of AI models with ease.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: Clinical Notes Reveal Physician Fatigue
Abstract: Physicians write notes about patients. In doing so, they reveal much about
themselves. Using data from 129,228 emergency room visits, we train a model to
identify notes written by fatigued physicians -- those who worked 5 or more of
the prior 7 days. In a hold-out set, the model accurately identifies notes
written by these high-workload physicians, and also flags notes written in
other high-fatigue settings: on overnight shifts, and after high patient
volumes. Model predictions also correlate with worse decision-making on at
least one important metric: yield of testing for heart attack is 18% lower with
each standard deviation increase in model-predicted fatigue. Finally, the model
indicates that notes written about Black and Hispanic patients have 12% and 21%
higher predicted fatigue than Whites -- larger than overnight vs. daytime
differences. These results have an important implication for large language
models (LLMs). Our model indicates that fatigued doctors write more predictable
notes. Perhaps unsurprisingly, because word prediction is the core of how LLMs
work, we find that LLM-written notes have 17% higher predicted fatigue than
real physicians' notes. This indicates that LLMs may introduce distortions in
generated text that are not yet fully understood.

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: Multi-Set Inoculation: Assessing Model Robustness Across Multiple Challenge Sets
Abstract: Language models, given their black-box nature, often exhibit sensitivity to
input perturbations, leading to trust issues due to hallucinations. To bolster
trust, it's essential to understand these models' failure modes and devise
strategies to enhance their performance. In this study, we propose a framework
to study the effect of input perturbations on language models of different
scales, from pre-trained models to large language models (LLMs). We use
fine-tuning to train a robust model to perturbations, and we investigate
whether exposure to one perturbation improves or degrades the model's
performance on other perturbations. To address multi-perturbation robustness,
we suggest three distinct training strategies. We also extend the framework to
LLMs via a chain of thought(COT) prompting with exemplars. We instantiate our
framework for the Tabular-NLI task and show that the proposed strategies train
the model robust to different perturbations without losing accuracy on a given
dataset.

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: High-fidelity Person-centric Subject-to-Image Synthesis
Abstract: Current subject-driven image generation methods encounter significant
challenges in person-centric image generation. The reason is that they learn
the semantic scene and person generation by fine-tuning a common pre-trained
diffusion, which involves an irreconcilable training imbalance. Precisely, to
generate realistic persons, they need to sufficiently tune the pre-trained
model, which inevitably causes the model to forget the rich semantic scene
prior and makes scene generation over-fit to the training data. Moreover, even
with sufficient fine-tuning, these methods can still not generate high-fidelity
persons since joint learning of the scene and person generation also lead to
quality compromise. In this paper, we propose Face-diffuser, an effective
collaborative generation pipeline to eliminate the above training imbalance and
quality compromise. Specifically, we first develop two specialized pre-trained
diffusion models, i.e., Text-driven Diffusion Model (TDM) and Subject-augmented
Diffusion Model (SDM), for scene and person generation, respectively. The
sampling process is divided into three sequential stages, i.e., semantic scene
construction, subject-scene fusion, and subject enhancement. The first and last
stages are performed by TDM and SDM respectively. The subject-scene fusion
stage, that is the collaboration achieved through a novel and highly effective
mechanism, Saliency-adaptive Noise Fusion (SNF). Specifically, it is based on
our key observation that there exists a robust link between classifier-free
guidance responses and the saliency of generated images. In each time step, SNF
leverages the unique strengths of each model and allows for the spatial
blending of predicted noises from both models automatically in a saliency-aware
manner. Extensive experiments confirm the impressive effectiveness and
robustness of the Face-diffuser.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Relation Extraction from News Articles (RENA): A Tool for Epidemic Surveillance
Abstract: Relation Extraction from News Articles (RENA) is a browser-based tool
designed to extract key entities and their semantic relationships in English
language news articles related to infectious diseases. Constructed using the
React framework, this system presents users with an elegant and user-friendly
interface. It enables users to input a news article and select from a choice of
two models to generate a comprehensive list of relations within the provided
text. As a result, RENA allows real-time parsing of news articles to extract
key information for epidemic surveillance, contributing to EPIWATCH, an
open-source intelligence-based epidemic warning system.

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: Language Guided Visual Question Answering: Elevate Your Multimodal Language Model Using Knowledge-Enriched Prompts
Abstract: Visual question answering (VQA) is the task of answering questions about an
image. The task assumes an understanding of both the image and the question to
provide a natural language answer. VQA has gained popularity in recent years
due to its potential applications in a wide range of fields, including
robotics, education, and healthcare. In this paper, we focus on
knowledge-augmented VQA, where answering the question requires commonsense
knowledge, world knowledge, and reasoning about ideas and concepts not present
in the image. We propose a multimodal framework that uses language guidance
(LG) in the form of rationales, image captions, scene graphs, etc to answer
questions more accurately. We benchmark our method on the multi-choice
question-answering task of the A-OKVQA, Science-QA, VSR, and IconQA datasets
using CLIP and BLIP models. We show that the use of language guidance is a
simple but powerful and effective strategy for visual question answering. Our
language guidance improves the performance of CLIP by 7.6% and BLIP-2 by 4.8%
in the challenging A-OKVQA dataset. We also observe consistent improvement in
performance on the Science-QA, VSR, and IconQA datasets when using the proposed
language guidances. The implementation of LG-VQA is publicly available at
https:// github.com/declare-lab/LG-VQA.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Holodeck: Language Guided Generation of 3D Embodied AI Environments
Abstract: 3D simulated environments play a critical role in Embodied AI, but their
creation requires expertise and extensive manual effort, restricting their
diversity and scope. To mitigate this limitation, we present Holodeck, a system
that generates 3D environments to match a user-supplied prompt fully
automatedly. Holodeck can generate diverse scenes, e.g., arcades, spas, and
museums, adjust the designs for styles, and can capture the semantics of
complex queries such as "apartment for a researcher with a cat" and "office of
a professor who is a fan of Star Wars". Holodeck leverages a large language
model (GPT-4) for common sense knowledge about what the scene might look like
and uses a large collection of 3D assets from Objaverse to populate the scene
with diverse objects. To address the challenge of positioning objects
correctly, we prompt GPT-4 to generate spatial relational constraints between
objects and then optimize the layout to satisfy those constraints. Our
large-scale human evaluation shows that annotators prefer Holodeck over
manually designed procedural baselines in residential scenes and that Holodeck
can produce high-quality outputs for diverse scene types. We also demonstrate
an exciting application of Holodeck in Embodied AI, training agents to navigate
in novel scenes like music rooms and daycares without human-constructed data,
which is a significant step forward in developing general-purpose embodied
agents.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Large Language Models with Retrieval-Augmented Generation for Zero-Shot Disease Phenotyping
Abstract: Identifying disease phenotypes from electronic health records (EHRs) is
critical for numerous secondary uses. Manually encoding physician knowledge
into rules is particularly challenging for rare diseases due to inadequate EHR
coding, necessitating review of clinical notes. Large language models (LLMs)
offer promise in text understanding but may not efficiently handle real-world
clinical documentation. We propose a zero-shot LLM-based method enriched by
retrieval-augmented generation and MapReduce, which pre-identifies
disease-related text snippets to be used in parallel as queries for the LLM to
establish diagnosis. We show that this method as applied to pulmonary
hypertension (PH), a rare disease characterized by elevated arterial pressures
in the lungs, significantly outperforms physician logic rules ($F_1$ score of
0.62 vs. 0.75). This method has the potential to enhance rare disease cohort
identification, expanding the scope of robust clinical research and care gap
identification.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: VisionTraj: A Noise-Robust Trajectory Recovery Framework based on Large-scale Camera Network
Abstract: Trajectory recovery based on the snapshots from the city-wide multi-camera
network facilitates urban mobility sensing and driveway optimization. The
state-of-the-art solutions devoted to such a vision-based scheme typically
incorporate predefined rules or unsupervised iterative feedback, struggling
with multi-fold challenges such as lack of open-source datasets for training
the whole pipeline, and the vulnerability to the noises from visual inputs. In
response to the dilemma, this paper proposes VisionTraj, the first
learning-based model that reconstructs vehicle trajectories from snapshots
recorded by road network cameras. Coupled with it, we elaborate on two rational
vision-trajectory datasets, which produce extensive trajectory data along with
corresponding visual snapshots, enabling supervised vision-trajectory interplay
extraction. Following the data creation, based on the results from the
off-the-shelf multi-modal vehicle clustering, we first re-formulate the
trajectory recovery problem as a generative task and introduce the canonical
Transformer as the autoregressive backbone. Then, to identify clustering noises
(e.g., false positives) with the bound on the snapshots' spatiotemporal
dependencies, a GCN-based soft-denoising module is conducted based on the fine-
and coarse-grained Re-ID clusters. Additionally, we harness strong semantic
information extracted from the tracklet to provide detailed insights into the
vehicle's entry and exit actions during trajectory recovery. The denoising and
tracklet components can also act as plug-and-play modules to boost baselines.
Experimental results on the two hand-crafted datasets show that the proposed
VisionTraj achieves a maximum +11.5% improvement against the sub-best model.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Applying Large Language Models for Causal Structure Learning in Non Small Cell Lung Cancer
Abstract: Causal discovery is becoming a key part in medical AI research. These methods
can enhance healthcare by identifying causal links between biomarkers,
demographics, treatments and outcomes. They can aid medical professionals in
choosing more impactful treatments and strategies. In parallel, Large Language
Models (LLMs) have shown great potential in identifying patterns and generating
insights from text data. In this paper we investigate applying LLMs to the
problem of determining the directionality of edges in causal discovery.
Specifically, we test our approach on a deidentified set of Non Small Cell Lung
Cancer(NSCLC) patients that have both electronic health record and genomic
panel data. Graphs are validated using Bayesian Dirichlet estimators using
tabular data. Our result shows that LLMs can accurately predict the
directionality of edges in causal graphs, outperforming existing
state-of-the-art methods. These findings suggests that LLMs can play a
significant role in advancing causal discovery and help us better understand
complex systems.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: A Graph Neural Network-Based QUBO-Formulated Hamiltonian-Inspired Loss Function for Combinatorial Optimization using Reinforcement Learning
Abstract: Quadratic Unconstrained Binary Optimization (QUBO) is a generic technique to
model various NP-hard Combinatorial Optimization problems (CO) in the form of
binary variables. Ising Hamiltonian is used to model the energy function of a
system. QUBO to Ising Hamiltonian is regarded as a technique to solve various
canonical optimization problems through quantum optimization algorithms.
Recently, PI-GNN, a generic framework, has been proposed to address CO problems
over graphs based on Graph Neural Network (GNN) architecture. They introduced a
generic QUBO-formulated Hamiltonian-inspired loss function that was directly
optimized using GNN. PI-GNN is highly scalable but there lies a noticeable
decrease in the number of satisfied constraints when compared to
problem-specific algorithms and becomes more pronounced with increased graph
densities. Here, We identify a behavioral pattern related to it and devise
strategies to improve its performance. Another group of literature uses
Reinforcement learning (RL) to solve the aforementioned NP-hard problems using
problem-specific reward functions. In this work, we also focus on creating a
bridge between the RL-based solutions and the QUBO-formulated Hamiltonian. We
formulate and empirically evaluate the compatibility of the QUBO-formulated
Hamiltonian as the generic reward function in the RL-based paradigm in the form
of rewards. Furthermore, we also introduce a novel Monty Carlo Tree
Search-based strategy with GNN where we apply a guided search through manual
perturbation of node labels during training. We empirically evaluated our
methods and observed up to 44% improvement in the number of constraint
violations compared to the PI-GNN.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: A Spatial-Temporal Transformer based Framework For Human Pose Assessment And Correction in Education Scenarios
Abstract: Human pose assessment and correction play a crucial role in applications
across various fields, including computer vision, robotics, sports analysis,
healthcare, and entertainment. In this paper, we propose a Spatial-Temporal
Transformer based Framework (STTF) for human pose assessment and correction in
education scenarios such as physical exercises and science experiment. The
framework comprising skeletal tracking, pose estimation, posture assessment,
and posture correction modules to educate students with professional,
quick-to-fix feedback. We also create a pose correction method to provide
corrective feedback in the form of visual aids. We test the framework with our
own dataset. It comprises (a) new recordings of five exercises, (b) existing
recordings found on the internet of the same exercises, and (c) corrective
feedback on the recordings by professional athletes and teachers. Results show
that our model can effectively measure and comment on the quality of students'
actions. The STTF leverages the power of transformer models to capture spatial
and temporal dependencies in human poses, enabling accurate assessment and
effective correction of students' movements.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Prompt-Engineering and Transformer-based Question Generation and Evaluation
Abstract: Question generation has numerous applications in the educational context.
Question generation can prove helpful for students when reviewing content and
testing themselves. Furthermore, a question generation model can aid teachers
by lessening the burden of creating assessments and other practice material.
This paper aims to find the best method to generate questions from textual data
through a transformer model and prompt engineering. In this research, we
finetuned a pretrained distilBERT model on the SQuAD question answering dataset
to generate questions. In addition to training a transformer model, prompt
engineering was applied to generate questions effectively using the LLaMA
model. The generated questions were compared against the baseline questions in
the SQuAD dataset to evaluate the effectiveness of four different prompts. All
four prompts demonstrated over 60% similarity on average. Of the
prompt-generated questions, 30% achieved a high similarity score greater than
70%.

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: Mixed Pseudo Labels for Semi-Supervised Object Detection
Abstract: While the pseudo-label method has demonstrated considerable success in
semi-supervised object detection tasks, this paper uncovers notable limitations
within this approach. Specifically, the pseudo-label method tends to amplify
the inherent strengths of the detector while accentuating its weaknesses, which
is manifested in the missed detection of pseudo-labels, particularly for small
and tail category objects. To overcome these challenges, this paper proposes
Mixed Pseudo Labels (MixPL), consisting of Mixup and Mosaic for pseudo-labeled
data, to mitigate the negative impact of missed detections and balance the
model's learning across different object scales. Additionally, the model's
detection performance on tail categories is improved by resampling labeled data
with relevant instances. Notably, MixPL consistently improves the performance
of various detectors and obtains new state-of-the-art results with Faster
R-CNN, FCOS, and DINO on COCO-Standard and COCO-Full benchmarks. Furthermore,
MixPL also exhibits good scalability on large models, improving DINO Swin-L by
2.5% mAP and achieving nontrivial new records (60.2% mAP) on the COCO val2017
benchmark without extra annotations.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Contactless Fingerprint Biometric Anti-Spoofing: An Unsupervised Deep Learning Approach
Abstract: Contactless fingerprint recognition offers a higher level of user comfort and
addresses hygiene concerns more effectively. However, it is also more
vulnerable to presentation attacks such as photo paper, paper-printout, and
various display attacks, which makes it more challenging to implement in
biometric systems compared to contact-based modalities. Limited research has
been conducted on presentation attacks in contactless fingerprint systems, and
these studies have encountered challenges in terms of generalization and
scalability since both bonafide samples and presentation attacks are utilized
during training model. Although this approach appears promising, it lacks the
ability to handle unseen attacks, which is a crucial factor for developing PAD
methods that can generalize effectively. We introduced an innovative
anti-spoofing approach that combines an unsupervised autoencoder with a
convolutional block attention module to address the limitations of existing
methods. Our model is exclusively trained on bonafide images without exposure
to any spoofed samples during the training phase. It is then evaluated against
various types of presentation attack images in the testing phase. The scheme we
proposed has achieved an average BPCER of 0.96\% with an APCER of 1.6\% for
presentation attacks involving various types of spoofed samples.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Optimal Wildfire Escape Route Planning for Drones under Dynamic Fire and Smoke
Abstract: In recent years, the increasing prevalence and intensity of wildfires have
posed significant challenges to emergency response teams. The utilization of
unmanned aerial vehicles (UAVs), commonly known as drones, has shown promise in
aiding wildfire management efforts. This work focuses on the development of an
optimal wildfire escape route planning system specifically designed for drones,
considering dynamic fire and smoke models. First, the location of the source of
the wildfire can be well located by information fusion between UAV and
satellite, and the road conditions in the vicinity of the fire can be assessed
and analyzed using multi-channel remote sensing data. Second, the road network
can be extracted and segmented in real time using UAV vision technology, and
each road in the road network map can be given priority based on the results of
road condition classification. Third, the spread model of dynamic fires
calculates the new location of the fire source based on the fire intensity,
wind speed and direction, and the radius increases as the wildfire spreads.
Smoke is generated around the fire source to create a visual representation of
a burning fire. Finally, based on the improved A* algorithm, which considers
all the above factors, the UAV can quickly plan an escape route based on the
starting and destination locations that avoid the location of the fire source
and the area where it is spreading. By considering dynamic fire and smoke
models, the proposed system enhances the safety and efficiency of drone
operations in wildfire environments.

Output: Robotics


Instruction: What field is the article from?

Prompt:
Title: Image Restoration Through Generalized Ornstein-Uhlenbeck Bridge
Abstract: Diffusion models possess powerful generative capabilities enabling the
mapping of noise to data using reverse stochastic differential equations.
However, in image restoration tasks, the focus is on the mapping relationship
from low-quality images to high-quality images. To address this, we introduced
the Generalized Ornstein-Uhlenbeck Bridge (GOUB) model. By leveraging the
natural mean-reverting property of the generalized OU process and further
adjusting the variance of its steady-state distribution through the Doob's
h-transform, we achieve diffusion mappings from point to point with minimal
cost. This allows for end-to-end training, enabling the recovery of
high-quality images from low-quality ones. Additionally, we uncovered the
mathematical essence of some bridge models, all of which are special cases of
the GOUB and empirically demonstrated the optimality of our proposed models.
Furthermore, benefiting from our distinctive parameterization mechanism, we
proposed the Mean-ODE model that is better at capturing pixel-level information
and structural perceptions. Experimental results show that both models achieved
state-of-the-art results in various tasks, including inpainting, deraining, and
super-resolution. Code is available at https://github.com/Hammour-steak/GOUB.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: Push it to the Demonstrated Limit: Multimodal Visuotactile Imitation Learning with Force Matching
Abstract: Optical tactile sensors have emerged as an effective means to acquire dense
contact information during robotic manipulation. A recently-introduced
`see-through-your-skin' (STS) variant of this type of sensor has both visual
and tactile modes, enabled by leveraging a semi-transparent surface and
controllable lighting. In this work, we investigate the benefits of pairing
visuotactile sensing with imitation learning for contact-rich manipulation
tasks. First, we use tactile force measurements and a novel algorithm during
kinesthetic teaching to yield a force profile that better matches that of the
human demonstrator. Second, we add visual/tactile STS mode switching as a
control policy output, simplifying the application of the sensor. Finally, we
study multiple observation configurations to compare and contrast the value of
visual/tactile data (both with and without mode switching) with visual data
from a wrist-mounted eye-in-hand camera. We perform an extensive series of
experiments on a real robotic manipulator with door-opening and closing tasks,
including over 3,000 real test episodes. Our results highlight the importance
of tactile sensing for imitation learning, both for data collection to allow
force matching, and for policy execution to allow accurate task feedback.

Output: Robotics


Instruction: What field is the article from?

Prompt:
Title: Relax: Composable Abstractions for End-to-End Dynamic Machine Learning
Abstract: Dynamic shape computations have become critical in modern machine learning
workloads, especially in emerging large language models. The success of these
models has driven demand for deploying them to a diverse set of backend
environments. In this paper, we present Relax, a compiler abstraction for
optimizing end-to-end dynamic machine learning workloads. Relax introduces
first-class symbolic shape annotations to track dynamic shape computations
globally across the program. It also introduces a cross-level abstraction that
encapsulates computational graphs, loop-level tensor programs, and library
calls in a single representation to enable cross-level optimizations. We build
an end-to-end compilation framework using the proposed approach to optimize
dynamic shape models. Experimental results on large language models show that
Relax delivers performance competitive with state-of-the-art hand-optimized
systems across platforms and enables deployment of emerging dynamic models to a
broader set of environments, including mobile phones, embedded devices, and web
browsers.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Finnish 5th and 6th graders' misconceptions about Artificial Intelligence
Abstract: Research on children's initial conceptions of AI is in an emerging state,
which, from a constructivist viewpoint, challenges the development of
pedagogically sound AI-literacy curricula, methods, and materials. To
contribute to resolving this need in the present paper, qualitative survey data
from 195 children were analyzed abductively to answer the following three
research questions: What kind of misconceptions do Finnish 5th and 6th graders'
have about the essence AI?; 2) How do these misconceptions relate to common
misconception types?; and 3) How profound are these misconceptions? As a
result, three misconception categories were identified: 1) Non-technological
AI, in which AI was conceptualized as peoples' cognitive processes (factual
misconception); 2) Anthropomorphic AI, in which AI was conceptualized as a
human-like entity (vernacular, non-scientific, and conceptual misconception);
and 3) AI as a machine with a pre-installed intelligence or knowledge (factual
misconception). Majority of the children evaluated their AI-knowledge low,
which implies that the misconceptions are more superficial than profound. The
findings suggest that context-specific linguistic features can contribute to
students' AI misconceptions. Implications for future research and AI literacy
education are discussed.

Output: Computers and Society


Instruction: What field is the article from?

Prompt:
Title: Chain-of-Note: Enhancing Robustness in Retrieval-Augmented Language Models
Abstract: Retrieval-augmented language models (RALMs) represent a substantial
advancement in the capabilities of large language models, notably in reducing
factual hallucination by leveraging external knowledge sources. However, the
reliability of the retrieved information is not always guaranteed. The
retrieval of irrelevant data can lead to misguided responses, and potentially
causing the model to overlook its inherent knowledge, even when it possesses
adequate information to address the query. Moreover, standard RALMs often
struggle to assess whether they possess adequate knowledge, both intrinsic and
retrieved, to provide an accurate answer. In situations where knowledge is
lacking, these systems should ideally respond with "unknown" when the answer is
unattainable. In response to these challenges, we introduces Chain-of-Noting
(CoN), a novel approach aimed at improving the robustness of RALMs in facing
noisy, irrelevant documents and in handling unknown scenarios. The core idea of
CoN is to generate sequential reading notes for retrieved documents, enabling a
thorough evaluation of their relevance to the given question and integrating
this information to formulate the final answer. We employed ChatGPT to create
training data for CoN, which was subsequently trained on an LLaMa-2 7B model.
Our experiments across four open-domain QA benchmarks show that RALMs equipped
with CoN significantly outperform standard RALMs. Notably, CoN achieves an
average improvement of +7.9 in EM score given entirely noisy retrieved
documents and +10.5 in rejection rates for real-time questions that fall
outside the pre-training knowledge scope.

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: Shortcut Bias Mitigation via Ensemble Diversity Using Diffusion Probabilistic Models
Abstract: Spurious correlations in the data, where multiple cues are predictive of the
target labels, often lead to a phenomenon known as simplicity bias, where a
model relies on erroneous, easy-to-learn cues while ignoring reliable ones. In
this work, we propose an ensemble diversification framework exploiting
Diffusion Probabilistic Models (DPMs) for shortcut bias mitigation. We show
that at particular training intervals, DPMs can generate images with novel
feature combinations, even when trained on images displaying correlated input
features. We leverage this crucial property to generate synthetic
counterfactuals to increase model diversity via ensemble disagreement. We show
that DPM-guided diversification is sufficient to remove dependence on primary
shortcut cues, without a need for additional supervised signals. We further
empirically quantify its efficacy on several diversification objectives, and
finally show improved generalization and diversification performance on par
with prior work that relies on auxiliary data collection.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Mission-driven Exploration for Accelerated Deep Reinforcement Learning with Temporal Logic Task Specifications
Abstract: This paper addresses the problem of designing optimal control policies for
mobile robots with mission and safety requirements specified using Linear
Temporal Logic (LTL). We consider robots with unknown stochastic dynamics
operating in environments with unknown geometric structure. The robots are
equipped with sensors allowing them to detect obstacles. Our goal is to
synthesize a control policy that maximizes the probability of satisfying an
LTL-encoded task in the presence of motion and environmental uncertainty.
Several deep reinforcement learning (DRL) algorithms have been proposed
recently to address similar problems. A common limitation in related works is
that of slow learning performance. In order to address this issue, we propose a
novel DRL algorithm, which has the capability to learn control policies at a
notably faster rate compared to similar methods. Its sample efficiency is due
to a mission-driven exploration strategy that prioritizes exploration towards
directions that may contribute to mission accomplishment. Identifying these
directions relies on an automaton representation of the LTL task as well as a
learned neural network that (partially) models the unknown system dynamics. We
provide comparative experiments demonstrating the efficiency of our algorithm
on robot navigation tasks in unknown environments.

Output: Robotics


Instruction: What field is the article from?

Prompt:
Title: Uncertainty Quantification of Deep Learning for Spatiotemporal Data: Challenges and Opportunities
Abstract: With the advancement of GPS, remote sensing, and computational simulations,
large amounts of geospatial and spatiotemporal data are being collected at an
increasing speed. Such emerging spatiotemporal big data assets, together with
the recent progress of deep learning technologies, provide unique opportunities
to transform society. However, it is widely recognized that deep learning
sometimes makes unexpected and incorrect predictions with unwarranted
confidence, causing severe consequences in high-stake decision-making
applications (e.g., disaster management, medical diagnosis, autonomous
driving). Uncertainty quantification (UQ) aims to estimate a deep learning
model's confidence. This paper provides a brief overview of UQ of deep learning
for spatiotemporal data, including its unique challenges and existing methods.
We particularly focus on the importance of uncertainty sources. We identify
several future research directions for spatiotemporal data.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Exploring Semi-supervised Hierarchical Stacked Encoder for Legal Judgement Prediction
Abstract: Predicting the judgment of a legal case from its unannotated case facts is a
challenging task. The lengthy and non-uniform document structure poses an even
greater challenge in extracting information for decision prediction. In this
work, we explore and propose a two-level classification mechanism; both
supervised and unsupervised; by using domain-specific pre-trained BERT to
extract information from long documents in terms of sentence embeddings further
processing with transformer encoder layer and use unsupervised clustering to
extract hidden labels from these embeddings to better predict a judgment of a
legal case. We conduct several experiments with this mechanism and see higher
performance gains than the previously proposed methods on the ILDC dataset. Our
experimental results also show the importance of domain-specific pre-training
of Transformer Encoders in legal information processing.

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: CompeteAI: Understanding the Competition Behaviors in Large Language Model-based Agents
Abstract: Large language models (LLMs) have been widely used as agents to complete
different tasks, such as personal assistance or event planning. While most work
has focused on cooperation and collaboration between agents, little work
explores competition, another important mechanism that fosters the development
of society and economy. In this paper, we seek to examine the competition
behaviors in LLM-based agents. We first propose a general framework to study
the competition between agents. Then, we implement a practical competitive
environment using GPT-4 to simulate a virtual town with two types of agents,
including restaurant agents and customer agents. Specifically, restaurant
agents compete with each other to attract more customers, where the competition
fosters them to transform, such as cultivating new operating strategies. The
results of our experiments reveal several interesting findings ranging from
social learning to Matthew Effect, which aligns well with existing sociological
and economic theories. We believe that competition between agents deserves
further investigation to help us understand society better. The code will be
released soon.

Output: Artificial Intelligence


Instruction: What field is the article from?

Prompt:
Title: HEALNet -- Hybrid Multi-Modal Fusion for Heterogeneous Biomedical Data
Abstract: Technological advances in medical data collection such as high-resolution
histopathology and high-throughput genomic sequencing have contributed to the
rising requirement for multi-modal biomedical modelling, specifically for
image, tabular, and graph data. Most multi-modal deep learning approaches use
modality-specific architectures that are trained separately and cannot capture
the crucial cross-modal information that motivates the integration of different
data sources. This paper presents the Hybrid Early-fusion Attention Learning
Network (HEALNet): a flexible multi-modal fusion architecture, which a)
preserves modality-specific structural information, b) captures the cross-modal
interactions and structural information in a shared latent space, c) can
effectively handle missing modalities during training and inference, and d)
enables intuitive model inspection by learning on the raw data input instead of
opaque embeddings. We conduct multi-modal survival analysis on Whole Slide
Images and Multi-omic data on four cancer cohorts of The Cancer Genome Atlas
(TCGA). HEALNet achieves state-of-the-art performance, substantially improving
over both uni-modal and recent multi-modal baselines, whilst being robust in
scenarios with missing modalities.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: Train 'n Trade: Foundations of Parameter Markets
Abstract: Organizations typically train large models individually. This is costly and
time-consuming, particularly for large-scale foundation models. Such vertical
production is known to be suboptimal. Inspired by this economic insight, we ask
whether it is possible to leverage others' expertise by trading the constituent
parts in models, i.e., sets of weights, as if they were market commodities.
While recent advances in aligning and interpolating models suggest that doing
so may be possible, a number of fundamental questions must be answered to
create viable parameter markets. In this work, we address these basic
questions, propose a framework containing the infrastructure necessary for
market operations to take place, study strategies for exchanging parameters,
and offer means for agents to monetize parameters. Excitingly, compared to
agents who train siloed models from scratch, we show that it is possible to
mutually gain by using the market, even in competitive settings. This suggests
that the notion of parameter markets may be a useful paradigm for improving
large-scale model training in the future.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: On Surgical Fine-tuning for Language Encoders
Abstract: Fine-tuning all the layers of a pre-trained neural language encoder (either
using all the parameters or using parameter-efficient methods) is often the
de-facto way of adapting it to a new task. We show evidence that for different
downstream language tasks, fine-tuning only a subset of layers is sufficient to
obtain performance that is close to and often better than fine-tuning all the
layers in the language encoder. We propose an efficient metric based on the
diagonal of the Fisher information matrix (FIM score), to select the candidate
layers for selective fine-tuning. We show, empirically on GLUE and SuperGLUE
tasks and across distinct language encoders, that this metric can effectively
select layers leading to a strong downstream performance. Our work highlights
that task-specific information corresponding to a given downstream task is
often localized within a few layers, and tuning only those is sufficient for
strong performance. Additionally, we demonstrate the robustness of the FIM
score to rank layers in a manner that remains constant during the optimization
process.

Output: Computational Linguistics


Instruction: What field is the article from?

Prompt:
Title: The New Frontier of Cybersecurity: Emerging Threats and Innovations
Abstract: In today's digitally interconnected world, cybersecurity threats have reached
unprecedented levels, presenting a pressing concern for individuals,
organizations, and governments. This study employs a qualitative research
approach to comprehensively examine the diverse threats of cybersecurity and
their impacts across various sectors. Four primary categories of threats are
identified and analyzed, encompassing malware attacks, social engineering
attacks, network vulnerabilities, and data breaches. The research delves into
the consequences of these threats on individuals, organizations, and society at
large. The findings reveal a range of key emerging threats in cybersecurity,
including advanced persistent threats, ransomware attacks, Internet of Things
(IoT) vulnerabilities, and social engineering exploits. Consequently, it is
evident that emerging cybersecurity threats pose substantial risks to both
organizations and individuals. The sophistication and diversity of these
emerging threats necessitate a multi-layered approach to cybersecurity. This
approach should include robust security measures, comprehensive employee
training, and regular security audits. The implications of these emerging
threats are extensive, with potential consequences such as financial loss,
reputational damage, and compromised personal information. This study
emphasizes the importance of implementing effective measures to mitigate these
threats. It highlights the significance of using strong passwords, encryption
methods, and regularly updating software to bolster cyber defenses.

Output: Cryptography and Security


Instruction: What field is the article from?

Prompt:
Title: Distributed Global Structure-from-Motion with a Deep Front-End
Abstract: While initial approaches to Structure-from-Motion (SfM) revolved around both
global and incremental methods, most recent applications rely on incremental
systems to estimate camera poses due to their superior robustness. Though there
has been tremendous progress in SfM `front-ends' powered by deep models learned
from data, the state-of-the-art (incremental) SfM pipelines still rely on
classical SIFT features, developed in 2004. In this work, we investigate
whether leveraging the developments in feature extraction and matching helps
global SfM perform on par with the SOTA incremental SfM approach (COLMAP). To
do so, we design a modular SfM framework that allows us to easily combine
developments in different stages of the SfM pipeline. Our experiments show that
while developments in deep-learning based two-view correspondence estimation do
translate to improvements in point density for scenes reconstructed with global
SfM, none of them outperform SIFT when comparing with incremental SfM results
on a range of datasets. Our SfM system is designed from the ground up to
leverage distributed computation, enabling us to parallelize computation on
multiple machines and scale to large scenes.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: ChatGPT and Beyond: The Generative AI Revolution in Education
Abstract: The wide adoption and usage of generative artificial intelligence (AI)
models, particularly ChatGPT, has sparked a surge in research exploring their
potential applications in the educational landscape. This survey examines
academic literature published between November, 2022, and July, 2023,
specifically targeting high-impact research from Scopus-indexed Q1 and Q2
journals. This survey delves into the practical applications and implications
of generative AI models across a diverse range of educational contexts. Through
a comprehensive and rigorous evaluation of recent academic literature, this
survey seeks to illuminate the evolving role of generative AI models,
particularly ChatGPT, in education. By shedding light on the potential
benefits, challenges, and emerging trends in this dynamic field, the survey
endeavors to contribute to the understanding of the nexus between artificial
intelligence and education. The findings of this review will empower educators,
researchers, and policymakers to make informed decisions about the integration
of AI technologies into learning environments.

Output: Computers and Society


Instruction: What field is the article from?

Prompt:
Title: Efficient Large Language Models Fine-Tuning On Graphs
Abstract: Learning from Text-Attributed Graphs (TAGs) has attracted significant
attention due to its wide range of real-world applications. The rapid evolution
of large language models (LLMs) has revolutionized the way we process textual
data, which indicates a strong potential to replace shallow text embedding
generally used in Graph Neural Networks (GNNs). However, we find that existing
LLM approaches that exploit text information in graphs suffer from inferior
computation and data efficiency. In this work, we introduce a novel and
efficient approach for the end-to-end fine-tuning of Large Language Models
(LLMs) on TAGs, named LEADING. The proposed approach maintains computation cost
and memory overhead comparable to the graph-less fine-tuning of LLMs. Moreover,
it transfers the rick knowledge in LLMs to downstream graph learning tasks
effectively with limited labeled data in semi-supervised learning. Its superior
computation and data efficiency are demonstrated through comprehensive
experiments, offering a promising solution for a wide range of LLMs and graph
learning tasks on TAGs.

Output: Machine Learning


Instruction: What field is the article from?

Prompt:
Title: MRxaI: Black-Box Explainability for Image Classifiers in a Medical Setting
Abstract: Existing tools for explaining the output of image classifiers can be divided
into white-box, which rely on access to the model internals, and black-box,
agnostic to the model. As the usage of AI in the medical domain grows, so too
does the usage of explainability tools. Existing work on medical image
explanations focuses on white-box tools, such as gradcam. However, there are
clear advantages to switching to a black-box tool, including the ability to use
it with any classifier and the wide selection of black-box tools available. On
standard images, black-box tools are as precise as white-box. In this paper we
compare the performance of several black-box methods against gradcam on a brain
cancer MRI dataset. We demonstrate that most black-box tools are not suitable
for explaining medical image classifications and present a detailed analysis of
the reasons for their shortcomings. We also show that one black-box tool, a
causal explainability-based rex, performs as well as \gradcam.

Output: Computer Vision


Instruction: What field is the article from?

Prompt:
Title: SparseSpikformer: A Co-Design Framework for Token and Weight Pruning in Spiking Transformer
Abstract: As the third-generation neural network, the Spiking Neural Network (SNN) has
the advantages of low power consumption and high energy efficiency, making it
suitable for implementation on edge devices. More recently, the most advanced
SNN, Spikformer, combines the self-attention module from Transformer with SNN
to achieve remarkable performance. However, it adopts larger channel dimensions
in MLP layers, leading to an increased number of redundant model parameters. To
effectively decrease the computational complexity and weight parameters of the
model, we explore the Lottery Ticket Hypothesis (LTH) and discover a very
sparse ($\ge$90%) subnetwork that achieves comparable performance to the
original network. Furthermore, we also design a lightweight token selector
module, which can remove unimportant background information from images based
on the average spike firing rate of neurons, selecting only essential
foreground image tokens to participate in attention calculation. Based on that,
we present SparseSpikformer, a co-design framework aimed at achieving sparsity
in Spikformer through token and weight pruning techniques. Experimental results
demonstrate that our framework can significantly reduce 90% model parameters
and cut down Giga Floating-Point Operations (GFLOPs) by 20% while maintaining
the accuracy of the original model.

Output: Computer Vision