scispace - formally typeset
Search or ask a question
Institution

Salesforce.com

About: Salesforce.com is a based out in . It is known for research contribution in the topics: User interface & Object (computer science). The organization has 2418 authors who have published 2775 publications receiving 63956 citations.


Papers
More filters
Proceedings Article
12 Jul 2020
TL;DR: In this article, the authors study self-play in competitive reinforcement learning under the setting of Markov games, a generalization of the Markov decision processes to the two-player case.
Abstract: Self-play, where the algorithm learns by playing against itself without requiring any direct supervision, has become the new weapon in modern Reinforcement Learning (RL) for achieving superhuman performance in practice. However, the majority of exisiting theory in reinforcement learning only applies to the setting where the agent plays against a fixed environment; it remains largely open whether self-play algorithms can be provably effective, especially when it is necessary to manage the exploration/exploitation tradeoff. We study self-play in competitive reinforcement learning under the setting of Markov games, a generalization of Markov decision processes to the two-player case. We introduce a self-play algorithm---Value Iteration with Upper/Lower Confidence Bound (VI-ULCB)---and show that it achieves regret $\tilde{\mathcal{O}}(\sqrt{T})$ after playing $T$ steps of the game, where the regret is measured by the agent's performance against a \emph{fully adversarial} opponent who can exploit the agent's strategy at \emph{any} step. We also introduce an explore-then-exploit style algorithm, which achieves a slightly worse regret of $\tilde{\mathcal{O}}(T^{2/3})$, but is guaranteed to run in polynomial time even in the worst case. To the best of our knowledge, our work presents the first line of provably sample-efficient self-play algorithms for competitive reinforcement learning.

22 citations

Patent
08 Mar 2010
TL;DR: In this paper, a system for controlling access within an enterprise to information associated with recipients of an electronic message campaign of the enterprise sent to a plurality of recipient devices is presented, where the server is configured to assign an enterprise account to the enterprise system and to allow the enterprise level device to communicate selected portions of the recipient list.
Abstract: A system for controlling access within an enterprise to information associated with recipients of an electronic message campaign of the enterprise sent to a plurality of recipient devices wherein the enterprise includes hierarchically structured Business Units having an enterprise level Business Unit at the highest level and a plurality of second level Business Units and an enterprise system communicatively coupled to a network and including an enterprise level device communicatively coupled to a plurality of second level devices includes a server and an electronic message engine The server is configured to assign an enterprise account to the enterprise system and to allow the enterprise level device to communicate selected portions of the recipient list. The electronic message engine is configured to generate electronic messages within a message campaign for sending to recipients identified by each of the second level devices from the selected portions of the recipient list.

22 citations

Patent
Jonathan Pappas1, Scott White1, Marcus Ericsson1, Joel Palmert1, Xiao Meng1 
09 Oct 2014
TL;DR: In this article, a system for enhancing user engagement in a social network computing environment by using affinity indices to track the interaction among posts, topics, users, groups, and experts, and populating displays on user, group, and topic pages using the affinity indices.
Abstract: Methods and systems are provided for enhancing user engagement in a social network computing environment by using affinity indices to track the interaction among posts, topics, users, groups, and experts, and populating displays on user, group, and topic pages using the affinity indices.

22 citations

Patent
04 May 2009
TL;DR: In this paper, the authors present a method for managing recent data items in a database, which typically includes determining whether a data object managed by an on-demand service is designated as able to be accessed by a user at a mobile device.
Abstract: Systems and methods for managing recent data items in a database. A method typically includes determining whether a data object managed by an on demand service is designated as able to be accessed by a user at a mobile device and storing locally at a mobile device a plurality of most recently used items viewed for a data object designated as able to be accessed by a user at a mobile device. The method also typically includes determining a single most recently used set from among the stored plurality of most recently used items viewed for at least one data object designated as able to be accessed by a user at a mobile device.

22 citations

Patent
Scott White1
13 Feb 2014
TL;DR: In this article, a machine learning system is used to identify a set of enterprise users that are predicted to find the information in the communication relevant, and especially, relevant from the enterprise's perspective.
Abstract: Various implementations are directed to systems, apparatus, computer-implemented methods and storage media for identifying a target set of users of an enterprise network to which to distribute a communication of enterprise-related information. For example, when a communication system receives a request to distribute a communication, the communication system analyzes the communication to identify a set of enterprise users that are predicted to find the information in the communication relevant, and especially, relevant from the enterprise's perspective. For example, the communication system can include a machine learning system that can construct, update and maintain a machine learning model of induction. In some implementations, the machine learning system trains the machine learning model by identifying contextual features of previously distributed communications, user traits of recipients of the previously distributed communications, and actions or inactions that indicate whether the recipients found the information in the communications relevant.

22 citations


Authors

Showing all 2418 results

NameH-indexPapersCitations
Philip S. Yu1481914107374
Michael R. Lyu8969633257
Silvio Savarese8938635975
Jiashi Feng7742621521
Richard Socher7727497703
Haibin Ling7238320858
Dragomir R. Radev6928820131
Irwin King6747619056
Steven C. H. Hoi6637515935
Xiaodan Liang6131814121
Caiming Xiong6033618037
Min-Yen Kan5225310207
Justin Yifu Lin4830213491
Hannaneh Hajishirzi421817802
Larry S. Davis401056960
Network Information
Related Institutions (5)
Facebook
10.9K papers, 570.1K citations

90% related

Google
39.8K papers, 2.1M citations

90% related

Microsoft
86.9K papers, 4.1M citations

89% related

Adobe Systems
8K papers, 214.7K citations

87% related

Carnegie Mellon University
104.3K papers, 5.9M citations

84% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
20221
2021222
2020433
2019323
2018288
2017161