Arrow Research search

Author name cluster

Jaime G. Carbonell

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

31 papers
2 author rows

Possible papers

31

ICLR Conference 2020 Conference Paper

Cross-lingual Alignment vs Joint Training: A Comparative Study and A Simple Unified Framework

  • Zirui Wang
  • Jiateng Xie
  • Ruochen Xu
  • Yiming Yang 0002
  • Graham Neubig
  • Jaime G. Carbonell

Learning multilingual representations of text has proven a successful method for many cross-lingual transfer learning tasks. There are two main paradigms for learning such representations: (1) alignment, which maps different independently trained monolingual representations into a shared space, and (2) joint training, which directly learns unified multilingual representations using monolingual and cross-lingual objectives jointly. In this paper, we first conduct direct comparisons of representations learned using both of these methods across diverse cross-lingual tasks. Our empirical results reveal a set of pros and cons for both methods, and show that the relative performance of alignment versus joint training is task-dependent. Stemming from this analysis, we propose a simple and novel framework that combines these two previously mutually-exclusive approaches. Extensive experiments demonstrate that our proposed framework alleviates limitations of both approaches, and outperforms existing methods on the MUSE bilingual lexicon induction (BLI) benchmark. We further show that this framework can generalize to contextualized representations such as Multilingual BERT, and produces state-of-the-art results on the CoNLL cross-lingual NER benchmark.

IJCAI Conference 2020 Conference Paper

Harnessing Code Switching to Transcend the Linguistic Barrier

  • Ashiqur R. KhudaBukhsh
  • Shriphani Palakodety
  • Jaime G. Carbonell

Code mixing (or code switching) is a common phenomenon observed in social-media content generated by a linguistically diverse user-base. Studies show that in the Indian sub-continent, a substantial fraction of social media posts exhibit code switching. While the difficulties posed by code mixed documents to further downstream analyses are well-understood, lending visibility to code mixed documents under certain scenarios may have utility that has been previously overlooked. For instance, a document written in a mixture of multiple languages can be partially accessible to a wider audience; this could be particularly useful if a considerable fraction of the audience lacks fluency in one of the component languages. In this paper, we provide a systematic approach to sample code mixed documents leveraging a polyglot embedding based method that requires minimal supervision. In the context of the 2019 India-Pakistan conflict triggered by the Pulwama terror attack, we demonstrate an untapped potential of harnessing code mixing for human well-being: starting from an existing hostility diffusing hope speech classifier solely trained on English documents, code mixed documents are utilized to perform cross-lingual sampling and retrieve hope speech content written in a low-resource but widely used language - Romanized Hindi. Our proposed pipeline requires minimal supervision and holds promise in substantially reducing web moderation efforts. A further exploratory study on a new COVID-19 data set introduced in this paper demonstrates the generalizability of our cross-lingual sampling technique.

ECAI Conference 2020 Conference Paper

Hope Speech Detection: A Computational Analysis of the Voice of Peace

  • Shriphani Palakodety
  • Ashiqur R. KhudaBukhsh
  • Jaime G. Carbonell

The recent Pulwama terror attack (February 14, 2019, Pulwama, Kashmir) triggered a chain of escalating events between India and Pakistan adding another episode to their 70-year-old dispute over Kashmir. The present era of ubiquitious social media has never seen nuclear powers closer to war. In this paper, we analyze this evolving international crisis via a substantial corpus constructed using comments on YouTube videos (921, 235 English comments posted by 392, 460 users out of 2. 04 million overall comments by 791, 289 users on 2, 890 videos). Our main contributions in the paper are three-fold. First, we present an observation that polyglot word-embeddings reveal precise and accurate language clusters, and subsequently construct a document language identification technique with negligible annotation requirements. We demonstrate the viability and utility across a variety of data sets involving several low-resource languages. Second, we present an analysis on temporal trends of pro-peace and pro-war intent observing that when tensions between the two nations were at their peak, pro-peace intent in the corpus was at its highest point. Finally, in the context of heated discussions in a politically tense situation where two nations are at the brink of a full-fledged war, we argue the importance of automatic identification of user-generated web content that can diffuse hostility and address this prediction task, dubbed hope-speech detection.

ECAI Conference 2020 Conference Paper

Minimizing and Recovering from the Effect of Concept Drift via Feature Selection

  • Daegun Won
  • Peter J. Jansen
  • Jaime G. Carbonell

With increasing expectations for flexibility and adaptability of machine learning systems, the importance of automatic model updates and performance stability in the face of various types of concept drift has received significant interest. In this study, we explore how feature selection techniques, mostly neglected in the aforementioned effort, may be used to improve the drift compensation process with no a priori assumptions regarding the type of drift. To this end, we (A) evaluate several feature selection techniques by their potential to minimize the effect of drift while still capturing its essence (predict its near-term course), (B) analyze the factors contributing to the success of our proposed method, and (C) provide empirical drift adaptation results via active learning on an extensive data set of real-life political indicators. The results demonstrate that using L1 regularization in the context of our new sample-driven drift-modeling approach results in improved performance as compared to alternative feature selection techniques. The reduced model also requires fewer additional samples to recover from drift even with existing active-sampling strategies.

ECAI Conference 2020 Conference Paper

Mining Insights from Large-Scale Corpora Using Fine-Tuned Language Models

  • Shriphani Palakodety
  • Ashiqur R. KhudaBukhsh
  • Jaime G. Carbonell

Mining insights from large volume of social media texts with minimal supervision is a highly challenging Natural Language Processing (NLP) task. While Language Models’ (LMs) efficacy in several downstream tasks is well-studied, assessing their applicability in answering relational questions, tracking perception or mining deeper insights is under-explored. Few recent lines of work have scratched the surface by studying pre-trained LMs’ (e. g. , BERT) capability in answering relational questions through “fill-in-the-blank” cloze statements (e. g. , [Dante was born in MASK]). BERT predicts the MASK-ed word with a list of words ranked by probability (in this case, BERT successfully predicts Florence with the highest probability). In this paper, we conduct a feasibility study of fine-tuned LMs with a different focus on tracking polls, tracking community perception and mining deeper insights typically obtained through costly surveys. Our main focus is on a substantial corpus of video comments extracted from YouTube videos (6, 182, 868 comments on 130, 067 videos by 1, 518, 077 users) posted within 100 days prior to the 2019 Indian General Election. Using fill-in-the-blank cloze statements against a recent high-performance language modeling algorithm, BERT, we present a novel application of this family of tools that is able to (1) aggregate political sentiment (2) reveal community perception and (3) track evolving national priorities and issues of interest.

ICML Conference 2020 Conference Paper

Optimizing Data Usage via Differentiable Rewards

  • Xinyi Wang 0001
  • Hieu Pham
  • Paul Michel
  • Antonios Anastasopoulos
  • Jaime G. Carbonell
  • Graham Neubig

To acquire a new skill, humans learn better and faster if a tutor, based on their current knowledge level, informs them of how much attention they should pay to particular content or practice problems. Similarly, a machine learning model could potentially be trained better with a scorer that “adapts” to its current learning state and estimates the importance of each training data instance. Training such an adaptive scorer efficiently is a challenging problem; in order to precisely quantify the effect of a data instance at a given time during the training, it is typically necessary to first complete the entire training process. To efficiently optimize data usage, we propose a reinforcement learning approach called Differentiable Data Selection (DDS). In DDS, we formulate a scorer network as a learnable function of the training data, which can be efficiently updated along with the main model being trained. Specifically, DDS updates the scorer with an intuitive reward signal: it should up-weigh the data that has a similar gradient with a dev set upon which we would finally like to perform well. Without significant computing overhead, DDS delivers strong and consistent improvements over several strong baselines on two very different tasks of machine translation and image classification.

ECAI Conference 2020 Conference Paper

The Refugee Experience Online: Surfacing Positivity Amidst Hate

  • Shriphani Palakodety
  • Ashiqur R. KhudaBukhsh
  • Jaime G. Carbonell

How can Artificial Intelligence help a stateless minority from online abuse? Research efforts in hate speech detection thus far have largely focused on identifying and subsequently filtering out negative content that specifically targets them. In this paper, we highlight a recent work [8] which tackles a different aspect of web-vulnerability of marginalized communities: sparsity of prominority voices championing their cause. The highlighted paper advocates that blocking hate alone may not be sufficient in these cases as the internet shapes community perception to a great extent in modern times and supportive comments to a vulnerable community serve a different purpose. Using an Active Sampling approach, the paper constructs a nuanced voice-for-the-voiceless classifier that automatically discovers comments supporting a (allegedly) persecuted minority. In the context of the Rohingya refugee crisis, one of the biggest humanitarian crises of modern times, the paper presents promising results that can substantially aid content moderation efforts in finding positive content supporting the Rohingyas.

AAAI Conference 2020 Conference Paper

Voice for the Voiceless: Active Sampling to Detect Comments Supporting the Rohingyas

  • Shriphani Palakodety
  • Ashiqur R. KhudaBukhsh
  • Jaime G. Carbonell

The Rohingya refugee crisis is one of the biggest humanitarian crises of modern times with more than 700, 000 Rohingyas rendered homeless according to the United Nations High Commissioner for Refugees. While it has received sustained press attention globally, no comprehensive research has been performed on social media pertaining to this large evolving crisis. In this work, we construct a substantial corpus of YouTube video comments (263, 482 comments from 113, 250 users in 5, 153 relevant videos) with an aim to analyze the possible role of AI in helping a marginalized community. Using a novel combination of multiple Active Learning strategies and a novel active sampling strategy based on nearest-neighbors in the comment-embedding space, we construct a classifier that can detect comments defending the Rohingyas among larger numbers of disparaging and neutral ones. We advocate that beyond the burgeoning field of hate speech detection, automatic detection of help speech can lend voice to the voiceless people and make the internet safer for marginalized communities.

JAAMAS Journal 2019 Journal Article

Expertise drift in referral networks

  • Ashiqur R. KhudaBukhsh
  • Jaime G. Carbonell

Abstract Learning-to-refer is a challenge in expert referral networks, wherein Active Learning helps experts (agents) estimate the topic-conditioned skills of other connected experts for problems that the initial expert cannot solve and therefore must seek referral to experts with more appropriate expertise. Recent research has investigated different reinforcement action selection algorithms to assess viability of the learning setting both with uninformative priors and with partially available noisy priors, where experts are allowed to advertise a subset of their skills to their colleagues. Prior to this work, time-varying expertise drift (e. g. , experts learning with experience) had not been considered, though it is an aspect that may often arise in practice. This paper addresses the challenge of referral learning with time-varying expertise, proposing Hybrid, a novel combination of Thompson Sampling and Distributed Interval Estimation Learning ( DIEL ) with variance reset, first proposed in this paper. In our extensive empirical evaluation, considering both biased and unbiased drift, the proposed algorithm outperforms the previous state-of-the-art ( DIEL ) and other competitive algorithms e. g. , Thompson Sampling and Optimistic Thompson Sampling. We further show that our method is robust to topic-dependent drifts and expertise level-dependent drifts, and the newly-proposed DIEL \(_{reset}\) can be effectively combined with other Bayesian approaches e. g. , Optimistic Thompson Sampling and Dynamic Thompson Sampling and Discounted Thompson Sampling for improved performance.

EUMAS Conference 2018 Conference Paper

Endorsement in Referral Networks

  • Ashiqur R. KhudaBukhsh
  • Jaime G. Carbonell

Abstract Referral networks is an emerging research area in the intersection of Active Learning and Multi-Agent Systems where experts—humans or automated agents—can redirect difficult instances (tasks or queries) to appropriate colleagues. Learning-to-refer involves estimating topic-conditioned skills of colleagues connected through a referral network for effective referrals. Proactive skill posting is a learning setting where experts are allowed a one-time local network advertisement of a subset of their top skills. The learning challenge is exploiting partially available (potentially noisy) self-skill estimates, including adversarial strategic lying to attract unwarranted referrals. In this paper, we introduce the notion of endorsement typically found in professional networks where one colleague endorses another on particular topic(s). We first augment proactive skill posting with endorsements and propose modifications to existing algorithms to take advantage of such endorsements, penalizing subsequent referrals to agents with bogus skill reporting. Our results indicate that truthful endorsements improve performance as they act as an additional cushion to early failures of strong experts. When combined with truthful endorsements, extensive empirical evaluations indicate performance improvement in proactive- DIEL and \(\epsilon \) - Greedy in both market-aware and market-agnostic skill posting setting while retaining desirable properties like tolerance to noisy self-skill estimates and strategic lying.

AAMAS Conference 2018 Conference Paper

Expertise Drift in Referral Networks

  • Ashiqur R. KhudaBukhsh
  • Jaime G. Carbonell

Learning-to-refer is a challenge in expert referral networks, wherein Active Learning helps experts (agents) estimate the skills of other connected experts for different categories of tasks that the initial expert cannot solve and therefore must seek referral to experts with more appropriate expertise. Prior research has investigated different reinforcement action selection algorithms to assess viability of the learning setting both with uninformative priors and with partially available noisy priors, where experts are allowed to advertise a subset of their skills to their colleagues. Prior to this work, time-varying expertise drift (e. g. , experts learning with experience) has not been considered though it is an aspect that may often arise in practice. This paper addresses the challenge of referral learning with time-varying expertise, proposing Hybrid, a novel combination of Optimistic Thompson Sampling, Pessimistic Thompson Sampling and Distributed Interval Estimation Learning (DIEL). In our extensive empirical evaluation, considering both biased and unbiased drift, the proposed algorithm outperforms the previous state-of-the-art (DIEL) and approaches the drift-aware oracle upper bound.

EUMAS Conference 2017 Conference Paper

Incentive Compatible Proactive Skill Posting in Referral Networks

  • Ashiqur R. KhudaBukhsh
  • Jaime G. Carbonell
  • Peter J. Jansen

Abstract Learning to refer in a network of experts (agents) consists of distributed estimation of other experts’ topic-conditioned skills so as to refer problem instances too difficult for the referring agent to solve. This paper focuses on the cold-start case, where experts post a subset of their top skills to connected agents, and as the results show, improve overall network performance and, in particular, early-learning-phase behavior. The method surpasses state-of-the-art, i. e. , proactive- DIEL, by proposing a new mechanism to penalize experts who misreport their skills, and extends the technique to other distributed learning algorithms: proactive- \(\epsilon \) - Greedy, and proactive- Q-Learning. Our proposed new technique exhibits stronger discouragement of strategic lying, both in the limit and finite-horizon empirical analysis. The method is shown robust to noisy self-skill estimates and in evolving networks.

ECAI Conference 2016 Conference Paper

Distributed Learning in Expert Referral Networks

  • Ashiqur R. KhudaBukhsh
  • Peter J. Jansen
  • Jaime G. Carbonell

Human experts or autonomous agents in a referral network must decide whether to accept a task or refer to a more appropriate expert, and if so to whom. In order for the referral network to improve over time, the experts must learn to estimate the topical expertise of other experts. This paper extends concepts from Reinforcement Learning and Active Learning to referral networks, to learn how to refer at the network level, based on the proposed distributed interval estimation learning (DIEL) algorithm. Diverse Monte Carlo simulations reveal that DIEL improves network performance significantly over both greedy and Q-learning baselines [3], approaching optimal given enough data.

EUMAS Conference 2016 Conference Paper

Proactive-DIEL in Evolving Referral Networks

  • Ashiqur R. KhudaBukhsh
  • Jaime G. Carbonell
  • Peter J. Jansen

Abstract Distributed learning in expert referral networks is a new Active Learning paradigm where experts—humans or automated agents—solve problems if they can or refer said problems to others with more appropriate expertise. Recent work augmented the basic learning-to-refer method with proactive skill posting, where experts may report their top skills to their colleagues, and proposed a modified algorithm, proactive- DIEL (Distributed Interval Estimation Learning), that takes advantage of such one-time posting instead of using an uninformed prior. This work extends the method in three main directions: (1) Proactive- DIEL is shown to work on a referral network of automated agents, namely SAT solvers, (2) Proactive- DIEL ’s reward mechanism is extended to another referral-learning algorithm, \(\epsilon \) -Greedy, with some appropriate modifications. (3) The method is shown robust with respect to evolving networks where experts join or drop off, requiring the learning method to recover referral expertise. In all cases the proposed method exhibits superiority to the state of the art.

ICML Conference 2014 Conference Paper

Saddle Points and Accelerated Perceptron Algorithms

  • Adams Wei Yu
  • Fatma Kilinç-Karzan
  • Jaime G. Carbonell

In this paper, we consider the problem of finding a linear (binary) classifier or providing a near-infeasibility certificate if there is none. We bring a new perspective to addressing these two problems simultaneously in a single efficient process, by investigating a related Bilinear Saddle Point Problem (BSPP). More specifically, we show that a BSPP-based approach provides either a linear classifier or an ε-infeasibility certificate. We show that the accelerated primal-dual algorithm, Mirror Prox, can be used for this purpose and achieves the best known convergence rate of O(\sqrt\log n\overρ(A)) (O(\sqrt\log n\overε)), which is \emphalmost independent of the problem size, n. Our framework also solves kernelized and conic versions of the problem, with the same rate of convergence. We support our theoretical findings with an empirical study on synthetic and real data, highlighting the efficiency and numerical stability of our algorithms, especially on large-scale instances.

AIJ Journal 1998 Journal Article

Translingual information retrieval: learning from bilingual corpora

  • Yiming Yang
  • Jaime G. Carbonell
  • Ralf D. Brown
  • Robert E. Frederking

Translingual information retrieval (TLIR) consists of providing a query in one language and searching document collections in one or more different languages. This paper introduces new TLIR methods and reports on comparative TLIR experiments with these new methods and with previously reported ones in a realistic setting. Methods fall into two categories: query translation and statistical-IR approaches establishing translingual associations. The results show that using bilingual corpora for automated extraction of term equivalences in context outperforms dictionarybased methods. Translingual versions of the Generalized Vector Space Model (GVSM) and Latent Semantic Indexing (LSI) perform well, as does translingual pseudo-relevance feedback (PRF) and Example-Based Term-in-context translation (EBT). All showed relatively small performance loss between monolingual and translingual versions, ranging between 87–101% of monolingual IR performance. Query translation based on a general machine-readable bilingual dictionary—heretofore the most popular method—did not match the performance of other, more sophisticated methods. Also, the previous very high LSI results in the literature based on “mate-finding” were superseded by more realistic relevance-based evaluations; LSI performance proved comparable to that of other statistical corpus-based methods.

ICAPS Conference 1994 Conference Paper

Control Knowledge to Improve Plan Quality

  • M. Alicia Pérez
  • Jaime G. Carbonell

Generatingproduction-qualityplans is an essential element in Iransformingplannersfromresearchtools into reel-world applications. However mostof the workto date on learning planningcontrol knowledge has beenaimedat improvingthe effw[encyof planning; this workhas beentermed"speed-up learning". This paper focuses on teamingcontrol knowledgeto guide a plann~towardsbetter solutions, i. e. to improvethe quality of the plans producedby the planner, as its problemsolving experienceincreases. Wemotivate the use of quality-enhancingsearch control knowledge and its automatedacquisifi~mfromproblemsolving experience. Weinlzoduce an implementedmechanismfor teaming such control knowledge and someof our preliminaryresults in a process planningdomain.

AIJ Journal 1989 Journal Article

Explanation-based learning:A problem solving perspective

  • Steven Minton
  • Jaime G. Carbonell
  • Craig A. Knoblock
  • Daniel R. Kuokka
  • Oren Etzioni
  • Yolanda Gil

This article outlines explanation-based learning (EBL) and its role in improving problem solving performance through experience. Unlike inductive systems, which learn by abstracting common properties from multiple examples, EBL systems explain why a particular example is an instance of a concept. The explanations are then converted into operational recognition rules. In essence, the EBL approach is analytical and knowledge-intensive, whereas inductive methods are empirical and knowledge-poor. This article focuses on extensions of the basic EBL method and their integration with the prodigy problem solving system. prodigy's EBL method is specifically designed to acquire search control rules that are effective in reducing total search time for complex task domains. Domain-specific search control rules are learned from successful problem solving decisions, costly failures, and unforeseen goal interactions. The ability to specify multiple learning strategies in a declarative manner enables EBL to serve as a general technique for performance improvement. prodigy's EBL method is analyzed, illustrated with several examples and performance results, and compared with other methods for integrating EBL and problem solving.

AAAI Conference 1983 Conference Paper

Derivational Analogy and Its Role in Problem Solving

  • Jaime G. Carbonell

Derivational analogy, a method of solving problems based upon the transfer of past experience to new problem situations, is discussed in the context of other general approaches to problem solving. The experience transfer process consists of recreating lines of reasoning, including decision sequences and accompanying justifications, that proved effective in solving particular problems requiring similar initial analysis. The derivational analogy approach is advocated as a means of implementing reasoning from individual cases in expert systems.'

AAAI Conference 1982 Conference Paper

Experiential Learning in Analogical Problem Solving

  • Jaime G. Carbonell

A computational model of skill acquisition is analyzed based on extensions to an analogical problem solving method and previous Al work on concept acquisition. The present investigation focuses on exploiting and extending the analogical reasoning model to generate useful exemplary solutions to related problems from which more general plans can be induced and refined. Starting with a general analogical inference engine, problem solving experience is, in essence, compiled incrementally into effective procedures that solve various classes of problems in a more reliable and direct manner.

AIJ Journal 1981 Journal Article

Counterplanning: A strategy-based model of adversary planning in real-world situations

  • Jaime G. Carbonell

Plan formulation and plan comprehension in adversary situations constitute integral components of human reasoning. A process model based on heuristic strategies is presented for decision making in obstructive and constructive counterplanning situations. The former situation is characterized by an actor striving to thwart the goals and plans of a second actor. The latter is the dual situation; it provides general means for an actor to pursue his goals in spite of attempts by others to block his initial plans. The model has been implemented as part of the politics system, a computer program that understands brief natural language accounts of international political conflicts.

AIJ Journal 1980 Journal Article

Towards a process model of human personality traits

  • Jaime G. Carbonell

A goal-based analysis of human personality traits is presented with the objective of developing a comprehensive simulation model. It is shown that understanding trait attributions is an integral part of story comprehension and therefore much of natural language processing. The model of personality traits is derived from the goal trees in the POLITICS system, the notion of social prototypes, and planning/counterplanning strategies. It is argued that the goal-expectation setting, created from an analysis of personality traits attributed to actors in a story, establishes a best-first evaluation criterion that makes more tractable the search problem inherent in story understanding.

v2026.09.13