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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2106.11652 | Zhiwei Xu | Zhiwei Xu, Dapeng Li, Yunpeng Bai, Guoliang Fan | MMD-MIX: Value Function Factorisation with Maximum Mean Discrepancy for
Cooperative Multi-Agent Reinforcement Learning | 7 pages, 2 figures, 2 tables. Accepted by IJCNN 2021 | null | null | null | cs.MA cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the real world, many tasks require multiple agents to cooperate with each
other under the condition of local observations. To solve such problems, many
multi-agent reinforcement learning methods based on Centralized Training with
Decentralized Execution have been proposed. One representative class of work is
value... | [
{
"created": "Tue, 22 Jun 2021 10:21:00 GMT",
"version": "v1"
}
] | 2021-06-23 | [
[
"Xu",
"Zhiwei",
""
],
[
"Li",
"Dapeng",
""
],
[
"Bai",
"Yunpeng",
""
],
[
"Fan",
"Guoliang",
""
]
] | In the real world, many tasks require multiple agents to cooperate with each other under the condition of local observations. To solve such problems, many multi-agent reinforcement learning methods based on Centralized Training with Decentralized Execution have been proposed. One representative class of work is value d... |
2405.11092 | Yuya Asano | Yuya Asano, Diane Litman, Quentin King-Shepard, Tristan Maidment,
Tyree Langley, Teresa Davison, Timothy Nokes-Malach, Adriana Kovashka, Erin
Walker | What metrics of participation balance predict outcomes of collaborative
learning with a robot? | To appear in Seventeenth International Conference on Educational Data
Mining (EDM 2024) | null | null | null | cs.HC cs.RO | http://creativecommons.org/licenses/by/4.0/ | One of the keys to the success of collaborative learning is balanced
participation by all learners, but this does not always happen naturally.
Pedagogical robots have the potential to facilitate balance. However, it
remains unclear what participation balance robots should aim at; various
metrics have been proposed, b... | [
{
"created": "Fri, 17 May 2024 21:06:34 GMT",
"version": "v1"
}
] | 2024-05-21 | [
[
"Asano",
"Yuya",
""
],
[
"Litman",
"Diane",
""
],
[
"King-Shepard",
"Quentin",
""
],
[
"Maidment",
"Tristan",
""
],
[
"Langley",
"Tyree",
""
],
[
"Davison",
"Teresa",
""
],
[
"Nokes-Malach",
"Timothy",
""
... | One of the keys to the success of collaborative learning is balanced participation by all learners, but this does not always happen naturally. Pedagogical robots have the potential to facilitate balance. However, it remains unclear what participation balance robots should aim at; various metrics have been proposed, but... |
2004.02003 | Sudhanshu Sane | Sudhanshu Sane, Abhishek Yenpure, Roxana Bujack, Matthew Larsen,
Kenneth Moreland, Christoph Garth and Hank Childs | Scalable In Situ Lagrangian Flow Map Extraction: Demonstrating the
Viability of a Communication-Free Model | null | null | 10.2312/pgv.20211040 | null | cs.CE cs.DC physics.comp-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce and evaluate a new algorithm for the in situ extraction of
Lagrangian flow maps, which we call Boundary Termination Optimization (BTO).
Our approach is a communication-free model, requiring no message passing or
synchronization between processes, improving scalability, thereby reducing
overall execution ... | [
{
"created": "Sat, 4 Apr 2020 19:21:28 GMT",
"version": "v1"
}
] | 2021-09-06 | [
[
"Sane",
"Sudhanshu",
""
],
[
"Yenpure",
"Abhishek",
""
],
[
"Bujack",
"Roxana",
""
],
[
"Larsen",
"Matthew",
""
],
[
"Moreland",
"Kenneth",
""
],
[
"Garth",
"Christoph",
""
],
[
"Childs",
"Hank",
""
]
] | We introduce and evaluate a new algorithm for the in situ extraction of Lagrangian flow maps, which we call Boundary Termination Optimization (BTO). Our approach is a communication-free model, requiring no message passing or synchronization between processes, improving scalability, thereby reducing overall execution ti... |
2010.11413 | Baihan Lin | Baihan Lin, Djallel Bouneffouf, Guillermo Cecchi | Predicting human decision making in psychological tasks with recurrent
neural networks | To appear in PLOS ONE. Codes at https://github.com/doerlbh/HumanLSTM | PLOS ONE 17(5): e0267907 (2022) | 10.1371/journal.pone.0267907 | null | cs.LG cs.AI q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unlike traditional time series, the action sequences of human decision making
usually involve many cognitive processes such as beliefs, desires, intentions,
and theory of mind, i.e., what others are thinking. This makes predicting human
decision-making challenging to be treated agnostically to the underlying
psycholo... | [
{
"created": "Thu, 22 Oct 2020 03:36:03 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Nov 2021 22:45:58 GMT",
"version": "v2"
},
{
"created": "Wed, 20 Apr 2022 16:28:20 GMT",
"version": "v3"
}
] | 2022-06-07 | [
[
"Lin",
"Baihan",
""
],
[
"Bouneffouf",
"Djallel",
""
],
[
"Cecchi",
"Guillermo",
""
]
] | Unlike traditional time series, the action sequences of human decision making usually involve many cognitive processes such as beliefs, desires, intentions, and theory of mind, i.e., what others are thinking. This makes predicting human decision-making challenging to be treated agnostically to the underlying psychologi... |
1303.3733 | Rodrigo de Lamare | Y. Cai and R. C. de Lamare | Adaptive Reduced-Rank MBER Linear Receive Processing for Large Multiuser
MIMO Systems | 2 figures | ICASSP 2013 | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we propose a novel adaptive reduced-rank strategy based on
joint interpolation, decimation and filtering (JIDF) for large multiuser
multiple-input multiple-output (MIMO) systems. In this scheme, a reduced-rank
framework is proposed for linear receive processing and multiuser interference
suppression acc... | [
{
"created": "Fri, 15 Mar 2013 11:13:29 GMT",
"version": "v1"
}
] | 2013-03-18 | [
[
"Cai",
"Y.",
""
],
[
"de Lamare",
"R. C.",
""
]
] | In this work, we propose a novel adaptive reduced-rank strategy based on joint interpolation, decimation and filtering (JIDF) for large multiuser multiple-input multiple-output (MIMO) systems. In this scheme, a reduced-rank framework is proposed for linear receive processing and multiuser interference suppression accor... |
1810.13098 | Chao Li | Chao Li, Zhun Sun, Jinshi Yu, Ming Hou and Qibin Zhao | Low-Rank Embedding of Kernels in Convolutional Neural Networks under
Random Shuffling | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although the convolutional neural networks (CNNs) have become popular for
various image processing and computer vision task recently, it remains a
challenging problem to reduce the storage cost of the parameters for
resource-limited platforms. In the previous studies, tensor decomposition (TD)
has achieved promising ... | [
{
"created": "Wed, 31 Oct 2018 04:05:54 GMT",
"version": "v1"
}
] | 2018-11-01 | [
[
"Li",
"Chao",
""
],
[
"Sun",
"Zhun",
""
],
[
"Yu",
"Jinshi",
""
],
[
"Hou",
"Ming",
""
],
[
"Zhao",
"Qibin",
""
]
] | Although the convolutional neural networks (CNNs) have become popular for various image processing and computer vision task recently, it remains a challenging problem to reduce the storage cost of the parameters for resource-limited platforms. In the previous studies, tensor decomposition (TD) has achieved promising co... |
2010.01695 | Marius Schubert | Marius Schubert, Karsten Kahl, Matthias Rottmann | MetaDetect: Uncertainty Quantification and Prediction Quality Estimates
for Object Detection | 11 pages, 5 figures, 5 tables | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In object detection with deep neural networks, the box-wise objectness score
tends to be overconfident, sometimes even indicating high confidence in
presence of inaccurate predictions. Hence, the reliability of the prediction
and therefore reliable uncertainties are of highest interest. In this work, we
present a pos... | [
{
"created": "Sun, 4 Oct 2020 21:49:23 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Oct 2020 15:38:53 GMT",
"version": "v2"
}
] | 2020-10-07 | [
[
"Schubert",
"Marius",
""
],
[
"Kahl",
"Karsten",
""
],
[
"Rottmann",
"Matthias",
""
]
] | In object detection with deep neural networks, the box-wise objectness score tends to be overconfident, sometimes even indicating high confidence in presence of inaccurate predictions. Hence, the reliability of the prediction and therefore reliable uncertainties are of highest interest. In this work, we present a post ... |
2307.03493 | Gamze \.Islamo\u{g}lu | Gamze \.Islamo\u{g}lu, Moritz Scherer, Gianna Paulin, Tim Fischer,
Victor J.B. Jung, Angelo Garofalo, Luca Benini | ITA: An Energy-Efficient Attention and Softmax Accelerator for Quantized
Transformers | Accepted for publication at the 2023 ACM/IEEE International Symposium
on Low Power Electronics and Design (ISLPED) | null | 10.1109/ISLPED58423.2023.10244348 | null | cs.AR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transformer networks have emerged as the state-of-the-art approach for
natural language processing tasks and are gaining popularity in other domains
such as computer vision and audio processing. However, the efficient hardware
acceleration of transformer models poses new challenges due to their high
arithmetic intens... | [
{
"created": "Fri, 7 Jul 2023 10:05:38 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Jul 2023 06:08:45 GMT",
"version": "v2"
}
] | 2024-07-29 | [
[
"İslamoğlu",
"Gamze",
""
],
[
"Scherer",
"Moritz",
""
],
[
"Paulin",
"Gianna",
""
],
[
"Fischer",
"Tim",
""
],
[
"Jung",
"Victor J. B.",
""
],
[
"Garofalo",
"Angelo",
""
],
[
"Benini",
"Luca",
""
]
] | Transformer networks have emerged as the state-of-the-art approach for natural language processing tasks and are gaining popularity in other domains such as computer vision and audio processing. However, the efficient hardware acceleration of transformer models poses new challenges due to their high arithmetic intensit... |
2401.01624 | Ying Lv | Ying Lv, Zhi Liu, Gongyang Li | Context-Aware Interaction Network for RGB-T Semantic Segmentation | 13 pages, 7 figures, Accepted by IEEE Transactions on Multimedia 2024 | null | 10.1109/TMM.2023.3349072 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | RGB-T semantic segmentation is a key technique for autonomous driving scenes
understanding. For the existing RGB-T semantic segmentation methods, however,
the effective exploration of the complementary relationship between different
modalities is not implemented in the information interaction between multiple
levels.... | [
{
"created": "Wed, 3 Jan 2024 08:49:29 GMT",
"version": "v1"
}
] | 2024-01-04 | [
[
"Lv",
"Ying",
""
],
[
"Liu",
"Zhi",
""
],
[
"Li",
"Gongyang",
""
]
] | RGB-T semantic segmentation is a key technique for autonomous driving scenes understanding. For the existing RGB-T semantic segmentation methods, however, the effective exploration of the complementary relationship between different modalities is not implemented in the information interaction between multiple levels. T... |
2212.07345 | Federica Nenna | Federica Nenna, Davide Zanardi, Luciano Gamberini | Human-centric telerobotics: investigating users' performance and
workload via VR-based eye-tracking measures | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Virtual Reality (VR) is gaining ground in the robotics and teleoperation
industry, opening new prospects as a novel computerized methodology to make
humans interact with robots. In contrast with more conventional button-based
teleoperations, VR allows users to use their physical movements to drive
robotic systems in ... | [
{
"created": "Wed, 14 Dec 2022 17:13:40 GMT",
"version": "v1"
}
] | 2022-12-15 | [
[
"Nenna",
"Federica",
""
],
[
"Zanardi",
"Davide",
""
],
[
"Gamberini",
"Luciano",
""
]
] | Virtual Reality (VR) is gaining ground in the robotics and teleoperation industry, opening new prospects as a novel computerized methodology to make humans interact with robots. In contrast with more conventional button-based teleoperations, VR allows users to use their physical movements to drive robotic systems in th... |
2210.01951 | Alejandro Lancho | Alejandro Lancho, Alexander Fengler and Yury Polyanskiy | Finite-Blocklength Results for the A-channel: Applications to Unsourced
Random Access and Group Testing | 11 pages, 4 figures, extended version of the paper presented at the
58th Annual Allerton Conference on Communication, Control, and Computing
(2022) | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present finite-blocklength achievability bounds for the unsourced
A-channel. In this multiple-access channel, users noiselessly transmit
codewords picked from a common codebook with entries generated from a $q$-ary
alphabet. At each channel use, the receiver observes the set of different
transmitted symbols but no... | [
{
"created": "Tue, 4 Oct 2022 22:59:10 GMT",
"version": "v1"
}
] | 2022-10-06 | [
[
"Lancho",
"Alejandro",
""
],
[
"Fengler",
"Alexander",
""
],
[
"Polyanskiy",
"Yury",
""
]
] | We present finite-blocklength achievability bounds for the unsourced A-channel. In this multiple-access channel, users noiselessly transmit codewords picked from a common codebook with entries generated from a $q$-ary alphabet. At each channel use, the receiver observes the set of different transmitted symbols but not ... |
0711.0538 | Grenville Croll | Thomas A. Grossman | Spreadsheet Engineering: A Research Framework | 12 Pages | Proc. European Spreadsheet Risks Int. Grp. 2002 23-34 ISBN 1 86166
182 7 | null | null | cs.SE | null | Spreadsheet engineering adapts the lessons of software engineering to
spreadsheets, providing eight principles as a framework for organizing
spreadsheet programming recommendations. Spreadsheets raise issues inadequately
addressed by software engineering. Spreadsheets are a powerful modeling
language, allowing strate... | [
{
"created": "Sun, 4 Nov 2007 19:24:57 GMT",
"version": "v1"
}
] | 2007-11-06 | [
[
"Grossman",
"Thomas A.",
""
]
] | Spreadsheet engineering adapts the lessons of software engineering to spreadsheets, providing eight principles as a framework for organizing spreadsheet programming recommendations. Spreadsheets raise issues inadequately addressed by software engineering. Spreadsheets are a powerful modeling language, allowing strategi... |
1504.03561 | Gregory Gutin | Jason Crampton, Andrei Gagarin, Gregory Gutin, Mark Jones and Magnus
Wahlstrom | On the Workflow Satisfiability Problem with Class-Independent
Constraints | null | null | null | null | cs.CR cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A workflow specification defines sets of steps and users. An authorization
policy determines for each user a subset of steps the user is allowed to
perform. Other security requirements, such as separation-of-duty, impose
constraints on which subsets of users may perform certain subsets of steps. The
\emph{workflow sa... | [
{
"created": "Tue, 14 Apr 2015 14:25:22 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Sep 2015 15:21:23 GMT",
"version": "v2"
}
] | 2015-09-15 | [
[
"Crampton",
"Jason",
""
],
[
"Gagarin",
"Andrei",
""
],
[
"Gutin",
"Gregory",
""
],
[
"Jones",
"Mark",
""
],
[
"Wahlstrom",
"Magnus",
""
]
] | A workflow specification defines sets of steps and users. An authorization policy determines for each user a subset of steps the user is allowed to perform. Other security requirements, such as separation-of-duty, impose constraints on which subsets of users may perform certain subsets of steps. The \emph{workflow sati... |
1509.06470 | Yiyi Liao | Yiyi Liao, Sarath Kodagoda, Yue Wang, Lei Shi, Yong Liu | Understand Scene Categories by Objects: A Semantic Regularized Scene
Classifier Using Convolutional Neural Networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scene classification is a fundamental perception task for environmental
understanding in today's robotics. In this paper, we have attempted to exploit
the use of popular machine learning technique of deep learning to enhance scene
understanding, particularly in robotics applications. As scene images have
larger diver... | [
{
"created": "Tue, 22 Sep 2015 05:43:27 GMT",
"version": "v1"
}
] | 2015-09-23 | [
[
"Liao",
"Yiyi",
""
],
[
"Kodagoda",
"Sarath",
""
],
[
"Wang",
"Yue",
""
],
[
"Shi",
"Lei",
""
],
[
"Liu",
"Yong",
""
]
] | Scene classification is a fundamental perception task for environmental understanding in today's robotics. In this paper, we have attempted to exploit the use of popular machine learning technique of deep learning to enhance scene understanding, particularly in robotics applications. As scene images have larger diversi... |
2205.01197 | Hengyi Wang | Hengyi Wang, Changjae Oh | Boosting Video Object Segmentation based on Scale Inconsistency | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a refinement framework to boost the performance of pre-trained
semi-supervised video object segmentation (VOS) models. Our work is based on
scale inconsistency, which is motivated by the observation that existing VOS
models generate inconsistent predictions from input frames with different
sizes. We use th... | [
{
"created": "Mon, 2 May 2022 20:22:29 GMT",
"version": "v1"
}
] | 2022-05-04 | [
[
"Wang",
"Hengyi",
""
],
[
"Oh",
"Changjae",
""
]
] | We present a refinement framework to boost the performance of pre-trained semi-supervised video object segmentation (VOS) models. Our work is based on scale inconsistency, which is motivated by the observation that existing VOS models generate inconsistent predictions from input frames with different sizes. We use the ... |
1811.10220 | Vladimir Mironov | Vladimir Mironov, Andrey Kudryavtsev, Yuri Alexeev, Alexander
Moskovsky, Igor Kulikov, Igor Chernykh | Evaluation of Intel Memory Drive Technology Performance for Scientific
Applications | null | In Proceedings of the Workshop on Memory Centric High Performance
Computing (MCHPC'18). ACM, New York, NY, USA, 14-21, 2018 | 10.1145/3286475.3286479 | null | cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present benchmark data for Intel Memory Drive Technology
(IMDT), which is a new generation of Software-defined Memory (SDM) based on
Intel ScaleMP collaboration and using 3D XPointTM based Intel Solid-State
Drives (SSDs) called Optane. We studied IMDT performance for synthetic
benchmarks, scientific... | [
{
"created": "Mon, 26 Nov 2018 07:49:13 GMT",
"version": "v1"
}
] | 2018-11-27 | [
[
"Mironov",
"Vladimir",
""
],
[
"Kudryavtsev",
"Andrey",
""
],
[
"Alexeev",
"Yuri",
""
],
[
"Moskovsky",
"Alexander",
""
],
[
"Kulikov",
"Igor",
""
],
[
"Chernykh",
"Igor",
""
]
] | In this paper, we present benchmark data for Intel Memory Drive Technology (IMDT), which is a new generation of Software-defined Memory (SDM) based on Intel ScaleMP collaboration and using 3D XPointTM based Intel Solid-State Drives (SSDs) called Optane. We studied IMDT performance for synthetic benchmarks, scientific k... |
1809.08587 | Ohad Shamir | Ohad Shamir | Exponential Convergence Time of Gradient Descent for One-Dimensional
Deep Linear Neural Networks | Comparison to previous version: Fixed a bug in lemma 1 part 3 (does
not affect any other part of the paper) | null | null | null | cs.LG cs.NE math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the dynamics of gradient descent on objective functions of the form
$f(\prod_{i=1}^{k} w_i)$ (with respect to scalar parameters $w_1,\ldots,w_k$),
which arise in the context of training depth-$k$ linear neural networks. We
prove that for standard random initializations, and under mild assumptions on
$f$, the... | [
{
"created": "Sun, 23 Sep 2018 12:32:45 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Sep 2018 08:37:45 GMT",
"version": "v2"
},
{
"created": "Thu, 27 Dec 2018 08:31:56 GMT",
"version": "v3"
},
{
"created": "Thu, 13 Jun 2019 07:23:22 GMT",
"version": "v4"
}
] | 2019-06-14 | [
[
"Shamir",
"Ohad",
""
]
] | We study the dynamics of gradient descent on objective functions of the form $f(\prod_{i=1}^{k} w_i)$ (with respect to scalar parameters $w_1,\ldots,w_k$), which arise in the context of training depth-$k$ linear neural networks. We prove that for standard random initializations, and under mild assumptions on $f$, the n... |
1507.08322 | Martin Tak\'a\v{c} | Martin Tak\'a\v{c} and Peter Richt\'arik and Nathan Srebro | Distributed Mini-Batch SDCA | null | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an improved analysis of mini-batched stochastic dual coordinate
ascent for regularized empirical loss minimization (i.e. SVM and SVM-type
objectives). Our analysis allows for flexible sampling schemes, including where
data is distribute across machines, and combines a dependence on the smoothness
of the lo... | [
{
"created": "Wed, 29 Jul 2015 21:15:31 GMT",
"version": "v1"
}
] | 2015-07-31 | [
[
"Takáč",
"Martin",
""
],
[
"Richtárik",
"Peter",
""
],
[
"Srebro",
"Nathan",
""
]
] | We present an improved analysis of mini-batched stochastic dual coordinate ascent for regularized empirical loss minimization (i.e. SVM and SVM-type objectives). Our analysis allows for flexible sampling schemes, including where data is distribute across machines, and combines a dependence on the smoothness of the loss... |
1809.01426 | Pascal Ochem | Pamela Fleischmann and Pascal Ochem and Kamellia Reshadi | Repetition avoidance in products of factors | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a variation on a classical avoidance problem from combinatorics
on words that has been introduced by Mousavi and Shallit at DLT 2013. Let
$\texttt{pexp}_i(w)$ be the supremum of the exponent over the products of $i$
factors of the word $w$. The repetition threshold $\texttt{RT}_i(k)$ is then
the infimum o... | [
{
"created": "Wed, 5 Sep 2018 10:36:14 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Apr 2019 16:19:07 GMT",
"version": "v2"
}
] | 2019-04-30 | [
[
"Fleischmann",
"Pamela",
""
],
[
"Ochem",
"Pascal",
""
],
[
"Reshadi",
"Kamellia",
""
]
] | We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let $\texttt{pexp}_i(w)$ be the supremum of the exponent over the products of $i$ factors of the word $w$. The repetition threshold $\texttt{RT}_i(k)$ is then the infimum of ... |
1902.03237 | Cristina Kadar | Cristina Kadar, Rudolf Maculan, Stefan Feuerriegel | Public decision support for low population density areas: An
imbalance-aware hyper-ensemble for spatio-temporal crime prediction | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Crime events are known to reveal spatio-temporal patterns, which can be used
for predictive modeling and subsequent decision support. While the focus has
hitherto been placed on areas with high population density, we address the
challenging undertaking of predicting crime hotspots in regions with low
population densi... | [
{
"created": "Fri, 1 Feb 2019 17:34:05 GMT",
"version": "v1"
}
] | 2019-02-12 | [
[
"Kadar",
"Cristina",
""
],
[
"Maculan",
"Rudolf",
""
],
[
"Feuerriegel",
"Stefan",
""
]
] | Crime events are known to reveal spatio-temporal patterns, which can be used for predictive modeling and subsequent decision support. While the focus has hitherto been placed on areas with high population density, we address the challenging undertaking of predicting crime hotspots in regions with low population densiti... |
2305.12983 | Michael Kranl | Michael Kranl, Hubert Ramsauer and Bernhard Knapp | Why current rain denoising models fail on CycleGAN created rain images
in autonomous driving | 7 pages, 4 figures | null | null | null | cs.CV cs.LG eess.IV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | One of the main tasks of an autonomous agent in a vehicle is to correctly
perceive its environment. Much of the data that needs to be processed is
collected by optical sensors such as cameras. Unfortunately, the data collected
in this way can be affected by a variety of factors, including environmental
influences suc... | [
{
"created": "Mon, 22 May 2023 12:42:32 GMT",
"version": "v1"
}
] | 2023-05-23 | [
[
"Kranl",
"Michael",
""
],
[
"Ramsauer",
"Hubert",
""
],
[
"Knapp",
"Bernhard",
""
]
] | One of the main tasks of an autonomous agent in a vehicle is to correctly perceive its environment. Much of the data that needs to be processed is collected by optical sensors such as cameras. Unfortunately, the data collected in this way can be affected by a variety of factors, including environmental influences such ... |
2111.10338 | Lukas Lindenroth | Lukas Lindenroth, Danail Stoyanov, Kawal Rhode and Hongbin Liu | Towards intrinsic force sensing and control in parallel soft robots | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With soft robotics being increasingly employed in settings demanding high and
controlled contact forces, recent research has demonstrated the use of soft
robots to estimate or intrinsically sense forces without requiring external
sensing mechanisms. Whilst this has mainly been shown in tendon-based continuum
manipula... | [
{
"created": "Fri, 19 Nov 2021 17:39:18 GMT",
"version": "v1"
}
] | 2021-11-22 | [
[
"Lindenroth",
"Lukas",
""
],
[
"Stoyanov",
"Danail",
""
],
[
"Rhode",
"Kawal",
""
],
[
"Liu",
"Hongbin",
""
]
] | With soft robotics being increasingly employed in settings demanding high and controlled contact forces, recent research has demonstrated the use of soft robots to estimate or intrinsically sense forces without requiring external sensing mechanisms. Whilst this has mainly been shown in tendon-based continuum manipulato... |
1809.06016 | Saber Moradi | Saber Moradi, Rajit Manohar | The Impact of On-chip Communication on Memory Technologies for
Neuromorphic Systems | 26 pages, 6 figures, Journal of Physics D: Applied Physics 2018 | null | 10.1088/1361-6463/aae641 | null | cs.AR cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Emergent nanoscale non-volatile memory technologies with high integration
density offer a promising solution to overcome the scalability limitations of
CMOS-based neural networks architectures, by efficiently exhibiting the key
principle of neural computation. Despite the potential improvements in
computational costs... | [
{
"created": "Mon, 17 Sep 2018 04:40:52 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Oct 2018 05:00:47 GMT",
"version": "v2"
}
] | 2018-11-14 | [
[
"Moradi",
"Saber",
""
],
[
"Manohar",
"Rajit",
""
]
] | Emergent nanoscale non-volatile memory technologies with high integration density offer a promising solution to overcome the scalability limitations of CMOS-based neural networks architectures, by efficiently exhibiting the key principle of neural computation. Despite the potential improvements in computational costs, ... |
1703.08252 | Fabricio Murai | Fabricio Murai, Bruno Ribeiro, Don Towsley, Pinghui Wang | Characterizing Directed and Undirected Networks via Multidimensional
Walks with Jumps | 35 pages, submitted to ACM Transactions on Knowledge Discovery from
Data (TKDD) | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Estimating distributions of node characteristics (labels) such as number of
connections or citizenship of users in a social network via edge and node
sampling is a vital part of the study of complex networks. Due to its low cost,
sampling via a random walk (RW) has been proposed as an attractive solution to
this task... | [
{
"created": "Thu, 23 Mar 2017 23:35:53 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Jul 2018 20:10:55 GMT",
"version": "v2"
}
] | 2018-07-17 | [
[
"Murai",
"Fabricio",
""
],
[
"Ribeiro",
"Bruno",
""
],
[
"Towsley",
"Don",
""
],
[
"Wang",
"Pinghui",
""
]
] | Estimating distributions of node characteristics (labels) such as number of connections or citizenship of users in a social network via edge and node sampling is a vital part of the study of complex networks. Due to its low cost, sampling via a random walk (RW) has been proposed as an attractive solution to this task. ... |
1807.09940 | Shuhan Chen | Shuhan Chen, Xiuli Tan, Ben Wang, Xuelong Hu | Reverse Attention for Salient Object Detection | ECCV 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Benefit from the quick development of deep learning techniques, salient
object detection has achieved remarkable progresses recently. However, there
still exists following two major challenges that hinder its application in
embedded devices, low resolution output and heavy model weight. To this end,
this paper presen... | [
{
"created": "Thu, 26 Jul 2018 03:30:57 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Apr 2019 14:46:46 GMT",
"version": "v2"
}
] | 2019-04-16 | [
[
"Chen",
"Shuhan",
""
],
[
"Tan",
"Xiuli",
""
],
[
"Wang",
"Ben",
""
],
[
"Hu",
"Xuelong",
""
]
] | Benefit from the quick development of deep learning techniques, salient object detection has achieved remarkable progresses recently. However, there still exists following two major challenges that hinder its application in embedded devices, low resolution output and heavy model weight. To this end, this paper presents... |
2408.04131 | Tong Liu | Tong Liu, Hadi Meidani | Heterogeneous Graph Sequence Neural Networks for Dynamic Traffic
Assignment | 9 pages, 5 figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Traffic assignment and traffic flow prediction provide critical insights for
urban planning, traffic management, and the development of intelligent
transportation systems. An efficient model for calculating traffic flows over
the entire transportation network could provide a more detailed and realistic
understanding ... | [
{
"created": "Wed, 7 Aug 2024 23:41:09 GMT",
"version": "v1"
}
] | 2024-08-09 | [
[
"Liu",
"Tong",
""
],
[
"Meidani",
"Hadi",
""
]
] | Traffic assignment and traffic flow prediction provide critical insights for urban planning, traffic management, and the development of intelligent transportation systems. An efficient model for calculating traffic flows over the entire transportation network could provide a more detailed and realistic understanding of... |
1907.12849 | Chao Zhang | Chao Zhang, Stephan Liwicki, William Smith, Roberto Cipolla | Orientation-aware Semantic Segmentation on Icosahedron Spheres | 9 pages, accepted to iccv 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address semantic segmentation on omnidirectional images, to leverage a
holistic understanding of the surrounding scene for applications like
autonomous driving systems. For the spherical domain, several methods recently
adopt an icosahedron mesh, but systems are typically rotation invariant or
require significant ... | [
{
"created": "Tue, 30 Jul 2019 11:59:24 GMT",
"version": "v1"
}
] | 2019-07-31 | [
[
"Zhang",
"Chao",
""
],
[
"Liwicki",
"Stephan",
""
],
[
"Smith",
"William",
""
],
[
"Cipolla",
"Roberto",
""
]
] | We address semantic segmentation on omnidirectional images, to leverage a holistic understanding of the surrounding scene for applications like autonomous driving systems. For the spherical domain, several methods recently adopt an icosahedron mesh, but systems are typically rotation invariant or require significant me... |
2011.10280 | Ashiqur KhudaBukhsh Ashiqur Rahman KhudaBukhsh | Rupak Sarkar, Ashiqur R. KhudaBukhsh | Are Chess Discussions Racist? An Adversarial Hate Speech Data Set | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | On June 28, 2020, while presenting a chess podcast on Grandmaster Hikaru
Nakamura, Antonio Radi\'c's YouTube handle got blocked because it contained
"harmful and dangerous" content. YouTube did not give further specific reason,
and the channel got reinstated within 24 hours. However, Radi\'c speculated
that given the... | [
{
"created": "Fri, 20 Nov 2020 08:50:06 GMT",
"version": "v1"
}
] | 2020-11-23 | [
[
"Sarkar",
"Rupak",
""
],
[
"KhudaBukhsh",
"Ashiqur R.",
""
]
] | On June 28, 2020, while presenting a chess podcast on Grandmaster Hikaru Nakamura, Antonio Radi\'c's YouTube handle got blocked because it contained "harmful and dangerous" content. YouTube did not give further specific reason, and the channel got reinstated within 24 hours. However, Radi\'c speculated that given the c... |
2204.13543 | Nick Brown | Nick Brown, Gordon Gibb, Evgenij Belikov, Rupert Nash | Predicting batch queue job wait times for informed scheduling of urgent
HPC workloads | Preprint of article at the 2022 Cray User Group (CUG) | null | null | null | cs.DC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is increasing interest in the use of HPC machines for urgent workloads
to help tackle disasters as they unfold. Whilst batch queue systems are not
ideal in supporting such workloads, many disadvantages can be worked around by
accurately predicting when a waiting job will start to run. However there are
numerous... | [
{
"created": "Thu, 28 Apr 2022 14:51:58 GMT",
"version": "v1"
}
] | 2022-04-29 | [
[
"Brown",
"Nick",
""
],
[
"Gibb",
"Gordon",
""
],
[
"Belikov",
"Evgenij",
""
],
[
"Nash",
"Rupert",
""
]
] | There is increasing interest in the use of HPC machines for urgent workloads to help tackle disasters as they unfold. Whilst batch queue systems are not ideal in supporting such workloads, many disadvantages can be worked around by accurately predicting when a waiting job will start to run. However there are numerous c... |
2207.05300 | Daiheng Gao | Zhou Kangneng, Zhu Xiaobin, Gao Daiheng, Lee Kai, Li Xinjie, Yin
Xu-Cheng | SD-GAN: Semantic Decomposition for Face Image Synthesis with Discrete
Attribute | 16 pages, 12 figures, Accepted by ACM MM2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Manipulating latent code in generative adversarial networks (GANs) for facial
image synthesis mainly focuses on continuous attribute synthesis (e.g., age,
pose and emotion), while discrete attribute synthesis (like face mask and
eyeglasses) receives less attention. Directly applying existing works to facial
discrete ... | [
{
"created": "Tue, 12 Jul 2022 04:23:38 GMT",
"version": "v1"
}
] | 2022-07-13 | [
[
"Kangneng",
"Zhou",
""
],
[
"Xiaobin",
"Zhu",
""
],
[
"Daiheng",
"Gao",
""
],
[
"Kai",
"Lee",
""
],
[
"Xinjie",
"Li",
""
],
[
"Xu-Cheng",
"Yin",
""
]
] | Manipulating latent code in generative adversarial networks (GANs) for facial image synthesis mainly focuses on continuous attribute synthesis (e.g., age, pose and emotion), while discrete attribute synthesis (like face mask and eyeglasses) receives less attention. Directly applying existing works to facial discrete at... |
2309.05632 | Mayank Sewlia | Mayank Sewlia, Christos K. Verginis, Dimos V. Dimarogonas | MAPS$^2$: Multi-Robot Autonomous Motion Planning under Signal Temporal
Logic Specifications | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | This article presents MAPS$^2$ : a distributed algorithm that allows
multi-robot systems to deliver coupled tasks expressed as Signal Temporal Logic
(STL) constraints. Classical control theoretical tools addressing STL
constraints either adopt a limited fragment of the STL formula or require
approximations of min/max... | [
{
"created": "Mon, 11 Sep 2023 17:25:08 GMT",
"version": "v1"
},
{
"created": "Tue, 21 May 2024 13:22:06 GMT",
"version": "v2"
}
] | 2024-05-22 | [
[
"Sewlia",
"Mayank",
""
],
[
"Verginis",
"Christos K.",
""
],
[
"Dimarogonas",
"Dimos V.",
""
]
] | This article presents MAPS$^2$ : a distributed algorithm that allows multi-robot systems to deliver coupled tasks expressed as Signal Temporal Logic (STL) constraints. Classical control theoretical tools addressing STL constraints either adopt a limited fragment of the STL formula or require approximations of min/max o... |
2203.15241 | Pan Zhang | Pan Zhang, Jianmin Bao, Ting Zhang, Dong Chen, Fang Wen | Semi-Supervised Image-to-Image Translation using Latent Space Mapping | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent image-to-image translation works have been transferred from supervised
to unsupervised settings due to the expensive cost of capturing or labeling
large amounts of paired data. However, current unsupervised methods using the
cycle-consistency constraint may not find the desired mapping, especially for
difficul... | [
{
"created": "Tue, 29 Mar 2022 05:14:26 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Zhang",
"Pan",
""
],
[
"Bao",
"Jianmin",
""
],
[
"Zhang",
"Ting",
""
],
[
"Chen",
"Dong",
""
],
[
"Wen",
"Fang",
""
]
] | Recent image-to-image translation works have been transferred from supervised to unsupervised settings due to the expensive cost of capturing or labeling large amounts of paired data. However, current unsupervised methods using the cycle-consistency constraint may not find the desired mapping, especially for difficult ... |
1607.08073 | Adrian Groza | Adrian Groza, Calin Cara, Sergiu Zaporojan, Igor Calmicov | Assisting Drivers During Overtaking Using Car-2-Car Communication and
Multi-Agent Systems | preprint ICCP 2016, Cluj-Napoca | null | null | null | cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A warning system for assisting drivers during overtaking maneuvers is
proposed. The system relies on Car-2-Car communication technologies and
multi-agent systems. A protocol for safety overtaking is proposed based on ACL
communicative acts. The mathematical model for safety overtaking used Kalman
filter to minimize l... | [
{
"created": "Wed, 27 Jul 2016 13:08:13 GMT",
"version": "v1"
}
] | 2016-07-28 | [
[
"Groza",
"Adrian",
""
],
[
"Cara",
"Calin",
""
],
[
"Zaporojan",
"Sergiu",
""
],
[
"Calmicov",
"Igor",
""
]
] | A warning system for assisting drivers during overtaking maneuvers is proposed. The system relies on Car-2-Car communication technologies and multi-agent systems. A protocol for safety overtaking is proposed based on ACL communicative acts. The mathematical model for safety overtaking used Kalman filter to minimize loc... |
1810.06472 | Luc Jaulmes | Luc Jaulmes, Miquel Moret\'o, Mateo Valero, Marc Casas | Memory Vulnerability: A Case for Delaying Error Reporting | null | null | 10.1109/IOLTS.2019.8854397 | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To face future reliability challenges, it is necessary to quantify the risk
of error in any part of a computing system. To this goal, the Architectural
Vulnerability Factor (AVF) has long been used for chips. However, this metric
is used for offline characterisation, which is inappropriate for memory. We
survey the l... | [
{
"created": "Mon, 15 Oct 2018 15:44:27 GMT",
"version": "v1"
}
] | 2023-08-02 | [
[
"Jaulmes",
"Luc",
""
],
[
"Moretó",
"Miquel",
""
],
[
"Valero",
"Mateo",
""
],
[
"Casas",
"Marc",
""
]
] | To face future reliability challenges, it is necessary to quantify the risk of error in any part of a computing system. To this goal, the Architectural Vulnerability Factor (AVF) has long been used for chips. However, this metric is used for offline characterisation, which is inappropriate for memory. We survey the lit... |
2402.02061 | Mohammad Ridwan Kabir | Mohsinul Kabir, Mohammad Ridwan Kabir and Riasat Siam Islam | Islamic Lifestyle Applications: Meeting the Spiritual Needs of Modern
Muslims | 23 pages | null | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We evaluated contemporary Islamic lifestyle applications supporting religious
practices and motivation among Muslims. We reviewed 11 popular applications
using self-determination theory and the technology-as-experience framework to
assess their support for motivation and affective needs. Most applications lack
featur... | [
{
"created": "Sat, 3 Feb 2024 06:54:47 GMT",
"version": "v1"
}
] | 2024-02-06 | [
[
"Kabir",
"Mohsinul",
""
],
[
"Kabir",
"Mohammad Ridwan",
""
],
[
"Islam",
"Riasat Siam",
""
]
] | We evaluated contemporary Islamic lifestyle applications supporting religious practices and motivation among Muslims. We reviewed 11 popular applications using self-determination theory and the technology-as-experience framework to assess their support for motivation and affective needs. Most applications lack features... |
2003.05063 | Sara Morsy | Sara Morsy and George Karypis | Context-aware Non-linear and Neural Attentive Knowledge-based Models for
Grade Prediction | arXiv admin note: substantial text overlap with arXiv:1904.11858 | null | null | null | cs.LG cs.CY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Grade prediction for future courses not yet taken by students is important as
it can help them and their advisers during the process of course selection as
well as for designing personalized degree plans and modifying them based on
their performance. One of the successful approaches for accurately predicting a
studen... | [
{
"created": "Mon, 9 Mar 2020 20:20:48 GMT",
"version": "v1"
}
] | 2020-03-12 | [
[
"Morsy",
"Sara",
""
],
[
"Karypis",
"George",
""
]
] | Grade prediction for future courses not yet taken by students is important as it can help them and their advisers during the process of course selection as well as for designing personalized degree plans and modifying them based on their performance. One of the successful approaches for accurately predicting a student'... |
2102.02525 | Kai Liang | Kai Liang and Youlong Wu | Improved Communication Efficiency for Distributed Mean Estimation with
Side Information | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | In this paper, we consider the distributed mean estimation problem where the
server has access to some side information, e.g., its local computed mean
estimation or the received information sent by the distributed clients at the
previous iterations. We propose a practical and efficient estimator based on an
r-bit Wyn... | [
{
"created": "Thu, 4 Feb 2021 10:32:13 GMT",
"version": "v1"
}
] | 2021-02-05 | [
[
"Liang",
"Kai",
""
],
[
"Wu",
"Youlong",
""
]
] | In this paper, we consider the distributed mean estimation problem where the server has access to some side information, e.g., its local computed mean estimation or the received information sent by the distributed clients at the previous iterations. We propose a practical and efficient estimator based on an r-bit Wynze... |
1912.09093 | Okyay Altay | S. Schleiter (1), O. Altay (1) ((1) RWTH Aachen University) | Identification of abrupt stiffness changes of structures with tuned mass
dampers under sudden events | 21 pages, 13 figures. Preprint published in Journal of Structural
Control and Health Monitoring | Struct Control Health Monit. 2020:e2530 | 10.1002/stc.2530 | null | cs.CE cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a recursive system identification method for
multi-degree-of-freedom (MDoF) structures with tuned mass dampers (TMDs)
considering abrupt stiffness changes in case of sudden events, such as
earthquakes. Due to supplementary non-classical damping of the TMDs, the system
identification of MDoF+TMD sy... | [
{
"created": "Thu, 19 Dec 2019 09:56:15 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Dec 2019 10:16:12 GMT",
"version": "v2"
},
{
"created": "Mon, 2 Mar 2020 17:08:01 GMT",
"version": "v3"
}
] | 2020-03-03 | [
[
"Schleiter",
"S.",
"",
"RWTH Aachen University"
],
[
"Altay",
"O.",
"",
"RWTH Aachen University"
]
] | This paper presents a recursive system identification method for multi-degree-of-freedom (MDoF) structures with tuned mass dampers (TMDs) considering abrupt stiffness changes in case of sudden events, such as earthquakes. Due to supplementary non-classical damping of the TMDs, the system identification of MDoF+TMD syst... |
2208.06537 | Mingyuan Fan | Mingyuan Fan, Yang Liu, Cen Chen, Ximeng Liu, Wenzhong Guo | Defense against Backdoor Attacks via Identifying and Purifying Bad
Neurons | null | null | null | null | cs.LG cs.CR cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The opacity of neural networks leads their vulnerability to backdoor attacks,
where hidden attention of infected neurons is triggered to override normal
predictions to the attacker-chosen ones. In this paper, we propose a novel
backdoor defense method to mark and purify the infected neurons in the
backdoored neural n... | [
{
"created": "Sat, 13 Aug 2022 01:10:20 GMT",
"version": "v1"
}
] | 2022-08-16 | [
[
"Fan",
"Mingyuan",
""
],
[
"Liu",
"Yang",
""
],
[
"Chen",
"Cen",
""
],
[
"Liu",
"Ximeng",
""
],
[
"Guo",
"Wenzhong",
""
]
] | The opacity of neural networks leads their vulnerability to backdoor attacks, where hidden attention of infected neurons is triggered to override normal predictions to the attacker-chosen ones. In this paper, we propose a novel backdoor defense method to mark and purify the infected neurons in the backdoored neural net... |
2312.16954 | Yue Han | Yue Han, Jinguang Han, Weizhi Meng, Jianchang Lai, Ge Wu | Blockchain-based Privacy-Preserving Public Key Searchable Encryption
with Strong Traceability | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Public key searchable encryption (PKSE) scheme allows data users to search
over encrypted data. To identify illegal users, many traceable PKSE schemes
have been proposed. However, existing schemes cannot trace the keywords which
illegal users searched and protect users' privacy simultaneously. In some
practical appli... | [
{
"created": "Thu, 28 Dec 2023 10:58:14 GMT",
"version": "v1"
}
] | 2023-12-29 | [
[
"Han",
"Yue",
""
],
[
"Han",
"Jinguang",
""
],
[
"Meng",
"Weizhi",
""
],
[
"Lai",
"Jianchang",
""
],
[
"Wu",
"Ge",
""
]
] | Public key searchable encryption (PKSE) scheme allows data users to search over encrypted data. To identify illegal users, many traceable PKSE schemes have been proposed. However, existing schemes cannot trace the keywords which illegal users searched and protect users' privacy simultaneously. In some practical applica... |
1909.08864 | Michael Smith | Michael Thomas Smith, Kathrin Grosse, Michael Backes, Mauricio A
Alvarez | Adversarial Vulnerability Bounds for Gaussian Process Classification | 10 pages + 2 pages references + 7 pages of supplementary. 12 figures.
Submitted to AAAI | null | null | null | cs.CR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning (ML) classification is increasingly used in safety-critical
systems. Protecting ML classifiers from adversarial examples is crucial. We
propose that the main threat is that of an attacker perturbing a confidently
classified input to produce a confident misclassification. To protect against
this we de... | [
{
"created": "Thu, 19 Sep 2019 08:50:01 GMT",
"version": "v1"
}
] | 2019-09-20 | [
[
"Smith",
"Michael Thomas",
""
],
[
"Grosse",
"Kathrin",
""
],
[
"Backes",
"Michael",
""
],
[
"Alvarez",
"Mauricio A",
""
]
] | Machine learning (ML) classification is increasingly used in safety-critical systems. Protecting ML classifiers from adversarial examples is crucial. We propose that the main threat is that of an attacker perturbing a confidently classified input to produce a confident misclassification. To protect against this we devi... |
0804.2614 | Laura Anna Ripamonti | Laura Anna Ripamonti, Ines Di Loreto, Dario Maggiorini | Augmenting Actual Life Through MUVEs | null | null | null | null | cs.HC cs.CY | http://creativecommons.org/licenses/by-nc-sa/3.0/ | The necessity of supporting more and more social interaction (and not only
the mere information sharing) in online environments is the disruptive force
upon which phenomena ascribed to the Web2.0 paradigm continuously bud. People
interacting in online socio-technical environments mould technology on their
needs, seam... | [
{
"created": "Wed, 16 Apr 2008 14:43:31 GMT",
"version": "v1"
}
] | 2008-04-17 | [
[
"Ripamonti",
"Laura Anna",
""
],
[
"Di Loreto",
"Ines",
""
],
[
"Maggiorini",
"Dario",
""
]
] | The necessity of supporting more and more social interaction (and not only the mere information sharing) in online environments is the disruptive force upon which phenomena ascribed to the Web2.0 paradigm continuously bud. People interacting in online socio-technical environments mould technology on their needs, seamle... |
2405.06929 | Jianzong Wang | Shenglin He, Xiaoyang Qu, Jiguang Wan, Guokuan Li, Changsheng Xie,
Jianzong Wang | PRENet: A Plane-Fit Redundancy Encoding Point Cloud Sequence Network for
Real-Time 3D Action Recognition | Accepted by the 2024 International Joint Conference on Neural
Networks (IJCNN 2024) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recognizing human actions from point cloud sequence has attracted tremendous
attention from both academia and industry due to its wide applications.
However, most previous studies on point cloud action recognition typically
require complex networks to extract intra-frame spatial features and
inter-frame temporal feat... | [
{
"created": "Sat, 11 May 2024 06:20:28 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"He",
"Shenglin",
""
],
[
"Qu",
"Xiaoyang",
""
],
[
"Wan",
"Jiguang",
""
],
[
"Li",
"Guokuan",
""
],
[
"Xie",
"Changsheng",
""
],
[
"Wang",
"Jianzong",
""
]
] | Recognizing human actions from point cloud sequence has attracted tremendous attention from both academia and industry due to its wide applications. However, most previous studies on point cloud action recognition typically require complex networks to extract intra-frame spatial features and inter-frame temporal featur... |
1810.04611 | Yaqian Zhang | Yaqian Zhang, Zhifang Zhang | Scalar MSCR Codes via the Product Matrix Construction | 16 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An $(n,k,d)$ cooperative regenerating code provides the optimal-bandwidth
repair for any $t~(t\!>\!1)$ node failures in a cooperative way. In particular,
an MSCR (minimum storage cooperative regenerating) code retains the same
storage overhead as an $(n,k)$ MDS code. Suppose each node stores $\alpha$
symbols which in... | [
{
"created": "Wed, 10 Oct 2018 16:13:41 GMT",
"version": "v1"
}
] | 2018-10-11 | [
[
"Zhang",
"Yaqian",
""
],
[
"Zhang",
"Zhifang",
""
]
] | An $(n,k,d)$ cooperative regenerating code provides the optimal-bandwidth repair for any $t~(t\!>\!1)$ node failures in a cooperative way. In particular, an MSCR (minimum storage cooperative regenerating) code retains the same storage overhead as an $(n,k)$ MDS code. Suppose each node stores $\alpha$ symbols which indi... |
2005.12536 | Zhouxia Wang | Zhouxia Wang, Jiawei Zhang, Mude Lin, Jiong Wang, Ping Luo, and Jimmy
Ren | Learning a Reinforced Agent for Flexible Exposure Bracketing Selection | to be published in CVPR 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatically selecting exposure bracketing (images exposed differently) is
important to obtain a high dynamic range image by using multi-exposure fusion.
Unlike previous methods that have many restrictions such as requiring camera
response function, sensor noise model, and a stream of preview images with
different e... | [
{
"created": "Tue, 26 May 2020 06:24:42 GMT",
"version": "v1"
}
] | 2020-05-27 | [
[
"Wang",
"Zhouxia",
""
],
[
"Zhang",
"Jiawei",
""
],
[
"Lin",
"Mude",
""
],
[
"Wang",
"Jiong",
""
],
[
"Luo",
"Ping",
""
],
[
"Ren",
"Jimmy",
""
]
] | Automatically selecting exposure bracketing (images exposed differently) is important to obtain a high dynamic range image by using multi-exposure fusion. Unlike previous methods that have many restrictions such as requiring camera response function, sensor noise model, and a stream of preview images with different exp... |
2404.01535 | Laboni Sarker | Laboni Sarker, Mara Downing, Achintya Desai and Tevfik Bultan | Syntactic Robustness for LLM-based Code Generation | 12 pages, 12 figures | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Rapid advances in the field of Large Language Models (LLMs) have made
LLM-based code generation an important area for investigation. An LLM-based
code generator takes a prompt as input and produces code that implements the
requirements specified in the prompt. Many software requirements include
mathematical formulas ... | [
{
"created": "Mon, 1 Apr 2024 23:55:05 GMT",
"version": "v1"
}
] | 2024-04-03 | [
[
"Sarker",
"Laboni",
""
],
[
"Downing",
"Mara",
""
],
[
"Desai",
"Achintya",
""
],
[
"Bultan",
"Tevfik",
""
]
] | Rapid advances in the field of Large Language Models (LLMs) have made LLM-based code generation an important area for investigation. An LLM-based code generator takes a prompt as input and produces code that implements the requirements specified in the prompt. Many software requirements include mathematical formulas th... |
1707.08813 | Sean Maudsley-Barton Mr | Sean Maudsley-Barton, Jamie McPheey, Anthony Bukowski, Daniel
Leightley and Moi Hoon Yap | A Comparative Study of the Clinical use of Motion Analysis from Kinect
Skeleton Data | null | null | 10.1109/SMC.2017.8123052 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The analysis of human motion as a clinical tool can bring many benefits such
as the early detection of disease and the monitoring of recovery, so in turn
helping people to lead independent lives. However, it is currently under used.
Developments in depth cameras, such as Kinect, have opened up the use of motion
analy... | [
{
"created": "Thu, 27 Jul 2017 10:55:43 GMT",
"version": "v1"
},
{
"created": "Mon, 31 Jul 2017 08:42:04 GMT",
"version": "v2"
}
] | 2018-04-10 | [
[
"Maudsley-Barton",
"Sean",
""
],
[
"McPheey",
"Jamie",
""
],
[
"Bukowski",
"Anthony",
""
],
[
"Leightley",
"Daniel",
""
],
[
"Yap",
"Moi Hoon",
""
]
] | The analysis of human motion as a clinical tool can bring many benefits such as the early detection of disease and the monitoring of recovery, so in turn helping people to lead independent lives. However, it is currently under used. Developments in depth cameras, such as Kinect, have opened up the use of motion analysi... |
1602.02658 | Tom Zahavy | Tom Zahavy, Nir Ben Zrihem, Shie Mannor | Graying the black box: Understanding DQNs | null | null | null | null | cs.LG cs.AI cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years there is a growing interest in using deep representations for
reinforcement learning. In this paper, we present a methodology and tools to
analyze Deep Q-networks (DQNs) in a non-blind matter. Moreover, we propose a
new model, the Semi Aggregated Markov Decision Process (SAMDP), and an
algorithm that ... | [
{
"created": "Mon, 8 Feb 2016 17:27:31 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Feb 2016 16:13:00 GMT",
"version": "v2"
},
{
"created": "Wed, 17 Feb 2016 19:15:55 GMT",
"version": "v3"
},
{
"created": "Mon, 24 Apr 2017 09:57:21 GMT",
"version": "v4"
}
] | 2017-04-25 | [
[
"Zahavy",
"Tom",
""
],
[
"Zrihem",
"Nir Ben",
""
],
[
"Mannor",
"Shie",
""
]
] | In recent years there is a growing interest in using deep representations for reinforcement learning. In this paper, we present a methodology and tools to analyze Deep Q-networks (DQNs) in a non-blind matter. Moreover, we propose a new model, the Semi Aggregated Markov Decision Process (SAMDP), and an algorithm that le... |
1802.05593 | Pradip Sircar | Pradip Sircar | System Identification via Polynomial Transformation Method | 10 pages, 3 figures, 2 tables | null | null | SciTopics, October 9, 2011 | cs.SY math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a method based on minimum-variance polynomial approximation to
extract system poles from a data set of samples of the impulse response of a
linear system. The method is capable of handling the problem under general
conditions of sampling and noise characteristics. The superiority of the
proposed method is ... | [
{
"created": "Thu, 15 Feb 2018 15:11:52 GMT",
"version": "v1"
}
] | 2018-02-16 | [
[
"Sircar",
"Pradip",
""
]
] | We propose a method based on minimum-variance polynomial approximation to extract system poles from a data set of samples of the impulse response of a linear system. The method is capable of handling the problem under general conditions of sampling and noise characteristics. The superiority of the proposed method is de... |
2004.04342 | Yang Yang | Adam Golinski, Reza Pourreza, Yang Yang, Guillaume Sautiere, Taco S
Cohen | Feedback Recurrent Autoencoder for Video Compression | null | null | null | null | cs.LG cs.CV stat.ML | http://creativecommons.org/licenses/by/4.0/ | Recent advances in deep generative modeling have enabled efficient modeling
of high dimensional data distributions and opened up a new horizon for solving
data compression problems. Specifically, autoencoder based learned image or
video compression solutions are emerging as strong competitors to traditional
approache... | [
{
"created": "Thu, 9 Apr 2020 02:58:07 GMT",
"version": "v1"
}
] | 2020-04-10 | [
[
"Golinski",
"Adam",
""
],
[
"Pourreza",
"Reza",
""
],
[
"Yang",
"Yang",
""
],
[
"Sautiere",
"Guillaume",
""
],
[
"Cohen",
"Taco S",
""
]
] | Recent advances in deep generative modeling have enabled efficient modeling of high dimensional data distributions and opened up a new horizon for solving data compression problems. Specifically, autoencoder based learned image or video compression solutions are emerging as strong competitors to traditional approaches.... |
0808.3990 | Mehmet A. S\"uzen | Mehmet S\"uzen and Ziya S\"uzen | Adaptive Dynamic Congestion Avoidance with Master Equation | 7 pages, 2 figure, technical report | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes an adaptive variant of Random Early Detection (RED)
gateway queue management for packet-switched networks via a discrete state
analog of the non-stationary Master Equation i.e. Markov process. The
computation of average queue size, which appeared in the original RED
algorithm, is altered by introd... | [
{
"created": "Thu, 28 Aug 2008 20:36:59 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Sep 2008 01:21:46 GMT",
"version": "v2"
}
] | 2008-09-18 | [
[
"Süzen",
"Mehmet",
""
],
[
"Süzen",
"Ziya",
""
]
] | This paper proposes an adaptive variant of Random Early Detection (RED) gateway queue management for packet-switched networks via a discrete state analog of the non-stationary Master Equation i.e. Markov process. The computation of average queue size, which appeared in the original RED algorithm, is altered by introduc... |
0707.0762 | Richard McClatchey | Irfan Habib, Kamran Soomro, Ashiq Anjum, Richard McClatchey, Arshad
Ali, Peter Bloodsworth | PhantomOS: A Next Generation Grid Operating System | 8 pages, 6 figures. Presented at the UK eScience All Hands Meeting
2007 (AHM07). Nottingham, UK. September 2007 | null | null | null | cs.DC | null | Grid Computing has made substantial advances in the past decade; these are
primarily due to the adoption of standardized Grid middleware. However Grid
computing has not yet become pervasive because of some barriers that we believe
have been caused by the adoption of middleware centric approaches. These
barriers inclu... | [
{
"created": "Thu, 5 Jul 2007 11:14:45 GMT",
"version": "v1"
}
] | 2007-07-06 | [
[
"Habib",
"Irfan",
""
],
[
"Soomro",
"Kamran",
""
],
[
"Anjum",
"Ashiq",
""
],
[
"McClatchey",
"Richard",
""
],
[
"Ali",
"Arshad",
""
],
[
"Bloodsworth",
"Peter",
""
]
] | Grid Computing has made substantial advances in the past decade; these are primarily due to the adoption of standardized Grid middleware. However Grid computing has not yet become pervasive because of some barriers that we believe have been caused by the adoption of middleware centric approaches. These barriers include... |
1508.05814 | Tomoyuki Yamakami | Tomoyuki Yamakami | Structural Complexity of Multi-Valued Partial Functions Computed by
Nondeterministic Pushdown Automata | (Extended Abstract, A4, 10pt, 8 pages) This extended abstract has
already appeared in the Proceedings of the 15th Italian Conference of
Theoretical Computer Science (ICTCS 2014), September 17-19, Perugia, Italy,
CEUR Workshop Proceedings, vol.1231, pp.225-236, 2014 | null | null | null | cs.FL cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper continues a systematic and comprehensive study on the structural
properties of CFL functions, which are in general multi-valued partial
functions computed by one-way one-head nondeterministic pushdown automata
equipped with write-only output tapes (or pushdown transducers), where CFL
refers to a relevance ... | [
{
"created": "Mon, 24 Aug 2015 14:13:49 GMT",
"version": "v1"
}
] | 2015-08-25 | [
[
"Yamakami",
"Tomoyuki",
""
]
] | This paper continues a systematic and comprehensive study on the structural properties of CFL functions, which are in general multi-valued partial functions computed by one-way one-head nondeterministic pushdown automata equipped with write-only output tapes (or pushdown transducers), where CFL refers to a relevance to... |
2106.01345 | Lili Chen | Lili Chen, Kevin Lu, Aravind Rajeswaran, Kimin Lee, Aditya Grover,
Michael Laskin, Pieter Abbeel, Aravind Srinivas, Igor Mordatch | Decision Transformer: Reinforcement Learning via Sequence Modeling | First two authors contributed equally. Last two authors advised
equally | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a framework that abstracts Reinforcement Learning (RL) as a
sequence modeling problem. This allows us to draw upon the simplicity and
scalability of the Transformer architecture, and associated advances in
language modeling such as GPT-x and BERT. In particular, we present Decision
Transformer, an archit... | [
{
"created": "Wed, 2 Jun 2021 17:53:39 GMT",
"version": "v1"
},
{
"created": "Thu, 24 Jun 2021 17:09:59 GMT",
"version": "v2"
}
] | 2021-06-25 | [
[
"Chen",
"Lili",
""
],
[
"Lu",
"Kevin",
""
],
[
"Rajeswaran",
"Aravind",
""
],
[
"Lee",
"Kimin",
""
],
[
"Grover",
"Aditya",
""
],
[
"Laskin",
"Michael",
""
],
[
"Abbeel",
"Pieter",
""
],
[
"Srinivas... | We introduce a framework that abstracts Reinforcement Learning (RL) as a sequence modeling problem. This allows us to draw upon the simplicity and scalability of the Transformer architecture, and associated advances in language modeling such as GPT-x and BERT. In particular, we present Decision Transformer, an architec... |
2406.17482 | Pierre Vandenhove | Sougata Bose, Rasmus Ibsen-Jensen, David Purser, Patrick Totzke,
Pierre Vandenhove | The Power of Counting Steps in Quantitative Games | Extended version of a CONCUR 2024 paper | null | null | null | cs.GT cs.FL cs.LO | http://creativecommons.org/licenses/by/4.0/ | We study deterministic games of infinite duration played on graphs and focus
on the strategy complexity of quantitative objectives. Such games are known to
admit optimal memoryless strategies over finite graphs, but require
infinite-memory strategies in general over infinite graphs.
We provide new lower and upper b... | [
{
"created": "Tue, 25 Jun 2024 12:03:03 GMT",
"version": "v1"
}
] | 2024-06-26 | [
[
"Bose",
"Sougata",
""
],
[
"Ibsen-Jensen",
"Rasmus",
""
],
[
"Purser",
"David",
""
],
[
"Totzke",
"Patrick",
""
],
[
"Vandenhove",
"Pierre",
""
]
] | We study deterministic games of infinite duration played on graphs and focus on the strategy complexity of quantitative objectives. Such games are known to admit optimal memoryless strategies over finite graphs, but require infinite-memory strategies in general over infinite graphs. We provide new lower and upper bound... |
2207.12763 | Till Hofmann | Till Hofmann, Vaishak Belle | Using Abstraction for Interpretable Robot Programs in Stochastic Domains | Presented at the KR'22 Workshop on Explainable Logic-Based Knowledge
Representation (XLoKR). arXiv admin note: substantial text overlap with
arXiv:2204.03536 | null | null | null | cs.AI | http://creativecommons.org/licenses/by-sa/4.0/ | A robot's actions are inherently stochastic, as its sensors are noisy and its
actions do not always have the intended effects. For this reason, the agent
language Golog has been extended to models with degrees of belief and
stochastic actions. While this allows more precise robot models, the resulting
programs are mu... | [
{
"created": "Tue, 26 Jul 2022 09:15:37 GMT",
"version": "v1"
}
] | 2023-03-02 | [
[
"Hofmann",
"Till",
""
],
[
"Belle",
"Vaishak",
""
]
] | A robot's actions are inherently stochastic, as its sensors are noisy and its actions do not always have the intended effects. For this reason, the agent language Golog has been extended to models with degrees of belief and stochastic actions. While this allows more precise robot models, the resulting programs are much... |
2209.02809 | Hamidreza Jahangir Dr | Hamidreza Jahangir, Subhash Lakshminarayana, and Carsten Maple | Localizing Load-Altering Attacks Against Power Grids Using Deep Capsule
Nets | null | null | null | null | cs.CR cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent research has shown that the security of power grids can be seriously
threatened by botnet-type cyber attacks that target a large number of
high-wattage smart electrical appliances owned by end-users. Accurate detection
and localization of such attacks is of critical importance in limiting the
damage. To this e... | [
{
"created": "Tue, 6 Sep 2022 20:25:52 GMT",
"version": "v1"
}
] | 2022-09-08 | [
[
"Jahangir",
"Hamidreza",
""
],
[
"Lakshminarayana",
"Subhash",
""
],
[
"Maple",
"Carsten",
""
]
] | Recent research has shown that the security of power grids can be seriously threatened by botnet-type cyber attacks that target a large number of high-wattage smart electrical appliances owned by end-users. Accurate detection and localization of such attacks is of critical importance in limiting the damage. To this end... |
2303.14773 | Changdae Oh | Changdae Oh, Hyeji Hwang, Hee-young Lee, YongTaek Lim, Geunyoung Jung,
Jiyoung Jung, Hosik Choi, Kyungwoo Song | BlackVIP: Black-Box Visual Prompting for Robust Transfer Learning | Accepted to CVPR 2023 (v2: citation error was fixed) | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | With the surge of large-scale pre-trained models (PTMs), fine-tuning these
models to numerous downstream tasks becomes a crucial problem. Consequently,
parameter efficient transfer learning (PETL) of large models has grasped huge
attention. While recent PETL methods showcase impressive performance, they rely
on optim... | [
{
"created": "Sun, 26 Mar 2023 16:42:05 GMT",
"version": "v1"
},
{
"created": "Sat, 8 Jul 2023 12:13:50 GMT",
"version": "v2"
}
] | 2023-07-11 | [
[
"Oh",
"Changdae",
""
],
[
"Hwang",
"Hyeji",
""
],
[
"Lee",
"Hee-young",
""
],
[
"Lim",
"YongTaek",
""
],
[
"Jung",
"Geunyoung",
""
],
[
"Jung",
"Jiyoung",
""
],
[
"Choi",
"Hosik",
""
],
[
"Song",
... | With the surge of large-scale pre-trained models (PTMs), fine-tuning these models to numerous downstream tasks becomes a crucial problem. Consequently, parameter efficient transfer learning (PETL) of large models has grasped huge attention. While recent PETL methods showcase impressive performance, they rely on optimis... |
1007.4748 | Aron Culotta | Aron Culotta | Detecting influenza outbreaks by analyzing Twitter messages | null | null | null | null | cs.IR cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyze over 500 million Twitter messages from an eight month period and
find that tracking a small number of flu-related keywords allows us to forecast
future influenza rates with high accuracy, obtaining a 95% correlation with
national health statistics. We then analyze the robustness of this approach to
spuriou... | [
{
"created": "Tue, 27 Jul 2010 15:16:36 GMT",
"version": "v1"
}
] | 2010-07-28 | [
[
"Culotta",
"Aron",
""
]
] | We analyze over 500 million Twitter messages from an eight month period and find that tracking a small number of flu-related keywords allows us to forecast future influenza rates with high accuracy, obtaining a 95% correlation with national health statistics. We then analyze the robustness of this approach to spurious ... |
1010.3411 | Mohamed Ibrahim | Mohamed Ibrahim and Moustafa Youssef | A Hidden Markov Model for Localization Using Low-End GSM Cell Phones | 6 pages, 5 figures, submitted to ICC 2010 | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Research in location determination for GSM phones has gained interest
recently as it enables a wide set of location based services. RSSI-based
techniques have been the preferred method for GSM localization on the handset
as RSSI information is available in all cell phones. Although the GSM standard
allows for a cell ... | [
{
"created": "Sun, 17 Oct 2010 13:21:06 GMT",
"version": "v1"
}
] | 2010-10-19 | [
[
"Ibrahim",
"Mohamed",
""
],
[
"Youssef",
"Moustafa",
""
]
] | Research in location determination for GSM phones has gained interest recently as it enables a wide set of location based services. RSSI-based techniques have been the preferred method for GSM localization on the handset as RSSI information is available in all cell phones. Although the GSM standard allows for a cell ph... |
2111.03505 | Quanshi Zhang | Mingjie Li, Shaobo Wang, Quanshi Zhang | Visualizing the Emergence of Intermediate Visual Patterns in DNNs | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a method to visualize the discrimination power of
intermediate-layer visual patterns encoded by a DNN. Specifically, we visualize
(1) how the DNN gradually learns regional visual patterns in each intermediate
layer during the training process, and (2) the effects of the DNN using
non-discriminativ... | [
{
"created": "Fri, 5 Nov 2021 13:49:39 GMT",
"version": "v1"
}
] | 2021-11-08 | [
[
"Li",
"Mingjie",
""
],
[
"Wang",
"Shaobo",
""
],
[
"Zhang",
"Quanshi",
""
]
] | This paper proposes a method to visualize the discrimination power of intermediate-layer visual patterns encoded by a DNN. Specifically, we visualize (1) how the DNN gradually learns regional visual patterns in each intermediate layer during the training process, and (2) the effects of the DNN using non-discriminative ... |
2305.04501 | Junran Wu | Junran Wu, Xueyuan Chen, Bowen Shi, Shangzhe Li, Ke Xu | SEGA: Structural Entropy Guided Anchor View for Graph Contrastive
Learning | ICML'23 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In contrastive learning, the choice of ``view'' controls the information that
the representation captures and influences the performance of the model.
However, leading graph contrastive learning methods generally produce views via
random corruption or learning, which could lead to the loss of essential
information an... | [
{
"created": "Mon, 8 May 2023 06:52:02 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Jun 2023 08:57:49 GMT",
"version": "v2"
}
] | 2023-06-12 | [
[
"Wu",
"Junran",
""
],
[
"Chen",
"Xueyuan",
""
],
[
"Shi",
"Bowen",
""
],
[
"Li",
"Shangzhe",
""
],
[
"Xu",
"Ke",
""
]
] | In contrastive learning, the choice of ``view'' controls the information that the representation captures and influences the performance of the model. However, leading graph contrastive learning methods generally produce views via random corruption or learning, which could lead to the loss of essential information and ... |
1912.02217 | Pedro Mirabal | P. Mirabal, J. Abreu, D. Seco | Assessing the best edit in perturbation-based iterative refinement
algorithms to compute the median string | 14 pages, 4 figures | Pattern Recognition Letters, Volume 120, 1 April 2019, Pages
104-111 | 10.1016/j.patrec.2019.02.004 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Strings are a natural representation of biological data such as DNA, RNA and
protein sequences. The problem of finding a string that summarizes a set of
sequences has direct application in relative compression algorithms for genome
and proteome analysis, where reference sequences need to be chosen. Median
strings hav... | [
{
"created": "Wed, 4 Dec 2019 19:09:15 GMT",
"version": "v1"
}
] | 2019-12-06 | [
[
"Mirabal",
"P.",
""
],
[
"Abreu",
"J.",
""
],
[
"Seco",
"D.",
""
]
] | Strings are a natural representation of biological data such as DNA, RNA and protein sequences. The problem of finding a string that summarizes a set of sequences has direct application in relative compression algorithms for genome and proteome analysis, where reference sequences need to be chosen. Median strings have ... |
2012.00901 | Shibo Li | Shibo Li, Robert M. Kirby, Shandian Zhe | Deep Multi-Fidelity Active Learning of High-dimensional Outputs | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Many applications, such as in physical simulation and engineering design,
demand we estimate functions with high-dimensional outputs. The training
examples can be collected with different fidelities to allow a cost/accuracy
trade-off. In this paper, we consider the active learning task that identifies
both the fideli... | [
{
"created": "Wed, 2 Dec 2020 00:02:31 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Oct 2021 21:52:52 GMT",
"version": "v2"
}
] | 2021-10-27 | [
[
"Li",
"Shibo",
""
],
[
"Kirby",
"Robert M.",
""
],
[
"Zhe",
"Shandian",
""
]
] | Many applications, such as in physical simulation and engineering design, demand we estimate functions with high-dimensional outputs. The training examples can be collected with different fidelities to allow a cost/accuracy trade-off. In this paper, we consider the active learning task that identifies both the fidelity... |
2312.11086 | Jacob Focke | Jacob Focke and Florian H\"orsch and Shaohua Li and D\'aniel Marx | Multicut Problems in Embedded Graphs: The Dependency of Complexity on
the Demand Pattern | null | null | null | null | cs.CC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Multicut problem asks for a minimum cut separating certain pairs of
vertices: formally, given a graph $G$ and demand graph $H$ on a set $T\subseteq
V(G)$ of terminals, the task is to find a minimum-weight set $C$ of edges of
$G$ such that whenever two vertices of $T$ are adjacent in $H$, they are in
different com... | [
{
"created": "Mon, 18 Dec 2023 10:27:39 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Focke",
"Jacob",
""
],
[
"Hörsch",
"Florian",
""
],
[
"Li",
"Shaohua",
""
],
[
"Marx",
"Dániel",
""
]
] | The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph $G$ and demand graph $H$ on a set $T\subseteq V(G)$ of terminals, the task is to find a minimum-weight set $C$ of edges of $G$ such that whenever two vertices of $T$ are adjacent in $H$, they are in different compo... |
2306.08240 | Zhongyi Shui | Zhongyi Shui, Yizhi Zhao, Sunyi Zheng, Yunlong Zhang, Honglin Li,
Shichuan Zhang, Xiaoxuan Yu, Chenglu Zhu, Lin Yang | Semi-supervised Cell Recognition under Point Supervision | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Cell recognition is a fundamental task in digital histopathology image
analysis. Point-based cell recognition (PCR) methods normally require a vast
number of annotations, which is extremely costly, time-consuming and
labor-intensive. Semi-supervised learning (SSL) can provide a shortcut to make
full use of cell infor... | [
{
"created": "Wed, 14 Jun 2023 04:56:31 GMT",
"version": "v1"
}
] | 2023-06-16 | [
[
"Shui",
"Zhongyi",
""
],
[
"Zhao",
"Yizhi",
""
],
[
"Zheng",
"Sunyi",
""
],
[
"Zhang",
"Yunlong",
""
],
[
"Li",
"Honglin",
""
],
[
"Zhang",
"Shichuan",
""
],
[
"Yu",
"Xiaoxuan",
""
],
[
"Zhu",
"... | Cell recognition is a fundamental task in digital histopathology image analysis. Point-based cell recognition (PCR) methods normally require a vast number of annotations, which is extremely costly, time-consuming and labor-intensive. Semi-supervised learning (SSL) can provide a shortcut to make full use of cell informa... |
2402.01643 | Md. Shohanur Islam Sobuj | Md. Kowsher, Md. Shohanur Islam Sobuj, Asif Mahmud, Nusrat Jahan
Prottasha and Prakash Bhat | L-TUNING: Synchronized Label Tuning for Prompt and Prefix in LLMs | Published in the ICLR TinyPaper track | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Efficiently fine-tuning Large Language Models (LLMs) for specific tasks
presents a considerable challenge in natural language processing. Traditional
methods, like prompt or prefix tuning, typically rely on arbitrary tokens for
training, leading to prolonged training times and generalized token use across
various cla... | [
{
"created": "Thu, 21 Dec 2023 01:47:49 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Apr 2024 00:14:21 GMT",
"version": "v2"
}
] | 2024-04-16 | [
[
"Kowsher",
"Md.",
""
],
[
"Sobuj",
"Md. Shohanur Islam",
""
],
[
"Mahmud",
"Asif",
""
],
[
"Prottasha",
"Nusrat Jahan",
""
],
[
"Bhat",
"Prakash",
""
]
] | Efficiently fine-tuning Large Language Models (LLMs) for specific tasks presents a considerable challenge in natural language processing. Traditional methods, like prompt or prefix tuning, typically rely on arbitrary tokens for training, leading to prolonged training times and generalized token use across various class... |
2304.08366 | Yun Wang | Haotian Li, Yun Wang, Q. Vera Liao, Huamin Qu | Why is AI not a Panacea for Data Workers? An Interview Study on Human-AI
Collaboration in Data Storytelling | null | null | null | null | cs.HC cs.AI | http://creativecommons.org/licenses/by/4.0/ | Data storytelling plays an important role in data workers' daily jobs since
it boosts team collaboration and public communication. However, to make an
appealing data story, data workers spend tremendous efforts on various tasks,
including outlining and styling the story. Recently, a growing research trend
has been ex... | [
{
"created": "Mon, 17 Apr 2023 15:30:05 GMT",
"version": "v1"
}
] | 2023-04-18 | [
[
"Li",
"Haotian",
""
],
[
"Wang",
"Yun",
""
],
[
"Liao",
"Q. Vera",
""
],
[
"Qu",
"Huamin",
""
]
] | Data storytelling plays an important role in data workers' daily jobs since it boosts team collaboration and public communication. However, to make an appealing data story, data workers spend tremendous efforts on various tasks, including outlining and styling the story. Recently, a growing research trend has been expl... |
2008.12520 | Noa Garcia | Noa Garcia, Chentao Ye, Zihua Liu, Qingtao Hu, Mayu Otani, Chenhui
Chu, Yuta Nakashima, Teruko Mitamura | A Dataset and Baselines for Visual Question Answering on Art | null | null | null | null | cs.CV cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Answering questions related to art pieces (paintings) is a difficult task, as
it implies the understanding of not only the visual information that is shown
in the picture, but also the contextual knowledge that is acquired through the
study of the history of art. In this work, we introduce our first attempt
towards b... | [
{
"created": "Fri, 28 Aug 2020 07:33:30 GMT",
"version": "v1"
}
] | 2020-08-31 | [
[
"Garcia",
"Noa",
""
],
[
"Ye",
"Chentao",
""
],
[
"Liu",
"Zihua",
""
],
[
"Hu",
"Qingtao",
""
],
[
"Otani",
"Mayu",
""
],
[
"Chu",
"Chenhui",
""
],
[
"Nakashima",
"Yuta",
""
],
[
"Mitamura",
"Te... | Answering questions related to art pieces (paintings) is a difficult task, as it implies the understanding of not only the visual information that is shown in the picture, but also the contextual knowledge that is acquired through the study of the history of art. In this work, we introduce our first attempt towards bui... |
2111.13330 | Zhijie Wang | Hua Qi, Zhijie Wang, Qing Guo, Jianlang Chen, Felix Juefei-Xu, Lei Ma,
Jianjun Zhao | ArchRepair: Block-Level Architecture-Oriented Repairing for Deep Neural
Networks | 33 pages, 7 figures | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the past few years, deep neural networks (DNNs) have achieved tremendous
success and have been continuously applied in many application domains.
However, during the practical deployment in the industrial tasks, DNNs are
found to be erroneous-prone due to various reasons such as overfitting, lacking
robustness to... | [
{
"created": "Fri, 26 Nov 2021 06:35:15 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Dec 2021 19:25:47 GMT",
"version": "v2"
}
] | 2021-12-14 | [
[
"Qi",
"Hua",
""
],
[
"Wang",
"Zhijie",
""
],
[
"Guo",
"Qing",
""
],
[
"Chen",
"Jianlang",
""
],
[
"Juefei-Xu",
"Felix",
""
],
[
"Ma",
"Lei",
""
],
[
"Zhao",
"Jianjun",
""
]
] | Over the past few years, deep neural networks (DNNs) have achieved tremendous success and have been continuously applied in many application domains. However, during the practical deployment in the industrial tasks, DNNs are found to be erroneous-prone due to various reasons such as overfitting, lacking robustness to r... |
1503.04260 | Diederik Aerts | Diederik Aerts, Sandro Sozzo and Tomas Veloz | Quantum Structure of Negation and Conjunction in Human Thought | 44 pages. arXiv admin note: text overlap with arXiv:1406.2358 | Frontiers in Psychology 6, 1447, (2015) | 10.3389/fpsyg.2015.01447 | null | cs.AI quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyse in this paper the data collected in a set of experiments performed
on human subjects on the combination of natural concepts. We investigate the
mutual influence of conceptual conjunction and negation by measuring the
membership weights of a list of exemplars with respect to two concepts, e.g.,
'Fruits' and... | [
{
"created": "Sat, 14 Mar 2015 02:43:14 GMT",
"version": "v1"
}
] | 2016-09-09 | [
[
"Aerts",
"Diederik",
""
],
[
"Sozzo",
"Sandro",
""
],
[
"Veloz",
"Tomas",
""
]
] | We analyse in this paper the data collected in a set of experiments performed on human subjects on the combination of natural concepts. We investigate the mutual influence of conceptual conjunction and negation by measuring the membership weights of a list of exemplars with respect to two concepts, e.g., 'Fruits' and '... |
2011.08277 | Meera Hahn | Meera Hahn, Jacob Krantz, Dhruv Batra, Devi Parikh, James M. Rehg,
Stefan Lee and Peter Anderson | Where Are You? Localization from Embodied Dialog | null | EMNLP 2020 | null | null | cs.CV cs.CL | http://creativecommons.org/licenses/by/4.0/ | We present Where Are You? (WAY), a dataset of ~6k dialogs in which two humans
-- an Observer and a Locator -- complete a cooperative localization task. The
Observer is spawned at random in a 3D environment and can navigate from
first-person views while answering questions from the Locator. The Locator must
localize t... | [
{
"created": "Mon, 16 Nov 2020 21:09:43 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Sep 2021 13:06:58 GMT",
"version": "v2"
}
] | 2021-09-06 | [
[
"Hahn",
"Meera",
""
],
[
"Krantz",
"Jacob",
""
],
[
"Batra",
"Dhruv",
""
],
[
"Parikh",
"Devi",
""
],
[
"Rehg",
"James M.",
""
],
[
"Lee",
"Stefan",
""
],
[
"Anderson",
"Peter",
""
]
] | We present Where Are You? (WAY), a dataset of ~6k dialogs in which two humans -- an Observer and a Locator -- complete a cooperative localization task. The Observer is spawned at random in a 3D environment and can navigate from first-person views while answering questions from the Locator. The Locator must localize the... |
2009.00964 | Laura Giordano | Laura Giordano, Daniele Theseider Dupr\'e | A framework for a modular multi-concept lexicographic closure semantics | 18 pages. Accepted for presentation at NMR2020 (18th International
Workshop on Non-Monotonic Reasoning, September 12th - 14th - Rhodes, Greece | null | null | TR-INF-2020-09-03-UNIPMN | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We define a modular multi-concept extension of the lexicographic closure
semantics for defeasible description logics with typicality. The idea is that
of distributing the defeasible properties of concepts into different modules,
according to their subject, and of defining a notion of preference for each
module based ... | [
{
"created": "Wed, 2 Sep 2020 11:41:38 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Sep 2020 05:19:53 GMT",
"version": "v2"
}
] | 2020-09-07 | [
[
"Giordano",
"Laura",
""
],
[
"Dupré",
"Daniele Theseider",
""
]
] | We define a modular multi-concept extension of the lexicographic closure semantics for defeasible description logics with typicality. The idea is that of distributing the defeasible properties of concepts into different modules, according to their subject, and of defining a notion of preference for each module based on... |
1506.00238 | Bhavya Kailkhura | Bhavya Kailkhura and Sijia Liu and Thakshila Wimalajeewa and Pramod K.
Varshney | Measurement Matrix Design for Compressive Detection with Secrecy
Guarantees | null | null | null | null | cs.IT math.IT stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this letter, we consider the problem of detecting a high dimensional
signal based on compressed measurements with physical layer secrecy guarantees.
We assume that the network operates in the presence of an eavesdropper who
intends to discover the state of the nature being monitored by the system. We
design measur... | [
{
"created": "Sun, 31 May 2015 14:31:43 GMT",
"version": "v1"
}
] | 2015-06-02 | [
[
"Kailkhura",
"Bhavya",
""
],
[
"Liu",
"Sijia",
""
],
[
"Wimalajeewa",
"Thakshila",
""
],
[
"Varshney",
"Pramod K.",
""
]
] | In this letter, we consider the problem of detecting a high dimensional signal based on compressed measurements with physical layer secrecy guarantees. We assume that the network operates in the presence of an eavesdropper who intends to discover the state of the nature being monitored by the system. We design measurem... |
1308.2450 | Marcos Villagra | Xiaoming Sun and Marcos Villagra | Exponential Quantum-Classical Gaps in Multiparty Nondeterministic
Communication Complexity | This paper has been withdrawn by the author due to a crucial mistake
in the main proof | null | null | null | cs.CC quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are three different types of nondeterminism in quantum communication:
i) $\nqp$-communication, ii) $\qma$-communication, and iii)
$\qcma$-communication. In this \redout{paper} we show that multiparty
$\nqp$-communication can be exponentially stronger than $\qcma$-communication.
This also implies an exponential ... | [
{
"created": "Mon, 12 Aug 2013 02:53:46 GMT",
"version": "v1"
},
{
"created": "Sun, 18 Aug 2013 06:33:26 GMT",
"version": "v2"
}
] | 2013-08-20 | [
[
"Sun",
"Xiaoming",
""
],
[
"Villagra",
"Marcos",
""
]
] | There are three different types of nondeterminism in quantum communication: i) $\nqp$-communication, ii) $\qma$-communication, and iii) $\qcma$-communication. In this \redout{paper} we show that multiparty $\nqp$-communication can be exponentially stronger than $\qcma$-communication. This also implies an exponential se... |
2405.15082 | Han Song | Han Song and Zhongche Qu and Zhi Zhang and Zihan Ye and Cong Liu | Advancements in Translation Accuracy for Stereo Visual-Inertial
Initialization | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the current initialization method in the state-of-the-art Stereo
Visual-Inertial SLAM framework, ORB-SLAM3 has limitations. Its success depends
on the performance of the pure stereo SLAM system and is based on the
underlying assumption that pure visual SLAM can accurately estimate the camera
trajectory, which is e... | [
{
"created": "Thu, 23 May 2024 22:08:38 GMT",
"version": "v1"
},
{
"created": "Sun, 9 Jun 2024 07:03:45 GMT",
"version": "v2"
},
{
"created": "Thu, 20 Jun 2024 16:44:02 GMT",
"version": "v3"
}
] | 2024-06-21 | [
[
"Song",
"Han",
""
],
[
"Qu",
"Zhongche",
""
],
[
"Zhang",
"Zhi",
""
],
[
"Ye",
"Zihan",
""
],
[
"Liu",
"Cong",
""
]
] | As the current initialization method in the state-of-the-art Stereo Visual-Inertial SLAM framework, ORB-SLAM3 has limitations. Its success depends on the performance of the pure stereo SLAM system and is based on the underlying assumption that pure visual SLAM can accurately estimate the camera trajectory, which is ess... |
2102.09340 | Xinlong Lu | Xinlong Lu, Zhengming Ma, Yuanping Lin | Domain Adaptive Learning Based on Sample-Dependent and Learnable Kernels | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Reproducing Kernel Hilbert Space (RKHS) is the common mathematical platform
for various kernel methods in machine learning. The purpose of kernel learning
is to learn an appropriate RKHS according to different machine learning
scenarios and training samples. Because RKHS is uniquely generated by the
kernel function, ... | [
{
"created": "Thu, 18 Feb 2021 13:55:06 GMT",
"version": "v1"
}
] | 2021-02-19 | [
[
"Lu",
"Xinlong",
""
],
[
"Ma",
"Zhengming",
""
],
[
"Lin",
"Yuanping",
""
]
] | Reproducing Kernel Hilbert Space (RKHS) is the common mathematical platform for various kernel methods in machine learning. The purpose of kernel learning is to learn an appropriate RKHS according to different machine learning scenarios and training samples. Because RKHS is uniquely generated by the kernel function, ke... |
2311.09807 | Yanzhu Guo | Yanzhu Guo, Guokan Shang, Michalis Vazirgiannis and Chlo\'e Clavel | The Curious Decline of Linguistic Diversity: Training Language Models on
Synthetic Text | Accepted to NAACL 2024 Findings | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study investigates the consequences of training language models on
synthetic data generated by their predecessors, an increasingly prevalent
practice given the prominence of powerful generative models. Diverging from the
usual emphasis on performance metrics, we focus on the impact of this training
methodology o... | [
{
"created": "Thu, 16 Nov 2023 11:31:50 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Apr 2024 15:57:11 GMT",
"version": "v2"
}
] | 2024-04-17 | [
[
"Guo",
"Yanzhu",
""
],
[
"Shang",
"Guokan",
""
],
[
"Vazirgiannis",
"Michalis",
""
],
[
"Clavel",
"Chloé",
""
]
] | This study investigates the consequences of training language models on synthetic data generated by their predecessors, an increasingly prevalent practice given the prominence of powerful generative models. Diverging from the usual emphasis on performance metrics, we focus on the impact of this training methodology on ... |
2012.12594 | Christian Schulz | Faisal Abu-Khzam, Sebastian Lamm, Matthias Mnich, Alexander Noe,
Christian Schulz, and Darren Strash | Recent Advances in Practical Data Reduction | null | null | null | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the last two decades, significant advances have been made in the design
and analysis of fixed-parameter algorithms for a wide variety of
graph-theoretic problems. This has resulted in an algorithmic toolbox that is
by now well-established. However, these theoretical algorithmic ideas have
received very little at... | [
{
"created": "Wed, 23 Dec 2020 10:52:29 GMT",
"version": "v1"
},
{
"created": "Sat, 26 Dec 2020 10:11:13 GMT",
"version": "v2"
},
{
"created": "Thu, 31 Dec 2020 07:57:30 GMT",
"version": "v3"
}
] | 2021-01-01 | [
[
"Abu-Khzam",
"Faisal",
""
],
[
"Lamm",
"Sebastian",
""
],
[
"Mnich",
"Matthias",
""
],
[
"Noe",
"Alexander",
""
],
[
"Schulz",
"Christian",
""
],
[
"Strash",
"Darren",
""
]
] | Over the last two decades, significant advances have been made in the design and analysis of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has resulted in an algorithmic toolbox that is by now well-established. However, these theoretical algorithmic ideas have received very little atte... |
2305.15314 | Vijayanta Jain | Vijayanta Jain, Sepideh Ghanavati, Sai Teja Peddinti, Collin McMillan | Towards Fine-Grained Localization of Privacy Behaviors | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Mobile applications are required to give privacy notices to users when they
collect or share personal information. Creating consistent and concise privacy
notices can be a challenging task for developers. Previous work has attempted
to help developers create privacy notices through a questionnaire or predefined
templ... | [
{
"created": "Wed, 24 May 2023 16:32:14 GMT",
"version": "v1"
}
] | 2023-05-25 | [
[
"Jain",
"Vijayanta",
""
],
[
"Ghanavati",
"Sepideh",
""
],
[
"Peddinti",
"Sai Teja",
""
],
[
"McMillan",
"Collin",
""
]
] | Mobile applications are required to give privacy notices to users when they collect or share personal information. Creating consistent and concise privacy notices can be a challenging task for developers. Previous work has attempted to help developers create privacy notices through a questionnaire or predefined templat... |
2111.00722 | Tetsu Kasanishi | Tetsu Kasanishi, Xueting Wang, and Toshihiko Yamasaki | Edge-Level Explanations for Graph Neural Networks by Extending
Explainability Methods for Convolutional Neural Networks | 4 pages, accepted at 23rd IEEE International Symposium on Multimedia
(ISM), short paper, 2021 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Neural Networks (GNNs) are deep learning models that take graph data as
inputs, and they are applied to various tasks such as traffic prediction and
molecular property prediction. However, owing to the complexity of the GNNs, it
has been difficult to analyze which parts of inputs affect the GNN model's
outputs.... | [
{
"created": "Mon, 1 Nov 2021 06:27:29 GMT",
"version": "v1"
}
] | 2021-11-02 | [
[
"Kasanishi",
"Tetsu",
""
],
[
"Wang",
"Xueting",
""
],
[
"Yamasaki",
"Toshihiko",
""
]
] | Graph Neural Networks (GNNs) are deep learning models that take graph data as inputs, and they are applied to various tasks such as traffic prediction and molecular property prediction. However, owing to the complexity of the GNNs, it has been difficult to analyze which parts of inputs affect the GNN model's outputs. I... |
2405.15665 | Maleknaz Nayebi | Umme Ayman Koana, Quang Hy Le, Shadikur Rahman, Chris Carlson, Francis
Chew, Maleknaz Nayebi | Examining Ownership Models in Software Teams: A Systematic Literature
Review and a Replication Study | Pre-print an accepted paper for the ESE journal | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Effective ownership of software artifacts, particularly code, is crucial for
accountability, knowledge sharing, and code quality enhancement. Researchers
have proposed models linking ownership of software artifacts with developer
performance and code quality. Our study aims to systematically examine various
ownership... | [
{
"created": "Fri, 24 May 2024 16:03:22 GMT",
"version": "v1"
}
] | 2024-05-27 | [
[
"Koana",
"Umme Ayman",
""
],
[
"Le",
"Quang Hy",
""
],
[
"Rahman",
"Shadikur",
""
],
[
"Carlson",
"Chris",
""
],
[
"Chew",
"Francis",
""
],
[
"Nayebi",
"Maleknaz",
""
]
] | Effective ownership of software artifacts, particularly code, is crucial for accountability, knowledge sharing, and code quality enhancement. Researchers have proposed models linking ownership of software artifacts with developer performance and code quality. Our study aims to systematically examine various ownership m... |
2306.00355 | Jinsheng Ba | Jinsheng Ba, Manuel Rigger | CERT: Finding Performance Issues in Database Systems Through the Lens of
Cardinality Estimation | The 46th International Conference on Software Engineering (ICSE'24),
Lisbon, Portugal | null | 10.1145/3597503.3639076 | null | cs.SE cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Database Management Systems (DBMSs) process a given query by creating a query
plan, which is subsequently executed, to compute the query's result. Deriving
an efficient query plan is challenging, and both academia and industry have
invested decades into researching query optimization. Despite this, DBMSs are
prone to... | [
{
"created": "Thu, 1 Jun 2023 05:21:31 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Dec 2023 07:30:29 GMT",
"version": "v2"
},
{
"created": "Wed, 10 Jan 2024 02:56:41 GMT",
"version": "v3"
}
] | 2024-01-11 | [
[
"Ba",
"Jinsheng",
""
],
[
"Rigger",
"Manuel",
""
]
] | Database Management Systems (DBMSs) process a given query by creating a query plan, which is subsequently executed, to compute the query's result. Deriving an efficient query plan is challenging, and both academia and industry have invested decades into researching query optimization. Despite this, DBMSs are prone to p... |
2109.10868 | Corrado Puligheddu | Sharda Tripathi, Corrado Puligheddu, Carla Fabiana Chiasserini,
Federico Mungari | A Context-aware Radio Resource Management in Heterogeneous Virtual RANs | Accepted for publication in IEEE Transactions on Cognitive
Communications and Networking | null | 10.1109/TCCN.2021.3115098 | null | cs.NI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | New-generation wireless networks are designed to support a wide range of
services with diverse key performance indicators (KPIs) requirements. A
fundamental component of such networks, and a pivotal factor to the fulfillment
of the target KPIs, is the virtual radio access network (vRAN), which allows
high flexibility... | [
{
"created": "Wed, 22 Sep 2021 17:37:26 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Sep 2021 15:18:16 GMT",
"version": "v2"
}
] | 2021-09-24 | [
[
"Tripathi",
"Sharda",
""
],
[
"Puligheddu",
"Corrado",
""
],
[
"Chiasserini",
"Carla Fabiana",
""
],
[
"Mungari",
"Federico",
""
]
] | New-generation wireless networks are designed to support a wide range of services with diverse key performance indicators (KPIs) requirements. A fundamental component of such networks, and a pivotal factor to the fulfillment of the target KPIs, is the virtual radio access network (vRAN), which allows high flexibility o... |
2404.12407 | Da-Wei Zhou | Da-Wei Zhou, Zhi-Hong Qi, Han-Jia Ye, De-Chuan Zhan | TV100: A TV Series Dataset that Pre-Trained CLIP Has Not Seen | Project page: https://tv-100.github.io/ | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The era of pre-trained models has ushered in a wealth of new insights for the
machine learning community. Among the myriad of questions that arise, one of
paramount importance is: 'Do pre-trained models possess comprehensive
knowledge?' This paper seeks to address this crucial inquiry. In line with our
objective, we ... | [
{
"created": "Tue, 16 Apr 2024 17:47:45 GMT",
"version": "v1"
}
] | 2024-04-22 | [
[
"Zhou",
"Da-Wei",
""
],
[
"Qi",
"Zhi-Hong",
""
],
[
"Ye",
"Han-Jia",
""
],
[
"Zhan",
"De-Chuan",
""
]
] | The era of pre-trained models has ushered in a wealth of new insights for the machine learning community. Among the myriad of questions that arise, one of paramount importance is: 'Do pre-trained models possess comprehensive knowledge?' This paper seeks to address this crucial inquiry. In line with our objective, we ha... |
cs/0206033 | David Eppstein | David Eppstein, Jean-Claude Falmagne | Algorithms for Media | 12 pages | null | null | null | cs.DS | null | Falmagne recently introduced the concept of a medium, a combinatorial object
encompassing hyperplane arrangements, topological orderings, acyclic
orientations, and many other familiar structures. We find efficient solutions
for several algorithmic problems on media: finding short reset sequences,
shortest paths, test... | [
{
"created": "Mon, 24 Jun 2002 06:50:52 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Eppstein",
"David",
""
],
[
"Falmagne",
"Jean-Claude",
""
]
] | Falmagne recently introduced the concept of a medium, a combinatorial object encompassing hyperplane arrangements, topological orderings, acyclic orientations, and many other familiar structures. We find efficient solutions for several algorithmic problems on media: finding short reset sequences, shortest paths, testin... |
1610.04583 | Alexander Wein | Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra | Message-passing algorithms for synchronization problems over compact
groups | 35 pages, 11 figures | null | 10.1002/cpa.21750 | null | cs.IT cs.CV cs.DS math.IT math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Various alignment problems arising in cryo-electron microscopy, community
detection, time synchronization, computer vision, and other fields fall into a
common framework of synchronization problems over compact groups such as Z/L,
U(1), or SO(3). The goal of such problems is to estimate an unknown vector of
group ele... | [
{
"created": "Fri, 14 Oct 2016 19:05:32 GMT",
"version": "v1"
}
] | 2018-09-14 | [
[
"Perry",
"Amelia",
""
],
[
"Wein",
"Alexander S.",
""
],
[
"Bandeira",
"Afonso S.",
""
],
[
"Moitra",
"Ankur",
""
]
] | Various alignment problems arising in cryo-electron microscopy, community detection, time synchronization, computer vision, and other fields fall into a common framework of synchronization problems over compact groups such as Z/L, U(1), or SO(3). The goal of such problems is to estimate an unknown vector of group eleme... |
2008.12646 | Yun Peng | Yun Peng, Byron Choi, Jianliang Xu | Graph Learning for Combinatorial Optimization: A Survey of
State-of-the-Art | 40 pages | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graphs have been widely used to represent complex data in many applications.
Efficient and effective analysis of graphs is important for graph-based
applications. However, most graph analysis tasks are combinatorial optimization
(CO) problems, which are NP-hard. Recent studies have focused a lot on the
potential of u... | [
{
"created": "Wed, 26 Aug 2020 09:56:30 GMT",
"version": "v1"
},
{
"created": "Tue, 20 Apr 2021 08:47:03 GMT",
"version": "v2"
},
{
"created": "Thu, 22 Apr 2021 02:07:09 GMT",
"version": "v3"
}
] | 2021-04-23 | [
[
"Peng",
"Yun",
""
],
[
"Choi",
"Byron",
""
],
[
"Xu",
"Jianliang",
""
]
] | Graphs have been widely used to represent complex data in many applications. Efficient and effective analysis of graphs is important for graph-based applications. However, most graph analysis tasks are combinatorial optimization (CO) problems, which are NP-hard. Recent studies have focused a lot on the potential of usi... |
2309.03787 | Chengguang Gan | Chengguang Gan, Qinghao Zhang, Tatsunori Mori | USA: Universal Sentiment Analysis Model & Construction of Japanese
Sentiment Text Classification and Part of Speech Dataset | Model already Open Sourced, Dataset will release soon | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sentiment analysis is a pivotal task in the domain of natural language
processing. It encompasses both text-level sentiment polarity classification
and word-level Part of Speech(POS) sentiment polarity determination. Such
analysis challenges models to understand text holistically while also
extracting nuanced informa... | [
{
"created": "Thu, 7 Sep 2023 15:35:00 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Sep 2023 05:53:45 GMT",
"version": "v2"
}
] | 2023-09-15 | [
[
"Gan",
"Chengguang",
""
],
[
"Zhang",
"Qinghao",
""
],
[
"Mori",
"Tatsunori",
""
]
] | Sentiment analysis is a pivotal task in the domain of natural language processing. It encompasses both text-level sentiment polarity classification and word-level Part of Speech(POS) sentiment polarity determination. Such analysis challenges models to understand text holistically while also extracting nuanced informati... |
1510.08544 | Silas Fong | Silas L. Fong and Vincent Y. F. Tan | Empirical Output Distribution of Good Delay-Limited Codes for
Quasi-Static Fading Channels | This paper has been withdrawn by the authors because of insufficient
novelty | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers delay-limited communication over quasi-static fading
channels under a long-term power constraint. A sequence of length-$n$
delay-limited codes for a quasi-static fading channel is said to be
capacity-achieving if the codes achieve the delay-limited capacity, which is
defined to be the maximum rat... | [
{
"created": "Thu, 29 Oct 2015 02:09:37 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Nov 2015 06:50:12 GMT",
"version": "v2"
},
{
"created": "Mon, 14 Nov 2016 01:51:48 GMT",
"version": "v3"
}
] | 2016-11-15 | [
[
"Fong",
"Silas L.",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] | This paper considers delay-limited communication over quasi-static fading channels under a long-term power constraint. A sequence of length-$n$ delay-limited codes for a quasi-static fading channel is said to be capacity-achieving if the codes achieve the delay-limited capacity, which is defined to be the maximum rate ... |
1807.02251 | WajihUllah Baig | Wajih Ullah Baig, Umar Munir, Waqas Ellahi, Adeel Ejaz, Kashif Sardar
(National Database and Registration Authority) | Minutia Texture Cylinder Codes for fingerprint matching | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Minutia Cylinder Codes (MCC) are minutiae based fingerprint descriptors that
take into account minutiae information in a fingerprint image for fingerprint
matching. In this paper, we present a modification to the underlying
information of the MCC descriptor and show that using different features, the
accuracy of matc... | [
{
"created": "Fri, 6 Jul 2018 04:25:18 GMT",
"version": "v1"
}
] | 2018-07-09 | [
[
"Baig",
"Wajih Ullah",
"",
"National Database and Registration Authority"
],
[
"Munir",
"Umar",
"",
"National Database and Registration Authority"
],
[
"Ellahi",
"Waqas",
"",
"National Database and Registration Authority"
],
[
"Ejaz",
"Adeel",
... | Minutia Cylinder Codes (MCC) are minutiae based fingerprint descriptors that take into account minutiae information in a fingerprint image for fingerprint matching. In this paper, we present a modification to the underlying information of the MCC descriptor and show that using different features, the accuracy of matchi... |
2308.04187 | Lutz Terfloth | Lutz Terfloth, Michael Schaffer, Heike M. Buhl, Carsten Schulte | Adding Why to What? Analyses of an Everyday Explanation | Paper accepted and presented at XAI World Conference 2023, Lisboa | null | 10.1007/978-3-031-44070-0_13 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In XAI it is important to consider that, in contrast to explanations for
professional audiences, one cannot assume common expertise when explaining for
laypeople. But such explanations between humans vary greatly, making it
difficult to research commonalities across explanations. We used the dual
nature theory, a tec... | [
{
"created": "Tue, 8 Aug 2023 11:17:22 GMT",
"version": "v1"
}
] | 2023-10-24 | [
[
"Terfloth",
"Lutz",
""
],
[
"Schaffer",
"Michael",
""
],
[
"Buhl",
"Heike M.",
""
],
[
"Schulte",
"Carsten",
""
]
] | In XAI it is important to consider that, in contrast to explanations for professional audiences, one cannot assume common expertise when explaining for laypeople. But such explanations between humans vary greatly, making it difficult to research commonalities across explanations. We used the dual nature theory, a techn... |
2104.12623 | Sebastian Szyller | Sebastian Szyller, Vasisht Duddu, Tommi Gr\"ondahl, N. Asokan | Good Artists Copy, Great Artists Steal: Model Extraction Attacks Against
Image Translation Models | 19 pages | null | null | null | cs.LG cs.CR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning models are typically made available to potential client
users via inference APIs. Model extraction attacks occur when a malicious
client uses information gleaned from queries to the inference API of a victim
model $F_V$ to build a surrogate model $F_A$ with comparable functionality.
Recent research h... | [
{
"created": "Mon, 26 Apr 2021 14:50:59 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Feb 2023 09:37:59 GMT",
"version": "v2"
}
] | 2023-03-01 | [
[
"Szyller",
"Sebastian",
""
],
[
"Duddu",
"Vasisht",
""
],
[
"Gröndahl",
"Tommi",
""
],
[
"Asokan",
"N.",
""
]
] | Machine learning models are typically made available to potential client users via inference APIs. Model extraction attacks occur when a malicious client uses information gleaned from queries to the inference API of a victim model $F_V$ to build a surrogate model $F_A$ with comparable functionality. Recent research has... |
2302.11341 | A. R. Sricharan | Monika Henzinger and A. R. Sricharan and Teresa Anna Steiner | Differentially Private Data Structures under Continual Observation for
Histograms and Related Queries | null | null | null | null | cs.DS cs.CR | http://creativecommons.org/licenses/by-sa/4.0/ | Binary counting under continual observation is a well-studied fundamental
problem in differential privacy. A natural extension is maintaining column
sums, also known as histogram, over a stream of rows from $\{0,1\}^d$, and
answering queries about those sums, e.g. the maximum column sum or the median,
while satisfyin... | [
{
"created": "Wed, 22 Feb 2023 12:38:02 GMT",
"version": "v1"
}
] | 2023-02-23 | [
[
"Henzinger",
"Monika",
""
],
[
"Sricharan",
"A. R.",
""
],
[
"Steiner",
"Teresa Anna",
""
]
] | Binary counting under continual observation is a well-studied fundamental problem in differential privacy. A natural extension is maintaining column sums, also known as histogram, over a stream of rows from $\{0,1\}^d$, and answering queries about those sums, e.g. the maximum column sum or the median, while satisfying ... |
1907.03998 | EPTCS | Daniel Dietsch (University of Freiburg), Matthias Heizmann (University
of Freiburg), Jochen Hoenicke (University of Freiburg), Alexander Nutz
(University of Freiburg), Andreas Podelski (University of Freiburg) | Ultimate TreeAutomizer (CHC-COMP Tool Description) | In Proceedings HCVS/PERR 2019, arXiv:1907.03523 | EPTCS 296, 2019, pp. 42-47 | 10.4204/EPTCS.296.7 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present Ultimate TreeAutomizer, a solver for satisfiability of sets of
constrained Horn clauses. Constrained Horn clauses (CHC) are a fragment of
first order logic with attractive properties in terms of expressiveness and
accessibility to algorithmic solving. Ultimate TreeAutomizer is based on the
techniques of tr... | [
{
"created": "Tue, 9 Jul 2019 06:02:28 GMT",
"version": "v1"
}
] | 2019-07-10 | [
[
"Dietsch",
"Daniel",
"",
"University of Freiburg"
],
[
"Heizmann",
"Matthias",
"",
"University\n of Freiburg"
],
[
"Hoenicke",
"Jochen",
"",
"University of Freiburg"
],
[
"Nutz",
"Alexander",
"",
"University of Freiburg"
],
[
"Po... | We present Ultimate TreeAutomizer, a solver for satisfiability of sets of constrained Horn clauses. Constrained Horn clauses (CHC) are a fragment of first order logic with attractive properties in terms of expressiveness and accessibility to algorithmic solving. Ultimate TreeAutomizer is based on the techniques of trac... |
1703.02851 | Ghislain Fourny | Ghislain Fourny | On the Importance of Correlations in Rational Choice: A Case for
Non-Nashian Game Theory | Note | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Nash equilibrium paradigm, and Rational Choice Theory in general, rely on
agents acting independently from each other. This note shows how this
assumption is crucial in the definition of Rational Choice Theory. It explains
how a consistent Alternate Rational Choice Theory, as suggested by Jean-Pierre
Dupuy, can b... | [
{
"created": "Wed, 8 Mar 2017 14:41:30 GMT",
"version": "v1"
}
] | 2017-03-09 | [
[
"Fourny",
"Ghislain",
""
]
] | The Nash equilibrium paradigm, and Rational Choice Theory in general, rely on agents acting independently from each other. This note shows how this assumption is crucial in the definition of Rational Choice Theory. It explains how a consistent Alternate Rational Choice Theory, as suggested by Jean-Pierre Dupuy, can be ... |
1403.5788 | K. V. Krishna | Shubh Narayan Singh and K. V. Krishna | $L$-Primitive Words in Submonoids | null | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work considers a natural generalization of primitivity with respect to a
language. Given a language $L$, a nonempty word $w$ is said to be $L$-primitive
if $w$ is not a proper power of any word in $L$. After ascertaining the number
of primitive words in submonoids of a free monoid, the work proceeds to count
$L$... | [
{
"created": "Sun, 23 Mar 2014 18:55:23 GMT",
"version": "v1"
}
] | 2014-03-25 | [
[
"Singh",
"Shubh Narayan",
""
],
[
"Krishna",
"K. V.",
""
]
] | This work considers a natural generalization of primitivity with respect to a language. Given a language $L$, a nonempty word $w$ is said to be $L$-primitive if $w$ is not a proper power of any word in $L$. After ascertaining the number of primitive words in submonoids of a free monoid, the work proceeds to count $L$-p... |
1204.5791 | Chathuranga Widanapathirana | Chathuranga Widanapathirana and Y. Ahmet Sekercioglu and Bok-Min Goi | Hybrid FPMS: A New Fairness Protocol Management Scheme for Community
Wireless Mesh Networks | KSII Transactions on Internet and Information Systems, 2011 | null | 10.3837/tiis.2011.11.002 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Node cooperation during packet forwarding operations is critically important
for fair resource utilization in Community Wireless Mesh Networks (CoWMNs). In
a CoWMN, node cooperation is achieved by using fairness protocols specifically
designed to detect and isolate malicious nodes, discourage unfair behavior, and
enc... | [
{
"created": "Wed, 25 Apr 2012 23:44:47 GMT",
"version": "v1"
}
] | 2012-04-27 | [
[
"Widanapathirana",
"Chathuranga",
""
],
[
"Sekercioglu",
"Y. Ahmet",
""
],
[
"Goi",
"Bok-Min",
""
]
] | Node cooperation during packet forwarding operations is critically important for fair resource utilization in Community Wireless Mesh Networks (CoWMNs). In a CoWMN, node cooperation is achieved by using fairness protocols specifically designed to detect and isolate malicious nodes, discourage unfair behavior, and encou... |
1912.07600 | Ning Li | Ning Li | A new Frequency Estimation Sketch for Data Streams | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In data stream applications, one of the critical issues is to estimate the
frequency of each item in the specific multiset. The multiset means that each
item in this set can appear multiple times. The data streams in many
applications are high-speed streams which contain massive data, such as
real-time IP traffic, gr... | [
{
"created": "Mon, 16 Dec 2019 08:16:37 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Dec 2019 01:51:21 GMT",
"version": "v2"
},
{
"created": "Sat, 4 Jan 2020 14:22:49 GMT",
"version": "v3"
}
] | 2020-01-07 | [
[
"Li",
"Ning",
""
]
] | In data stream applications, one of the critical issues is to estimate the frequency of each item in the specific multiset. The multiset means that each item in this set can appear multiple times. The data streams in many applications are high-speed streams which contain massive data, such as real-time IP traffic, grap... |
2202.08199 | Zixun Wang | Xinpeng Ding, Xinjian Yan, Zixun Wang, Wei Zhao, Jian Zhuang, Xiaowei
Xu and Xiaomeng Li | Less is More: Surgical Phase Recognition from Timestamp Supervision | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Surgical phase recognition is a fundamental task in computer-assisted surgery
systems. Most existing works are under the supervision of expensive and
time-consuming full annotations, which require the surgeons to repeat watching
videos to find the precise start and end time for a surgical phase. In this
paper, we int... | [
{
"created": "Wed, 16 Feb 2022 17:18:38 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Dec 2022 03:09:22 GMT",
"version": "v2"
}
] | 2022-12-02 | [
[
"Ding",
"Xinpeng",
""
],
[
"Yan",
"Xinjian",
""
],
[
"Wang",
"Zixun",
""
],
[
"Zhao",
"Wei",
""
],
[
"Zhuang",
"Jian",
""
],
[
"Xu",
"Xiaowei",
""
],
[
"Li",
"Xiaomeng",
""
]
] | Surgical phase recognition is a fundamental task in computer-assisted surgery systems. Most existing works are under the supervision of expensive and time-consuming full annotations, which require the surgeons to repeat watching videos to find the precise start and end time for a surgical phase. In this paper, we intro... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.