id stringlengths 9 10 | submitter stringlengths 1 64 ⌀ | authors stringlengths 4 20.7k | title stringlengths 4 246 | comments stringlengths 1 523 ⌀ | journal-ref stringlengths 4 404 ⌀ | doi stringlengths 11 153 ⌀ | report-no stringlengths 2 254 ⌀ | categories stringlengths 5 98 | license stringclasses 9
values | orig_abstract stringlengths 14 3.35k | versions listlengths 1 60 | update_date stringlengths 10 10 | authors_parsed listlengths 1 1.35k | abstract stringlengths 11 3.34k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2012.00150 | Hanchen Xie | Hanchen Xie, Mohamed E. Hussein, Aram Galstyan, Wael Abd-Almageed | MUSCLE: Strengthening Semi-Supervised Learning Via Concurrent
Unsupervised Learning Using Mutual Information Maximization | 10 pages, 3 figures, Accepted to WACV2021 | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Deep neural networks are powerful, massively parameterized machine learning
models that have been shown to perform well in supervised learning tasks.
However, very large amounts of labeled data are usually needed to train deep
neural networks. Several semi-supervised learning approaches have been proposed
to train ne... | [
{
"created": "Mon, 30 Nov 2020 23:01:04 GMT",
"version": "v1"
}
] | 2020-12-02 | [
[
"Xie",
"Hanchen",
""
],
[
"Hussein",
"Mohamed E.",
""
],
[
"Galstyan",
"Aram",
""
],
[
"Abd-Almageed",
"Wael",
""
]
] | Deep neural networks are powerful, massively parameterized machine learning models that have been shown to perform well in supervised learning tasks. However, very large amounts of labeled data are usually needed to train deep neural networks. Several semi-supervised learning approaches have been proposed to train neur... |
2404.08985 | Yijiang Liu | Yijiang Liu, Rongyu Zhang, Huanrui Yang, Kurt Keutzer, Yuan Du, Li Du,
Shanghang Zhang | Intuition-aware Mixture-of-Rank-1-Experts for Parameter Efficient
Finetuning | 13 pages, 5 figures | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Large Language Models (LLMs) have demonstrated significant potential in
performing multiple tasks in multimedia applications, ranging from content
generation to interactive entertainment, and artistic creation. However, the
diversity of downstream tasks in multitask scenarios presents substantial
adaptation challenge... | [
{
"created": "Sat, 13 Apr 2024 12:14:58 GMT",
"version": "v1"
}
] | 2024-04-16 | [
[
"Liu",
"Yijiang",
""
],
[
"Zhang",
"Rongyu",
""
],
[
"Yang",
"Huanrui",
""
],
[
"Keutzer",
"Kurt",
""
],
[
"Du",
"Yuan",
""
],
[
"Du",
"Li",
""
],
[
"Zhang",
"Shanghang",
""
]
] | Large Language Models (LLMs) have demonstrated significant potential in performing multiple tasks in multimedia applications, ranging from content generation to interactive entertainment, and artistic creation. However, the diversity of downstream tasks in multitask scenarios presents substantial adaptation challenges ... |
2004.00517 | Christoph G\"unther | Christoph G\"unther, Michael G\"unther, Daniel G\"unther | Tracing Contacts to Control the COVID-19 Pandemic | 5 pages, no figures | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The control of the COVID-19 pandemic requires a considerable reduction of
contacts mostly achieved by imposing movement control up to the level of
enforced quarantine. This has lead to a collapse of substantial parts of the
economy. Carriers of the disease are infectious roughly 3 days after exposure
to the virus. Fi... | [
{
"created": "Wed, 1 Apr 2020 15:40:48 GMT",
"version": "v1"
}
] | 2020-04-02 | [
[
"Günther",
"Christoph",
""
],
[
"Günther",
"Michael",
""
],
[
"Günther",
"Daniel",
""
]
] | The control of the COVID-19 pandemic requires a considerable reduction of contacts mostly achieved by imposing movement control up to the level of enforced quarantine. This has lead to a collapse of substantial parts of the economy. Carriers of the disease are infectious roughly 3 days after exposure to the virus. Firs... |
2407.16889 | Modan Tailleur | Modan Tailleur (LS2N), Pierre Aumond (UMRAE), Vincent Tourre (AAU),
Mathieu Lagrange (LS2N) | Towards better visualizations of urban sound environments: insights from
interviews | null | INTERNOISE 2024, Aug 2024, Nantes (France), France | null | null | cs.CY cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Urban noise maps and noise visualizations traditionally provide macroscopic
representations of noise levels across cities. However, those representations
fail at accurately gauging the sound perception associated with these sound
environments, as perception highly depends on the sound sources involved. This
paper aim... | [
{
"created": "Tue, 11 Jun 2024 07:39:48 GMT",
"version": "v1"
}
] | 2024-07-25 | [
[
"Tailleur",
"Modan",
"",
"LS2N"
],
[
"Aumond",
"Pierre",
"",
"UMRAE"
],
[
"Tourre",
"Vincent",
"",
"AAU"
],
[
"Lagrange",
"Mathieu",
"",
"LS2N"
]
] | Urban noise maps and noise visualizations traditionally provide macroscopic representations of noise levels across cities. However, those representations fail at accurately gauging the sound perception associated with these sound environments, as perception highly depends on the sound sources involved. This paper aims ... |
2301.09310 | Jinho Lee | Seongyeon Park, Hajin Kim, Tanveer Ahmad, Nauman Ahmed, Zaid Al-Ars,
H. Peter Hofstee, Youngsok Kim, and Jinho Lee | SaLoBa: Maximizing Data Locality and Workload Balance for Fast Sequence
Alignment on GPUs | Published at IPDPS'22 | null | null | null | cs.DB cs.DC | http://creativecommons.org/licenses/by/4.0/ | Sequence alignment forms an important backbone in many sequencing
applications. A commonly used strategy for sequence alignment is an approximate
string matching with a two-dimensional dynamic programming approach. Although
some prior work has been conducted on GPU acceleration of a sequence alignment,
we identify se... | [
{
"created": "Mon, 23 Jan 2023 08:14:40 GMT",
"version": "v1"
}
] | 2023-01-24 | [
[
"Park",
"Seongyeon",
""
],
[
"Kim",
"Hajin",
""
],
[
"Ahmad",
"Tanveer",
""
],
[
"Ahmed",
"Nauman",
""
],
[
"Al-Ars",
"Zaid",
""
],
[
"Hofstee",
"H. Peter",
""
],
[
"Kim",
"Youngsok",
""
],
[
"Lee",... | Sequence alignment forms an important backbone in many sequencing applications. A commonly used strategy for sequence alignment is an approximate string matching with a two-dimensional dynamic programming approach. Although some prior work has been conducted on GPU acceleration of a sequence alignment, we identify seve... |
2102.08868 | Fartash Faghri | Fartash Faghri, Sven Gowal, Cristina Vasconcelos, David J. Fleet,
Fabian Pedregosa, Nicolas Le Roux | Bridging the Gap Between Adversarial Robustness and Optimization Bias | New CIFAR-10 experiments and Fourier attack variations | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We demonstrate that the choice of optimizer, neural network architecture, and
regularizer significantly affect the adversarial robustness of linear neural
networks, providing guarantees without the need for adversarial training. To
this end, we revisit a known result linking maximally robust classifiers and
minimum n... | [
{
"created": "Wed, 17 Feb 2021 16:58:04 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Jun 2021 15:27:16 GMT",
"version": "v2"
}
] | 2021-06-08 | [
[
"Faghri",
"Fartash",
""
],
[
"Gowal",
"Sven",
""
],
[
"Vasconcelos",
"Cristina",
""
],
[
"Fleet",
"David J.",
""
],
[
"Pedregosa",
"Fabian",
""
],
[
"Roux",
"Nicolas Le",
""
]
] | We demonstrate that the choice of optimizer, neural network architecture, and regularizer significantly affect the adversarial robustness of linear neural networks, providing guarantees without the need for adversarial training. To this end, we revisit a known result linking maximally robust classifiers and minimum nor... |
2110.02369 | Karl Stratos | Wenzheng Zhang, Wenyue Hua, Karl Stratos | EntQA: Entity Linking as Question Answering | ICLR 2022 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A conventional approach to entity linking is to first find mentions in a
given document and then infer their underlying entities in the knowledge base.
A well-known limitation of this approach is that it requires finding mentions
without knowing their entities, which is unnatural and difficult. We present a
new model... | [
{
"created": "Tue, 5 Oct 2021 21:39:57 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Mar 2022 21:53:43 GMT",
"version": "v2"
}
] | 2022-03-09 | [
[
"Zhang",
"Wenzheng",
""
],
[
"Hua",
"Wenyue",
""
],
[
"Stratos",
"Karl",
""
]
] | A conventional approach to entity linking is to first find mentions in a given document and then infer their underlying entities in the knowledge base. A well-known limitation of this approach is that it requires finding mentions without knowing their entities, which is unnatural and difficult. We present a new model t... |
1609.02191 | Chuang Wang | Chuang Wang and Yue M. Lu | Online Learning for Sparse PCA in High Dimensions: Exact Dynamics and
Phase Transitions | 5 pages | null | null | null | cs.IT cond-mat.dis-nn math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the dynamics of an online algorithm for learning a sparse leading
eigenvector from samples generated from a spiked covariance model. This
algorithm combines the classical Oja's method for online PCA with an
element-wise nonlinearity at each iteration to promote sparsity. In the
high-dimensional limit, the jo... | [
{
"created": "Wed, 7 Sep 2016 20:55:38 GMT",
"version": "v1"
}
] | 2016-09-09 | [
[
"Wang",
"Chuang",
""
],
[
"Lu",
"Yue M.",
""
]
] | We study the dynamics of an online algorithm for learning a sparse leading eigenvector from samples generated from a spiked covariance model. This algorithm combines the classical Oja's method for online PCA with an element-wise nonlinearity at each iteration to promote sparsity. In the high-dimensional limit, the join... |
2210.01800 | Fengdi Che | Fengdi Che, Xiru Zhu, Doina Precup, David Meger, and Gregory Dudek | Bayesian Q-learning With Imperfect Expert Demonstrations | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Guided exploration with expert demonstrations improves data efficiency for
reinforcement learning, but current algorithms often overuse expert
information. We propose a novel algorithm to speed up Q-learning with the help
of a limited amount of imperfect expert demonstrations. The algorithm avoids
excessive reliance ... | [
{
"created": "Sat, 1 Oct 2022 17:38:19 GMT",
"version": "v1"
}
] | 2022-10-06 | [
[
"Che",
"Fengdi",
""
],
[
"Zhu",
"Xiru",
""
],
[
"Precup",
"Doina",
""
],
[
"Meger",
"David",
""
],
[
"Dudek",
"Gregory",
""
]
] | Guided exploration with expert demonstrations improves data efficiency for reinforcement learning, but current algorithms often overuse expert information. We propose a novel algorithm to speed up Q-learning with the help of a limited amount of imperfect expert demonstrations. The algorithm avoids excessive reliance on... |
2104.00148 | Gonzalo M\'endez Dr | Gonzalo Gabriel M\'endez, Luis Gal\'arraga and Katherine Chiluiza | Showing Academic Performance Predictions during Term Planning: Effects
on Students' Decisions, Behaviors, and Preferences | 17 pages | null | 10.1145/3411764 | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Course selection is a crucial activity for students as it directly impacts
their workload and performance. It is also time-consuming, prone to
subjectivity, and often carried out based on incomplete information. This task
can, nevertheless, be assisted with computational tools, for instance, by
predicting performance... | [
{
"created": "Wed, 31 Mar 2021 22:32:21 GMT",
"version": "v1"
}
] | 2021-04-02 | [
[
"Méndez",
"Gonzalo Gabriel",
""
],
[
"Galárraga",
"Luis",
""
],
[
"Chiluiza",
"Katherine",
""
]
] | Course selection is a crucial activity for students as it directly impacts their workload and performance. It is also time-consuming, prone to subjectivity, and often carried out based on incomplete information. This task can, nevertheless, be assisted with computational tools, for instance, by predicting performance b... |
1705.09180 | Jingjin Yu | Shuai D. Han, Nicholas M. Stiffler, Athansios Krontiris, Kostas E.
Bekris and Jingjin Yu | High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness
Results and Fast Methods | Updated manuscript | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the underlying combinatorial structure of a class of
object rearrangement problems, which appear frequently in applications. The
problems involve multiple, similar-geometry objects placed on a flat,
horizontal surface, where a robot can approach them from above and perform
pick-and-place operations... | [
{
"created": "Thu, 25 May 2017 13:54:27 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Jun 2017 14:08:43 GMT",
"version": "v2"
},
{
"created": "Tue, 20 Jun 2017 20:21:47 GMT",
"version": "v3"
}
] | 2017-06-22 | [
[
"Han",
"Shuai D.",
""
],
[
"Stiffler",
"Nicholas M.",
""
],
[
"Krontiris",
"Athansios",
""
],
[
"Bekris",
"Kostas E.",
""
],
[
"Yu",
"Jingjin",
""
]
] | This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface, where a robot can approach them from above and perform pick-and-place operations t... |
2105.10859 | Dipika Singhania | Dipika Singhania, Rahul Rahaman, Angela Yao | Coarse to Fine Multi-Resolution Temporal Convolutional Network | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Temporal convolutional networks (TCNs) are a commonly used architecture for
temporal video segmentation. TCNs however, tend to suffer from
over-segmentation errors and require additional refinement modules to ensure
smoothness and temporal coherency. In this work, we propose a novel temporal
encoder-decoder to tackle... | [
{
"created": "Sun, 23 May 2021 06:07:40 GMT",
"version": "v1"
}
] | 2021-05-25 | [
[
"Singhania",
"Dipika",
""
],
[
"Rahaman",
"Rahul",
""
],
[
"Yao",
"Angela",
""
]
] | Temporal convolutional networks (TCNs) are a commonly used architecture for temporal video segmentation. TCNs however, tend to suffer from over-segmentation errors and require additional refinement modules to ensure smoothness and temporal coherency. In this work, we propose a novel temporal encoder-decoder to tackle t... |
1805.12308 | Luliang Jia | Luliang Jia, Yuhua Xu, Youming Sun, Shuo Feng, and Alagan Anpalagan | Stackelberg Game Approaches for Anti-jamming Defence in Wireless
Networks | 8 pages, 6figures, to appear in IEEE Wireless Communications | null | null | null | cs.GT cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article investigates the anti-jamming communications problem in wireless
networks from a Stackelberg game perspective. By exploring and analyzing the
inherent characteristics of the anti-jamming problem, we present and discuss
some technical challenges and fundamental requirements to address them. To be
specific... | [
{
"created": "Thu, 31 May 2018 03:28:57 GMT",
"version": "v1"
}
] | 2018-06-01 | [
[
"Jia",
"Luliang",
""
],
[
"Xu",
"Yuhua",
""
],
[
"Sun",
"Youming",
""
],
[
"Feng",
"Shuo",
""
],
[
"Anpalagan",
"Alagan",
""
]
] | This article investigates the anti-jamming communications problem in wireless networks from a Stackelberg game perspective. By exploring and analyzing the inherent characteristics of the anti-jamming problem, we present and discuss some technical challenges and fundamental requirements to address them. To be specific, ... |
1902.10895 | Jordan Malof | Wei Hu, Kyle Bradbury, Jordan M. Malof, Boning Li, Bohao Huang, Artem
Streltsov, K. Sydny Fujita, and Ben Hoen | What you get is not always what you see: pitfalls in solar array
assessment using overhead imagery | 25 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Effective integration planning for small, distributed solar photovoltaic (PV)
arrays into electric power grids requires access to high quality data: the
location and power capacity of individual solar PV arrays. Unfortunately,
national databases of small-scale solar PV do not exist; those that do are
limited in their... | [
{
"created": "Thu, 28 Feb 2019 05:10:08 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Jul 2022 22:09:37 GMT",
"version": "v2"
}
] | 2022-07-27 | [
[
"Hu",
"Wei",
""
],
[
"Bradbury",
"Kyle",
""
],
[
"Malof",
"Jordan M.",
""
],
[
"Li",
"Boning",
""
],
[
"Huang",
"Bohao",
""
],
[
"Streltsov",
"Artem",
""
],
[
"Fujita",
"K. Sydny",
""
],
[
"Hoen",
... | Effective integration planning for small, distributed solar photovoltaic (PV) arrays into electric power grids requires access to high quality data: the location and power capacity of individual solar PV arrays. Unfortunately, national databases of small-scale solar PV do not exist; those that do are limited in their s... |
2302.09419 | Ce Zhou | Ce Zhou (1), Qian Li (2), Chen Li (2), Jun Yu (3), Yixin Liu (3),
Guangjing Wang (1), Kai Zhang (3), Cheng Ji (2), Qiben Yan (1), Lifang He
(3), Hao Peng (2), Jianxin Li (2), Jia Wu (4), Ziwei Liu (5), Pengtao Xie
(6), Caiming Xiong (7), Jian Pei (8), Philip S. Yu (9), Lichao Sun (3) ((1)
Michigan State Univers... | A Comprehensive Survey on Pretrained Foundation Models: A History from
BERT to ChatGPT | 99 pages, 16 figures | null | null | null | cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pretrained Foundation Models (PFMs) are regarded as the foundation for
various downstream tasks with different data modalities. A PFM (e.g., BERT,
ChatGPT, and GPT-4) is trained on large-scale data which provides a reasonable
parameter initialization for a wide range of downstream applications. BERT
learns bidirectio... | [
{
"created": "Sat, 18 Feb 2023 20:51:09 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Mar 2023 14:44:09 GMT",
"version": "v2"
},
{
"created": "Mon, 1 May 2023 07:48:05 GMT",
"version": "v3"
}
] | 2023-05-02 | [
[
"Zhou",
"Ce",
""
],
[
"Li",
"Qian",
""
],
[
"Li",
"Chen",
""
],
[
"Yu",
"Jun",
""
],
[
"Liu",
"Yixin",
""
],
[
"Wang",
"Guangjing",
""
],
[
"Zhang",
"Kai",
""
],
[
"Ji",
"Cheng",
""
],
[... | Pretrained Foundation Models (PFMs) are regarded as the foundation for various downstream tasks with different data modalities. A PFM (e.g., BERT, ChatGPT, and GPT-4) is trained on large-scale data which provides a reasonable parameter initialization for a wide range of downstream applications. BERT learns bidirectiona... |
2006.13286 | Chao Zhang | Chao Zhang, Yuanwei Liu, Zhijin Qin and Zhiguo Ding | Semi-Grant-Free NOMA: A Stochastic Geometry Model | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Grant-free (GF) transmission holds promise in terms of low latency
communication by directly transmitting messages without waiting for any
permissions. However, collision situations may frequently happen when limited
spectrum is occupied by numerous GF users. The non-orthogonal multiple access
(NOMA) technique can be... | [
{
"created": "Tue, 23 Jun 2020 19:32:48 GMT",
"version": "v1"
}
] | 2020-06-25 | [
[
"Zhang",
"Chao",
""
],
[
"Liu",
"Yuanwei",
""
],
[
"Qin",
"Zhijin",
""
],
[
"Ding",
"Zhiguo",
""
]
] | Grant-free (GF) transmission holds promise in terms of low latency communication by directly transmitting messages without waiting for any permissions. However, collision situations may frequently happen when limited spectrum is occupied by numerous GF users. The non-orthogonal multiple access (NOMA) technique can be a... |
1206.4914 | Mario Alejandro Castrillon | Mario A. Castrillon, Damian A. Morero, and Mario R. Hueda | Joint Demapping and Decoding for DQPSK Optical Coherent Receivers | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a low-complexity joint demapper-decoder scheme for coherent
optical receivers with DQPSK modulation. The new technique reduces to 0.7dB the
gap between QPSK and DQPSK in 100Gb/s coherent optical systems.
| [
{
"created": "Thu, 21 Jun 2012 15:25:05 GMT",
"version": "v1"
}
] | 2012-06-22 | [
[
"Castrillon",
"Mario A.",
""
],
[
"Morero",
"Damian A.",
""
],
[
"Hueda",
"Mario R.",
""
]
] | We present a low-complexity joint demapper-decoder scheme for coherent optical receivers with DQPSK modulation. The new technique reduces to 0.7dB the gap between QPSK and DQPSK in 100Gb/s coherent optical systems. |
2001.01049 | Ziling Heng | Ziling Heng, Cunsheng Ding, Weiqiong Wang | Optimal Binary Linear Codes from Maximal Arcs | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect.
Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are
distance-optimal. The first objective of this paper is to construct a class of
binary linear codes with parameters $[2^{m+s}+2^s-2^m,2^{m+s}+2^s-2^m-2m-2,4]$,
which have better ... | [
{
"created": "Sat, 4 Jan 2020 07:02:18 GMT",
"version": "v1"
}
] | 2020-01-07 | [
[
"Heng",
"Ziling",
""
],
[
"Ding",
"Cunsheng",
""
],
[
"Wang",
"Weiqiong",
""
]
] | The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes with parameters $[2^{m+s}+2^s-2^m,2^{m+s}+2^s-2^m-2m-2,4]$, which have better in... |
2104.08638 | Priyanka Bose | Priyanka Bose, Dipanjan Das, Yanju Chen, Yu Feng, Christopher Kruegel,
Giovanni Vigna | SAILFISH: Vetting Smart Contract State-Inconsistency Bugs in Seconds | null | IEEE Symposium on Security & Privacy, May 2022 | null | null | cs.CR cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents SAILFISH, a scalable system for automatically finding
state-inconsistency bugs in smart contracts. To make the analysis tractable, we
introduce a hybrid approach that includes (i) a light-weight exploration phase
that dramatically reduces the number of instructions to analyze, and (ii) a
precise r... | [
{
"created": "Sat, 17 Apr 2021 20:21:07 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Dec 2021 04:23:57 GMT",
"version": "v2"
}
] | 2021-12-14 | [
[
"Bose",
"Priyanka",
""
],
[
"Das",
"Dipanjan",
""
],
[
"Chen",
"Yanju",
""
],
[
"Feng",
"Yu",
""
],
[
"Kruegel",
"Christopher",
""
],
[
"Vigna",
"Giovanni",
""
]
] | This paper presents SAILFISH, a scalable system for automatically finding state-inconsistency bugs in smart contracts. To make the analysis tractable, we introduce a hybrid approach that includes (i) a light-weight exploration phase that dramatically reduces the number of instructions to analyze, and (ii) a precise ref... |
1811.11553 | Michael Alcorn | Michael A. Alcorn, Qi Li, Zhitao Gong, Chengfei Wang, Long Mai,
Wei-Shinn Ku, Anh Nguyen | Strike (with) a Pose: Neural Networks Are Easily Fooled by Strange Poses
of Familiar Objects | Poster at the 2019 Conference on Computer Vision and Pattern
Recognition | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite excellent performance on stationary test sets, deep neural networks
(DNNs) can fail to generalize to out-of-distribution (OoD) inputs, including
natural, non-adversarial ones, which are common in real-world settings. In this
paper, we present a framework for discovering DNN failures that harnesses 3D
renderer... | [
{
"created": "Wed, 28 Nov 2018 13:39:27 GMT",
"version": "v1"
},
{
"created": "Sun, 13 Jan 2019 23:55:45 GMT",
"version": "v2"
},
{
"created": "Thu, 18 Apr 2019 13:54:20 GMT",
"version": "v3"
}
] | 2019-04-19 | [
[
"Alcorn",
"Michael A.",
""
],
[
"Li",
"Qi",
""
],
[
"Gong",
"Zhitao",
""
],
[
"Wang",
"Chengfei",
""
],
[
"Mai",
"Long",
""
],
[
"Ku",
"Wei-Shinn",
""
],
[
"Nguyen",
"Anh",
""
]
] | Despite excellent performance on stationary test sets, deep neural networks (DNNs) can fail to generalize to out-of-distribution (OoD) inputs, including natural, non-adversarial ones, which are common in real-world settings. In this paper, we present a framework for discovering DNN failures that harnesses 3D renderers ... |
2212.05891 | Jia-Rui Lin | Zhe Zheng, Bo-Rui Kang, Qi-Tian Yuan, Yu-Cheng Zhou, Xin-Zheng Lu,
Jia-Rui Lin | Text Mining-Based Patent Analysis for Automated Rule Checking in AEC | null | null | null | null | cs.IR cs.CL cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Automated rule checking (ARC), which is expected to promote the efficiency of
the compliance checking process in the architecture, engineering, and
construction (AEC) industry, is gaining increasing attention. Throwing light on
the ARC application hotspots and forecasting its trends are useful to the
related research... | [
{
"created": "Mon, 12 Dec 2022 13:48:38 GMT",
"version": "v1"
}
] | 2022-12-13 | [
[
"Zheng",
"Zhe",
""
],
[
"Kang",
"Bo-Rui",
""
],
[
"Yuan",
"Qi-Tian",
""
],
[
"Zhou",
"Yu-Cheng",
""
],
[
"Lu",
"Xin-Zheng",
""
],
[
"Lin",
"Jia-Rui",
""
]
] | Automated rule checking (ARC), which is expected to promote the efficiency of the compliance checking process in the architecture, engineering, and construction (AEC) industry, is gaining increasing attention. Throwing light on the ARC application hotspots and forecasting its trends are useful to the related research a... |
2201.09051 | Marco Virgolin | Marco Virgolin and Saverio Fracaros | On the Robustness of Sparse Counterfactual Explanations to Adverse
Perturbations | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Counterfactual explanations (CEs) are a powerful means for understanding how
decisions made by algorithms can be changed. Researchers have proposed a number
of desiderata that CEs should meet to be practically useful, such as requiring
minimal effort to enact, or complying with causal models. We consider a further
as... | [
{
"created": "Sat, 22 Jan 2022 13:57:45 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Mar 2022 09:33:49 GMT",
"version": "v2"
},
{
"created": "Fri, 23 Sep 2022 15:00:08 GMT",
"version": "v3"
}
] | 2022-09-26 | [
[
"Virgolin",
"Marco",
""
],
[
"Fracaros",
"Saverio",
""
]
] | Counterfactual explanations (CEs) are a powerful means for understanding how decisions made by algorithms can be changed. Researchers have proposed a number of desiderata that CEs should meet to be practically useful, such as requiring minimal effort to enact, or complying with causal models. We consider a further aspe... |
1106.1516 | Francesco De Pellegrini Dr. | Francesco De Pellegrini, Karina Gomez, Daniele Miorandi and Imrich
Chlamtac | Distributed Wake-Up Scheduling for Energy Saving in Wireless Networks | 13 pages, 4 figures | null | null | null | cs.NI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A customary solution to reduce the energy consumption of wireless
communication devices is to periodically put the radio into low-power sleep
mode. A relevant problem is to schedule the wake-up of nodes in such a way as
to ensure proper coordination among devices, respecting delay constraints while
still saving energ... | [
{
"created": "Wed, 8 Jun 2011 08:12:19 GMT",
"version": "v1"
}
] | 2011-06-09 | [
[
"De Pellegrini",
"Francesco",
""
],
[
"Gomez",
"Karina",
""
],
[
"Miorandi",
"Daniele",
""
],
[
"Chlamtac",
"Imrich",
""
]
] | A customary solution to reduce the energy consumption of wireless communication devices is to periodically put the radio into low-power sleep mode. A relevant problem is to schedule the wake-up of nodes in such a way as to ensure proper coordination among devices, respecting delay constraints while still saving energy.... |
2303.18087 | Esther Rolf | Esther Rolf | Evaluation Challenges for Geospatial ML | ICLR 2023 Workshop on Machine Learning for Remote Sensing | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As geospatial machine learning models and maps derived from their predictions
are increasingly used for downstream analyses in science and policy, it is
imperative to evaluate their accuracy and applicability. Geospatial machine
learning has key distinctions from other learning paradigms, and as such, the
correct way... | [
{
"created": "Fri, 31 Mar 2023 14:24:06 GMT",
"version": "v1"
}
] | 2023-04-03 | [
[
"Rolf",
"Esther",
""
]
] | As geospatial machine learning models and maps derived from their predictions are increasingly used for downstream analyses in science and policy, it is imperative to evaluate their accuracy and applicability. Geospatial machine learning has key distinctions from other learning paradigms, and as such, the correct way t... |
2305.18665 | Arshdeep Singh | Arshdeep Singh, Haohe Liu, Mark D. Plumbley | E-PANNs: Sound Recognition Using Efficient Pre-trained Audio Neural
Networks | Accepted in Internoise 2023 conference | null | null | null | cs.SD cs.AI eess.AS eess.SP | http://creativecommons.org/licenses/by/4.0/ | Sounds carry an abundance of information about activities and events in our
everyday environment, such as traffic noise, road works, music, or people
talking. Recent machine learning methods, such as convolutional neural networks
(CNNs), have been shown to be able to automatically recognize sound activities,
a task k... | [
{
"created": "Tue, 30 May 2023 00:08:55 GMT",
"version": "v1"
}
] | 2023-05-31 | [
[
"Singh",
"Arshdeep",
""
],
[
"Liu",
"Haohe",
""
],
[
"Plumbley",
"Mark D.",
""
]
] | Sounds carry an abundance of information about activities and events in our everyday environment, such as traffic noise, road works, music, or people talking. Recent machine learning methods, such as convolutional neural networks (CNNs), have been shown to be able to automatically recognize sound activities, a task kno... |
2002.09587 | Zhanyu Wang | Zhanyu Wang and Jean Honorio | The Sample Complexity of Meta Sparse Regression | null | Artificial Intelligence and Statistics (AISTATS), 2021 | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the meta-learning problem in sparse linear regression
with infinite tasks. We assume that the learner can access several similar
tasks. The goal of the learner is to transfer knowledge from the prior tasks to
a similar but novel task. For p parameters, size of the support set k , and l
samples pe... | [
{
"created": "Sat, 22 Feb 2020 00:59:53 GMT",
"version": "v1"
},
{
"created": "Sun, 21 Jun 2020 18:35:21 GMT",
"version": "v2"
}
] | 2021-02-19 | [
[
"Wang",
"Zhanyu",
""
],
[
"Honorio",
"Jean",
""
]
] | This paper addresses the meta-learning problem in sparse linear regression with infinite tasks. We assume that the learner can access several similar tasks. The goal of the learner is to transfer knowledge from the prior tasks to a similar but novel task. For p parameters, size of the support set k , and l samples per ... |
2109.03702 | Ziyue Zhang | Ziyue Zhang, Shuai Jiang, Congzhentao Huang, Richard YiDa Xu | Unsupervised clothing change adaptive person ReID | 9 pages | null | 10.1109/LSP.2021.3134195 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clothing changes and lack of data labels are both crucial challenges in
person ReID. For the former challenge, people may occur multiple times at
different locations wearing different clothing. However, most of the current
person ReID research works focus on the benchmarks in which a person's clothing
is kept the sam... | [
{
"created": "Wed, 8 Sep 2021 15:08:10 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Sep 2021 14:42:00 GMT",
"version": "v2"
}
] | 2022-02-09 | [
[
"Zhang",
"Ziyue",
""
],
[
"Jiang",
"Shuai",
""
],
[
"Huang",
"Congzhentao",
""
],
[
"Xu",
"Richard YiDa",
""
]
] | Clothing changes and lack of data labels are both crucial challenges in person ReID. For the former challenge, people may occur multiple times at different locations wearing different clothing. However, most of the current person ReID research works focus on the benchmarks in which a person's clothing is kept the same ... |
1807.05543 | Arman Ahmadian | Arman Ahmadian, and Hyuncheol Park | Maximizing Ergodic Throughput in Wireless Powered Communication Networks | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers a single-antenna wirelesspowered communication network
(WPCN) over a flat-fading channel. We show that, by using our probabilistic
harvestand-transmit (PHAT) strategy, which requires the knowledge of
instantaneous full channel state information (CSI) and fading probability
distribution, the ergod... | [
{
"created": "Sun, 15 Jul 2018 13:21:35 GMT",
"version": "v1"
}
] | 2018-07-17 | [
[
"Ahmadian",
"Arman",
""
],
[
"Park",
"Hyuncheol",
""
]
] | This paper considers a single-antenna wirelesspowered communication network (WPCN) over a flat-fading channel. We show that, by using our probabilistic harvestand-transmit (PHAT) strategy, which requires the knowledge of instantaneous full channel state information (CSI) and fading probability distribution, the ergodic... |
2109.14812 | Sajad Meisami | Sajad Meisami, Mohammad Beheshti-Atashgah, Mohammad Reza Aref | Using Blockchain to Achieve Decentralized Privacy In IoT Healthcare | 6 pages | International Journal on Cybernetics & Informatics (IJCI) Vol. 12,
No.2, April 2023, Page 97-108 | 10.5121/ijci.2023.120208 | null | cs.CR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | With the advent of the Internet of Things (IoT), e-health has become one of
the main topics of research. Due to the sensitivity of patient information,
patient privacy seems challenging. Nowadays, patient data is usually stored in
the cloud in healthcare programs, making it difficult for users to have enough
control ... | [
{
"created": "Thu, 30 Sep 2021 02:30:09 GMT",
"version": "v1"
}
] | 2023-04-04 | [
[
"Meisami",
"Sajad",
""
],
[
"Beheshti-Atashgah",
"Mohammad",
""
],
[
"Aref",
"Mohammad Reza",
""
]
] | With the advent of the Internet of Things (IoT), e-health has become one of the main topics of research. Due to the sensitivity of patient information, patient privacy seems challenging. Nowadays, patient data is usually stored in the cloud in healthcare programs, making it difficult for users to have enough control ov... |
1705.08503 | Fionn Murtagh | Fionn Murtagh | The Geometry and Topology of Data and Information for Analytics of
Processes and Behaviours: Building on Bourdieu and Addressing New Societal
Challenges | 16 pages, 7 figures | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We begin by summarizing the relevance and importance of inductive analytics
based on the geometry and topology of data and information. Contemporary issues
are then discussed. These include how sampling data for representativity is
increasingly to be questioned. While we can always avail of analytics from a
"bag of t... | [
{
"created": "Mon, 15 May 2017 22:44:53 GMT",
"version": "v1"
}
] | 2017-05-25 | [
[
"Murtagh",
"Fionn",
""
]
] | We begin by summarizing the relevance and importance of inductive analytics based on the geometry and topology of data and information. Contemporary issues are then discussed. These include how sampling data for representativity is increasingly to be questioned. While we can always avail of analytics from a "bag of too... |
1507.08396 | Shuangyin Li | Shuangyin Li, Jiefei Li, Guan Huang, Ruiyang Tan, and Rong Pan | Tag-Weighted Topic Model For Large-scale Semi-Structured Documents | null | null | null | null | cs.CL cs.IR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To date, there have been massive Semi-Structured Documents (SSDs) during the
evolution of the Internet. These SSDs contain both unstructured features (e.g.,
plain text) and metadata (e.g., tags). Most previous works focused on modeling
the unstructured text, and recently, some other methods have been proposed to
mode... | [
{
"created": "Thu, 30 Jul 2015 06:44:37 GMT",
"version": "v1"
}
] | 2015-07-31 | [
[
"Li",
"Shuangyin",
""
],
[
"Li",
"Jiefei",
""
],
[
"Huang",
"Guan",
""
],
[
"Tan",
"Ruiyang",
""
],
[
"Pan",
"Rong",
""
]
] | To date, there have been massive Semi-Structured Documents (SSDs) during the evolution of the Internet. These SSDs contain both unstructured features (e.g., plain text) and metadata (e.g., tags). Most previous works focused on modeling the unstructured text, and recently, some other methods have been proposed to model ... |
2109.09476 | Junya Morita | Junya Morita, Thanakit Pitakchokchai, Giri Basanta Raj, Yusuke
Yamamoto, Hiroyasu Yuhashi and Teppei Koguchi | Regulating Ruminative Web-browsing Based on the Counterbalance Modeling
Approach | null | Frontiers in Artificial Intelligence, 2022 | 10.3389/frai.2022.741610 | null | cs.HC cs.AI | http://creativecommons.org/licenses/by/4.0/ | Even though the web environment facilitates daily life, emotional problems
caused by its incompatibility with human cognition are becoming increasingly
serious. To alleviate negative emotions during web use, we developed a browser
extension that presents memorized product images to users, in the form of web
advertise... | [
{
"created": "Mon, 20 Sep 2021 12:31:03 GMT",
"version": "v1"
}
] | 2022-08-16 | [
[
"Morita",
"Junya",
""
],
[
"Pitakchokchai",
"Thanakit",
""
],
[
"Raj",
"Giri Basanta",
""
],
[
"Yamamoto",
"Yusuke",
""
],
[
"Yuhashi",
"Hiroyasu",
""
],
[
"Koguchi",
"Teppei",
""
]
] | Even though the web environment facilitates daily life, emotional problems caused by its incompatibility with human cognition are becoming increasingly serious. To alleviate negative emotions during web use, we developed a browser extension that presents memorized product images to users, in the form of web advertiseme... |
2401.04592 | Mihael Arcan | Mihael Arcan, David-Paul Niland and Fionn Delahunty | An Assessment on Comprehending Mental Health through Large Language
Models | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Mental health challenges pose considerable global burdens on individuals and
communities. Recent data indicates that more than 20% of adults may encounter
at least one mental disorder in their lifetime. On the one hand, the
advancements in large language models have facilitated diverse applications,
yet a significant... | [
{
"created": "Tue, 9 Jan 2024 14:50:04 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Feb 2024 09:36:58 GMT",
"version": "v2"
}
] | 2024-02-05 | [
[
"Arcan",
"Mihael",
""
],
[
"Niland",
"David-Paul",
""
],
[
"Delahunty",
"Fionn",
""
]
] | Mental health challenges pose considerable global burdens on individuals and communities. Recent data indicates that more than 20% of adults may encounter at least one mental disorder in their lifetime. On the one hand, the advancements in large language models have facilitated diverse applications, yet a significant r... |
2304.11205 | Camille Coti | Camille Coti and Kevin Huck and Allen D. Malony | STaKTAU: profiling HPC applications' operating system usage | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | This paper presents a approach for measuring the time spent by HPC
applications in the operating system's kernel. We use the SystemTap interface
to insert timers before and after system calls, and take advantage of its
stability to design a tool that can be used with multiple versions of the
kernel. We evaluate its p... | [
{
"created": "Fri, 21 Apr 2023 18:27:57 GMT",
"version": "v1"
}
] | 2023-04-25 | [
[
"Coti",
"Camille",
""
],
[
"Huck",
"Kevin",
""
],
[
"Malony",
"Allen D.",
""
]
] | This paper presents a approach for measuring the time spent by HPC applications in the operating system's kernel. We use the SystemTap interface to insert timers before and after system calls, and take advantage of its stability to design a tool that can be used with multiple versions of the kernel. We evaluate its per... |
2109.05927 | Mohammad Masiur Rahaman | Mohammad Masiur Rahaman | An open-source implementation of a phase-field model for brittle
fracture using Gridap in Julia | null | null | null | null | cs.CE physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This article proposes an open-source implementation of a phase-field model
for brittle fracture using a recently developed finite element toolbox, Gridap
in Julia. The present work exploits the advantages of both the phase-field
model and Gridap toolbox for simulating fracture in brittle materials. On one
hand, the u... | [
{
"created": "Fri, 10 Sep 2021 03:02:59 GMT",
"version": "v1"
}
] | 2021-09-14 | [
[
"Rahaman",
"Mohammad Masiur",
""
]
] | This article proposes an open-source implementation of a phase-field model for brittle fracture using a recently developed finite element toolbox, Gridap in Julia. The present work exploits the advantages of both the phase-field model and Gridap toolbox for simulating fracture in brittle materials. On one hand, the use... |
2003.06713 | Rodrigo Nogueira | Rodrigo Nogueira, Zhiying Jiang, Jimmy Lin | Document Ranking with a Pretrained Sequence-to-Sequence Model | null | null | null | null | cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work proposes a novel adaptation of a pretrained sequence-to-sequence
model to the task of document ranking. Our approach is fundamentally different
from a commonly-adopted classification-based formulation of ranking, based on
encoder-only pretrained transformer architectures such as BERT. We show how a
sequence... | [
{
"created": "Sat, 14 Mar 2020 22:29:50 GMT",
"version": "v1"
}
] | 2020-03-17 | [
[
"Nogueira",
"Rodrigo",
""
],
[
"Jiang",
"Zhiying",
""
],
[
"Lin",
"Jimmy",
""
]
] | This work proposes a novel adaptation of a pretrained sequence-to-sequence model to the task of document ranking. Our approach is fundamentally different from a commonly-adopted classification-based formulation of ranking, based on encoder-only pretrained transformer architectures such as BERT. We show how a sequence-t... |
1401.5697 | Evgeniy Gabrilovich | Evgeniy Gabrilovich, Shaul Markovitch | Wikipedia-based Semantic Interpretation for Natural Language Processing | null | Journal Of Artificial Intelligence Research, Volume 34, pages
443-498, 2009 | 10.1613/jair.2669 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adequate representation of natural language semantics requires access to vast
amounts of common sense and domain-specific world knowledge. Prior work in the
field was based on purely statistical techniques that did not make use of
background knowledge, on limited lexicographic knowledge bases such as WordNet,
or on h... | [
{
"created": "Wed, 15 Jan 2014 05:21:01 GMT",
"version": "v1"
}
] | 2014-01-23 | [
[
"Gabrilovich",
"Evgeniy",
""
],
[
"Markovitch",
"Shaul",
""
]
] | Adequate representation of natural language semantics requires access to vast amounts of common sense and domain-specific world knowledge. Prior work in the field was based on purely statistical techniques that did not make use of background knowledge, on limited lexicographic knowledge bases such as WordNet, or on hug... |
1604.04326 | Stephan Zheng | Stephan Zheng, Yang Song, Thomas Leung, Ian Goodfellow | Improving the Robustness of Deep Neural Networks via Stability Training | Published in CVPR 2016 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we address the issue of output instability of deep neural
networks: small perturbations in the visual input can significantly distort the
feature embeddings and output of a neural network. Such instability affects
many deep architectures with state-of-the-art performance on a wide range of
computer visi... | [
{
"created": "Fri, 15 Apr 2016 01:15:18 GMT",
"version": "v1"
}
] | 2016-04-18 | [
[
"Zheng",
"Stephan",
""
],
[
"Song",
"Yang",
""
],
[
"Leung",
"Thomas",
""
],
[
"Goodfellow",
"Ian",
""
]
] | In this paper we address the issue of output instability of deep neural networks: small perturbations in the visual input can significantly distort the feature embeddings and output of a neural network. Such instability affects many deep architectures with state-of-the-art performance on a wide range of computer vision... |
2111.07226 | Kostis Kaffes | Kostis Kaffes and Neeraja J. Yadwadkar and Christos Kozyrakis | Practical Scheduling for Real-World Serverless Computing | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Serverless computing has seen rapid growth due to the ease-of-use and
cost-efficiency it provides. However, function scheduling, a critical component
of serverless systems, has been overlooked. In this paper, we take a
first-principles approach toward designing a scheduler that caters to the
unique characteristics of... | [
{
"created": "Sun, 14 Nov 2021 02:55:48 GMT",
"version": "v1"
}
] | 2021-11-16 | [
[
"Kaffes",
"Kostis",
""
],
[
"Yadwadkar",
"Neeraja J.",
""
],
[
"Kozyrakis",
"Christos",
""
]
] | Serverless computing has seen rapid growth due to the ease-of-use and cost-efficiency it provides. However, function scheduling, a critical component of serverless systems, has been overlooked. In this paper, we take a first-principles approach toward designing a scheduler that caters to the unique characteristics of s... |
1706.05059 | Victor Dalmau | Victor Dalmau | Conjunctions of Among Constraints | 15 pages plus appendix | null | null | null | cs.AI cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many existing global constraints can be encoded as a conjunction of among
constraints. An among constraint holds if the number of the variables in its
scope whose value belongs to a prespecified set, which we call its range, is
within some given bounds. It is known that domain filtering algorithms can
benefit from re... | [
{
"created": "Thu, 15 Jun 2017 19:51:52 GMT",
"version": "v1"
}
] | 2017-06-19 | [
[
"Dalmau",
"Victor",
""
]
] | Many existing global constraints can be encoded as a conjunction of among constraints. An among constraint holds if the number of the variables in its scope whose value belongs to a prespecified set, which we call its range, is within some given bounds. It is known that domain filtering algorithms can benefit from reas... |
2310.13570 | Alexandros Xenos | Alexandros Xenos, Themos Stafylakis, Ioannis Patras and Georgios
Tzimiropoulos | A Simple Baseline for Knowledge-Based Visual Question Answering | Accepted at EMNLP 2023 (camera-ready version) | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper is on the problem of Knowledge-Based Visual Question Answering
(KB-VQA). Recent works have emphasized the significance of incorporating both
explicit (through external databases) and implicit (through LLMs) knowledge to
answer questions requiring external knowledge effectively. A common limitation
of such ... | [
{
"created": "Fri, 20 Oct 2023 15:08:17 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Oct 2023 13:24:25 GMT",
"version": "v2"
}
] | 2023-10-25 | [
[
"Xenos",
"Alexandros",
""
],
[
"Stafylakis",
"Themos",
""
],
[
"Patras",
"Ioannis",
""
],
[
"Tzimiropoulos",
"Georgios",
""
]
] | This paper is on the problem of Knowledge-Based Visual Question Answering (KB-VQA). Recent works have emphasized the significance of incorporating both explicit (through external databases) and implicit (through LLMs) knowledge to answer questions requiring external knowledge effectively. A common limitation of such ap... |
1601.00184 | Asaf Shabtai | Ben Feher, Lior Sidi, Asaf Shabtai, Rami Puzis | The Security of WebRTC | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | WebRTC is an API that allows users to share streaming information, whether it
is text, sound, video or files. It is supported by all major browsers and has a
flexible underlying infrastructure. In this study we review current WebRTC
structure and security in the contexts of communication disruption,
modification and ... | [
{
"created": "Sat, 2 Jan 2016 15:59:55 GMT",
"version": "v1"
}
] | 2016-01-05 | [
[
"Feher",
"Ben",
""
],
[
"Sidi",
"Lior",
""
],
[
"Shabtai",
"Asaf",
""
],
[
"Puzis",
"Rami",
""
]
] | WebRTC is an API that allows users to share streaming information, whether it is text, sound, video or files. It is supported by all major browsers and has a flexible underlying infrastructure. In this study we review current WebRTC structure and security in the contexts of communication disruption, modification and ea... |
0909.0685 | Chris Giannella | Joel W. Branch, Chris Giannella, Boleslaw Szymanski, Ran Wolff, Hillol
Kargupta | In-Network Outlier Detection in Wireless Sensor Networks | Extended version of a paper appearing in the Int'l Conference on
Distributed Computing Systems 2006 | Knowledge and Information Systems 34(1) January, 2013, pp. 23-54 | 10.1007/s10115-011-0474-5 | null | cs.DB cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To address the problem of unsupervised outlier detection in wireless sensor
networks, we develop an approach that (1) is flexible with respect to the
outlier definition, (2) computes the result in-network to reduce both bandwidth
and energy usage,(3) only uses single hop communication thus permitting very
simple node... | [
{
"created": "Thu, 3 Sep 2009 15:26:38 GMT",
"version": "v1"
}
] | 2013-05-15 | [
[
"Branch",
"Joel W.",
""
],
[
"Giannella",
"Chris",
""
],
[
"Szymanski",
"Boleslaw",
""
],
[
"Wolff",
"Ran",
""
],
[
"Kargupta",
"Hillol",
""
]
] | To address the problem of unsupervised outlier detection in wireless sensor networks, we develop an approach that (1) is flexible with respect to the outlier definition, (2) computes the result in-network to reduce both bandwidth and energy usage,(3) only uses single hop communication thus permitting very simple node f... |
2005.10217 | Zhiguo Ding | Z. Ding and R. Schober and H. V. Poor | Unveiling the Importance of SIC in NOMA Systems: Part II: New Results
and Future Directions | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In most existing works on non-orthogonal multiple access (NOMA), the decoding
order of successive interference cancellation (SIC) is prefixed and based on
either the users' channel conditions or their quality of service (QoS)
requirements. A recent work on NOMA assisted semi-grant-free transmission
showed that the us... | [
{
"created": "Wed, 20 May 2020 17:29:21 GMT",
"version": "v1"
}
] | 2020-05-21 | [
[
"Ding",
"Z.",
""
],
[
"Schober",
"R.",
""
],
[
"Poor",
"H. V.",
""
]
] | In most existing works on non-orthogonal multiple access (NOMA), the decoding order of successive interference cancellation (SIC) is prefixed and based on either the users' channel conditions or their quality of service (QoS) requirements. A recent work on NOMA assisted semi-grant-free transmission showed that the use ... |
2211.06720 | Shubham Varma | Rupali Patil, Bhairav Narkhede, Shubham Varma, Shreyans Suraliya,
Ninad Mehendale | Auto Lead Extraction and Digitization of ECG Paper Records using cGAN | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Purpose: An Electrocardiogram (ECG) is the simplest and fastest bio-medical
test that is used to detect any heart-related disease. ECG signals are
generally stored in paper form, which makes it difficult to store and analyze
the data. While capturing ECG leads from paper ECG records, a lot of background
information i... | [
{
"created": "Sat, 12 Nov 2022 18:36:29 GMT",
"version": "v1"
}
] | 2022-11-15 | [
[
"Patil",
"Rupali",
""
],
[
"Narkhede",
"Bhairav",
""
],
[
"Varma",
"Shubham",
""
],
[
"Suraliya",
"Shreyans",
""
],
[
"Mehendale",
"Ninad",
""
]
] | Purpose: An Electrocardiogram (ECG) is the simplest and fastest bio-medical test that is used to detect any heart-related disease. ECG signals are generally stored in paper form, which makes it difficult to store and analyze the data. While capturing ECG leads from paper ECG records, a lot of background information is ... |
2302.00861 | Jiaxiang Dong | Jiaxiang Dong, Haixu Wu, Haoran Zhang, Li Zhang, Jianmin Wang,
Mingsheng Long | SimMTM: A Simple Pre-Training Framework for Masked Time-Series Modeling | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Time series analysis is widely used in extensive areas. Recently, to reduce
labeling expenses and benefit various tasks, self-supervised pre-training has
attracted immense interest. One mainstream paradigm is masked modeling, which
successfully pre-trains deep models by learning to reconstruct the masked
content base... | [
{
"created": "Thu, 2 Feb 2023 04:12:29 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Feb 2023 05:25:58 GMT",
"version": "v2"
},
{
"created": "Fri, 26 May 2023 14:29:09 GMT",
"version": "v3"
},
{
"created": "Mon, 23 Oct 2023 13:02:38 GMT",
"version": "v4"
}
] | 2023-10-24 | [
[
"Dong",
"Jiaxiang",
""
],
[
"Wu",
"Haixu",
""
],
[
"Zhang",
"Haoran",
""
],
[
"Zhang",
"Li",
""
],
[
"Wang",
"Jianmin",
""
],
[
"Long",
"Mingsheng",
""
]
] | Time series analysis is widely used in extensive areas. Recently, to reduce labeling expenses and benefit various tasks, self-supervised pre-training has attracted immense interest. One mainstream paradigm is masked modeling, which successfully pre-trains deep models by learning to reconstruct the masked content based ... |
2304.00363 | Pablo Gamallo | Miguel Cavadas and Pablo Gamallo | Automatic Authorship Attribution in the Work of Tirso de Molina | 20 pages, 2 figures | Recent Advances in Digital Humanities: Romance Language
Applications, Peter Lang Edition, 2022, DOI 10.3726/b19920. ISBN
978-3-631-81147-4 | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Automatic Authorship Attribution (AAA) is the result of applying tools and
techniques from Digital Humanities to authorship attribution studies. Through a
quantitative and statistical approach this discipline can draw further
conclusions about renowned authorship issues which traditional critics have
been dealing wit... | [
{
"created": "Sat, 1 Apr 2023 18:05:14 GMT",
"version": "v1"
}
] | 2023-04-04 | [
[
"Cavadas",
"Miguel",
""
],
[
"Gamallo",
"Pablo",
""
]
] | Automatic Authorship Attribution (AAA) is the result of applying tools and techniques from Digital Humanities to authorship attribution studies. Through a quantitative and statistical approach this discipline can draw further conclusions about renowned authorship issues which traditional critics have been dealing with ... |
2211.08704 | Sicheng Mo | Sicheng Mo, Fangzhou Mu, Yin Li | A Simple Transformer-Based Model for Ego4D Natural Language Queries
Challenge | 5 pages, 2 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This report describes Badgers@UW-Madison, our submission to the Ego4D Natural
Language Queries (NLQ) Challenge. Our solution inherits the point-based event
representation from our prior work on temporal action localization, and
develops a Transformer-based model for video grounding. Further, our solution
integrates s... | [
{
"created": "Wed, 16 Nov 2022 06:33:37 GMT",
"version": "v1"
}
] | 2022-11-17 | [
[
"Mo",
"Sicheng",
""
],
[
"Mu",
"Fangzhou",
""
],
[
"Li",
"Yin",
""
]
] | This report describes Badgers@UW-Madison, our submission to the Ego4D Natural Language Queries (NLQ) Challenge. Our solution inherits the point-based event representation from our prior work on temporal action localization, and develops a Transformer-based model for video grounding. Further, our solution integrates sev... |
2208.10817 | Hsien-Chin Lin | Hsien-Chin Lin, Christian Geishauser, Shutong Feng, Nurul Lubis, Carel
van Niekerk, Michael Heck, and Milica Ga\v{s}i\'c | GenTUS: Simulating User Behaviour and Language in Task-oriented
Dialogues with Generative Transformers | Accepted as a long paper to SIGDial 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | User simulators (USs) are commonly used to train task-oriented dialogue
systems (DSs) via reinforcement learning. The interactions often take place on
semantic level for efficiency, but there is still a gap from semantic actions
to natural language, which causes a mismatch between training and deployment
environment.... | [
{
"created": "Tue, 23 Aug 2022 09:01:17 GMT",
"version": "v1"
}
] | 2022-08-24 | [
[
"Lin",
"Hsien-Chin",
""
],
[
"Geishauser",
"Christian",
""
],
[
"Feng",
"Shutong",
""
],
[
"Lubis",
"Nurul",
""
],
[
"van Niekerk",
"Carel",
""
],
[
"Heck",
"Michael",
""
],
[
"Gašić",
"Milica",
""
]
] | User simulators (USs) are commonly used to train task-oriented dialogue systems (DSs) via reinforcement learning. The interactions often take place on semantic level for efficiency, but there is still a gap from semantic actions to natural language, which causes a mismatch between training and deployment environment. I... |
2406.08946 | Enrico Ferrentino | Lorenzo Pagliara, Vincenzo Petrone, Enrico Ferrentino, Pasquale
Chiacchio | Human-Robot Interface for Teleoperated Robotized Planetary Sample
Collection and Assembly | null | 2023 IEEE 10th International Workshop on Metrology for AeroSpace
(MetroAeroSpace), Milan, Italy, 2023, pp. 171-176 | 10.1109/MetroAeroSpace57412.2023.10189984 | null | cs.RO cs.HC cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As human space exploration evolves toward longer voyages farther from our
home planet, in-situ resource utilization (ISRU) becomes increasingly
important. Haptic teleoperations are one of the technologies by which such
activities can be carried out remotely by humans, whose expertise is still
necessary for complex ac... | [
{
"created": "Thu, 13 Jun 2024 09:17:10 GMT",
"version": "v1"
}
] | 2024-06-14 | [
[
"Pagliara",
"Lorenzo",
""
],
[
"Petrone",
"Vincenzo",
""
],
[
"Ferrentino",
"Enrico",
""
],
[
"Chiacchio",
"Pasquale",
""
]
] | As human space exploration evolves toward longer voyages farther from our home planet, in-situ resource utilization (ISRU) becomes increasingly important. Haptic teleoperations are one of the technologies by which such activities can be carried out remotely by humans, whose expertise is still necessary for complex acti... |
1203.4364 | Marilyne Rosselle | Marilyne Rosselle | Teacher Module in an Assistance Tool - Adaptating a device to a teaching
context and and teacher's preferences | 6 pages, 3 figures. This article is a long version of the one edited
in ICALT'2012 | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This communication presents the genesis and the implementation of a teacher
module, which is included in an Assistance Tool (AT). The teacher module is
based on a teacher model for which we did a thorough analysis of the state of
the art. The aim of the AT is to help a teacher to design pedagogical devices.
Teachers ... | [
{
"created": "Tue, 20 Mar 2012 10:01:37 GMT",
"version": "v1"
}
] | 2013-03-12 | [
[
"Rosselle",
"Marilyne",
""
]
] | This communication presents the genesis and the implementation of a teacher module, which is included in an Assistance Tool (AT). The teacher module is based on a teacher model for which we did a thorough analysis of the state of the art. The aim of the AT is to help a teacher to design pedagogical devices. Teachers ca... |
2311.03534 | Anurag Koul | Anurag Koul, Shivakanth Sujit, Shaoru Chen, Ben Evans, Lili Wu, Byron
Xu, Rajan Chari, Riashat Islam, Raihan Seraj, Yonathan Efroni, Lekan Molu,
Miro Dudik, John Langford, Alex Lamb | PcLast: Discovering Plannable Continuous Latent States | Accepted at ICML 2024 | null | null | null | cs.LG cs.AI cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Goal-conditioned planning benefits from learned low-dimensional
representations of rich observations. While compact latent representations
typically learned from variational autoencoders or inverse dynamics enable
goal-conditioned decision making, they ignore state reachability, hampering
their performance. In this p... | [
{
"created": "Mon, 6 Nov 2023 21:16:37 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jun 2024 03:32:58 GMT",
"version": "v2"
}
] | 2024-06-12 | [
[
"Koul",
"Anurag",
""
],
[
"Sujit",
"Shivakanth",
""
],
[
"Chen",
"Shaoru",
""
],
[
"Evans",
"Ben",
""
],
[
"Wu",
"Lili",
""
],
[
"Xu",
"Byron",
""
],
[
"Chari",
"Rajan",
""
],
[
"Islam",
"Riasha... | Goal-conditioned planning benefits from learned low-dimensional representations of rich observations. While compact latent representations typically learned from variational autoencoders or inverse dynamics enable goal-conditioned decision making, they ignore state reachability, hampering their performance. In this pap... |
2401.16422 | Eliot Shekhtman | Eliot Shekhtman and Sarah Dean | Strategic Usage in a Multi-Learner Setting | 18 pages, 9 figures | null | null | null | cs.LG cs.GT | http://creativecommons.org/licenses/by/4.0/ | Real-world systems often involve some pool of users choosing between a set of
services. With the increase in popularity of online learning algorithms, these
services can now self-optimize, leveraging data collected on users to maximize
some reward such as service quality. On the flipside, users may strategically
choo... | [
{
"created": "Mon, 29 Jan 2024 18:59:22 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Mar 2024 21:01:08 GMT",
"version": "v2"
}
] | 2024-03-12 | [
[
"Shekhtman",
"Eliot",
""
],
[
"Dean",
"Sarah",
""
]
] | Real-world systems often involve some pool of users choosing between a set of services. With the increase in popularity of online learning algorithms, these services can now self-optimize, leveraging data collected on users to maximize some reward such as service quality. On the flipside, users may strategically choose... |
2310.13016 | Sengul Dogan | Turker Tuncer and Sengul Dogan and Mehmet Baygin and Prabal Datta
Barua and Abdul Hafeez-Baig and Ru-San Tan and Subrata Chakraborty and U.
Rajendra Acharya | Solving the multiplication problem of a large language model system
using a graph-based method | 9 pages, 3 figures | null | null | null | cs.OH cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The generative pre-trained transformer (GPT)-based chatbot software ChatGPT
possesses excellent natural language processing capabilities but is inadequate
for solving arithmetic problems, especially multiplication. Its GPT structure
uses a computational graph for multiplication, which has limited accuracy
beyond simp... | [
{
"created": "Wed, 18 Oct 2023 08:02:00 GMT",
"version": "v1"
}
] | 2023-10-23 | [
[
"Tuncer",
"Turker",
""
],
[
"Dogan",
"Sengul",
""
],
[
"Baygin",
"Mehmet",
""
],
[
"Barua",
"Prabal Datta",
""
],
[
"Hafeez-Baig",
"Abdul",
""
],
[
"Tan",
"Ru-San",
""
],
[
"Chakraborty",
"Subrata",
""
],... | The generative pre-trained transformer (GPT)-based chatbot software ChatGPT possesses excellent natural language processing capabilities but is inadequate for solving arithmetic problems, especially multiplication. Its GPT structure uses a computational graph for multiplication, which has limited accuracy beyond simple... |
2108.05774 | Kuldeep Singh | Anson Bastos, Kuldeep Singh, Abhishek Nadgeri, Saeedeh Shekarpour,
Isaiah Onando Mulang, Johannes Hoffart | HopfE: Knowledge Graph Representation Learning using Inverse Hopf
Fibrations | CIKM 2021 : 30th ACM International Conference on Information and
Knowledge Management (full paper) | null | null | null | cs.IR cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Recently, several Knowledge Graph Embedding (KGE) approaches have been
devised to represent entities and relations in dense vector space and employed
in downstream tasks such as link prediction. A few KGE techniques address
interpretability, i.e., mapping the connectivity patterns of the relations
(i.e., symmetric/as... | [
{
"created": "Thu, 12 Aug 2021 14:34:02 GMT",
"version": "v1"
}
] | 2021-08-13 | [
[
"Bastos",
"Anson",
""
],
[
"Singh",
"Kuldeep",
""
],
[
"Nadgeri",
"Abhishek",
""
],
[
"Shekarpour",
"Saeedeh",
""
],
[
"Mulang",
"Isaiah Onando",
""
],
[
"Hoffart",
"Johannes",
""
]
] | Recently, several Knowledge Graph Embedding (KGE) approaches have been devised to represent entities and relations in dense vector space and employed in downstream tasks such as link prediction. A few KGE techniques address interpretability, i.e., mapping the connectivity patterns of the relations (i.e., symmetric/asym... |
2208.04286 | Pilhyeon Lee | Sungpil Kho, Pilhyeon Lee, Wonyoung Lee, Minsong Ki, Hyeran Byun | Exploiting Shape Cues for Weakly Supervised Semantic Segmentation | Accepted by Pattern Recognition. The first two authors contributed
equally | Pattern Recognition 132 (2022): 108953 | 10.1016/j.patcog.2022.108953 | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Weakly supervised semantic segmentation (WSSS) aims to produce pixel-wise
class predictions with only image-level labels for training. To this end,
previous methods adopt the common pipeline: they generate pseudo masks from
class activation maps (CAMs) and use such masks to supervise segmentation
networks. However, i... | [
{
"created": "Mon, 8 Aug 2022 17:25:31 GMT",
"version": "v1"
}
] | 2022-08-09 | [
[
"Kho",
"Sungpil",
""
],
[
"Lee",
"Pilhyeon",
""
],
[
"Lee",
"Wonyoung",
""
],
[
"Ki",
"Minsong",
""
],
[
"Byun",
"Hyeran",
""
]
] | Weakly supervised semantic segmentation (WSSS) aims to produce pixel-wise class predictions with only image-level labels for training. To this end, previous methods adopt the common pipeline: they generate pseudo masks from class activation maps (CAMs) and use such masks to supervise segmentation networks. However, it ... |
2004.03073 | Anastasios Petropoulos | Anastasios Petropoulos, Irem Boybat, Manuel Le Gallo, Evangelos
Eleftheriou, Abu Sebastian and Theodore Antonakopoulos | Accurate Emulation of Memristive Crossbar Arrays for In-Memory Computing | 5 pages, 4 figures, accepted for publication at ISCAS 2020 | null | null | null | cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In-memory computing is an emerging non-von Neumann computing paradigm where
certain computational tasks are performed in memory by exploiting the physical
attributes of the memory devices. Memristive devices such as phase-change
memory (PCM), where information is stored in terms of their conductance levels,
are espec... | [
{
"created": "Tue, 7 Apr 2020 01:53:56 GMT",
"version": "v1"
}
] | 2020-04-08 | [
[
"Petropoulos",
"Anastasios",
""
],
[
"Boybat",
"Irem",
""
],
[
"Gallo",
"Manuel Le",
""
],
[
"Eleftheriou",
"Evangelos",
""
],
[
"Sebastian",
"Abu",
""
],
[
"Antonakopoulos",
"Theodore",
""
]
] | In-memory computing is an emerging non-von Neumann computing paradigm where certain computational tasks are performed in memory by exploiting the physical attributes of the memory devices. Memristive devices such as phase-change memory (PCM), where information is stored in terms of their conductance levels, are especia... |
2010.13464 | Moritz Beller | Moritz Beller, Chu-Pan Wong, Johannes Bader, Andrew Scott, Mateusz
Machalica, Satish Chandra, Erik Meijer | What It Would Take to Use Mutation Testing in Industry--A Study at
Facebook | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditionally, mutation testing generates an abundance of small deviations of
a program, called mutants. At industrial systems the scale and size of
Facebook's, doing this is infeasible. We should not create mutants that the
test suite would likely fail on or that give no actionable signal to
developers. To tackle th... | [
{
"created": "Mon, 26 Oct 2020 10:03:58 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Oct 2020 06:35:50 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Jan 2021 16:43:42 GMT",
"version": "v3"
}
] | 2021-01-28 | [
[
"Beller",
"Moritz",
""
],
[
"Wong",
"Chu-Pan",
""
],
[
"Bader",
"Johannes",
""
],
[
"Scott",
"Andrew",
""
],
[
"Machalica",
"Mateusz",
""
],
[
"Chandra",
"Satish",
""
],
[
"Meijer",
"Erik",
""
]
] | Traditionally, mutation testing generates an abundance of small deviations of a program, called mutants. At industrial systems the scale and size of Facebook's, doing this is infeasible. We should not create mutants that the test suite would likely fail on or that give no actionable signal to developers. To tackle this... |
1909.13548 | Sai Dayapule | Fan Yao, Kathy Ngyugen, Sai Santosh Dayapule, Jingxin Wu, Bingqian Lu,
Suresh Subramaniam, and Guru Venkataramani | HolDCSim: A Holistic Simulator for Data Centers | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cloud computing based systems, that span data centers, are commonly deployed
to offer high performance for user service requests. As data centers continue
to expand, computer architects and system designers are facing many challenges
on how to balance resource utilization efficiency, server and network
performance, e... | [
{
"created": "Mon, 30 Sep 2019 09:24:40 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Oct 2019 14:13:21 GMT",
"version": "v2"
}
] | 2019-10-08 | [
[
"Yao",
"Fan",
""
],
[
"Ngyugen",
"Kathy",
""
],
[
"Dayapule",
"Sai Santosh",
""
],
[
"Wu",
"Jingxin",
""
],
[
"Lu",
"Bingqian",
""
],
[
"Subramaniam",
"Suresh",
""
],
[
"Venkataramani",
"Guru",
""
]
] | Cloud computing based systems, that span data centers, are commonly deployed to offer high performance for user service requests. As data centers continue to expand, computer architects and system designers are facing many challenges on how to balance resource utilization efficiency, server and network performance, ene... |
2310.15829 | Corentin Kervadec | Corentin Kervadec, Francesca Franzon and Marco Baroni | Unnatural language processing: How do language models handle
machine-generated prompts? | Findings of EMNLP 2023 Camera-Ready | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Language model prompt optimization research has shown that semantically and
grammatically well-formed manually crafted prompts are routinely outperformed
by automatically generated token sequences with no apparent meaning or
syntactic structure, including sequences of vectors from a model's embedding
space. We use ma... | [
{
"created": "Tue, 24 Oct 2023 13:32:20 GMT",
"version": "v1"
}
] | 2023-10-25 | [
[
"Kervadec",
"Corentin",
""
],
[
"Franzon",
"Francesca",
""
],
[
"Baroni",
"Marco",
""
]
] | Language model prompt optimization research has shown that semantically and grammatically well-formed manually crafted prompts are routinely outperformed by automatically generated token sequences with no apparent meaning or syntactic structure, including sequences of vectors from a model's embedding space. We use mach... |
2312.04140 | Ryota Maeda | Ryota Maeda, Shinsaku Hiura | Polarimetric Light Transport Analysis for Specular Inter-reflection | Accepted to IEEE Transactions on Computational Imaging (TCI) | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Polarization is well known for its ability to decompose diffuse and specular
reflections. However, the existing decomposition methods only focus on direct
reflection and overlook multiple reflections, especially specular
inter-reflection. In this paper, we propose a novel decomposition method for
handling specular in... | [
{
"created": "Thu, 7 Dec 2023 08:55:28 GMT",
"version": "v1"
},
{
"created": "Wed, 15 May 2024 16:24:54 GMT",
"version": "v2"
}
] | 2024-05-16 | [
[
"Maeda",
"Ryota",
""
],
[
"Hiura",
"Shinsaku",
""
]
] | Polarization is well known for its ability to decompose diffuse and specular reflections. However, the existing decomposition methods only focus on direct reflection and overlook multiple reflections, especially specular inter-reflection. In this paper, we propose a novel decomposition method for handling specular inte... |
2001.10298 | Amer Krivo\v{s}ija | Maike Buchin and Nicole Funk and Amer Krivo\v{s}ija | On the complexity of the middle curve problem | null | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For a set of curves, Ahn et al. introduced the notion of a middle curve and
gave algorithms computing these with run time exponential in the number of
curves. Here we study the computational complexity of this problem: we show
that it is NP-complete and give approximation algorithms.
| [
{
"created": "Tue, 28 Jan 2020 12:54:16 GMT",
"version": "v1"
}
] | 2020-01-29 | [
[
"Buchin",
"Maike",
""
],
[
"Funk",
"Nicole",
""
],
[
"Krivošija",
"Amer",
""
]
] | For a set of curves, Ahn et al. introduced the notion of a middle curve and gave algorithms computing these with run time exponential in the number of curves. Here we study the computational complexity of this problem: we show that it is NP-complete and give approximation algorithms. |
2106.15846 | Zhiyuan Wen | Wen Zhiyuan, Cao Jiannong, Yang Ruosong, Liu Shuaiqi, Shen Jiaxing | Automatically Select Emotion for Response via Personality-affected
Emotion Transition | Accepted by Findings of ACL-IJCNLP 2021 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To provide consistent emotional interaction with users, dialog systems should
be capable to automatically select appropriate emotions for responses like
humans. However, most existing works focus on rendering specified emotions in
responses or empathetically respond to the emotion of users, yet the individual
differe... | [
{
"created": "Wed, 30 Jun 2021 07:00:42 GMT",
"version": "v1"
}
] | 2021-07-01 | [
[
"Zhiyuan",
"Wen",
""
],
[
"Jiannong",
"Cao",
""
],
[
"Ruosong",
"Yang",
""
],
[
"Shuaiqi",
"Liu",
""
],
[
"Jiaxing",
"Shen",
""
]
] | To provide consistent emotional interaction with users, dialog systems should be capable to automatically select appropriate emotions for responses like humans. However, most existing works focus on rendering specified emotions in responses or empathetically respond to the emotion of users, yet the individual differenc... |
2302.12910 | Jia Shen | Jia Tracy Shen, Dongwon Lee | Imputing Knowledge Tracing Data with Subject-Based Training via LSTM
Variational Autoencoders Frameworks | Accepted by AAAI2023 AI4ED Workshop | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The issue of missing data poses a great challenge on boosting performance and
application of deep learning models in the {\em Knowledge Tracing} (KT)
problem. However, there has been the lack of understanding on the issue in the
literature. %are not sufficient studies tackling this problem. In this work, to
address t... | [
{
"created": "Fri, 24 Feb 2023 21:56:03 GMT",
"version": "v1"
}
] | 2023-02-28 | [
[
"Shen",
"Jia Tracy",
""
],
[
"Lee",
"Dongwon",
""
]
] | The issue of missing data poses a great challenge on boosting performance and application of deep learning models in the {\em Knowledge Tracing} (KT) problem. However, there has been the lack of understanding on the issue in the literature. %are not sufficient studies tackling this problem. In this work, to address thi... |
2312.14925 | Timo Kaufmann | Timo Kaufmann, Paul Weng, Viktor Bengs, Eyke H\"ullermeier | A Survey of Reinforcement Learning from Human Feedback | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Reinforcement learning from human feedback (RLHF) is a variant of
reinforcement learning (RL) that learns from human feedback instead of relying
on an engineered reward function. Building on prior work on the related setting
of preference-based reinforcement learning (PbRL), it stands at the
intersection of artificia... | [
{
"created": "Fri, 22 Dec 2023 18:58:06 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Apr 2024 17:59:01 GMT",
"version": "v2"
}
] | 2024-05-01 | [
[
"Kaufmann",
"Timo",
""
],
[
"Weng",
"Paul",
""
],
[
"Bengs",
"Viktor",
""
],
[
"Hüllermeier",
"Eyke",
""
]
] | Reinforcement learning from human feedback (RLHF) is a variant of reinforcement learning (RL) that learns from human feedback instead of relying on an engineered reward function. Building on prior work on the related setting of preference-based reinforcement learning (PbRL), it stands at the intersection of artificial ... |
1911.03852 | Amir Gholami | Zhen Dong, Zhewei Yao, Yaohui Cai, Daiyaan Arfeen, Amir Gholami,
Michael W. Mahoney, Kurt Keutzer | HAWQ-V2: Hessian Aware trace-Weighted Quantization of Neural Networks | null | NeurIPS 2020 paper, link:
https://proceedings.neurips.cc/paper/2020/file/d77c703536718b95308130ff2e5cf9ee-Supplemental.pdf | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Quantization is an effective method for reducing memory footprint and
inference time of Neural Networks, e.g., for efficient inference in the cloud,
especially at the edge. However, ultra low precision quantization could lead to
significant degradation in model generalization. A promising method to address
this is to... | [
{
"created": "Sun, 10 Nov 2019 04:46:17 GMT",
"version": "v1"
}
] | 2021-05-11 | [
[
"Dong",
"Zhen",
""
],
[
"Yao",
"Zhewei",
""
],
[
"Cai",
"Yaohui",
""
],
[
"Arfeen",
"Daiyaan",
""
],
[
"Gholami",
"Amir",
""
],
[
"Mahoney",
"Michael W.",
""
],
[
"Keutzer",
"Kurt",
""
]
] | Quantization is an effective method for reducing memory footprint and inference time of Neural Networks, e.g., for efficient inference in the cloud, especially at the edge. However, ultra low precision quantization could lead to significant degradation in model generalization. A promising method to address this is to p... |
1907.00483 | Amit Kumar Jaiswal | Amit Kumar Jaiswal, Haiming Liu and Ingo Frommholz | Effects of Foraging in Personalized Content-based Image Recommendation | Accepted in Proceedings of the the 2nd International Workshop on
Explainable Recommendation and Search (EARS) at SIGIR 2019 | null | null | null | cs.IR cs.HC cs.MM cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A major challenge of recommender systems is to help users locating
interesting items. Personalized recommender systems have become very popular as
they attempt to predetermine the needs of users and provide them with
recommendations to personalize their navigation. However, few studies have
addressed the question of ... | [
{
"created": "Sun, 30 Jun 2019 22:16:32 GMT",
"version": "v1"
},
{
"created": "Sat, 20 Jul 2019 12:43:53 GMT",
"version": "v2"
}
] | 2019-07-23 | [
[
"Jaiswal",
"Amit Kumar",
""
],
[
"Liu",
"Haiming",
""
],
[
"Frommholz",
"Ingo",
""
]
] | A major challenge of recommender systems is to help users locating interesting items. Personalized recommender systems have become very popular as they attempt to predetermine the needs of users and provide them with recommendations to personalize their navigation. However, few studies have addressed the question of wh... |
1509.06983 | Marc Hellmuth | Marc Hellmuth, Adrian Fritz, Nicolas Wieseke and Peter F. Stadler | Techniques for the Cograph Editing Problem: Module Merge is equivalent
to Editing P4s | null | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cographs are graphs in which no four vertices induce a simple connected path
$P_4$. Cograph editing is to find for a given graph $G = (V,E)$ a set of at
most $k$ edge additions and deletions that transform $G$ into a cograph. This
combinatorial optimization problem is NP-hard. It has, recently found
applications in t... | [
{
"created": "Wed, 23 Sep 2015 13:54:15 GMT",
"version": "v1"
},
{
"created": "Thu, 24 Sep 2015 09:34:29 GMT",
"version": "v2"
}
] | 2015-09-25 | [
[
"Hellmuth",
"Marc",
""
],
[
"Fritz",
"Adrian",
""
],
[
"Wieseke",
"Nicolas",
""
],
[
"Stadler",
"Peter F.",
""
]
] | Cographs are graphs in which no four vertices induce a simple connected path $P_4$. Cograph editing is to find for a given graph $G = (V,E)$ a set of at most $k$ edge additions and deletions that transform $G$ into a cograph. This combinatorial optimization problem is NP-hard. It has, recently found applications in the... |
2401.06080 | Rui Zheng | Binghai Wang, Rui Zheng, Lu Chen, Yan Liu, Shihan Dou, Caishuang
Huang, Wei Shen, Senjie Jin, Enyu Zhou, Chenyu Shi, Songyang Gao, Nuo Xu,
Yuhao Zhou, Xiaoran Fan, Zhiheng Xi, Jun Zhao, Xiao Wang, Tao Ji, Hang Yan,
Lixing Shen, Zhan Chen, Tao Gui, Qi Zhang, Xipeng Qiu, Xuanjing Huang, Zuxuan
Wu, Yu-Gang Jiang | Secrets of RLHF in Large Language Models Part II: Reward Modeling | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement Learning from Human Feedback (RLHF) has become a crucial
technology for aligning language models with human values and intentions,
enabling models to produce more helpful and harmless responses. Reward models
are trained as proxies for human preferences to drive reinforcement learning
optimization. Whil... | [
{
"created": "Thu, 11 Jan 2024 17:56:59 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Jan 2024 09:46:10 GMT",
"version": "v2"
}
] | 2024-01-15 | [
[
"Wang",
"Binghai",
""
],
[
"Zheng",
"Rui",
""
],
[
"Chen",
"Lu",
""
],
[
"Liu",
"Yan",
""
],
[
"Dou",
"Shihan",
""
],
[
"Huang",
"Caishuang",
""
],
[
"Shen",
"Wei",
""
],
[
"Jin",
"Senjie",
... | Reinforcement Learning from Human Feedback (RLHF) has become a crucial technology for aligning language models with human values and intentions, enabling models to produce more helpful and harmless responses. Reward models are trained as proxies for human preferences to drive reinforcement learning optimization. While ... |
1508.03261 | He Sun | Yin Tat Lee and He Sun | Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time | 22 pages. A preliminary version of this paper is to appear in
proceedings of the 56th Annual IEEE Symposium on Foundations of Computer
Science (FOCS 2015) | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the first almost-linear time algorithm for constructing
linear-sized spectral sparsification for graphs. This improves all previous
constructions of linear-sized spectral sparsification, which requires
$\Omega(n^2)$ time.
A key ingredient in our algorithm is a novel combination of two techniques
used in ... | [
{
"created": "Thu, 13 Aug 2015 16:24:28 GMT",
"version": "v1"
}
] | 2015-08-14 | [
[
"Lee",
"Yin Tat",
""
],
[
"Sun",
"He",
""
]
] | We present the first almost-linear time algorithm for constructing linear-sized spectral sparsification for graphs. This improves all previous constructions of linear-sized spectral sparsification, which requires $\Omega(n^2)$ time. A key ingredient in our algorithm is a novel combination of two techniques used in lite... |
2207.02802 | Qianglong Chen | Qianglong Chen, Xiangji Zeng, Jiangang Zhu, Yin Zhang, Bojia Lin, Yang
Yang, Daxin Jiang | Rethinking the Value of Gazetteer in Chinese Named Entity Recognition | Accepted by NLPCC 2022 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Gazetteer is widely used in Chinese named entity recognition (NER) to enhance
span boundary detection and type classification. However, to further understand
the generalizability and effectiveness of gazetteers, the NLP community still
lacks a systematic analysis of the gazetteer-enhanced NER model. In this paper,
we... | [
{
"created": "Wed, 6 Jul 2022 16:45:25 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Jul 2022 09:13:26 GMT",
"version": "v2"
}
] | 2022-07-19 | [
[
"Chen",
"Qianglong",
""
],
[
"Zeng",
"Xiangji",
""
],
[
"Zhu",
"Jiangang",
""
],
[
"Zhang",
"Yin",
""
],
[
"Lin",
"Bojia",
""
],
[
"Yang",
"Yang",
""
],
[
"Jiang",
"Daxin",
""
]
] | Gazetteer is widely used in Chinese named entity recognition (NER) to enhance span boundary detection and type classification. However, to further understand the generalizability and effectiveness of gazetteers, the NLP community still lacks a systematic analysis of the gazetteer-enhanced NER model. In this paper, we f... |
2311.00800 | AmirHosein Fadaei | Amir Hosein Fadaei, Mohammad-Reza A. Dehaqani | Beyond still images: Temporal features and input variance resilience | 13 pages, 9 figures | null | 10.1038/s41598-024-66346-w | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditionally, vision models have predominantly relied on spatial features
extracted from static images, deviating from the continuous stream of
spatiotemporal features processed by the brain in natural vision. While
numerous video-understanding models have emerged, incorporating videos into
image-understanding model... | [
{
"created": "Wed, 1 Nov 2023 19:34:45 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Feb 2024 15:41:08 GMT",
"version": "v2"
}
] | 2024-07-18 | [
[
"Fadaei",
"Amir Hosein",
""
],
[
"Dehaqani",
"Mohammad-Reza A.",
""
]
] | Traditionally, vision models have predominantly relied on spatial features extracted from static images, deviating from the continuous stream of spatiotemporal features processed by the brain in natural vision. While numerous video-understanding models have emerged, incorporating videos into image-understanding models ... |
0810.1248 | Ali Parandehgheibi | Ali ParandehGheibi, Atilla Eryilmaz, Asuman Ozdaglar, Muriel Medard | Resource Allocation in Multiple Access Channels | 5 pages, In proc. of ACSSC 2007 | null | null | null | cs.IT cs.NI math.IT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of rate allocation in a Gaussian multiple-access
channel, with the goal of maximizing a utility function over transmission
rates. In contrast to the literature which focuses on linear utility functions,
we study general concave utility functions. We present a gradient projection
algorithm for ... | [
{
"created": "Tue, 7 Oct 2008 17:29:52 GMT",
"version": "v1"
}
] | 2008-10-08 | [
[
"ParandehGheibi",
"Ali",
""
],
[
"Eryilmaz",
"Atilla",
""
],
[
"Ozdaglar",
"Asuman",
""
],
[
"Medard",
"Muriel",
""
]
] | We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literature which focuses on linear utility functions, we study general concave utility functions. We present a gradient projection algorithm for th... |
2407.16395 | Valderi Leithardt Valderi | Pedro Costa, Valderi Leithardt | Prisec II -- A Comprehensive Model for IoT Security: Cryptographic
Algorithms and Cloud Integration | 8 pages | IEEE Latam Transactions 2024 | null | null | cs.CR cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study addresses the critical issue of ensuring data security and
efficiency in interconnected devices, especially in IoT environments. The
objective is to design and implement a model using cryptographic algorithms to
enhance data security in 5G networks. Challenges arise from the limited
computational capabilit... | [
{
"created": "Tue, 23 Jul 2024 11:35:24 GMT",
"version": "v1"
}
] | 2024-07-24 | [
[
"Costa",
"Pedro",
""
],
[
"Leithardt",
"Valderi",
""
]
] | This study addresses the critical issue of ensuring data security and efficiency in interconnected devices, especially in IoT environments. The objective is to design and implement a model using cryptographic algorithms to enhance data security in 5G networks. Challenges arise from the limited computational capabilitie... |
0906.0426 | Li Li | Li Li, Yudong Chen, Yi Zhang | A Mixed-Fractal Model for Network Traffic | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this short paper, we propose a new multi-fractal flow model, aiming to
provide a possible explanation for the crossover phenomena that appear in the
estimation of Hurst exponent for network traffic. It is shown that crossover
occurs if the network flow consists of several components with different Hurst
components... | [
{
"created": "Tue, 2 Jun 2009 06:41:19 GMT",
"version": "v1"
}
] | 2009-06-03 | [
[
"Li",
"Li",
""
],
[
"Chen",
"Yudong",
""
],
[
"Zhang",
"Yi",
""
]
] | In this short paper, we propose a new multi-fractal flow model, aiming to provide a possible explanation for the crossover phenomena that appear in the estimation of Hurst exponent for network traffic. It is shown that crossover occurs if the network flow consists of several components with different Hurst components. ... |
2009.00548 | Philipp Meschenmoser | Philipp Meschenmoser, Juri F. Buchm\"uller, Daniel Seebacher, Martin
Wikelski and Daniel A. Keim | MultiSegVA: Using Visual Analytics to Segment Biologging Time Series on
Multiple Scales | IEEE VAST 2020 - Proceedings of IEEE Conference on Visual Analytics
Science and Technology (VAST), 2020 | null | null | null | cs.HC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Segmenting biologging time series of animals on multiple temporal scales is
an essential step that requires complex techniques with careful
parameterization and possibly cross-domain expertise. Yet, there is a lack of
visual-interactive tools that strongly support such multi-scale segmentation.
To close this gap, we ... | [
{
"created": "Tue, 1 Sep 2020 16:27:08 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Sep 2020 08:22:29 GMT",
"version": "v2"
}
] | 2020-09-03 | [
[
"Meschenmoser",
"Philipp",
""
],
[
"Buchmüller",
"Juri F.",
""
],
[
"Seebacher",
"Daniel",
""
],
[
"Wikelski",
"Martin",
""
],
[
"Keim",
"Daniel A.",
""
]
] | Segmenting biologging time series of animals on multiple temporal scales is an essential step that requires complex techniques with careful parameterization and possibly cross-domain expertise. Yet, there is a lack of visual-interactive tools that strongly support such multi-scale segmentation. To close this gap, we pr... |
1602.03031 | Can Alkan | Atalay M. Ileri, Halil I. Ozercan, Alper Gundogdu, Ahmet K. Senol, M.
Yusuf Ozkaya, Can Alkan | Coinami: A Cryptocurrency with DNA Sequence Alignment as Proof-of-work | null | null | null | null | cs.CE cs.CR q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rate of growth of the amount of data generated using the high throughput
sequencing (HTS) platforms now exceeds the growth stipulated by Moore's Law.
The HTS data is expected to surpass those of other "big data" domains such as
astronomy, before the year 2025. In addition to sequencing genomes for research
purposes, ... | [
{
"created": "Tue, 9 Feb 2016 15:23:38 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Feb 2016 11:19:35 GMT",
"version": "v2"
}
] | 2016-02-22 | [
[
"Ileri",
"Atalay M.",
""
],
[
"Ozercan",
"Halil I.",
""
],
[
"Gundogdu",
"Alper",
""
],
[
"Senol",
"Ahmet K.",
""
],
[
"Ozkaya",
"M. Yusuf",
""
],
[
"Alkan",
"Can",
""
]
] | Rate of growth of the amount of data generated using the high throughput sequencing (HTS) platforms now exceeds the growth stipulated by Moore's Law. The HTS data is expected to surpass those of other "big data" domains such as astronomy, before the year 2025. In addition to sequencing genomes for research purposes, ge... |
2006.03377 | Emil Bj\"ornson | Emil Bj\"ornson, \"Ozgecan \"Ozdogan, Erik G. Larsson | Reconfigurable Intelligent Surfaces: Three Myths and Two Critical
Questions | To appear in IEEE Communications Magazine, 7 pages, 6 figures | IEEE Communications Magazine, vol. 58, no. 12, pp. 90-96, December
2020 | 10.1109/MCOM.001.2000407 | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The search for physical-layer technologies that can play a key role in
beyond-5G systems has started. One option is reconfigurable intelligent
surfaces (RIS), which can collect wireless signals from a transmitter and
passively beamform them towards the receiver. The technology has exciting
prospects and is quickly ga... | [
{
"created": "Fri, 5 Jun 2020 11:25:32 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Oct 2020 14:01:49 GMT",
"version": "v2"
}
] | 2021-01-05 | [
[
"Björnson",
"Emil",
""
],
[
"Özdogan",
"Özgecan",
""
],
[
"Larsson",
"Erik G.",
""
]
] | The search for physical-layer technologies that can play a key role in beyond-5G systems has started. One option is reconfigurable intelligent surfaces (RIS), which can collect wireless signals from a transmitter and passively beamform them towards the receiver. The technology has exciting prospects and is quickly gain... |
2005.07174 | Elena Kochkina | Elena Kochkina and Maria Liakata | Estimating predictive uncertainty for rumour verification models | Accepted to the Annual Conference of the Association for
Computational Linguistics (ACL) 2020 | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | The inability to correctly resolve rumours circulating online can have
harmful real-world consequences. We present a method for incorporating model
and data uncertainty estimates into natural language processing models for
automatic rumour verification. We show that these estimates can be used to
filter out model pre... | [
{
"created": "Thu, 14 May 2020 17:42:25 GMT",
"version": "v1"
}
] | 2020-05-15 | [
[
"Kochkina",
"Elena",
""
],
[
"Liakata",
"Maria",
""
]
] | The inability to correctly resolve rumours circulating online can have harmful real-world consequences. We present a method for incorporating model and data uncertainty estimates into natural language processing models for automatic rumour verification. We show that these estimates can be used to filter out model predi... |
1506.09061 | Darryl Hill | Prosenjit Bose, Darryl Hill, and Michiel Smid | Improved Spanning Ratio for Low Degree Plane Spanners | 39 pages, appendix has been integrated into the main paper | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe an algorithm that builds a plane spanner with a maximum degree of
8 and a spanning ratio of approximately 4.414 with respect to the complete
graph. This is the best currently known spanning ratio for a plane spanner with
a maximum degree of less than 14.
| [
{
"created": "Tue, 30 Jun 2015 12:35:02 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Jul 2015 18:19:53 GMT",
"version": "v2"
}
] | 2015-07-03 | [
[
"Bose",
"Prosenjit",
""
],
[
"Hill",
"Darryl",
""
],
[
"Smid",
"Michiel",
""
]
] | We describe an algorithm that builds a plane spanner with a maximum degree of 8 and a spanning ratio of approximately 4.414 with respect to the complete graph. This is the best currently known spanning ratio for a plane spanner with a maximum degree of less than 14. |
2208.08759 | Benjamin Doerr | Benjamin Doerr and Zhongdi Qu | Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover | Extended version of a paper that appears in the proceedings of AAAI
2023 | null | null | null | cs.NE cs.AI cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Very recently, the first mathematical runtime analyses for the NSGA-II, the
most common multi-objective evolutionary algorithm, have been conducted.
Continuing this research direction, we prove that the NSGA-II optimizes the
OneJumpZeroJump benchmark asymptotically faster when crossover is employed.
Together with a p... | [
{
"created": "Thu, 18 Aug 2022 10:41:44 GMT",
"version": "v1"
},
{
"created": "Wed, 15 Mar 2023 08:58:10 GMT",
"version": "v2"
}
] | 2023-03-16 | [
[
"Doerr",
"Benjamin",
""
],
[
"Qu",
"Zhongdi",
""
]
] | Very recently, the first mathematical runtime analyses for the NSGA-II, the most common multi-objective evolutionary algorithm, have been conducted. Continuing this research direction, we prove that the NSGA-II optimizes the OneJumpZeroJump benchmark asymptotically faster when crossover is employed. Together with a par... |
2111.01625 | Xutian Deng | Xutian Deng, Yiting Chen, Fei Chen and Miao Li | Learning Robotic Ultrasound Scanning Skills via Human Demonstrations and
Guided Explorations | null | null | 10.1109/ROBIO54168.2021.9739464 | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Medical ultrasound has become a routine examination approach nowadays and is
widely adopted for different medical applications, so it is desired to have a
robotic ultrasound system to perform the ultrasound scanning autonomously.
However, the ultrasound scanning skill is considerably complex, which highly
depends on ... | [
{
"created": "Tue, 2 Nov 2021 14:38:09 GMT",
"version": "v1"
}
] | 2023-07-27 | [
[
"Deng",
"Xutian",
""
],
[
"Chen",
"Yiting",
""
],
[
"Chen",
"Fei",
""
],
[
"Li",
"Miao",
""
]
] | Medical ultrasound has become a routine examination approach nowadays and is widely adopted for different medical applications, so it is desired to have a robotic ultrasound system to perform the ultrasound scanning autonomously. However, the ultrasound scanning skill is considerably complex, which highly depends on th... |
2001.11595 | Matteo Pirotta | Jian Qian, Ronan Fruit, Matteo Pirotta, Alessandro Lazaric | Concentration Inequalities for Multinoulli Random Variables | Tutorial at ALT'19 on Regret Minimization in Infinite-Horizon Finite
Markov Decision Processes | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate concentration inequalities for Dirichlet and Multinomial
random variables.
| [
{
"created": "Thu, 30 Jan 2020 22:44:15 GMT",
"version": "v1"
}
] | 2020-02-03 | [
[
"Qian",
"Jian",
""
],
[
"Fruit",
"Ronan",
""
],
[
"Pirotta",
"Matteo",
""
],
[
"Lazaric",
"Alessandro",
""
]
] | We investigate concentration inequalities for Dirichlet and Multinomial random variables. |
2403.08245 | Shawn Tan | Shawn Tan, Yikang Shen, Rameswar Panda, Aaron Courville | Scattered Mixture-of-Experts Implementation | null | null | null | null | cs.LG cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present ScatterMoE, an implementation of Sparse Mixture-of-Experts (SMoE)
on GPUs. ScatterMoE builds upon existing implementations, and overcoming some
of the limitations to improve inference and training speed, and memory
footprint. This implementation achieves this by avoiding padding and making
excessive copies... | [
{
"created": "Wed, 13 Mar 2024 05:00:23 GMT",
"version": "v1"
}
] | 2024-03-14 | [
[
"Tan",
"Shawn",
""
],
[
"Shen",
"Yikang",
""
],
[
"Panda",
"Rameswar",
""
],
[
"Courville",
"Aaron",
""
]
] | We present ScatterMoE, an implementation of Sparse Mixture-of-Experts (SMoE) on GPUs. ScatterMoE builds upon existing implementations, and overcoming some of the limitations to improve inference and training speed, and memory footprint. This implementation achieves this by avoiding padding and making excessive copies o... |
2206.08422 | Henning U. Voss | Henning U. Voss | Real-time motion amplification on mobile devices | Supplemental data at https://doi.org/10.6084/m9.figshare.20084981.v2.
Changes to v1: Inclusion of offline video processing | null | null | null | cs.GR cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | A simple motion amplification algorithm suitable for real-time applications
on mobile devices, including smartphones, is presented. It is based on motion
enhancement by moving average differencing (MEMAD), a temporal high-pass filter
for video streams. MEMAD can amplify small moving objects or subtle motion in
larger... | [
{
"created": "Thu, 16 Jun 2022 19:48:00 GMT",
"version": "v1"
},
{
"created": "Wed, 10 May 2023 13:34:50 GMT",
"version": "v2"
}
] | 2023-05-11 | [
[
"Voss",
"Henning U.",
""
]
] | A simple motion amplification algorithm suitable for real-time applications on mobile devices, including smartphones, is presented. It is based on motion enhancement by moving average differencing (MEMAD), a temporal high-pass filter for video streams. MEMAD can amplify small moving objects or subtle motion in larger o... |
2204.05169 | Vishal Sunder | Vishal Sunder, Samuel Thomas, Hong-Kwang J. Kuo, Jatin Ganhotra, Brian
Kingsbury, Eric Fosler-Lussier | Towards End-to-End Integration of Dialog History for Improved Spoken
Language Understanding | 5 pages, 1 figure | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Dialog history plays an important role in spoken language understanding (SLU)
performance in a dialog system. For end-to-end (E2E) SLU, previous work has
used dialog history in text form, which makes the model dependent on a cascaded
automatic speech recognizer (ASR). This rescinds the benefits of an E2E system
which... | [
{
"created": "Mon, 11 Apr 2022 14:56:05 GMT",
"version": "v1"
}
] | 2022-04-12 | [
[
"Sunder",
"Vishal",
""
],
[
"Thomas",
"Samuel",
""
],
[
"Kuo",
"Hong-Kwang J.",
""
],
[
"Ganhotra",
"Jatin",
""
],
[
"Kingsbury",
"Brian",
""
],
[
"Fosler-Lussier",
"Eric",
""
]
] | Dialog history plays an important role in spoken language understanding (SLU) performance in a dialog system. For end-to-end (E2E) SLU, previous work has used dialog history in text form, which makes the model dependent on a cascaded automatic speech recognizer (ASR). This rescinds the benefits of an E2E system which i... |
2408.05184 | Denis Kokosinskii | Denis Kokosinskii, Mikhail Kuklin, Nikolay Arefyev | Deep-change at AXOLOTL-24: Orchestrating WSD and WSI Models for Semantic
Change Modeling | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | This paper describes our solution of the first subtask from the AXOLOTL-24
shared task on Semantic Change Modeling. The goal of this subtask is to
distribute a given set of usages of a polysemous word from a newer time period
between senses of this word from an older time period and clusters representing
gained sense... | [
{
"created": "Fri, 9 Aug 2024 17:15:54 GMT",
"version": "v1"
}
] | 2024-08-12 | [
[
"Kokosinskii",
"Denis",
""
],
[
"Kuklin",
"Mikhail",
""
],
[
"Arefyev",
"Nikolay",
""
]
] | This paper describes our solution of the first subtask from the AXOLOTL-24 shared task on Semantic Change Modeling. The goal of this subtask is to distribute a given set of usages of a polysemous word from a newer time period between senses of this word from an older time period and clusters representing gained senses ... |
1212.3631 | Pablo Sprechmann | Pablo Sprechmann, Alex M. Bronstein and Guillermo Sapiro | Learning efficient sparse and low rank models | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Parsimony, including sparsity and low rank, has been shown to successfully
model data in numerous machine learning and signal processing tasks.
Traditionally, such modeling approaches rely on an iterative algorithm that
minimizes an objective function with parsimony-promoting terms. The inherently
sequential structur... | [
{
"created": "Fri, 14 Dec 2012 22:50:44 GMT",
"version": "v1"
}
] | 2012-12-18 | [
[
"Sprechmann",
"Pablo",
""
],
[
"Bronstein",
"Alex M.",
""
],
[
"Sapiro",
"Guillermo",
""
]
] | Parsimony, including sparsity and low rank, has been shown to successfully model data in numerous machine learning and signal processing tasks. Traditionally, such modeling approaches rely on an iterative algorithm that minimizes an objective function with parsimony-promoting terms. The inherently sequential structure ... |
2205.14440 | Leye Wang | Xiao Han, Leye Wang, Junjie Wu, Yuncong Yang | Large-Scale Privacy-Preserving Network Embedding against Private Link
Inference Attacks | null | null | null | null | cs.LG cs.AI cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network embedding represents network nodes by a low-dimensional informative
vector. While it is generally effective for various downstream tasks, it may
leak some private information of networks, such as hidden private links. In
this work, we address a novel problem of privacy-preserving network embedding
against pri... | [
{
"created": "Sat, 28 May 2022 13:59:39 GMT",
"version": "v1"
}
] | 2022-05-31 | [
[
"Han",
"Xiao",
""
],
[
"Wang",
"Leye",
""
],
[
"Wu",
"Junjie",
""
],
[
"Yang",
"Yuncong",
""
]
] | Network embedding represents network nodes by a low-dimensional informative vector. While it is generally effective for various downstream tasks, it may leak some private information of networks, such as hidden private links. In this work, we address a novel problem of privacy-preserving network embedding against priva... |
2007.00328 | Hui Li | Hui Li, Xiao-Jun Wu, Tariq Durrani | NestFuse: An Infrared and Visible Image Fusion Architecture based on
Nest Connection and Spatial/Channel Attention Models | 12 pages, 13 figures, 6 tables. IEEE Transactions on Instrumentation
and Measurement | null | 10.1109/TIM.2020.3005230 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose a novel method for infrared and visible image fusion
where we develop nest connection-based network and spatial/channel attention
models. The nest connection-based network can preserve significant amounts of
information from input data in a multi-scale perspective. The approach
comprises thre... | [
{
"created": "Wed, 1 Jul 2020 08:46:23 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Jul 2020 06:31:34 GMT",
"version": "v2"
}
] | 2020-07-14 | [
[
"Li",
"Hui",
""
],
[
"Wu",
"Xiao-Jun",
""
],
[
"Durrani",
"Tariq",
""
]
] | In this paper we propose a novel method for infrared and visible image fusion where we develop nest connection-based network and spatial/channel attention models. The nest connection-based network can preserve significant amounts of information from input data in a multi-scale perspective. The approach comprises three ... |
2006.03423 | Kieran Chin-Cheong | Kieran Chin-Cheong, Thomas Sutter and Julia E. Vogt | Generation of Differentially Private Heterogeneous Electronic Health
Records | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Electronic Health Records (EHRs) are commonly used by the machine learning
community for research on problems specifically related to health care and
medicine. EHRs have the advantages that they can be easily distributed and
contain many features useful for e.g. classification problems. What makes EHR
data sets diffe... | [
{
"created": "Fri, 5 Jun 2020 13:21:46 GMT",
"version": "v1"
}
] | 2020-06-08 | [
[
"Chin-Cheong",
"Kieran",
""
],
[
"Sutter",
"Thomas",
""
],
[
"Vogt",
"Julia E.",
""
]
] | Electronic Health Records (EHRs) are commonly used by the machine learning community for research on problems specifically related to health care and medicine. EHRs have the advantages that they can be easily distributed and contain many features useful for e.g. classification problems. What makes EHR data sets differe... |
1504.04930 | Wentao Huang | Wentao Huang and Michael Langberg and Joerg Kliewer | Connecting Multiple-unicast and Network Error Correction: Reduction and
Unachievability | ISIT 2015. arXiv admin note: text overlap with arXiv:1410.1905 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that solving a multiple-unicast network coding problem can be reduced
to solving a single-unicast network error correction problem, where an
adversary may jam at most a single edge in the network. Specifically, we
present an efficient reduction that maps a multiple-unicast network coding
instance to a network... | [
{
"created": "Mon, 20 Apr 2015 04:02:35 GMT",
"version": "v1"
}
] | 2015-04-21 | [
[
"Huang",
"Wentao",
""
],
[
"Langberg",
"Michael",
""
],
[
"Kliewer",
"Joerg",
""
]
] | We show that solving a multiple-unicast network coding problem can be reduced to solving a single-unicast network error correction problem, where an adversary may jam at most a single edge in the network. Specifically, we present an efficient reduction that maps a multiple-unicast network coding instance to a network e... |
2401.07745 | Doris Yan | Mi Yan, Jiazhao Zhang, Yan Zhu, He Wang | MaskClustering: View Consensus based Mask Graph Clustering for
Open-Vocabulary 3D Instance Segmentation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Open-vocabulary 3D instance segmentation is cutting-edge for its ability to
segment 3D instances without predefined categories. However, progress in 3D
lags behind its 2D counterpart due to limited annotated 3D data. To address
this, recent works first generate 2D open-vocabulary masks through 2D models
and then merg... | [
{
"created": "Mon, 15 Jan 2024 14:56:15 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Apr 2024 15:30:23 GMT",
"version": "v2"
}
] | 2024-04-11 | [
[
"Yan",
"Mi",
""
],
[
"Zhang",
"Jiazhao",
""
],
[
"Zhu",
"Yan",
""
],
[
"Wang",
"He",
""
]
] | Open-vocabulary 3D instance segmentation is cutting-edge for its ability to segment 3D instances without predefined categories. However, progress in 3D lags behind its 2D counterpart due to limited annotated 3D data. To address this, recent works first generate 2D open-vocabulary masks through 2D models and then merge ... |
2405.19074 | Dipam Goswami Mr. | Dipam Goswami, Albin Soutif--Cormerais, Yuyang Liu, Sandesh Kamath,
Bart{\l}omiej Twardowski, Joost van de Weijer | Resurrecting Old Classes with New Data for Exemplar-Free Continual
Learning | Accepted at CVPR 2024 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Continual learning methods are known to suffer from catastrophic forgetting,
a phenomenon that is particularly hard to counter for methods that do not store
exemplars of previous tasks. Therefore, to reduce potential drift in the
feature extractor, existing exemplar-free methods are typically evaluated in
settings wh... | [
{
"created": "Wed, 29 May 2024 13:31:42 GMT",
"version": "v1"
}
] | 2024-05-30 | [
[
"Goswami",
"Dipam",
""
],
[
"Soutif--Cormerais",
"Albin",
""
],
[
"Liu",
"Yuyang",
""
],
[
"Kamath",
"Sandesh",
""
],
[
"Twardowski",
"Bartłomiej",
""
],
[
"van de Weijer",
"Joost",
""
]
] | Continual learning methods are known to suffer from catastrophic forgetting, a phenomenon that is particularly hard to counter for methods that do not store exemplars of previous tasks. Therefore, to reduce potential drift in the feature extractor, existing exemplar-free methods are typically evaluated in settings wher... |
2312.01330 | Asaf Shabtai | Roy Peled, Eran Aizikovich, Edan Habler, Yuval Elovici, Asaf Shabtai | Evaluating the Security of Satellite Systems | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Satellite systems are facing an ever-increasing amount of cybersecurity
threats as their role in communications, navigation, and other services
expands. Recent papers have examined attacks targeting satellites and space
systems; however, they did not comprehensively analyze the threats to
satellites and systematicall... | [
{
"created": "Sun, 3 Dec 2023 09:38:28 GMT",
"version": "v1"
}
] | 2023-12-05 | [
[
"Peled",
"Roy",
""
],
[
"Aizikovich",
"Eran",
""
],
[
"Habler",
"Edan",
""
],
[
"Elovici",
"Yuval",
""
],
[
"Shabtai",
"Asaf",
""
]
] | Satellite systems are facing an ever-increasing amount of cybersecurity threats as their role in communications, navigation, and other services expands. Recent papers have examined attacks targeting satellites and space systems; however, they did not comprehensively analyze the threats to satellites and systematically ... |
2102.09032 | Karl B\"ackstr\"om | Karl B\"ackstr\"om, Ivan Walulya, Marina Papatriantafilou, Philippas
Tsigas | Consistent Lock-free Parallel Stochastic Gradient Descent for Fast and
Stable Convergence | 13 pages, 10 figures. Accepted in the 35th IEEE International
Parallel & Distributed Processing Symposium | null | null | null | cs.DC cs.DS | http://creativecommons.org/licenses/by/4.0/ | Stochastic gradient descent (SGD) is an essential element in Machine Learning
(ML) algorithms. Asynchronous parallel shared-memory SGD (AsyncSGD), including
synchronization-free algorithms, e.g. HOGWILD!, have received interest in
certain contexts, due to reduced overhead compared to synchronous
parallelization. Desp... | [
{
"created": "Wed, 17 Feb 2021 21:24:44 GMT",
"version": "v1"
}
] | 2021-02-19 | [
[
"Bäckström",
"Karl",
""
],
[
"Walulya",
"Ivan",
""
],
[
"Papatriantafilou",
"Marina",
""
],
[
"Tsigas",
"Philippas",
""
]
] | Stochastic gradient descent (SGD) is an essential element in Machine Learning (ML) algorithms. Asynchronous parallel shared-memory SGD (AsyncSGD), including synchronization-free algorithms, e.g. HOGWILD!, have received interest in certain contexts, due to reduced overhead compared to synchronous parallelization. Despit... |
2407.08028 | Bingjie Tang | Bingjie Tang, Iretiayo Akinola, Jie Xu, Bowen Wen, Ankur Handa, Karl
Van Wyk, Dieter Fox, Gaurav S. Sukhatme, Fabio Ramos, Yashraj Narang | AutoMate: Specialist and Generalist Assembly Policies over Diverse
Geometries | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robotic assembly for high-mixture settings requires adaptivity to diverse
parts and poses, which is an open challenge. Meanwhile, in other areas of
robotics, large models and sim-to-real have led to tremendous progress.
Inspired by such work, we present AutoMate, a learning framework and system
that consists of 4 par... | [
{
"created": "Wed, 10 Jul 2024 20:11:29 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Aug 2024 01:01:45 GMT",
"version": "v2"
}
] | 2024-08-02 | [
[
"Tang",
"Bingjie",
""
],
[
"Akinola",
"Iretiayo",
""
],
[
"Xu",
"Jie",
""
],
[
"Wen",
"Bowen",
""
],
[
"Handa",
"Ankur",
""
],
[
"Van Wyk",
"Karl",
""
],
[
"Fox",
"Dieter",
""
],
[
"Sukhatme",
"... | Robotic assembly for high-mixture settings requires adaptivity to diverse parts and poses, which is an open challenge. Meanwhile, in other areas of robotics, large models and sim-to-real have led to tremendous progress. Inspired by such work, we present AutoMate, a learning framework and system that consists of 4 parts... |
2204.03456 | Rafael Rego Drumond | Lukas Brinkmeyer and Rafael Rego Drumond and Johannes Burchert and
Lars Schmidt-Thieme | Few-Shot Forecasting of Time-Series with Heterogeneous Channels | Under review. Equal contribution (Brinkmeyer and Rego Drumond) | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning complex time series forecasting models usually requires a large
amount of data, as each model is trained from scratch for each task/data set.
Leveraging learning experience with similar datasets is a well-established
technique for classification problems called few-shot classification. However,
existing appr... | [
{
"created": "Thu, 7 Apr 2022 14:02:15 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Aug 2022 14:27:13 GMT",
"version": "v2"
}
] | 2022-08-19 | [
[
"Brinkmeyer",
"Lukas",
""
],
[
"Drumond",
"Rafael Rego",
""
],
[
"Burchert",
"Johannes",
""
],
[
"Schmidt-Thieme",
"Lars",
""
]
] | Learning complex time series forecasting models usually requires a large amount of data, as each model is trained from scratch for each task/data set. Leveraging learning experience with similar datasets is a well-established technique for classification problems called few-shot classification. However, existing approa... |
2306.01457 | Stefan Arnold | Stefan Arnold, Dilara Yesilbas, Sven Weinzierl | Driving Context into Text-to-Text Privatization | null | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | \textit{Metric Differential Privacy} enables text-to-text privatization by
adding calibrated noise to the vector of a word derived from an embedding space
and projecting this noisy vector back to a discrete vocabulary using a nearest
neighbor search. Since words are substituted without context, this mechanism is
expe... | [
{
"created": "Fri, 2 Jun 2023 11:33:06 GMT",
"version": "v1"
}
] | 2023-06-05 | [
[
"Arnold",
"Stefan",
""
],
[
"Yesilbas",
"Dilara",
""
],
[
"Weinzierl",
"Sven",
""
]
] | \textit{Metric Differential Privacy} enables text-to-text privatization by adding calibrated noise to the vector of a word derived from an embedding space and projecting this noisy vector back to a discrete vocabulary using a nearest neighbor search. Since words are substituted without context, this mechanism is expect... |
2202.10019 | Md. Rafat Rahman Tushar | Ismot Sadik Peyas, Zahid Hasan, Md. Rafat Rahman Tushar, Al Musabbir,
Raisa Mehjabin Azni, Shahnewaz Siddique | Autonomous Warehouse Robot using Deep Q-Learning | TENCON 2021 | null | 10.1109/TENCON54134.2021.9707256 | null | cs.RO cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In warehouses, specialized agents need to navigate, avoid obstacles and
maximize the use of space in the warehouse environment. Due to the
unpredictability of these environments, reinforcement learning approaches can
be applied to complete these tasks. In this paper, we propose using Deep
Reinforcement Learning (DRL)... | [
{
"created": "Mon, 21 Feb 2022 07:16:51 GMT",
"version": "v1"
}
] | 2022-02-22 | [
[
"Peyas",
"Ismot Sadik",
""
],
[
"Hasan",
"Zahid",
""
],
[
"Tushar",
"Md. Rafat Rahman",
""
],
[
"Musabbir",
"Al",
""
],
[
"Azni",
"Raisa Mehjabin",
""
],
[
"Siddique",
"Shahnewaz",
""
]
] | In warehouses, specialized agents need to navigate, avoid obstacles and maximize the use of space in the warehouse environment. Due to the unpredictability of these environments, reinforcement learning approaches can be applied to complete these tasks. In this paper, we propose using Deep Reinforcement Learning (DRL) t... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.