Dataset Viewer
Auto-converted to Parquet Duplicate
title
stringlengths
10
168
paper_url
stringlengths
42
42
authors
listlengths
1
42
type
stringclasses
2 values
primary_area
stringclasses
0 values
abstract
large_stringlengths
417
2.06k
keywords
listlengths
0
0
TL;DR
large_stringclasses
0 values
submission_number
int64
6
6.84k
arxiv_id
stringlengths
10
10
arxiv_id_source
stringclasses
2 values
embedding
listlengths
768
768
Bayesian Estimation of Differential Privacy
https://openreview.net/forum?id=PwsvGnamYD
[ "Santiago Zanella-Beguelin", "Lukas Wutschitz", "Shruti Tople", "Ahmed Salem", "Victor Rühle", "Andrew Paverd", "Mohammad Naseri", "Boris Köpf", "Daniel Jones" ]
Poster
null
Algorithms such as Differentially Private SGD enable training machine learning models with formal privacy guarantees. However, because these guarantees hold with respect to unrealistic adversaries, the protection afforded against practical attacks is typically much better. An emerging strand of work empirically estimat...
[]
null
6,837
2206.05199
title_snapshot
[ 0.007438566070050001, 0.016047067940235138, -0.017850544303655624, 0.07430573552846909, 0.02714558318257332, 0.01040030550211668, 0.07559199631214142, -0.032099105417728424, -0.010474864393472672, -0.01705378107726574, 0.00575679587200284, 0.0072597539983689785, -0.06503807008266449, -0.01...
Adaptive Estimation of Graphical Models under Total Positivity
https://openreview.net/forum?id=USiX9gmGRx
[ "Jiaxi Ying", "José Vinícius De Miranda Cardoso", "Daniel P. Palomar" ]
Poster
null
We consider the problem of estimating (diagonally dominant) M-matrices as precision matrices in Gaussian graphical models. Such models have shown interesting properties, e.g., the maximum likelihood estimator exists with as little as two observations in the case of M-matrices, and exists even with one observation in th...
[]
null
6,836
2210.15471
title_snapshot
[ -0.03390168026089668, -0.00108319241553545, 0.02623227797448635, 0.0029114510398358107, 0.04107821732759476, 0.04577171057462692, 0.03374340012669563, 0.020640326663851738, -0.030787568539381027, -0.05615605041384697, -0.01284582819789648, 0.014143767766654491, -0.06835527718067169, -0.009...
GEAR: A GPU-Centric Experience Replay System for Large Reinforcement Learning Models
https://openreview.net/forum?id=elL6uw9qOX
[ "Hanjing Wang", "Man-Kit Sit", "Congjie He", "Ying Wen", "Weinan Zhang", "Jun Wang", "Yaodong Yang", "Luo Mai" ]
Poster
null
This paper introduces a distributed, GPU-centric experience replay system, GEAR, designed to perform scalable reinforcement learning (RL) with large sequence models (such as transformers). With such models, existing systems such as Reverb face considerable bottlenecks in memory, computation, and communication. GEAR, ho...
[]
null
6,829
2310.05205
title_snapshot
[ -0.01422877423465252, -0.0460486114025116, -0.0010454361326992512, 0.04105852544307709, 0.03750592842698097, 0.023116305470466614, 0.008336798287928104, 0.03965799883008003, -0.04058310016989708, -0.05604263022542, -0.0014654796104878187, 0.03360140323638916, -0.027463102713227272, -0.0077...
Disentangled Multi-Fidelity Deep Bayesian Active Learning
https://openreview.net/forum?id=jOLIFanYnt
[ "Dongxia Wu", "Ruijia Niu", "Matteo Chinazzi", "Yian Ma", "Rose Yu" ]
Poster
null
To balance quality and cost, various domain areas of science and engineering run simulations at multiple levels of sophistication. Multi-fidelity active learning aims to learn a direct mapping from input parameters to simulation outputs at the highest fidelity by actively acquiring data from multiple fidelity levels. H...
[]
null
6,826
2305.04392
title_snapshot
[ -0.0120158139616251, -0.01781063713133335, -0.011479714885354042, 0.06941990554332733, 0.029049135744571686, 0.02368404157459736, 0.02385232225060463, -0.025103110820055008, 0.010877104476094246, -0.054340753704309464, 0.0035657978150993586, 0.024386899545788765, -0.06747471541166306, 0.02...
Understand and Modularize Generator Optimization in ELECTRA-style Pretraining
https://openreview.net/forum?id=ikE60aXe8M
[ "Chengyu Dong", "Liyuan Liu", "Hao Cheng", "Jingbo Shang", "Jianfeng Gao", "Xiaodong Liu" ]
Poster
null
Despite the effectiveness of ELECTRA-style pre-training, their performance is dependent on the careful selection of the model size for the auxiliary generator, leading to high trial-and-error costs. In this paper, we present the first systematic study of this problem. Our theoretical investigation highlights the import...
[]
null
6,816
null
null
[ -0.022205248475074768, -0.041766371577978134, -0.002097330056130886, 0.030478371307253838, 0.04971480369567871, 0.0499977208673954, 0.009862750768661499, -0.03859530761837959, -0.03423754870891571, -0.024484239518642426, -0.030821651220321655, 0.019358109682798386, -0.055011726915836334, -...
NeRFool: Uncovering the Vulnerability of Generalizable Neural Radiance Fields against Adversarial Perturbations
https://openreview.net/forum?id=cHhGmXDiHp
[ "Yonggan Fu", "Ye Yuan", "Souvik Kundu", "Shang Wu", "Shunyao Zhang", "Celine Lin" ]
Poster
null
Generalizable Neural Radiance Fields (GNeRF) are one of the most promising real-world solutions for novel view synthesis, thanks to their cross-scene generalization capability and thus the possibility of instant rendering on new scenes. While adversarial robustness is essential for real-world applications, little study...
[]
null
6,810
2306.06359
title_snapshot
[ 0.017273522913455963, -0.03560503572225571, 0.00813992228358984, 0.015154436230659485, 0.03568326681852341, 0.011185023933649063, -0.016451289877295494, -0.010819424875080585, -0.03660358116030693, -0.04788248613476753, -0.02862388826906681, 0.012666676193475723, -0.07736800611019135, 0.00...
Provably Efficient Representation Learning with Tractable Planning in Low-Rank POMDP
https://openreview.net/forum?id=MI5YpKX84O
[ "Jiacheng Guo", "Zihao Li", "Huazheng Wang", "Mengdi Wang", "Zhuoran Yang", "Xuezhou Zhang" ]
Poster
null
In this paper, we study representation learning in partially observable Markov Decision Processes (POMDPs), where the agent learns a decoder function that maps a series of high-dimensional raw observations to a compact representation and uses it for more efficient exploration and planning. We focus our attention on the...
[]
null
6,793
2306.12356
title_snapshot
[ -0.06688950955867767, -0.019181935116648674, -0.02790066786110401, 0.04530227184295654, 0.04352741688489914, 0.03913909196853638, 0.014981197193264961, -0.015592996962368488, -0.025209125131368637, -0.029945561662316322, -0.016928328201174736, -0.004849790595471859, -0.07985029369592667, -...
Taming graph kernels with random features
https://openreview.net/forum?id=H21qm4xyk9
[ "Krzysztof Marcin Choromanski" ]
Oral
null
We introduce in this paper the mechanism of graph random features (GRFs). GRFs can be used to construct unbiased randomized estimators of several important kernels defined on graphs' nodes, in particular the regularized Laplacian kernel. As regular RFs for non-graph kernels, they provide means to scale up kernel method...
[]
null
6,792
2305.00156
title_snapshot
[ -0.012846036814153194, -0.04234633594751358, 0.02847837656736374, 0.06409837305545807, 0.017042139545083046, 0.04098710045218468, 0.022134821861982346, 0.011861195787787437, -0.019987167790532112, -0.05384700000286102, 0.007553728763014078, -0.03152638301253319, -0.07085690647363663, 0.002...
Block Subsampled Randomized Hadamard Transform for Nyström Approximation on Distributed Architectures
https://openreview.net/forum?id=EMN99LtfYA
[ "Oleg Balabanov", "Matthias Beaupère", "Laura Grigori", "Victor Lederer" ]
Poster
null
This article introduces a novel structured random matrix composed blockwise from subsampled randomized Hadamard transforms (SRHTs). The block SRHT is expected to outperform well-known dimension reduction maps, including SRHT and Gaussian matrices on distributed architectures. We prove that a block SRHT with enough rows...
[]
null
6,779
2210.11295
title_judge
[ -0.016678880900144577, -0.003781554289162159, 0.018713006749749184, 0.036217041313648224, 0.042477961629629135, 0.04093566909432411, 0.03489116206765175, -0.022495951503515244, -0.015425932593643665, -0.051392439752817154, -0.013874557800590992, -0.04187185689806938, -0.06573440879583359, ...
Unconstrained Online Learning with Unbounded Losses
https://openreview.net/forum?id=2K2vEVBm5G
[ "Andrew Jacobsen", "Ashok Cutkosky" ]
Poster
null
Algorithms for online learning typically require one or more boundedness assumptions: that the domain is bounded, that the losses are Lipschitz, or both. In this paper, we develop a new setting for online learning with unbounded domains and non-Lipschitz losses. For this setting we provide an algorithm which guarantees...
[]
null
6,766
2306.04923
title_snapshot
[ -0.04905961453914642, -0.014294566586613655, 0.010555527172982693, 0.0466606579720974, 0.04564652219414711, 0.02419564500451088, 0.01642480492591858, 0.023825613781809807, 0.0009842115687206388, -0.03382539004087448, -0.016635362058877945, 0.010859333910048008, -0.06407254189252853, -0.015...
Optimistic Planning by Regularized Dynamic Programming
https://openreview.net/forum?id=LctoTBcGUf
[ "Antoine Moulin", "Gergely Neu" ]
Poster
null
We propose a new method for optimistic planning in infinite-horizon discounted Markov decision processes based on the idea of adding regularization to the updates of an otherwise standard approximate value iteration procedure. This technique allows us to avoid contraction and monotonicity arguments typically required b...
[]
null
6,761
2302.14004
title_snapshot
[ -0.034282948821783066, -0.023606013506650925, -0.024082088842988014, 0.0542316697537899, 0.06921347975730896, 0.04129354655742645, -0.002328665228560567, 0.0065464237704873085, -0.05503373593091965, -0.04696136713027954, -0.016096774488687515, 0.024715937674045563, -0.06618636846542358, -0...
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
32

Collection including ai-conferences/ICML2023