Dataset Viewer
Auto-converted to Parquet Duplicate
title
stringlengths
10
192
paper_url
stringlengths
44
59
authors
listlengths
1
23
type
stringclasses
0 values
primary_area
stringclasses
0 values
abstract
large_stringlengths
82
4.49k
keywords
listlengths
0
0
TL;DR
large_stringclasses
0 values
submission_number
int64
1
1.18k
arxiv_id
stringlengths
10
10
arxiv_id_source
stringclasses
2 values
embedding
listlengths
768
768
A New Representation of Successor Features for Transfer across Dissimilar Environments
https://proceedings.mlr.press/v139/abdolshah21a.html
[ "Majid Abdolshah", "Hung Le", "Thommen Karimpanal George", "Sunil Gupta", "Santu Rana", "Svetha Venkatesh" ]
null
null
Transfer in reinforcement learning is usually achieved through generalisation across tasks. Whilst many studies have investigated transferring knowledge when the reward function changes, they have assumed that the dynamics of the environments remain consistent. Many real-world RL problems require transfer among environ...
[]
null
1
2107.08426
title_snapshot
[ -0.026629282161593437, -0.024072086438536644, 0.013690532185137272, 0.043085675686597824, 0.04824595898389816, 0.02296670340001583, 0.011094864457845688, -0.010320842266082764, -0.021677838638424873, -0.032942816615104675, -0.010698177851736546, 0.03813590109348297, -0.07625143975019455, 0...
Massively Parallel and Asynchronous Tsetlin Machine Architecture Supporting Almost Constant-Time Scaling
https://proceedings.mlr.press/v139/abeyrathna21a.html
[ "Kuruge Darshana Abeyrathna", "Bimal Bhattarai", "Morten Goodwin", "Saeed Rahimi Gorji", "Ole-Christoffer Granmo", "Lei Jiao", "Rupsa Saha", "Rohan K. Yadav" ]
null
null
Using logical clauses to represent patterns, Tsetlin Machine (TM) have recently obtained competitive performance in terms of accuracy, memory footprint, energy, and learning speed on several benchmarks. Each TM clause votes for or against a particular class, with classification resolved using a majority vote. While the...
[]
null
2
2009.04861
title_snapshot
[ 0.008741558529436588, -0.00878177024424076, -0.03641383722424507, 0.027108073234558105, 0.015006874687969685, 0.03284256160259247, 0.03671043738722801, 0.029293958097696304, -0.028746725991368294, -0.0014531008200719953, -0.0036968933418393135, -0.02053845301270485, -0.08083383738994598, 0...
Debiasing Model Updates for Improving Personalized Federated Training
https://proceedings.mlr.press/v139/acar21a.html
[ "Durmus Alp Emre Acar", "Yue Zhao", "Ruizhao Zhu", "Ramon Matas", "Matthew Mattina", "Paul Whatmough", "Venkatesh Saligrama" ]
null
null
We propose a novel method for federated learning that is customized specifically to the objective of a given edge device. In our proposed method, a server trains a global meta-model by collaborating with devices without actually sharing data. The trained global meta-model is then personalized locally by each device to ...
[]
null
3
null
null
[ 0.010962597094476223, -0.0333222933113575, 0.012858298607170582, 0.06836342066526413, 0.04507165402173996, 0.013685249723494053, 0.01927732117474079, 0.00366290844976902, -0.012048766016960144, -0.03961510956287384, 0.008753602392971516, 0.004990129265934229, -0.06460674852132797, 0.011117...
Memory Efficient Online Meta Learning
https://proceedings.mlr.press/v139/acar21b.html
[ "Durmus Alp Emre Acar", "Ruizhao Zhu", "Venkatesh Saligrama" ]
null
null
We propose a novel algorithm for online meta learning where task instances are sequentially revealed with limited supervision and a learner is expected to meta learn them in each round, so as to allow the learner to customize a task-specific model rapidly with little task-level supervision. A fundamental concern arisin...
[]
null
4
null
null
[ -0.022794188931584358, 0.008428105153143406, 0.003533667419105768, 0.02633746713399887, 0.03688473626971245, 0.006648068781942129, 0.03530531004071236, 0.025775719434022903, -0.05129930004477501, -0.017763830721378326, -0.014370692893862724, 0.013377645052969456, -0.06133793666958809, -0.0...
Robust Testing and Estimation under Manipulation Attacks
https://proceedings.mlr.press/v139/acharya21a.html
[ "Jayadev Acharya", "Ziteng Sun", "Huanyu Zhang" ]
null
null
We study robust testing and estimation of discrete distributions in the strong contamination model. Our results cover both centralized setting and distributed setting with general local information constraints including communication and LDP constraints. Our technique relates the strength of manipulation attacks to the...
[]
null
5
2104.10740
title_snapshot
[ -0.0014562532305717468, 0.025960303843021393, -0.029545534402132034, 0.06899944692850113, 0.0462266206741333, 0.011603307910263538, 0.043368928134441376, -0.007491069380193949, -0.0002901167899835855, -0.031790755689144135, 0.032469626516103745, -0.01733611710369587, -0.08416914194822311, ...
GP-Tree: A Gaussian Process Classifier for Few-Shot Incremental Learning
https://proceedings.mlr.press/v139/achituve21a.html
[ "Idan Achituve", "Aviv Navon", "Yochai Yemini", "Gal Chechik", "Ethan Fetaya" ]
null
null
Gaussian processes (GPs) are non-parametric, flexible, models that work well in many tasks. Combining GPs with deep learning methods via deep kernel learning (DKL) is especially compelling due to the strong representational power induced by the network. However, inference in GPs, whether with or without DKL, can be com...
[]
null
6
2102.07868
title_snapshot
[ 0.004718208219856024, -0.02557929791510105, 0.02447296306490898, 0.041794873774051666, 0.015030638314783573, 0.05100368335843086, 0.030798058956861496, 0.00534661952406168, -0.004616223741322756, -0.026041140779852867, -0.008564652875065804, 0.01387867797166109, -0.07478116452693939, 0.004...
f-Domain Adversarial Learning: Theory and Algorithms
https://proceedings.mlr.press/v139/acuna21a.html
[ "David Acuna", "Guojun Zhang", "Marc T. Law", "Sanja Fidler" ]
null
null
Unsupervised domain adaptation is used in many machine learning applications where, during training, a model has access to unlabeled data in the target domain, and a related labeled dataset. In this paper, we introduce a novel and general domain-adversarial framework. Specifically, we derive a novel generalization boun...
[]
null
7
2106.11344
title_snapshot
[ -0.022274646908044815, -0.016114884987473488, 0.016269387677311897, 0.035842638462781906, 0.04499557986855507, 0.006975047290325165, 0.036292098462581635, -0.011460316367447376, -0.006670734845101833, -0.014567256905138493, -0.030094677582383156, 0.028309732675552368, -0.07646959275007248, ...
Towards Rigorous Interpretations: a Formalisation of Feature Attribution
https://proceedings.mlr.press/v139/afchar21a.html
[ "Darius Afchar", "Vincent Guigue", "Romain Hennequin" ]
null
null
Feature attribution is often loosely presented as the process of selecting a subset of relevant features as a rationale of a prediction. Task-dependent by nature, precise definitions of "relevance" encountered in the literature are however not always consistent. This lack of clarity stems from the fact that we usually ...
[]
null
8
2104.12437
title_snapshot
[ -0.0019990180153399706, 0.015222134068608284, 0.01347552239894867, -0.003234773874282837, 0.04287559911608696, 0.04589828476309776, 0.00849742628633976, -0.015070564113557339, -0.008757542818784714, -0.0339202806353569, -0.05824494734406471, 0.050159845501184464, -0.08140677958726883, -0.0...
Acceleration via Fractal Learning Rate Schedules
https://proceedings.mlr.press/v139/agarwal21a.html
[ "Naman Agarwal", "Surbhi Goel", "Cyril Zhang" ]
null
null
In practical applications of iterative first-order optimization, the learning rate schedule remains notoriously difficult to understand and expensive to tune. We demonstrate the presence of these subtleties even in the innocuous case when the objective is a convex quadratic. We reinterpret an iterative algorithm from t...
[]
null
9
2103.01338
title_snapshot
[ -0.04004631191492081, 0.0006723927217535675, -0.011584465391933918, 0.02991885505616665, 0.015923786908388138, 0.06389500200748444, 0.02781708352267742, 0.000748941907659173, -0.01479725819081068, -0.042702529579401016, -0.0025041806511580944, 0.003215751377865672, -0.04908960312604904, 0....
A Regret Minimization Approach to Iterative Learning Control
https://proceedings.mlr.press/v139/agarwal21b.html
[ "Naman Agarwal", "Elad Hazan", "Anirudha Majumdar", "Karan Singh" ]
null
null
We consider the setting of iterative learning control, or model-based policy learning in the presence of uncertain, time-varying dynamics. In this setting, we propose a new performance metric, planning regret, which replaces the standard stochastic uncertainty assumptions with worst case regret. Based on recent advance...
[]
null
10
2102.13478
title_snapshot
[ -0.033253494650125504, -0.018733976408839226, -0.030841553583741188, 0.031541772186756134, 0.043209630995988846, 0.036619074642658234, 0.0063386717811226845, -0.0031784779857844114, -0.01737518422305584, -0.04570772126317024, -0.01904822140932083, 0.016886655241250992, -0.04203794524073601, ...
Towards the Unification and Robustness of Perturbation and Gradient Based Explanations
https://proceedings.mlr.press/v139/agarwal21c.html
[ "Sushant Agarwal", "Shahin Jabbari", "Chirag Agarwal", "Sohini Upadhyay", "Steven Wu", "Himabindu Lakkaraju" ]
null
null
As machine learning black boxes are increasingly being deployed in critical domains such as healthcare and criminal justice, there has been a growing emphasis on developing techniques for explaining these black boxes in a post hoc manner. In this work, we analyze two popular post hoc interpretation techniques: SmoothGr...
[]
null
11
2102.10618
title_snapshot
[ -0.03730187565088272, -0.02106856182217598, -0.025041449815034866, 0.04177354276180267, 0.029356159269809723, 0.03139925003051758, 0.03416644036769867, -0.002697854768484831, -0.0011016507633030415, -0.043166812509298325, -0.0022538856137543917, 0.02224578708410263, -0.07136718183755875, -...
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
34

Collection including ai-conferences/ICML2021