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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1908.07899 | Tobias Hinz | Marcus Soll, Tobias Hinz, Sven Magg, Stefan Wermter | Evaluating Defensive Distillation For Defending Text Processing Neural
Networks Against Adversarial Examples | Published at the International Conference on Artificial Neural
Networks (ICANN) 2019 | null | null | null | cs.CL cs.CR cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adversarial examples are artificially modified input samples which lead to
misclassifications, while not being detectable by humans. These adversarial
examples are a challenge for many tasks such as image and text classification,
especially as research shows that many adversarial examples are transferable
between dif... | [
{
"created": "Wed, 21 Aug 2019 14:50:13 GMT",
"version": "v1"
}
] | 2019-08-22 | [
[
"Soll",
"Marcus",
""
],
[
"Hinz",
"Tobias",
""
],
[
"Magg",
"Sven",
""
],
[
"Wermter",
"Stefan",
""
]
] | Adversarial examples are artificially modified input samples which lead to misclassifications, while not being detectable by humans. These adversarial examples are a challenge for many tasks such as image and text classification, especially as research shows that many adversarial examples are transferable between diffe... |
2204.03738 | Felipe Oviedo | Felipe Oviedo, Srinivas Vinnakota, Eugene Seleznev, Hemant Malhotra,
Saqib Shaikh, Juan Lavista Ferres | BankNote-Net: Open dataset for assistive universal currency recognition | Pre-print | null | null | null | cs.CV cs.HC cs.LG | http://creativecommons.org/licenses/by/4.0/ | Millions of people around the world have low or no vision. Assistive software
applications have been developed for a variety of day-to-day tasks, including
optical character recognition, scene identification, person recognition, and
currency recognition. This last task, the recognition of banknotes from
different den... | [
{
"created": "Thu, 7 Apr 2022 21:16:54 GMT",
"version": "v1"
}
] | 2022-04-11 | [
[
"Oviedo",
"Felipe",
""
],
[
"Vinnakota",
"Srinivas",
""
],
[
"Seleznev",
"Eugene",
""
],
[
"Malhotra",
"Hemant",
""
],
[
"Shaikh",
"Saqib",
""
],
[
"Ferres",
"Juan Lavista",
""
]
] | Millions of people around the world have low or no vision. Assistive software applications have been developed for a variety of day-to-day tasks, including optical character recognition, scene identification, person recognition, and currency recognition. This last task, the recognition of banknotes from different denom... |
2004.07610 | Roshan Singh | Roshan Singh, Pranav Kumar Singh | Connecting the Dots of COVID-19 Transmissions in India | Withdrawing for improving research scope | null | null | null | cs.SI physics.soc-ph q-bio.PE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Witnessing its first case in late January 2020 India has seen a sharp rise in
the number of positive cases of COVID-19. 34 States/UT (s) of the country have
been found to be affected by the pandemic to date. We in this work, study the
progress of COVID-19 pandemic in India. We aim to create transmission network
visua... | [
{
"created": "Thu, 16 Apr 2020 11:40:04 GMT",
"version": "v1"
},
{
"created": "Sat, 25 Jul 2020 13:18:39 GMT",
"version": "v2"
}
] | 2020-07-28 | [
[
"Singh",
"Roshan",
""
],
[
"Singh",
"Pranav Kumar",
""
]
] | Witnessing its first case in late January 2020 India has seen a sharp rise in the number of positive cases of COVID-19. 34 States/UT (s) of the country have been found to be affected by the pandemic to date. We in this work, study the progress of COVID-19 pandemic in India. We aim to create transmission network visuali... |
2408.01163 | Alexander Olza | Alexander Olza, David Soto, Roberto Santana | Domain Adaptation-Enhanced Searchlight: Enabling brain decoding from
visual perception to mental imagery | null | null | null | null | cs.LG q-bio.NC | http://creativecommons.org/licenses/by-sa/4.0/ | In cognitive neuroscience and brain-computer interface research, accurately
predicting imagined stimuli is crucial. This study investigates the
effectiveness of Domain Adaptation (DA) in enhancing imagery prediction using
primarily visual data from fMRI scans of 18 subjects. Initially, we train a
baseline model on vi... | [
{
"created": "Fri, 2 Aug 2024 10:25:19 GMT",
"version": "v1"
}
] | 2024-08-05 | [
[
"Olza",
"Alexander",
""
],
[
"Soto",
"David",
""
],
[
"Santana",
"Roberto",
""
]
] | In cognitive neuroscience and brain-computer interface research, accurately predicting imagined stimuli is crucial. This study investigates the effectiveness of Domain Adaptation (DA) in enhancing imagery prediction using primarily visual data from fMRI scans of 18 subjects. Initially, we train a baseline model on visu... |
2007.03680 | Ioannis Mavromatis Dr | Ioannis Mavromatis, Robert J. Piechocki, Mahesh Sooriyabandara, Arjun
Parekh | DRIVE: A Digital Network Oracle for Cooperative Intelligent
Transportation Systems | Accepted for publication at IEEE ISCC 2020 | null | 10.1109/ISCC50000.2020.9219683 | null | cs.NI cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a world where Artificial Intelligence revolutionizes inference, prediction
and decision-making tasks, Digital Twins emerge as game-changing tools. A case
in point is the development and optimization of Cooperative Intelligent
Transportation Systems (C-ITSs): a confluence of cyber-physical digital
infrastructure an... | [
{
"created": "Tue, 7 Jul 2020 09:34:09 GMT",
"version": "v1"
}
] | 2022-09-05 | [
[
"Mavromatis",
"Ioannis",
""
],
[
"Piechocki",
"Robert J.",
""
],
[
"Sooriyabandara",
"Mahesh",
""
],
[
"Parekh",
"Arjun",
""
]
] | In a world where Artificial Intelligence revolutionizes inference, prediction and decision-making tasks, Digital Twins emerge as game-changing tools. A case in point is the development and optimization of Cooperative Intelligent Transportation Systems (C-ITSs): a confluence of cyber-physical digital infrastructure and ... |
2304.05895 | Damien Dablain | Damien A. Dablain and Nitesh V. Chawla | Towards Understanding How Data Augmentation Works with Imbalanced Data | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Data augmentation forms the cornerstone of many modern machine learning
training pipelines; yet, the mechanisms by which it works are not clearly
understood. Much of the research on data augmentation (DA) has focused on
improving existing techniques, examining its regularization effects in the
context of neural netwo... | [
{
"created": "Wed, 12 Apr 2023 15:01:22 GMT",
"version": "v1"
}
] | 2023-04-13 | [
[
"Dablain",
"Damien A.",
""
],
[
"Chawla",
"Nitesh V.",
""
]
] | Data augmentation forms the cornerstone of many modern machine learning training pipelines; yet, the mechanisms by which it works are not clearly understood. Much of the research on data augmentation (DA) has focused on improving existing techniques, examining its regularization effects in the context of neural network... |
2001.05581 | Andreas Z\"ufle | Tobias Emrich, Hans-Peter Kriegel, Andreas Z\"ufle, Peer Kr\"oger,
Matthias Renz | Complete and Sufficient Spatial Domination of Multidimensional
Rectangles | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rectangles are used to approximate objects, or sets of objects, in a plethora
of applications, systems and index structures. Many tasks, such as nearest
neighbor search and similarity ranking, require to decide if objects in one
rectangle A may, must, or must not be closer to objects in a second rectangle
B, than obj... | [
{
"created": "Wed, 15 Jan 2020 22:24:40 GMT",
"version": "v1"
}
] | 2020-01-17 | [
[
"Emrich",
"Tobias",
""
],
[
"Kriegel",
"Hans-Peter",
""
],
[
"Züfle",
"Andreas",
""
],
[
"Kröger",
"Peer",
""
],
[
"Renz",
"Matthias",
""
]
] | Rectangles are used to approximate objects, or sets of objects, in a plethora of applications, systems and index structures. Many tasks, such as nearest neighbor search and similarity ranking, require to decide if objects in one rectangle A may, must, or must not be closer to objects in a second rectangle B, than objec... |
1306.5838 | Elena Khramtcova | Panagiotis Cheilaris, Elena Khramtcova, Evanthia Papadopoulou | Randomized incremental construction of the Hausdorff Voronoi diagram of
non-crossing clusters | This paper has been withdrawn by the author because the substantially
updated version (improved results, major text revision) is now submitted
(arXiv:1312.3904) | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the Hausdorff Voronoi diagram of a set of clusters of points in the plane,
the distance between a point t and a cluster P is the maximum Euclidean
distance between t and a point in P. This diagram has direct applications in
VLSI design. We consider so-called "non-crossing" clusters. The complexity of
the Hausdorff... | [
{
"created": "Tue, 25 Jun 2013 03:12:56 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Dec 2013 12:31:12 GMT",
"version": "v2"
}
] | 2013-12-17 | [
[
"Cheilaris",
"Panagiotis",
""
],
[
"Khramtcova",
"Elena",
""
],
[
"Papadopoulou",
"Evanthia",
""
]
] | In the Hausdorff Voronoi diagram of a set of clusters of points in the plane, the distance between a point t and a cluster P is the maximum Euclidean distance between t and a point in P. This diagram has direct applications in VLSI design. We consider so-called "non-crossing" clusters. The complexity of the Hausdorff d... |
2008.06471 | Gal Metzer | Gal Metzer, Rana Hanocka, Raja Giryes, Daniel Cohen-Or | Self-Sampling for Neural Point Cloud Consolidation | TOG 2021 | null | null | null | cs.GR cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a novel technique for neural point cloud consolidation which
learns from only the input point cloud. Unlike other point upsampling methods
which analyze shapes via local patches, in this work, we learn from global
subsets. We repeatedly self-sample the input point cloud with global subsets
that are used ... | [
{
"created": "Fri, 14 Aug 2020 17:16:02 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Mar 2021 17:09:31 GMT",
"version": "v2"
},
{
"created": "Fri, 13 May 2022 09:19:55 GMT",
"version": "v3"
}
] | 2022-05-16 | [
[
"Metzer",
"Gal",
""
],
[
"Hanocka",
"Rana",
""
],
[
"Giryes",
"Raja",
""
],
[
"Cohen-Or",
"Daniel",
""
]
] | We introduce a novel technique for neural point cloud consolidation which learns from only the input point cloud. Unlike other point upsampling methods which analyze shapes via local patches, in this work, we learn from global subsets. We repeatedly self-sample the input point cloud with global subsets that are used to... |
1708.09540 | Sukhdev Singh | Ayush Sharma, Piyush Bajpai, Sukhdev Singh and Kiran Khatter | Virtual Reality: Blessings and Risk Assessment | 22 page and 1 Table | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Objectives: This paper presents an up-to-date overview of research performed
in the Virtual Reality (VR) environment ranging from definitions, its presence
in the various fields, and existing market players and their projects in the VR
technology. Further an attempt is made to gain an insight on the psychological
mec... | [
{
"created": "Thu, 31 Aug 2017 02:34:22 GMT",
"version": "v1"
}
] | 2017-09-01 | [
[
"Sharma",
"Ayush",
""
],
[
"Bajpai",
"Piyush",
""
],
[
"Singh",
"Sukhdev",
""
],
[
"Khatter",
"Kiran",
""
]
] | Objectives: This paper presents an up-to-date overview of research performed in the Virtual Reality (VR) environment ranging from definitions, its presence in the various fields, and existing market players and their projects in the VR technology. Further an attempt is made to gain an insight on the psychological mecha... |
0905.1307 | Michael Goodrich | Michael T. Goodrich, Roberto Tamassia, Jasminka Hasic | An Efficient Dynamic and Distributed RSA Accumulator | Expanded version of a paper appearing in the 5th International
Information Security Conference (ISC) | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show how to use the RSA one-way accumulator to realize an efficient and
dynamic authenticated dictionary, where untrusted directories provide
cryptographically verifiable answers to membership queries on a set maintained
by a trusted source. Our accumulator-based scheme for authenticated
dictionaries supports effi... | [
{
"created": "Fri, 8 May 2009 17:49:57 GMT",
"version": "v1"
}
] | 2009-05-11 | [
[
"Goodrich",
"Michael T.",
""
],
[
"Tamassia",
"Roberto",
""
],
[
"Hasic",
"Jasminka",
""
]
] | We show how to use the RSA one-way accumulator to realize an efficient and dynamic authenticated dictionary, where untrusted directories provide cryptographically verifiable answers to membership queries on a set maintained by a trusted source. Our accumulator-based scheme for authenticated dictionaries supports effici... |
2202.13114 | Hoang Lam Nguyen | Hoang Lam Nguyen, Lars Grunske | BeDivFuzz: Integrating Behavioral Diversity into Generator-based Fuzzing | To appear in the proceedings of the 44th International Conference on
Software Engineering (ICSE 2022) | null | 10.1145/3510003.3510182 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A popular metric to evaluate the performance of fuzzers is branch coverage.
However, we argue that focusing solely on covering many different branches
(i.e., the richness) is not sufficient since the majority of the covered
branches may have been exercised only once, which does not inspire a high
confidence in the re... | [
{
"created": "Sat, 26 Feb 2022 11:03:35 GMT",
"version": "v1"
}
] | 2022-03-01 | [
[
"Nguyen",
"Hoang Lam",
""
],
[
"Grunske",
"Lars",
""
]
] | A popular metric to evaluate the performance of fuzzers is branch coverage. However, we argue that focusing solely on covering many different branches (i.e., the richness) is not sufficient since the majority of the covered branches may have been exercised only once, which does not inspire a high confidence in the reli... |
2311.08552 | Mahmoud Salem | Mahmoud G. Salem, Jiayu Ye, Chu-Cheng Lin, Frederick Liu | UT5: Pretraining Non autoregressive T5 with unrolled denoising | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Recent advances in Transformer-based Large Language Models have made great
strides in natural language generation. However, to decode K tokens, an
autoregressive model needs K sequential forward passes, which may be a
performance bottleneck for large language models. Many non-autoregressive (NAR)
research are aiming ... | [
{
"created": "Tue, 14 Nov 2023 21:28:10 GMT",
"version": "v1"
}
] | 2023-11-16 | [
[
"Salem",
"Mahmoud G.",
""
],
[
"Ye",
"Jiayu",
""
],
[
"Lin",
"Chu-Cheng",
""
],
[
"Liu",
"Frederick",
""
]
] | Recent advances in Transformer-based Large Language Models have made great strides in natural language generation. However, to decode K tokens, an autoregressive model needs K sequential forward passes, which may be a performance bottleneck for large language models. Many non-autoregressive (NAR) research are aiming to... |
1706.08675 | Dorien Herremans | Dorien Herremans, Ching-Hua Chuan | Proceedings of the First International Workshop on Deep Learning and
Music | null | Proceedings of the First International Workshop on Deep Learning
and Music, joint with IJCNN, Anchorage, US, May 17-18, 2017 | 10.13140/RG.2.2.22227.99364/1 | null | cs.NE cs.LG cs.MM cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Proceedings of the First International Workshop on Deep Learning and Music,
joint with IJCNN, Anchorage, US, May 17-18, 2017
| [
{
"created": "Tue, 27 Jun 2017 05:28:06 GMT",
"version": "v1"
}
] | 2017-06-28 | [
[
"Herremans",
"Dorien",
""
],
[
"Chuan",
"Ching-Hua",
""
]
] | Proceedings of the First International Workshop on Deep Learning and Music, joint with IJCNN, Anchorage, US, May 17-18, 2017 |
2210.07474 | Xiaojian Ma | Xiaojian Ma, Silong Yong, Zilong Zheng, Qing Li, Yitao Liang,
Song-Chun Zhu, Siyuan Huang | SQA3D: Situated Question Answering in 3D Scenes | ICLR 2023. First two authors contributed equally. Project website:
https://sqa3d.github.io | null | null | null | cs.CV cs.AI cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | We propose a new task to benchmark scene understanding of embodied agents:
Situated Question Answering in 3D Scenes (SQA3D). Given a scene context (e.g.,
3D scan), SQA3D requires the tested agent to first understand its situation
(position, orientation, etc.) in the 3D scene as described by text, then reason
about it... | [
{
"created": "Fri, 14 Oct 2022 02:52:26 GMT",
"version": "v1"
},
{
"created": "Sat, 22 Oct 2022 15:25:26 GMT",
"version": "v2"
},
{
"created": "Sat, 11 Feb 2023 01:57:41 GMT",
"version": "v3"
},
{
"created": "Wed, 22 Feb 2023 08:25:24 GMT",
"version": "v4"
},
{
"c... | 2023-04-14 | [
[
"Ma",
"Xiaojian",
""
],
[
"Yong",
"Silong",
""
],
[
"Zheng",
"Zilong",
""
],
[
"Li",
"Qing",
""
],
[
"Liang",
"Yitao",
""
],
[
"Zhu",
"Song-Chun",
""
],
[
"Huang",
"Siyuan",
""
]
] | We propose a new task to benchmark scene understanding of embodied agents: Situated Question Answering in 3D Scenes (SQA3D). Given a scene context (e.g., 3D scan), SQA3D requires the tested agent to first understand its situation (position, orientation, etc.) in the 3D scene as described by text, then reason about its ... |
2308.02874 | Zijie Wu | Zijie Wu, Yaonan Wang, Mingtao Feng, He Xie, Ajmal Mian | Sketch and Text Guided Diffusion Model for Colored Point Cloud
Generation | Accepted by ICCV 2023 | null | null | null | cs.CV cs.MM | http://creativecommons.org/licenses/by/4.0/ | Diffusion probabilistic models have achieved remarkable success in text
guided image generation. However, generating 3D shapes is still challenging due
to the lack of sufficient data containing 3D models along with their
descriptions. Moreover, text based descriptions of 3D shapes are inherently
ambiguous and lack de... | [
{
"created": "Sat, 5 Aug 2023 13:10:43 GMT",
"version": "v1"
}
] | 2023-08-08 | [
[
"Wu",
"Zijie",
""
],
[
"Wang",
"Yaonan",
""
],
[
"Feng",
"Mingtao",
""
],
[
"Xie",
"He",
""
],
[
"Mian",
"Ajmal",
""
]
] | Diffusion probabilistic models have achieved remarkable success in text guided image generation. However, generating 3D shapes is still challenging due to the lack of sufficient data containing 3D models along with their descriptions. Moreover, text based descriptions of 3D shapes are inherently ambiguous and lack deta... |
1102.5197 | Moez Hizem | Moez Hizem and Ridha Bouallegue | Fine Synchronization through UWB TH-PPM Impulse Radios | 11 pages, 7 figures | International Journal of Wireless & Mobile Networks (IJWMN) Vol.
3, No. 1, February 2011 | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a novel fine timing algorithm has been tested and developed to
synchronize Ultra-Wideband (UWB) signals with pulse position modulation (PPM).
By applying this algorithm, we evaluate timing algorithms in both data-aided
(DA) and non-data-aided (NDA) modes. Based on correlation operations, our
algorithm ... | [
{
"created": "Fri, 25 Feb 2011 09:31:28 GMT",
"version": "v1"
}
] | 2011-02-28 | [
[
"Hizem",
"Moez",
""
],
[
"Bouallegue",
"Ridha",
""
]
] | In this paper, a novel fine timing algorithm has been tested and developed to synchronize Ultra-Wideband (UWB) signals with pulse position modulation (PPM). By applying this algorithm, we evaluate timing algorithms in both data-aided (DA) and non-data-aided (NDA) modes. Based on correlation operations, our algorithm re... |
1304.0270 | Jun Zhu Professor | Fan Wang, Jun Zhu and Lin Zhang | An optimal problem for relative entropy | 10 page | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Relative entropy is an essential tool in quantum information theory. There
are so many problems which are related to relative entropy. In this article,
the optimal values which are defined by $\displaystyle\max_{U\in{U(\cX_{d})}}
S(U\rho{U^{\ast}}\parallel\sigma)$ and $\displaystyle\min_{U\in{U(\cX_{d})}}
S(U\rho{U^{... | [
{
"created": "Mon, 1 Apr 2013 00:53:08 GMT",
"version": "v1"
}
] | 2013-04-02 | [
[
"Wang",
"Fan",
""
],
[
"Zhu",
"Jun",
""
],
[
"Zhang",
"Lin",
""
]
] | Relative entropy is an essential tool in quantum information theory. There are so many problems which are related to relative entropy. In this article, the optimal values which are defined by $\displaystyle\max_{U\in{U(\cX_{d})}} S(U\rho{U^{\ast}}\parallel\sigma)$ and $\displaystyle\min_{U\in{U(\cX_{d})}} S(U\rho{U^{\a... |
0909.5649 | Vitaly Osipov | Nikolaj Leischner, Vitaly Osipov, Peter Sanders | GPU sample sort | null | null | null | null | cs.DS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present the design of a sample sort algorithm for manycore
GPUs. Despite being one of the most efficient comparison-based sorting
algorithms for distributed memory architectures its performance on GPUs was
previously unknown. For uniformly distributed keys our sample sort is at least
25% and on aver... | [
{
"created": "Wed, 30 Sep 2009 15:58:53 GMT",
"version": "v1"
}
] | 2009-10-01 | [
[
"Leischner",
"Nikolaj",
""
],
[
"Osipov",
"Vitaly",
""
],
[
"Sanders",
"Peter",
""
]
] | In this paper, we present the design of a sample sort algorithm for manycore GPUs. Despite being one of the most efficient comparison-based sorting algorithms for distributed memory architectures its performance on GPUs was previously unknown. For uniformly distributed keys our sample sort is at least 25% and on averag... |
2408.05746 | Nianzu Li | Nianzu Li, Weidong Mei, Boyu Ning, Peiran Wu | Movable Antenna Enhanced AF Relaying: Two-Stage Antenna Position
Optimization | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The movable antenna (MA) technology has attracted increasing attention in
wireless communications due to its capability for flexibly adjusting the
positions of multiple antennas in a local region to reconfigure channel
conditions. In this paper, we investigate its application in an
amplify-and-forward (AF) relay syst... | [
{
"created": "Sun, 11 Aug 2024 10:58:13 GMT",
"version": "v1"
}
] | 2024-08-13 | [
[
"Li",
"Nianzu",
""
],
[
"Mei",
"Weidong",
""
],
[
"Ning",
"Boyu",
""
],
[
"Wu",
"Peiran",
""
]
] | The movable antenna (MA) technology has attracted increasing attention in wireless communications due to its capability for flexibly adjusting the positions of multiple antennas in a local region to reconfigure channel conditions. In this paper, we investigate its application in an amplify-and-forward (AF) relay system... |
2002.08859 | Eitan Richardson | Eitan Richardson and Yair Weiss | A Bayes-Optimal View on Adversarial Examples | Minor revision per journal review, 28 pages | null | null | null | cs.LG cs.CR cs.CV stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Since the discovery of adversarial examples - the ability to fool modern CNN
classifiers with tiny perturbations of the input, there has been much
discussion whether they are a "bug" that is specific to current neural
architectures and training methods or an inevitable "feature" of high
dimensional geometry. In this ... | [
{
"created": "Thu, 20 Feb 2020 16:43:47 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Mar 2021 09:47:10 GMT",
"version": "v2"
}
] | 2021-03-18 | [
[
"Richardson",
"Eitan",
""
],
[
"Weiss",
"Yair",
""
]
] | Since the discovery of adversarial examples - the ability to fool modern CNN classifiers with tiny perturbations of the input, there has been much discussion whether they are a "bug" that is specific to current neural architectures and training methods or an inevitable "feature" of high dimensional geometry. In this pa... |
2111.12077 | Jonathan Barron | Jonathan T. Barron, Ben Mildenhall, Dor Verbin, Pratul P. Srinivasan,
Peter Hedman | Mip-NeRF 360: Unbounded Anti-Aliased Neural Radiance Fields | https://jonbarron.info/mipnerf360/ | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Though neural radiance fields (NeRF) have demonstrated impressive view
synthesis results on objects and small bounded regions of space, they struggle
on "unbounded" scenes, where the camera may point in any direction and content
may exist at any distance. In this setting, existing NeRF-like models often
produce blurr... | [
{
"created": "Tue, 23 Nov 2021 18:51:18 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Nov 2021 18:51:06 GMT",
"version": "v2"
},
{
"created": "Fri, 25 Mar 2022 23:05:20 GMT",
"version": "v3"
}
] | 2022-03-29 | [
[
"Barron",
"Jonathan T.",
""
],
[
"Mildenhall",
"Ben",
""
],
[
"Verbin",
"Dor",
""
],
[
"Srinivasan",
"Pratul P.",
""
],
[
"Hedman",
"Peter",
""
]
] | Though neural radiance fields (NeRF) have demonstrated impressive view synthesis results on objects and small bounded regions of space, they struggle on "unbounded" scenes, where the camera may point in any direction and content may exist at any distance. In this setting, existing NeRF-like models often produce blurry ... |
1103.4080 | Armel Ulrich Kemloh Wagoum | A. U. Kemloh Wagoum, A. Seyfried and S. Holl | Modelling dynamic route choice of pedestrians to assess the criticality
of building evacuation | 15 pages, 34 figures | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an event-driven way finding algorithm for pedestrians in
an evacuation scenario, which operates on a graph-based structure. The
motivation of each pedestrian is to leave the facility. The events used to
redirect pedestrians include the identification of a jam situation and/or
identification of a b... | [
{
"created": "Mon, 21 Mar 2011 17:04:08 GMT",
"version": "v1"
}
] | 2011-03-22 | [
[
"Wagoum",
"A. U. Kemloh",
""
],
[
"Seyfried",
"A.",
""
],
[
"Holl",
"S.",
""
]
] | This paper presents an event-driven way finding algorithm for pedestrians in an evacuation scenario, which operates on a graph-based structure. The motivation of each pedestrian is to leave the facility. The events used to redirect pedestrians include the identification of a jam situation and/or identification of a bet... |
2211.10409 | Chi Zhang | Chi Zhang, Paul Scheffler, Thomas Benz, Matteo Perotti, Luca Benini | AXI-Pack: Near-Memory Bus Packing for Bandwidth-Efficient Irregular
Workloads | 6 pages, 5 figures. Submitted to DATE 2023 | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data-intensive applications involving irregular memory streams are
inefficiently handled by modern processors and memory systems highly optimized
for regular, contiguous data. Recent work tackles these inefficiencies in
hardware through core-side stream extensions or memory-side prefetchers and
accelerators, but fail... | [
{
"created": "Fri, 18 Nov 2022 18:23:47 GMT",
"version": "v1"
}
] | 2022-11-21 | [
[
"Zhang",
"Chi",
""
],
[
"Scheffler",
"Paul",
""
],
[
"Benz",
"Thomas",
""
],
[
"Perotti",
"Matteo",
""
],
[
"Benini",
"Luca",
""
]
] | Data-intensive applications involving irregular memory streams are inefficiently handled by modern processors and memory systems highly optimized for regular, contiguous data. Recent work tackles these inefficiencies in hardware through core-side stream extensions or memory-side prefetchers and accelerators, but fails ... |
2303.13514 | Mehmet Ayg\"un | Mehmet Ayg\"un and Oisin Mac Aodha | SAOR: Single-View Articulated Object Reconstruction | Accepted to CVPR 2024, website: https://mehmetaygun.github.io/saor | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | We introduce SAOR, a novel approach for estimating the 3D shape, texture, and
viewpoint of an articulated object from a single image captured in the wild.
Unlike prior approaches that rely on pre-defined category-specific 3D templates
or tailored 3D skeletons, SAOR learns to articulate shapes from single-view
image c... | [
{
"created": "Thu, 23 Mar 2023 17:59:35 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Dec 2023 19:25:10 GMT",
"version": "v2"
},
{
"created": "Mon, 8 Apr 2024 11:22:05 GMT",
"version": "v3"
}
] | 2024-04-09 | [
[
"Aygün",
"Mehmet",
""
],
[
"Mac Aodha",
"Oisin",
""
]
] | We introduce SAOR, a novel approach for estimating the 3D shape, texture, and viewpoint of an articulated object from a single image captured in the wild. Unlike prior approaches that rely on pre-defined category-specific 3D templates or tailored 3D skeletons, SAOR learns to articulate shapes from single-view image col... |
1611.03453 | Abhishek Gupta | Abhishek Gupta, M. Farhan Habib, Uttam Mandal, Pulak Chowdhury,
Massimo Tornatore, and Biswanath Mukherjee | On Service-Chaining Strategies using Virtual Network Functions in
Operator Networks | null | https://doi.org/10.1016/j.comnet.2018.01.028 | 10.1016/j.comnet.2018.01.028 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network functions (e.g., firewalls, load balancers, etc.) have been
traditionally provided through proprietary hardware appliances. Often, hardware
appliances need to be hardwired back to back to form a service chain providing
chained network functions. Hardware appliances cannot be provisioned on demand
since they a... | [
{
"created": "Thu, 10 Nov 2016 19:15:45 GMT",
"version": "v1"
}
] | 2018-04-23 | [
[
"Gupta",
"Abhishek",
""
],
[
"Habib",
"M. Farhan",
""
],
[
"Mandal",
"Uttam",
""
],
[
"Chowdhury",
"Pulak",
""
],
[
"Tornatore",
"Massimo",
""
],
[
"Mukherjee",
"Biswanath",
""
]
] | Network functions (e.g., firewalls, load balancers, etc.) have been traditionally provided through proprietary hardware appliances. Often, hardware appliances need to be hardwired back to back to form a service chain providing chained network functions. Hardware appliances cannot be provisioned on demand since they are... |
2209.09668 | Max Klimm | Max Klimm and Martin Knaack | Maximizing a Submodular Function with Bounded Curvature under an Unknown
Knapsack Constraint | null | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the problem of maximizing a monotone submodular function
under an unknown knapsack constraint. A solution to this problem is a policy
that decides which item to pack next based on the past packing history. The
robustness factor of a policy is the worst case ratio of the solution obtained
by followi... | [
{
"created": "Tue, 20 Sep 2022 12:04:59 GMT",
"version": "v1"
}
] | 2022-09-21 | [
[
"Klimm",
"Max",
""
],
[
"Knaack",
"Martin",
""
]
] | This paper studies the problem of maximizing a monotone submodular function under an unknown knapsack constraint. A solution to this problem is a policy that decides which item to pack next based on the past packing history. The robustness factor of a policy is the worst case ratio of the solution obtained by following... |
1511.05768 | Andreas Bulling | Marc Tonsen, Xucong Zhang, Yusuke Sugano, Andreas Bulling | Labeled pupils in the wild: A dataset for studying pupil detection in
unconstrained environments | null | null | 10.1145/2857491.2857520 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present labelled pupils in the wild (LPW), a novel dataset of 66
high-quality, high-speed eye region videos for the development and evaluation
of pupil detection algorithms. The videos in our dataset were recorded from 22
participants in everyday locations at about 95 FPS using a state-of-the-art
dark-pupil head-m... | [
{
"created": "Wed, 18 Nov 2015 13:30:55 GMT",
"version": "v1"
}
] | 2017-02-07 | [
[
"Tonsen",
"Marc",
""
],
[
"Zhang",
"Xucong",
""
],
[
"Sugano",
"Yusuke",
""
],
[
"Bulling",
"Andreas",
""
]
] | We present labelled pupils in the wild (LPW), a novel dataset of 66 high-quality, high-speed eye region videos for the development and evaluation of pupil detection algorithms. The videos in our dataset were recorded from 22 participants in everyday locations at about 95 FPS using a state-of-the-art dark-pupil head-mou... |
2407.03596 | Xuerong Zhang | Xuerong Zhang, Li Huang, Jing Lv, Ming Yang | Self Adaptive Threshold Pseudo-labeling and Unreliable Sample
Contrastive Loss for Semi-supervised Image Classification | ICANN24 accepted | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Semi-supervised learning is attracting blooming attention, due to its success
in combining unlabeled data. However, pseudo-labeling-based semi-supervised
approaches suffer from two problems in image classification: (1) Existing
methods might fail to adopt suitable thresholds since they either use a
pre-defined/fixed ... | [
{
"created": "Thu, 4 Jul 2024 03:04:56 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Zhang",
"Xuerong",
""
],
[
"Huang",
"Li",
""
],
[
"Lv",
"Jing",
""
],
[
"Yang",
"Ming",
""
]
] | Semi-supervised learning is attracting blooming attention, due to its success in combining unlabeled data. However, pseudo-labeling-based semi-supervised approaches suffer from two problems in image classification: (1) Existing methods might fail to adopt suitable thresholds since they either use a pre-defined/fixed th... |
2303.04392 | Amaael Antonini | Amaael Antonini, Rita Gimelshein, and Richard Wesel | Achievable Rates and Low-Complexity Encoding of Posterior Matching for
the BSC | This paper consists of 26 pages and contains 6 figures. An earlier
version of the algorithm included in this paper was published at the 2020
IEEE International Symposium on Information Theory (ISIT), (DOI:
10.1109/ISIT44484.2020.9174232) | null | null | null | cs.IT cs.IR math.IT | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Horstein, Burnashev, Shayevitz and Feder, Naghshvar et al. and others have
studied sequential transmission of a K-bit message over the binary symmetric
channel (BSC) with full, noiseless feedback using posterior matching. Yang et
al. provide an improved lower bound on the achievable rate using martingale
analysis tha... | [
{
"created": "Wed, 8 Mar 2023 05:53:33 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Mar 2023 01:31:11 GMT",
"version": "v2"
}
] | 2023-03-13 | [
[
"Antonini",
"Amaael",
""
],
[
"Gimelshein",
"Rita",
""
],
[
"Wesel",
"Richard",
""
]
] | Horstein, Burnashev, Shayevitz and Feder, Naghshvar et al. and others have studied sequential transmission of a K-bit message over the binary symmetric channel (BSC) with full, noiseless feedback using posterior matching. Yang et al. provide an improved lower bound on the achievable rate using martingale analysis that ... |
2401.10353 | Mian Zhang | Mian Zhang, Lifeng Jin, Linfeng Song, Haitao Mi and Dong Yu | Inconsistent dialogue responses and how to recover from them | Accepted in EACL 2024. Code and dataset available at
https://github.com/mianzhang/CIDER | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | One critical issue for chat systems is to stay consistent about preferences,
opinions, beliefs and facts of itself, which has been shown a difficult
problem. In this work, we study methods to assess and bolster utterance
consistency of chat systems. A dataset is first developed for studying the
inconsistencies, where... | [
{
"created": "Thu, 18 Jan 2024 19:46:04 GMT",
"version": "v1"
}
] | 2024-01-22 | [
[
"Zhang",
"Mian",
""
],
[
"Jin",
"Lifeng",
""
],
[
"Song",
"Linfeng",
""
],
[
"Mi",
"Haitao",
""
],
[
"Yu",
"Dong",
""
]
] | One critical issue for chat systems is to stay consistent about preferences, opinions, beliefs and facts of itself, which has been shown a difficult problem. In this work, we study methods to assess and bolster utterance consistency of chat systems. A dataset is first developed for studying the inconsistencies, where i... |
2307.10447 | Yumeng Xue | Yumeng Xue, Patrick Paetzold, Rebecca Kehlbeck, Bin Chen, Kin Chung
Kwan, Yunhai Wang, and Oliver Deussen | Reducing Ambiguities in Line-based Density Plots by Image-space
Colorization | Published in IEEE Transactions on Visualization and Computer Graphics
(Supplementary Material: https://osf.io/jm5yz/) | null | 10.1109/TVCG.2023.3327149 | null | cs.GR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Line-based density plots are used to reduce visual clutter in line charts
with a multitude of individual lines. However, these traditional density plots
are often perceived ambiguously, which obstructs the user's identification of
underlying trends in complex datasets. Thus, we propose a novel image space
coloring me... | [
{
"created": "Sun, 16 Jul 2023 15:15:00 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Nov 2023 13:22:48 GMT",
"version": "v2"
}
] | 2023-11-23 | [
[
"Xue",
"Yumeng",
""
],
[
"Paetzold",
"Patrick",
""
],
[
"Kehlbeck",
"Rebecca",
""
],
[
"Chen",
"Bin",
""
],
[
"Kwan",
"Kin Chung",
""
],
[
"Wang",
"Yunhai",
""
],
[
"Deussen",
"Oliver",
""
]
] | Line-based density plots are used to reduce visual clutter in line charts with a multitude of individual lines. However, these traditional density plots are often perceived ambiguously, which obstructs the user's identification of underlying trends in complex datasets. Thus, we propose a novel image space coloring meth... |
2401.15289 | Xi Tan | Xi Tan, Zheyuan Ma, Sandro Pinto, Le Guan, Ning Zhang, Jun Xu,
Zhiqiang Lin, Hongxin Hu, Ziming Zhao | SoK: Where's the "up"?! A Comprehensive (bottom-up) Study on the
Security of Arm Cortex-M Systems | To Appear in the 18th USENIX WOOT Conference on Offensive
Technologies, August 12-13, 2024 | null | null | null | cs.CR cs.AR | http://creativecommons.org/licenses/by/4.0/ | Arm Cortex-M processors are the most widely used 32-bit microcontrollers
among embedded and Internet-of-Things devices. Despite the widespread usage,
there has been little effort in summarizing their hardware security features,
characterizing the limitations and vulnerabilities of their hardware and
software stack, a... | [
{
"created": "Sat, 27 Jan 2024 04:09:29 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Jan 2024 17:20:26 GMT",
"version": "v2"
},
{
"created": "Mon, 13 May 2024 21:09:28 GMT",
"version": "v3"
}
] | 2024-05-15 | [
[
"Tan",
"Xi",
""
],
[
"Ma",
"Zheyuan",
""
],
[
"Pinto",
"Sandro",
""
],
[
"Guan",
"Le",
""
],
[
"Zhang",
"Ning",
""
],
[
"Xu",
"Jun",
""
],
[
"Lin",
"Zhiqiang",
""
],
[
"Hu",
"Hongxin",
""
... | Arm Cortex-M processors are the most widely used 32-bit microcontrollers among embedded and Internet-of-Things devices. Despite the widespread usage, there has been little effort in summarizing their hardware security features, characterizing the limitations and vulnerabilities of their hardware and software stack, and... |
2205.01873 | Yuanfei Dai | Yuanfei Dai, Wenzhong Guo and Carsten Eickhoff | Wasserstein Adversarial Learning based Temporal Knowledge Graph
Embedding | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Research on knowledge graph embedding (KGE) has emerged as an active field in
which most existing KGE approaches mainly focus on static structural data and
ignore the influence of temporal variation involved in time-aware triples. In
order to deal with this issue, several temporal knowledge graph embedding
(TKGE) app... | [
{
"created": "Wed, 4 May 2022 03:28:49 GMT",
"version": "v1"
}
] | 2022-05-05 | [
[
"Dai",
"Yuanfei",
""
],
[
"Guo",
"Wenzhong",
""
],
[
"Eickhoff",
"Carsten",
""
]
] | Research on knowledge graph embedding (KGE) has emerged as an active field in which most existing KGE approaches mainly focus on static structural data and ignore the influence of temporal variation involved in time-aware triples. In order to deal with this issue, several temporal knowledge graph embedding (TKGE) appro... |
1612.05877 | Zhiwu Huang | Zhiwu Huang, Chengde Wan, Thomas Probst, Luc Van Gool | Deep Learning on Lie Groups for Skeleton-based Action Recognition | Accepted to CVPR 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, skeleton-based action recognition has become a popular 3D
classification problem. State-of-the-art methods typically first represent each
motion sequence as a high-dimensional trajectory on a Lie group with an
additional dynamic time warping, and then shallowly learn favorable Lie group
features. In ... | [
{
"created": "Sun, 18 Dec 2016 09:08:29 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Apr 2017 08:47:00 GMT",
"version": "v2"
}
] | 2017-04-12 | [
[
"Huang",
"Zhiwu",
""
],
[
"Wan",
"Chengde",
""
],
[
"Probst",
"Thomas",
""
],
[
"Van Gool",
"Luc",
""
]
] | In recent years, skeleton-based action recognition has become a popular 3D classification problem. State-of-the-art methods typically first represent each motion sequence as a high-dimensional trajectory on a Lie group with an additional dynamic time warping, and then shallowly learn favorable Lie group features. In th... |
1806.04836 | Noam Buckman | Noam Buckman, Han-Lim Choi, Jonathan P. How | Partial Replanning for Decentralized Dynamic Task Allocation | 11 pages, Accepted to AIAA GNC 2019 | null | 10.2514/6.2019-0915 | null | cs.MA | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In time-sensitive and dynamic missions, multi-UAV teams must respond quickly
to new information and objectives. This paper presents a dynamic decentralized
task allocation algorithm for allocating new tasks that appear online during
the solving of the task allocation problem. Our algorithm extends the
Consensus-Based... | [
{
"created": "Wed, 13 Jun 2018 03:18:40 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Oct 2018 22:45:04 GMT",
"version": "v2"
}
] | 2023-10-02 | [
[
"Buckman",
"Noam",
""
],
[
"Choi",
"Han-Lim",
""
],
[
"How",
"Jonathan P.",
""
]
] | In time-sensitive and dynamic missions, multi-UAV teams must respond quickly to new information and objectives. This paper presents a dynamic decentralized task allocation algorithm for allocating new tasks that appear online during the solving of the task allocation problem. Our algorithm extends the Consensus-Based B... |
2102.07833 | Aleksei Sorokin | Sou-Cheng T. Choi, Fred J. Hickernell, R. Jagadeeswaran, Michael J.
McCourt, and Aleksei G. Sorokin | Quasi-Monte Carlo Software | 25 pages, 7 figures, to be published in the MCQMC2020 Proceedings | null | null | null | cs.MS cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Practitioners wishing to experience the efficiency gains from using low
discrepancy sequences need correct, robust, well-written software. This
article, based on our MCQMC 2020 tutorial, describes some of the better
quasi-Monte Carlo (QMC) software available. We highlight the key software
components required by QMC t... | [
{
"created": "Mon, 15 Feb 2021 20:21:05 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Sep 2021 14:52:31 GMT",
"version": "v2"
},
{
"created": "Thu, 14 Oct 2021 17:44:05 GMT",
"version": "v3"
}
] | 2021-10-15 | [
[
"Choi",
"Sou-Cheng T.",
""
],
[
"Hickernell",
"Fred J.",
""
],
[
"Jagadeeswaran",
"R.",
""
],
[
"McCourt",
"Michael J.",
""
],
[
"Sorokin",
"Aleksei G.",
""
]
] | Practitioners wishing to experience the efficiency gains from using low discrepancy sequences need correct, robust, well-written software. This article, based on our MCQMC 2020 tutorial, describes some of the better quasi-Monte Carlo (QMC) software available. We highlight the key software components required by QMC to ... |
1807.11929 | Mengmi Zhang | Mengmi Zhang, Keng Teck Ma, Shih-Cheng Yen, Joo Hwee Lim, Qi Zhao, and
Jiashi Feng | Egocentric Spatial Memory | 8 pages, 6 figures, accepted in IROS 2018 | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Egocentric spatial memory (ESM) defines a memory system with encoding,
storing, recognizing and recalling the spatial information about the
environment from an egocentric perspective. We introduce an integrated deep
neural network architecture for modeling ESM. It learns to estimate the
occupancy state of the world a... | [
{
"created": "Tue, 31 Jul 2018 17:27:19 GMT",
"version": "v1"
}
] | 2018-08-01 | [
[
"Zhang",
"Mengmi",
""
],
[
"Ma",
"Keng Teck",
""
],
[
"Yen",
"Shih-Cheng",
""
],
[
"Lim",
"Joo Hwee",
""
],
[
"Zhao",
"Qi",
""
],
[
"Feng",
"Jiashi",
""
]
] | Egocentric spatial memory (ESM) defines a memory system with encoding, storing, recognizing and recalling the spatial information about the environment from an egocentric perspective. We introduce an integrated deep neural network architecture for modeling ESM. It learns to estimate the occupancy state of the world and... |
2110.14460 | Maciej Drozdowski | Thomas Robertazzi, Maciej Drozdowski | Interaction Maxima in Distributed Systems | 10 pages, 1 figure | null | null | null | cs.DM | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this paper we study the maximum degree of interaction which may emerge in
distributed systems. It is assumed that a distributed system is represented by
a graph of nodes interacting over edges. Each node has some amount of data. The
intensity of interaction over an edge is proportional to the product of the
amount... | [
{
"created": "Wed, 27 Oct 2021 14:28:11 GMT",
"version": "v1"
}
] | 2021-10-28 | [
[
"Robertazzi",
"Thomas",
""
],
[
"Drozdowski",
"Maciej",
""
]
] | In this paper we study the maximum degree of interaction which may emerge in distributed systems. It is assumed that a distributed system is represented by a graph of nodes interacting over edges. Each node has some amount of data. The intensity of interaction over an edge is proportional to the product of the amounts ... |
2208.07464 | Brendon G. Anderson | Brendon G. Anderson, Tanmay Gautam, Somayeh Sojoudi | An Overview and Prospective Outlook on Robust Training and Certification
of Machine Learning Models | null | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this discussion paper, we survey recent research surrounding robustness of
machine learning models. As learning algorithms become increasingly more
popular in data-driven control systems, their robustness to data uncertainty
must be ensured in order to maintain reliable safety-critical operations. We
begin by revi... | [
{
"created": "Mon, 15 Aug 2022 23:09:54 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Sep 2022 16:55:39 GMT",
"version": "v2"
}
] | 2022-09-28 | [
[
"Anderson",
"Brendon G.",
""
],
[
"Gautam",
"Tanmay",
""
],
[
"Sojoudi",
"Somayeh",
""
]
] | In this discussion paper, we survey recent research surrounding robustness of machine learning models. As learning algorithms become increasingly more popular in data-driven control systems, their robustness to data uncertainty must be ensured in order to maintain reliable safety-critical operations. We begin by review... |
2011.05507 | Chun-Na Li | Yan-Ru Guo, Yan-Qin Bai, Chun-Na Li, Lan Bai, Yuan-Hai Shao | Two-dimensional Bhattacharyya bound linear discriminant analysis with
its applications | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently proposed L2-norm linear discriminant analysis criterion via the
Bhattacharyya error bound estimation (L2BLDA) is an effective improvement of
linear discriminant analysis (LDA) for feature extraction. However, L2BLDA is
only proposed to cope with vector input samples. When facing with
two-dimensional (2D) inp... | [
{
"created": "Wed, 11 Nov 2020 01:56:42 GMT",
"version": "v1"
}
] | 2020-11-12 | [
[
"Guo",
"Yan-Ru",
""
],
[
"Bai",
"Yan-Qin",
""
],
[
"Li",
"Chun-Na",
""
],
[
"Bai",
"Lan",
""
],
[
"Shao",
"Yuan-Hai",
""
]
] | Recently proposed L2-norm linear discriminant analysis criterion via the Bhattacharyya error bound estimation (L2BLDA) is an effective improvement of linear discriminant analysis (LDA) for feature extraction. However, L2BLDA is only proposed to cope with vector input samples. When facing with two-dimensional (2D) input... |
2310.20212 | Yuan Wei | Zhiyuan Wei, Jing Sun, Zijian Zhang, Xianhao Zhang, Meng Li, Liehuang
Zhu | A Comparative Evaluation of Automated Analysis Tools for Solidity Smart
Contracts | 24 pages, 6 figure, IEEE Communications Surveys & Tutorials | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Blockchain smart contracts have emerged as a transformative force in the
digital realm, spawning a diverse range of compelling applications. Since
solidity smart contracts across various domains manage trillions of dollars in
virtual coins, they become a prime target for attacks. One of the primary
challenges is keep... | [
{
"created": "Tue, 31 Oct 2023 06:20:42 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Nov 2023 15:54:52 GMT",
"version": "v2"
},
{
"created": "Thu, 2 Nov 2023 00:33:22 GMT",
"version": "v3"
}
] | 2023-11-03 | [
[
"Wei",
"Zhiyuan",
""
],
[
"Sun",
"Jing",
""
],
[
"Zhang",
"Zijian",
""
],
[
"Zhang",
"Xianhao",
""
],
[
"Li",
"Meng",
""
],
[
"Zhu",
"Liehuang",
""
]
] | Blockchain smart contracts have emerged as a transformative force in the digital realm, spawning a diverse range of compelling applications. Since solidity smart contracts across various domains manage trillions of dollars in virtual coins, they become a prime target for attacks. One of the primary challenges is keepin... |
2206.01202 | Chieh Hubert Lin | Chieh Hubert Lin, Hsin-Ying Lee, Hung-Yu Tseng, Maneesh Singh,
Ming-Hsuan Yang | Unveiling The Mask of Position-Information Pattern Through the Mist of
Image Features | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent studies show that paddings in convolutional neural networks encode
absolute position information which can negatively affect the model performance
for certain tasks. However, existing metrics for quantifying the strength of
positional information remain unreliable and frequently lead to erroneous
results. To a... | [
{
"created": "Thu, 2 Jun 2022 17:59:57 GMT",
"version": "v1"
}
] | 2022-06-03 | [
[
"Lin",
"Chieh Hubert",
""
],
[
"Lee",
"Hsin-Ying",
""
],
[
"Tseng",
"Hung-Yu",
""
],
[
"Singh",
"Maneesh",
""
],
[
"Yang",
"Ming-Hsuan",
""
]
] | Recent studies show that paddings in convolutional neural networks encode absolute position information which can negatively affect the model performance for certain tasks. However, existing metrics for quantifying the strength of positional information remain unreliable and frequently lead to erroneous results. To add... |
1011.3571 | Kristina Lerman | Rumi Ghosh and Kristina Lerman | A Framework for Quantitative Analysis of Cascades on Networks | In Proceedings of 4th ACM Conference on Web Search and Data Mining | null | null | null | cs.SI cs.CY physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How does information flow in online social networks? How does the structure
and size of the information cascade evolve in time? How can we efficiently mine
the information contained in cascade dynamics? We approach these questions
empirically and present an efficient and scalable mathematical framework for
quantitati... | [
{
"created": "Tue, 16 Nov 2010 01:54:16 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Nov 2010 20:14:51 GMT",
"version": "v2"
}
] | 2010-11-18 | [
[
"Ghosh",
"Rumi",
""
],
[
"Lerman",
"Kristina",
""
]
] | How does information flow in online social networks? How does the structure and size of the information cascade evolve in time? How can we efficiently mine the information contained in cascade dynamics? We approach these questions empirically and present an efficient and scalable mathematical framework for quantitative... |
1403.5315 | Emrah Akyol | Mustafa Mehmetoglu, Emrah Akyol, Kenneth Rose | A Deterministic Annealing Optimization Approach for Witsenhausen's and
Related Decentralized Control Settings | submitted to CDC'14 | null | null | null | cs.SY cs.IT math.IT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the problem of mapping optimization in decentralized
control problems. A global optimization algorithm is proposed based on the
ideas of ``deterministic annealing" - a powerful non-convex optimization
framework derived from information theoretic principles with analogies to
statistical physics. The... | [
{
"created": "Thu, 20 Mar 2014 22:15:24 GMT",
"version": "v1"
}
] | 2014-03-24 | [
[
"Mehmetoglu",
"Mustafa",
""
],
[
"Akyol",
"Emrah",
""
],
[
"Rose",
"Kenneth",
""
]
] | This paper studies the problem of mapping optimization in decentralized control problems. A global optimization algorithm is proposed based on the ideas of ``deterministic annealing" - a powerful non-convex optimization framework derived from information theoretic principles with analogies to statistical physics. The k... |
cs/0610159 | Vaneet Aggarwal | Vaneet Aggarwal, A. Robert Calderbank | Boolean Functions, Projection Operators and Quantum Error Correcting
Codes | Submitted to IEEE Transactions on Information Theory, October 2006,
to appear in IEEE Transactions on Information Theory, 2008 | IEEE Trans. Inf. Theory, vol. 54, no. 4, pp.1700-1707, Apr. 2008. | 10.1109/TIT.2008.917720 | null | cs.IT math.IT quant-ph | null | This paper describes a fundamental correspondence between Boolean functions
and projection operators in Hilbert space. The correspondence is widely
applicable, and it is used in this paper to provide a common mathematical
framework for the design of both additive and non-additive quantum error
correcting codes. The n... | [
{
"created": "Fri, 27 Oct 2006 16:50:41 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Mar 2007 20:58:22 GMT",
"version": "v2"
},
{
"created": "Mon, 24 Sep 2007 13:20:15 GMT",
"version": "v3"
}
] | 2009-04-14 | [
[
"Aggarwal",
"Vaneet",
""
],
[
"Calderbank",
"A. Robert",
""
]
] | This paper describes a fundamental correspondence between Boolean functions and projection operators in Hilbert space. The correspondence is widely applicable, and it is used in this paper to provide a common mathematical framework for the design of both additive and non-additive quantum error correcting codes. The new... |
2303.13126 | Jing Zhao | Jing Zhao, Heliang Zheng, Chaoyue Wang, Long Lan, Wenjing Yang | MagicFusion: Boosting Text-to-Image Generation Performance by Fusing
Diffusion Models | Accepted by ICCV 2023 | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The advent of open-source AI communities has produced a cornucopia of
powerful text-guided diffusion models that are trained on various datasets.
While few explorations have been conducted on ensembling such models to combine
their strengths. In this work, we propose a simple yet effective method called
Saliency-awar... | [
{
"created": "Thu, 23 Mar 2023 09:30:39 GMT",
"version": "v1"
},
{
"created": "Sat, 25 Mar 2023 14:38:16 GMT",
"version": "v2"
},
{
"created": "Fri, 14 Jul 2023 09:36:35 GMT",
"version": "v3"
}
] | 2023-07-20 | [
[
"Zhao",
"Jing",
""
],
[
"Zheng",
"Heliang",
""
],
[
"Wang",
"Chaoyue",
""
],
[
"Lan",
"Long",
""
],
[
"Yang",
"Wenjing",
""
]
] | The advent of open-source AI communities has produced a cornucopia of powerful text-guided diffusion models that are trained on various datasets. While few explorations have been conducted on ensembling such models to combine their strengths. In this work, we propose a simple yet effective method called Saliency-aware ... |
2212.00881 | Saeed Mohammadzadeh | Saeed Mohammadzadeh, Peerasait Prachaseree, Emma Lejeune | Investigating Deep Learning Model Calibration for Classification
Problems in Mechanics | 21 pages, 9 figures | null | null | null | cs.LG physics.data-an | http://creativecommons.org/licenses/by-sa/4.0/ | Recently, there has been a growing interest in applying machine learning
methods to problems in engineering mechanics. In particular, there has been
significant interest in applying deep learning techniques to predicting the
mechanical behavior of heterogeneous materials and structures. Researchers have
shown that de... | [
{
"created": "Thu, 1 Dec 2022 21:39:48 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Mar 2023 17:22:41 GMT",
"version": "v2"
}
] | 2023-03-15 | [
[
"Mohammadzadeh",
"Saeed",
""
],
[
"Prachaseree",
"Peerasait",
""
],
[
"Lejeune",
"Emma",
""
]
] | Recently, there has been a growing interest in applying machine learning methods to problems in engineering mechanics. In particular, there has been significant interest in applying deep learning techniques to predicting the mechanical behavior of heterogeneous materials and structures. Researchers have shown that deep... |
2102.09086 | Robi Bhattacharjee | Robi Bhattacharjee and Kamalika Chaudhuri | Consistent Non-Parametric Methods for Maximizing Robustness | accepted to Nuerips 2021 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Learning classifiers that are robust to adversarial examples has received a
great deal of recent attention. A major drawback of the standard robust
learning framework is there is an artificial robustness radius $r$ that applies
to all inputs. This ignores the fact that data may be highly heterogeneous, in
which case ... | [
{
"created": "Thu, 18 Feb 2021 00:44:07 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Nov 2021 04:14:49 GMT",
"version": "v2"
},
{
"created": "Wed, 18 Jan 2023 18:02:20 GMT",
"version": "v3"
}
] | 2023-01-19 | [
[
"Bhattacharjee",
"Robi",
""
],
[
"Chaudhuri",
"Kamalika",
""
]
] | Learning classifiers that are robust to adversarial examples has received a great deal of recent attention. A major drawback of the standard robust learning framework is there is an artificial robustness radius $r$ that applies to all inputs. This ignores the fact that data may be highly heterogeneous, in which case it... |
2310.13583 | Ofir Arviv | Ofir Arviv, Dmitry Nikolaev, Taelin Karidi and Omri Abend | Improving Cross-Lingual Transfer through Subtree-Aware Word Reordering | Accepted to EMNLP Findings 2023 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the impressive growth of the abilities of multilingual language
models, such as XLM-R and mT5, it has been shown that they still face
difficulties when tackling typologically-distant languages, particularly in the
low-resource setting. One obstacle for effective cross-lingual transfer is
variability in word-o... | [
{
"created": "Fri, 20 Oct 2023 15:25:53 GMT",
"version": "v1"
}
] | 2023-10-23 | [
[
"Arviv",
"Ofir",
""
],
[
"Nikolaev",
"Dmitry",
""
],
[
"Karidi",
"Taelin",
""
],
[
"Abend",
"Omri",
""
]
] | Despite the impressive growth of the abilities of multilingual language models, such as XLM-R and mT5, it has been shown that they still face difficulties when tackling typologically-distant languages, particularly in the low-resource setting. One obstacle for effective cross-lingual transfer is variability in word-ord... |
2008.08931 | Liyi Guo | Liyi Guo, Rui Lu, Haoqi Zhang, Junqi Jin, Zhenzhe Zheng, Fan Wu, Jin
Li, Haiyang Xu, Han Li, Wenkai Lu, Jian Xu, Kun Gai | A Deep Prediction Network for Understanding Advertiser Intent and
Satisfaction | null | CIKM 2020, Virtual Event, Ireland | 10.1145/3340531.3412681 | null | cs.SI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For e-commerce platforms such as Taobao and Amazon, advertisers play an
important role in the entire digital ecosystem: their behaviors explicitly
influence users' browsing and shopping experience; more importantly,
advertiser's expenditure on advertising constitutes a primary source of
platform revenue. Therefore, p... | [
{
"created": "Thu, 20 Aug 2020 15:08:50 GMT",
"version": "v1"
}
] | 2020-09-01 | [
[
"Guo",
"Liyi",
""
],
[
"Lu",
"Rui",
""
],
[
"Zhang",
"Haoqi",
""
],
[
"Jin",
"Junqi",
""
],
[
"Zheng",
"Zhenzhe",
""
],
[
"Wu",
"Fan",
""
],
[
"Li",
"Jin",
""
],
[
"Xu",
"Haiyang",
""
],
... | For e-commerce platforms such as Taobao and Amazon, advertisers play an important role in the entire digital ecosystem: their behaviors explicitly influence users' browsing and shopping experience; more importantly, advertiser's expenditure on advertising constitutes a primary source of platform revenue. Therefore, pro... |
1304.3249 | Paolo Parisen Toldin | Jean-Yves Moyen, Paolo Parisen Toldin | A polytime complexity analyser for Probabilistic Polynomial Time over
imperative stack programs | null | null | null | null | cs.LO cs.CC | http://creativecommons.org/licenses/by/3.0/ | We present iSAPP (Imperative Static Analyser for Probabilistic Polynomial
Time), a complexity verifier tool that is sound and extensionally complete for
the Probabilistic Polynomial Time (PP) complexity class. iSAPP works on an
imperative programming language for stack machines. The certificate of
polynomiality can b... | [
{
"created": "Thu, 11 Apr 2013 10:20:24 GMT",
"version": "v1"
}
] | 2013-04-12 | [
[
"Moyen",
"Jean-Yves",
""
],
[
"Toldin",
"Paolo Parisen",
""
]
] | We present iSAPP (Imperative Static Analyser for Probabilistic Polynomial Time), a complexity verifier tool that is sound and extensionally complete for the Probabilistic Polynomial Time (PP) complexity class. iSAPP works on an imperative programming language for stack machines. The certificate of polynomiality can be ... |
2404.00686 | Srinjoy Roy | Srinjoy Roy, Swagatam Das | Utilizing Maximum Mean Discrepancy Barycenter for Propagating the
Uncertainty of Value Functions in Reinforcement Learning | We found some flaws in our analysis and we are in the process of
rectifying those | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Accounting for the uncertainty of value functions boosts exploration in
Reinforcement Learning (RL). Our work introduces Maximum Mean Discrepancy
Q-Learning (MMD-QL) to improve Wasserstein Q-Learning (WQL) for uncertainty
propagation during Temporal Difference (TD) updates. MMD-QL uses the MMD
barycenter for this pur... | [
{
"created": "Sun, 31 Mar 2024 13:41:56 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Apr 2024 14:32:17 GMT",
"version": "v2"
}
] | 2024-04-04 | [
[
"Roy",
"Srinjoy",
""
],
[
"Das",
"Swagatam",
""
]
] | Accounting for the uncertainty of value functions boosts exploration in Reinforcement Learning (RL). Our work introduces Maximum Mean Discrepancy Q-Learning (MMD-QL) to improve Wasserstein Q-Learning (WQL) for uncertainty propagation during Temporal Difference (TD) updates. MMD-QL uses the MMD barycenter for this purpo... |
2406.03893 | Anushka Singh | Anushka Singh, Ananya B. Sai, Raj Dabre, Ratish Puduppully, Anoop
Kunchukuttan, Mitesh M Khapra | How Good is Zero-Shot MT Evaluation for Low Resource Indian Languages? | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | While machine translation evaluation has been studied primarily for
high-resource languages, there has been a recent interest in evaluation for
low-resource languages due to the increasing availability of data and models.
In this paper, we focus on a zero-shot evaluation setting focusing on
low-resource Indian langua... | [
{
"created": "Thu, 6 Jun 2024 09:28:08 GMT",
"version": "v1"
}
] | 2024-06-07 | [
[
"Singh",
"Anushka",
""
],
[
"Sai",
"Ananya B.",
""
],
[
"Dabre",
"Raj",
""
],
[
"Puduppully",
"Ratish",
""
],
[
"Kunchukuttan",
"Anoop",
""
],
[
"Khapra",
"Mitesh M",
""
]
] | While machine translation evaluation has been studied primarily for high-resource languages, there has been a recent interest in evaluation for low-resource languages due to the increasing availability of data and models. In this paper, we focus on a zero-shot evaluation setting focusing on low-resource Indian language... |
2008.05440 | Jie Yang | Jie Yang, Kaichun Mo, Yu-Kun Lai, Leonidas J. Guibas, Lin Gao | DSG-Net: Learning Disentangled Structure and Geometry for 3D Shape
Generation | Accept to ACM Transaction on Graphics 2022, 26 pages | null | null | null | cs.GR cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | D shape generation is a fundamental operation in computer graphics. While
significant progress has been made, especially with recent deep generative
models, it remains a challenge to synthesize high-quality shapes with rich
geometric details and complex structure, in a controllable manner. To tackle
this, we introduc... | [
{
"created": "Wed, 12 Aug 2020 17:06:51 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Aug 2020 02:38:45 GMT",
"version": "v2"
},
{
"created": "Mon, 24 May 2021 14:45:26 GMT",
"version": "v3"
},
{
"created": "Sat, 28 May 2022 17:40:15 GMT",
"version": "v4"
}
] | 2022-05-31 | [
[
"Yang",
"Jie",
""
],
[
"Mo",
"Kaichun",
""
],
[
"Lai",
"Yu-Kun",
""
],
[
"Guibas",
"Leonidas J.",
""
],
[
"Gao",
"Lin",
""
]
] | D shape generation is a fundamental operation in computer graphics. While significant progress has been made, especially with recent deep generative models, it remains a challenge to synthesize high-quality shapes with rich geometric details and complex structure, in a controllable manner. To tackle this, we introduce ... |
1004.2079 | Yashodhan Kanoria | Mohsen Bayati, Christian Borgs, Jennifer Chayes, Yashodhan Kanoria and
Andrea Montanari | Bargaining dynamics in exchange networks | 47 pages, SODA 2011, invited to Journal of Economic Theory | Proc. ACM-SIAM Symp. on Discrete Algorithms (2011) 1518-1537 | null | null | cs.GT cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a one-sided assignment market or exchange network with
transferable utility and propose a model for the dynamics of bargaining in such
a market. Our dynamical model is local, involving iterative updates of 'offers'
based on estimated best alternative matches, in the spirit of pairwise Nash
bargaining. We ... | [
{
"created": "Mon, 12 Apr 2010 23:11:16 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Dec 2011 19:40:38 GMT",
"version": "v2"
}
] | 2015-03-14 | [
[
"Bayati",
"Mohsen",
""
],
[
"Borgs",
"Christian",
""
],
[
"Chayes",
"Jennifer",
""
],
[
"Kanoria",
"Yashodhan",
""
],
[
"Montanari",
"Andrea",
""
]
] | We consider a one-sided assignment market or exchange network with transferable utility and propose a model for the dynamics of bargaining in such a market. Our dynamical model is local, involving iterative updates of 'offers' based on estimated best alternative matches, in the spirit of pairwise Nash bargaining. We es... |
2208.04159 | Ningning Wang | Ningning Wang, Guodong Li, Sihuang Hu, Min Ye | Constructing MSR codes with subpacketization $2^{n/3}$ for $k+1$ helper
nodes | null | IEEE Transactions on Information Theory (Volume: 69, Issue: 6,
June 2023) | 10.1109/TIT.2023.3238759 | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 2016)
proposed an explicit construction of an $(n=k+2,k)$ Minimum Storage
Regenerating (MSR) code with $2$ parity nodes and subpacketization $2^{k/3}$.
The number of helper nodes for this code is $d=k+1=n-1$, and this code has the
smallest subpacke... | [
{
"created": "Mon, 8 Aug 2022 13:59:11 GMT",
"version": "v1"
},
{
"created": "Thu, 11 May 2023 14:58:30 GMT",
"version": "v2"
}
] | 2023-05-23 | [
[
"Wang",
"Ningning",
""
],
[
"Li",
"Guodong",
""
],
[
"Hu",
"Sihuang",
""
],
[
"Ye",
"Min",
""
]
] | Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 2016) proposed an explicit construction of an $(n=k+2,k)$ Minimum Storage Regenerating (MSR) code with $2$ parity nodes and subpacketization $2^{k/3}$. The number of helper nodes for this code is $d=k+1=n-1$, and this code has the smallest subpacketi... |
2002.04095 | Juan-Manuel Torres-Moreno | R\'emy Saksik, Alejandro Molina-Villegas, Andr\'ea Carneiro Linhares,
Juan-Manuel Torres-Moreno | Automatic Discourse Segmentation: an evaluation in French | 7 pages, 2 figures, 2 tables | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article, we describe some discursive segmentation methods as well as
a preliminary evaluation of the segmentation quality. Although our experiment
were carried for documents in French, we have developed three discursive
segmentation models solely based on resources simultaneously available in
several language... | [
{
"created": "Mon, 10 Feb 2020 21:35:39 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Jun 2020 20:27:29 GMT",
"version": "v2"
}
] | 2020-06-15 | [
[
"Saksik",
"Rémy",
""
],
[
"Molina-Villegas",
"Alejandro",
""
],
[
"Linhares",
"Andréa Carneiro",
""
],
[
"Torres-Moreno",
"Juan-Manuel",
""
]
] | In this article, we describe some discursive segmentation methods as well as a preliminary evaluation of the segmentation quality. Although our experiment were carried for documents in French, we have developed three discursive segmentation models solely based on resources simultaneously available in several languages:... |
0907.4547 | EPTCS | Janusz Brzozowski | Quotient Complexity of Regular Languages | null | EPTCS 3, 2009, pp. 17-28 | 10.4204/EPTCS.3.2 | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The past research on the state complexity of operations on regular languages
is examined, and a new approach based on an old method (derivatives of regular
expressions) is presented. Since state complexity is a property of a language,
it is appropriate to define it in formal-language terms as the number of
distinct q... | [
{
"created": "Mon, 27 Jul 2009 06:19:09 GMT",
"version": "v1"
}
] | 2009-07-28 | [
[
"Brzozowski",
"Janusz",
""
]
] | The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is appropriate to define it in formal-language terms as the number of distinct quo... |
1912.02858 | Victor Lecomte | Victor Lecomte and Omri Weinstein | Settling the relationship between Wilber's bounds for dynamic optimality | ESA 2020; 25 pages, 18 figures; v3 applies reviewers' comments | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In FOCS 1986, Wilber proposed two combinatorial lower bounds on the
operational cost of any binary search tree (BST) for a given access sequence $X
\in [n]^m$. Both bounds play a central role in the ongoing pursuit of the
dynamic optimality conjecture (Sleator and Tarjan, 1985), but their
relationship remained unknow... | [
{
"created": "Thu, 5 Dec 2019 20:17:15 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Dec 2019 20:49:57 GMT",
"version": "v2"
},
{
"created": "Sun, 28 Jun 2020 20:51:41 GMT",
"version": "v3"
}
] | 2020-06-30 | [
[
"Lecomte",
"Victor",
""
],
[
"Weinstein",
"Omri",
""
]
] | In FOCS 1986, Wilber proposed two combinatorial lower bounds on the operational cost of any binary search tree (BST) for a given access sequence $X \in [n]^m$. Both bounds play a central role in the ongoing pursuit of the dynamic optimality conjecture (Sleator and Tarjan, 1985), but their relationship remained unknown ... |
2110.04946 | Hieu-Thi Luong | Hieu-Thi Luong, Junichi Yamagishi | LaughNet: synthesizing laughter utterances from waveform silhouettes and
a single laughter example | null | null | null | null | cs.SD cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Emotional and controllable speech synthesis is a topic that has received much
attention. However, most studies focused on improving the expressiveness and
controllability in the context of linguistic content, even though natural
verbal human communication is inseparable from spontaneous non-speech
expressions such as... | [
{
"created": "Mon, 11 Oct 2021 00:45:07 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jan 2022 01:40:13 GMT",
"version": "v2"
}
] | 2022-01-27 | [
[
"Luong",
"Hieu-Thi",
""
],
[
"Yamagishi",
"Junichi",
""
]
] | Emotional and controllable speech synthesis is a topic that has received much attention. However, most studies focused on improving the expressiveness and controllability in the context of linguistic content, even though natural verbal human communication is inseparable from spontaneous non-speech expressions such as l... |
2006.03179 | Garrett Bingham | Garrett Bingham and Risto Miikkulainen | Discovering Parametric Activation Functions | Published in Neural Networks. 34 pages, 10 figures, 11 tables | Neural Networks, Volume 148, 2022, Pages 48-65, ISSN 0893-6080 | 10.1016/j.neunet.2022.01.001 | null | cs.LG cs.CV cs.NE stat.ML | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Recent studies have shown that the choice of activation function can
significantly affect the performance of deep learning networks. However, the
benefits of novel activation functions have been inconsistent and task
dependent, and therefore the rectified linear unit (ReLU) is still the most
commonly used. This paper... | [
{
"created": "Fri, 5 Jun 2020 00:25:33 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Oct 2020 15:33:14 GMT",
"version": "v2"
},
{
"created": "Tue, 8 Dec 2020 19:28:47 GMT",
"version": "v3"
},
{
"created": "Sat, 30 Jan 2021 02:17:20 GMT",
"version": "v4"
},
{
"crea... | 2022-01-25 | [
[
"Bingham",
"Garrett",
""
],
[
"Miikkulainen",
"Risto",
""
]
] | Recent studies have shown that the choice of activation function can significantly affect the performance of deep learning networks. However, the benefits of novel activation functions have been inconsistent and task dependent, and therefore the rectified linear unit (ReLU) is still the most commonly used. This paper p... |
1410.0382 | Mircea Andrecut Dr | M. Andrecut | A String-Based Public Key Cryptosystem | In this revised version of the paper we show that the eavesdropper's
problem of the proposed cryptosystem has a solution, and we give the details
of the solution | null | null | null | cs.CR physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditional methods in public key cryptography are based on number theory,
and suffer from problems such as dealing with very large numbers, making key
creation cumbersome. Here, we propose a new public key cryptosystem based on
strings only, which avoids the difficulties of the traditional number theory
approach. Th... | [
{
"created": "Fri, 5 Sep 2014 18:44:31 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Jan 2015 18:53:35 GMT",
"version": "v2"
}
] | 2015-01-20 | [
[
"Andrecut",
"M.",
""
]
] | Traditional methods in public key cryptography are based on number theory, and suffer from problems such as dealing with very large numbers, making key creation cumbersome. Here, we propose a new public key cryptosystem based on strings only, which avoids the difficulties of the traditional number theory approach. The ... |
2210.10226 | Zillur Rahman | Zillur Rahman, Amit Mazumder Ami, Muhammad Ahsan Ullah | A Real-Time Wrong-Way Vehicle Detection Based on YOLO and Centroid
Tracking | 5 pages | 2020 IEEE Region 10 Symposium (TENSYMP), page:916-920 | 10.1109/TENSYMP50017.2020.9230463 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Wrong-way driving is one of the main causes of road accidents and traffic jam
all over the world. By detecting wrong-way vehicles, the number of accidents
can be minimized and traffic jam can be reduced. With the increasing popularity
of real-time traffic management systems and due to the availability of cheaper
came... | [
{
"created": "Wed, 19 Oct 2022 00:53:28 GMT",
"version": "v1"
}
] | 2022-10-20 | [
[
"Rahman",
"Zillur",
""
],
[
"Ami",
"Amit Mazumder",
""
],
[
"Ullah",
"Muhammad Ahsan",
""
]
] | Wrong-way driving is one of the main causes of road accidents and traffic jam all over the world. By detecting wrong-way vehicles, the number of accidents can be minimized and traffic jam can be reduced. With the increasing popularity of real-time traffic management systems and due to the availability of cheaper camera... |
2202.13134 | Fu Song | Qi Qin and JulianAndres JiYang and Fu Song and Taolue Chen and Xinyu
Xing | Preventing Timing Side-Channels via Security-Aware Just-In-Time
Compilation | null | null | null | null | cs.PL cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work has shown that Just-In-Time (JIT) compilation can introduce
timing side-channels to constant-time programs, which would otherwise be a
principled and effective means to counter timing attacks. In this paper, we
propose a novel approach to eliminate JIT-induced leaks from these programs.
Specifically, we p... | [
{
"created": "Sat, 26 Feb 2022 13:06:15 GMT",
"version": "v1"
}
] | 2022-03-01 | [
[
"Qin",
"Qi",
""
],
[
"JiYang",
"JulianAndres",
""
],
[
"Song",
"Fu",
""
],
[
"Chen",
"Taolue",
""
],
[
"Xing",
"Xinyu",
""
]
] | Recent work has shown that Just-In-Time (JIT) compilation can introduce timing side-channels to constant-time programs, which would otherwise be a principled and effective means to counter timing attacks. In this paper, we propose a novel approach to eliminate JIT-induced leaks from these programs. Specifically, we pre... |
1703.09807 | Nhien-An Le-Khac | Lamine M. Aouad, Nhien-An Le-Khac, Tahar Kechadi | Grid-based Approaches for Distributed Data Mining Applications | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The data mining field is an important source of large-scale applications and
datasets which are getting more and more common. In this paper, we present
grid-based approaches for two basic data mining applications, and a performance
evaluation on an experimental grid environment that provides interesting
monitoring ca... | [
{
"created": "Tue, 28 Mar 2017 21:19:24 GMT",
"version": "v1"
}
] | 2017-03-30 | [
[
"Aouad",
"Lamine M.",
""
],
[
"Le-Khac",
"Nhien-An",
""
],
[
"Kechadi",
"Tahar",
""
]
] | The data mining field is an important source of large-scale applications and datasets which are getting more and more common. In this paper, we present grid-based approaches for two basic data mining applications, and a performance evaluation on an experimental grid environment that provides interesting monitoring capa... |
1605.06154 | Michael Nelson | Herbert Van de Sompel, David S. H. Rosenthal, Michael L. Nelson | Web Infrastructure to Support e-Journal Preservation (and More) | 23 pages, 5 figures | null | null | null | cs.DL | http://creativecommons.org/licenses/by/4.0/ | E-journal preservation systems have to ingest millions of articles each year.
Ingest, especially of the "long tail" of journals from small publishers, is the
largest element of their cost. Cost is the major reason that archives contain
less than half the content they should. Automation is essential to minimize
these ... | [
{
"created": "Thu, 19 May 2016 21:44:01 GMT",
"version": "v1"
}
] | 2016-05-23 | [
[
"Van de Sompel",
"Herbert",
""
],
[
"Rosenthal",
"David S. H.",
""
],
[
"Nelson",
"Michael L.",
""
]
] | E-journal preservation systems have to ingest millions of articles each year. Ingest, especially of the "long tail" of journals from small publishers, is the largest element of their cost. Cost is the major reason that archives contain less than half the content they should. Automation is essential to minimize these co... |
1802.01448 | Deepak Vijaykeerthy | Deepak Vijaykeerthy, Anshuman Suri, Sameep Mehta, Ponnurangam
Kumaraguru | Hardening Deep Neural Networks via Adversarial Model Cascades | null | null | null | null | cs.LG cs.CR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks (DNNs) are vulnerable to malicious inputs crafted by an
adversary to produce erroneous outputs. Works on securing neural networks
against adversarial examples achieve high empirical robustness on simple
datasets such as MNIST. However, these techniques are inadequate when
empirically tested on co... | [
{
"created": "Fri, 2 Feb 2018 09:02:38 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Feb 2018 16:38:56 GMT",
"version": "v2"
},
{
"created": "Mon, 12 Feb 2018 06:28:25 GMT",
"version": "v3"
},
{
"created": "Sun, 4 Nov 2018 11:16:23 GMT",
"version": "v4"
}
] | 2018-11-06 | [
[
"Vijaykeerthy",
"Deepak",
""
],
[
"Suri",
"Anshuman",
""
],
[
"Mehta",
"Sameep",
""
],
[
"Kumaraguru",
"Ponnurangam",
""
]
] | Deep neural networks (DNNs) are vulnerable to malicious inputs crafted by an adversary to produce erroneous outputs. Works on securing neural networks against adversarial examples achieve high empirical robustness on simple datasets such as MNIST. However, these techniques are inadequate when empirically tested on comp... |
1908.02999 | Fabian Schilling | Fabian Schilling and Julien Lecoeur and Fabrizio Schiano and Dario
Floreano | Learning Vision-based Flight in Drone Swarms by Imitation | 8 pages, 8 figures, accepted for publication in the IEEE Robotics and
Automation Letters (RA-L) on July 28, 2019. arXiv admin note: substantial
text overlap with arXiv:1809.00543 | null | null | null | cs.RO cs.CV cs.LG cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Decentralized drone swarms deployed today either rely on sharing of positions
among agents or detecting swarm members with the help of visual markers. This
work proposes an entirely visual approach to coordinate markerless drone swarms
based on imitation learning. Each agent is controlled by a small and efficient
con... | [
{
"created": "Thu, 8 Aug 2019 10:19:48 GMT",
"version": "v1"
}
] | 2019-08-09 | [
[
"Schilling",
"Fabian",
""
],
[
"Lecoeur",
"Julien",
""
],
[
"Schiano",
"Fabrizio",
""
],
[
"Floreano",
"Dario",
""
]
] | Decentralized drone swarms deployed today either rely on sharing of positions among agents or detecting swarm members with the help of visual markers. This work proposes an entirely visual approach to coordinate markerless drone swarms based on imitation learning. Each agent is controlled by a small and efficient convo... |
1911.11547 | Dat Quoc Nguyen | Dai Quoc Nguyen, Dat Quoc Nguyen, Son Bao Pham | A Vietnamese Text-Based Conversational Agent | In Proceedings of the 25th International Conference on Industrial,
Engineering & Other Applications of Applied Intelligent Systems (IEA/AIE
2012) | null | 10.1007/978-3-642-31087-4_71 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a Vietnamese text-based conversational agent
architecture on specific knowledge domain which is integrated in a question
answering system. When the question answering system fails to provide answers
to users' input, our conversational agent can step in to interact with users to
provide answers t... | [
{
"created": "Tue, 26 Nov 2019 14:11:50 GMT",
"version": "v1"
}
] | 2019-11-27 | [
[
"Nguyen",
"Dai Quoc",
""
],
[
"Nguyen",
"Dat Quoc",
""
],
[
"Pham",
"Son Bao",
""
]
] | This paper introduces a Vietnamese text-based conversational agent architecture on specific knowledge domain which is integrated in a question answering system. When the question answering system fails to provide answers to users' input, our conversational agent can step in to interact with users to provide answers to ... |
1312.0525 | Kiryung Lee | Kiryung Lee, Yihong Wu, and Yoram Bresler | Near Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices
via Sparse Power Factorization | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressed sensing of simultaneously sparse and low-rank matrices enables
recovery of sparse signals from a few linear measurements of their bilinear
form. One important question is how many measurements are needed for a stable
reconstruction in the presence of measurement noise. Unlike conventional
compressed sensin... | [
{
"created": "Mon, 2 Dec 2013 17:37:00 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Jun 2016 02:43:34 GMT",
"version": "v2"
}
] | 2016-07-01 | [
[
"Lee",
"Kiryung",
""
],
[
"Wu",
"Yihong",
""
],
[
"Bresler",
"Yoram",
""
]
] | Compressed sensing of simultaneously sparse and low-rank matrices enables recovery of sparse signals from a few linear measurements of their bilinear form. One important question is how many measurements are needed for a stable reconstruction in the presence of measurement noise. Unlike conventional compressed sensing ... |
2011.07200 | Yingtao Luo | Ziyang Zhang and Yingtao Luo | Deep Spatial Learning with Molecular Vibration | NeurIPS 2020 Machine Learning for Molecules Workshop, Vancouver,
Canada | null | null | null | cs.LG physics.chem-ph | http://creativecommons.org/licenses/by/4.0/ | Machine learning over-fitting caused by data scarcity greatly limits the
application of machine learning for molecules. Due to manufacturing processes
difference, big data is not always rendered available through computational
chemistry methods for some tasks, causing data scarcity problem for machine
learning algori... | [
{
"created": "Sat, 14 Nov 2020 02:46:43 GMT",
"version": "v1"
}
] | 2020-11-20 | [
[
"Zhang",
"Ziyang",
""
],
[
"Luo",
"Yingtao",
""
]
] | Machine learning over-fitting caused by data scarcity greatly limits the application of machine learning for molecules. Due to manufacturing processes difference, big data is not always rendered available through computational chemistry methods for some tasks, causing data scarcity problem for machine learning algorith... |
2001.00522 | Na-Young Ahn | Na-Young Ahn, Dong Hoon Lee | Schemes for Privacy Data Destruction in a NAND Flash Memory | Pages 181305 - 181313 | null | 10.1109/ACCESS.2019.2958628 | null | cs.CR cs.SY eess.SP eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose schemes for efficiently destroying privacy data in a NAND flash
memory. Generally, even if privcy data is discarded from NAND flash memories,
there is a high probability that the data will remain in an invalid block. This
is a management problem that arises from the specificity of a program operation
and a... | [
{
"created": "Sat, 28 Dec 2019 03:52:02 GMT",
"version": "v1"
}
] | 2020-11-20 | [
[
"Ahn",
"Na-Young",
""
],
[
"Lee",
"Dong Hoon",
""
]
] | We propose schemes for efficiently destroying privacy data in a NAND flash memory. Generally, even if privcy data is discarded from NAND flash memories, there is a high probability that the data will remain in an invalid block. This is a management problem that arises from the specificity of a program operation and an ... |
2301.04696 | Joberto Martins Prof. Dr. | Eduardo S. Xavier and Nazim Agoulmine and Joberto S. B. Martins | On Modeling Network Slicing Communication Resources with SARSA
Optimization | 8 pages, 9 figures, ADVANCE conference paper | null | 10.5281/zenodo.7513695 | null | cs.NI cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Network slicing is a crucial enabler to support the composition and
deployment of virtual network infrastructures required by the dynamic behavior
of networks like 5G/6G mobile networks, IoT-aware networks, e-health systems,
and industry verticals like the internet of vehicles (IoV) and industry 4.0.
The communicatio... | [
{
"created": "Wed, 11 Jan 2023 20:00:42 GMT",
"version": "v1"
}
] | 2023-01-13 | [
[
"Xavier",
"Eduardo S.",
""
],
[
"Agoulmine",
"Nazim",
""
],
[
"Martins",
"Joberto S. B.",
""
]
] | Network slicing is a crucial enabler to support the composition and deployment of virtual network infrastructures required by the dynamic behavior of networks like 5G/6G mobile networks, IoT-aware networks, e-health systems, and industry verticals like the internet of vehicles (IoV) and industry 4.0. The communication ... |
2107.02378 | Jun Shu | Jun Shu, Deyu Meng, Zongben Xu | Learning an Explicit Hyperparameter Prediction Function Conditioned on
Tasks | 74 pages | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Meta learning has attracted much attention recently in machine learning
community. Contrary to conventional machine learning aiming to learn inherent
prediction rules to predict labels for new query data, meta learning aims to
learn the learning methodology for machine learning from observed tasks, so as
to generaliz... | [
{
"created": "Tue, 6 Jul 2021 04:05:08 GMT",
"version": "v1"
},
{
"created": "Sat, 13 May 2023 09:41:42 GMT",
"version": "v2"
},
{
"created": "Sat, 1 Jul 2023 09:27:29 GMT",
"version": "v3"
}
] | 2023-07-04 | [
[
"Shu",
"Jun",
""
],
[
"Meng",
"Deyu",
""
],
[
"Xu",
"Zongben",
""
]
] | Meta learning has attracted much attention recently in machine learning community. Contrary to conventional machine learning aiming to learn inherent prediction rules to predict labels for new query data, meta learning aims to learn the learning methodology for machine learning from observed tasks, so as to generalize ... |
1709.08360 | Jiaqi Zhang | Jiaqi Zhang, Keyou You, and Tamer Ba\c{s}ar | Distributed Discrete-time Optimization in Multi-agent Networks Using
only Sign of Relative State | Part of this work has been presented in American Control Conference
(ACC) 2018, first version posted on arxiv on Sep. 2017, IEEE Transactions on
Automatic Control, 2018 | null | 10.1109/TAC.2018.2884998 | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes distributed discrete-time algorithms to cooperatively
solve an additive cost optimization problem in multi-agent networks. The
striking feature lies in the use of only the sign of relative state information
between neighbors, which substantially differentiates our algorithms from
others in the exi... | [
{
"created": "Mon, 25 Sep 2017 08:05:04 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Nov 2017 16:17:55 GMT",
"version": "v2"
},
{
"created": "Mon, 10 Dec 2018 07:01:54 GMT",
"version": "v3"
}
] | 2018-12-11 | [
[
"Zhang",
"Jiaqi",
""
],
[
"You",
"Keyou",
""
],
[
"Başar",
"Tamer",
""
]
] | This paper proposes distributed discrete-time algorithms to cooperatively solve an additive cost optimization problem in multi-agent networks. The striking feature lies in the use of only the sign of relative state information between neighbors, which substantially differentiates our algorithms from others in the exist... |
cs/0611058 | Marie Cottrell | Marie Cottrell (CES, SAMOS), Michel Verleysen (DICE) | Advances in Self Organising Maps | Special Issue of the Neural Networks Journal after WSOM 05 in Paris | Neural Networks Volume 19, Issues 6-7 (2006) 721-722 | 10.1016/j.neunet.2006.05.011 | null | cs.NE math.ST nlin.AO stat.TH | null | The Self-Organizing Map (SOM) with its related extensions is the most popular
artificial neural algorithm for use in unsupervised learning, clustering,
classification and data visualization. Over 5,000 publications have been
reported in the open literature, and many commercial projects employ the SOM as
a tool for so... | [
{
"created": "Tue, 14 Nov 2006 13:19:46 GMT",
"version": "v1"
}
] | 2011-11-09 | [
[
"Cottrell",
"Marie",
"",
"CES, SAMOS"
],
[
"Verleysen",
"Michel",
"",
"DICE"
]
] | The Self-Organizing Map (SOM) with its related extensions is the most popular artificial neural algorithm for use in unsupervised learning, clustering, classification and data visualization. Over 5,000 publications have been reported in the open literature, and many commercial projects employ the SOM as a tool for solv... |
2005.00198 | EPTCS | Artjoms {\v{S}}inkarovs (Heriot-Watt University) | Multi-dimensional Arrays with Levels | In Proceedings MSFP 2020, arXiv:2004.14735 | EPTCS 317, 2020, pp. 57-71 | 10.4204/EPTCS.317.4 | null | cs.DS cs.LO cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore a data structure that generalises rectangular multi-dimensional
arrays. The shape of an n-dimensional array is typically given by a tuple of n
natural numbers. Each element in that tuple defines the length of the
corresponding axis. If we treat this tuple as an array, the shape of that array
is described b... | [
{
"created": "Fri, 1 May 2020 03:42:41 GMT",
"version": "v1"
}
] | 2020-05-04 | [
[
"{Š}inkarovs",
"Artjoms",
"",
"Heriot-Watt University"
]
] | We explore a data structure that generalises rectangular multi-dimensional arrays. The shape of an n-dimensional array is typically given by a tuple of n natural numbers. Each element in that tuple defines the length of the corresponding axis. If we treat this tuple as an array, the shape of that array is described by ... |
2310.02029 | Gianluca Bontempi | Gianluca Bontempi | Between accurate prediction and poor decision making: the AI/ML gap | Position paper presented in the BENELEARN 2022 conference | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Intelligent agents rely on AI/ML functionalities to predict the consequence
of possible actions and optimise the policy. However, the effort of the
research community in addressing prediction accuracy has been so intense (and
successful) that it created the illusion that the more accurate the learner
prediction (or c... | [
{
"created": "Tue, 3 Oct 2023 13:15:02 GMT",
"version": "v1"
}
] | 2023-10-04 | [
[
"Bontempi",
"Gianluca",
""
]
] | Intelligent agents rely on AI/ML functionalities to predict the consequence of possible actions and optimise the policy. However, the effort of the research community in addressing prediction accuracy has been so intense (and successful) that it created the illusion that the more accurate the learner prediction (or cla... |
2108.11717 | Soroush Seifi | Soroush Seifi, Abhishek Jha, Tinne Tuytelaars | Glimpse-Attend-and-Explore: Self-Attention for Active Visual Exploration | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Active visual exploration aims to assist an agent with a limited field of
view to understand its environment based on partial observations made by
choosing the best viewing directions in the scene. Recent methods have tried to
address this problem either by using reinforcement learning, which is difficult
to train, o... | [
{
"created": "Thu, 26 Aug 2021 11:41:03 GMT",
"version": "v1"
}
] | 2021-08-27 | [
[
"Seifi",
"Soroush",
""
],
[
"Jha",
"Abhishek",
""
],
[
"Tuytelaars",
"Tinne",
""
]
] | Active visual exploration aims to assist an agent with a limited field of view to understand its environment based on partial observations made by choosing the best viewing directions in the scene. Recent methods have tried to address this problem either by using reinforcement learning, which is difficult to train, or ... |
1401.0092 | Shraddha Shinde | Shraddha S. Shinde and Prof. Anagha P. Khedkar | A Novel Approach For Generating Face Template Using Bda | 11 pages, ITCSE 2013 conference | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In identity management system, commonly used biometric recognition system
needs attention towards issue of biometric template protection as far as more
reliable solution is concerned. In view of this biometric template protection
algorithm should satisfy security, discriminability and cancelability. As no
single temp... | [
{
"created": "Tue, 31 Dec 2013 04:48:43 GMT",
"version": "v1"
}
] | 2014-01-03 | [
[
"Shinde",
"Shraddha S.",
""
],
[
"Khedkar",
"Prof. Anagha P.",
""
]
] | In identity management system, commonly used biometric recognition system needs attention towards issue of biometric template protection as far as more reliable solution is concerned. In view of this biometric template protection algorithm should satisfy security, discriminability and cancelability. As no single templa... |
1709.06668 | Daniel Seita | Daniel Seita, Sanjay Krishnan, Roy Fox, Stephen McKinley, John Canny,
Ken Goldberg | Fast and Reliable Autonomous Surgical Debridement with Cable-Driven
Robots Using a Two-Phase Calibration Procedure | Code, data, and videos are available at
https://sites.google.com/view/calib-icra/. Final version for ICRA 2018 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automating precision subtasks such as debridement (removing dead or diseased
tissue fragments) with Robotic Surgical Assistants (RSAs) such as the da Vinci
Research Kit (dVRK) is challenging due to inherent non-linearities in
cable-driven systems. We propose and evaluate a novel two-phase coarse-to-fine
calibration m... | [
{
"created": "Tue, 19 Sep 2017 22:51:36 GMT",
"version": "v1"
},
{
"created": "Sat, 24 Feb 2018 08:34:58 GMT",
"version": "v2"
}
] | 2018-02-27 | [
[
"Seita",
"Daniel",
""
],
[
"Krishnan",
"Sanjay",
""
],
[
"Fox",
"Roy",
""
],
[
"McKinley",
"Stephen",
""
],
[
"Canny",
"John",
""
],
[
"Goldberg",
"Ken",
""
]
] | Automating precision subtasks such as debridement (removing dead or diseased tissue fragments) with Robotic Surgical Assistants (RSAs) such as the da Vinci Research Kit (dVRK) is challenging due to inherent non-linearities in cable-driven systems. We propose and evaluate a novel two-phase coarse-to-fine calibration met... |
2312.15608 | Yupei Zhang | Yupei Zhang, Yuxin Li, Yifei Wang, Shuangshuang Wei, Yunan Xu, and
Xuequn Shang | Federated learning-outcome prediction with multi-layer privacy
protection | 10 pages, 9 figures, 3 tables. This preprint will be published in
Frontiers of Computer Science on Dec 15, 2024 | Frontiers of Computer Science, 2024,18(6):186604 | 10.1007/s11704-023-2791-8 | null | cs.LG cs.CR cs.DC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Learning-outcome prediction (LOP) is a long-standing and critical problem in
educational routes. Many studies have contributed to developing effective
models while often suffering from data shortage and low generalization to
various institutions due to the privacy-protection issue. To this end, this
study proposes a ... | [
{
"created": "Mon, 25 Dec 2023 04:29:05 GMT",
"version": "v1"
}
] | 2023-12-27 | [
[
"Zhang",
"Yupei",
""
],
[
"Li",
"Yuxin",
""
],
[
"Wang",
"Yifei",
""
],
[
"Wei",
"Shuangshuang",
""
],
[
"Xu",
"Yunan",
""
],
[
"Shang",
"Xuequn",
""
]
] | Learning-outcome prediction (LOP) is a long-standing and critical problem in educational routes. Many studies have contributed to developing effective models while often suffering from data shortage and low generalization to various institutions due to the privacy-protection issue. To this end, this study proposes a di... |
2110.04683 | Alexander Lin | Alexander Lin, Andrew H. Song, Demba Ba | Mixture Model Auto-Encoders: Deep Clustering through Dictionary Learning | 5 pages, 3 figures | IEEE ICASSP 2022 | null | null | cs.LG eess.SP | http://creativecommons.org/licenses/by/4.0/ | State-of-the-art approaches for clustering high-dimensional data utilize deep
auto-encoder architectures. Many of these networks require a large number of
parameters and suffer from a lack of interpretability, due to the black-box
nature of the auto-encoders. We introduce Mixture Model Auto-Encoders
(MixMate), a nove... | [
{
"created": "Sun, 10 Oct 2021 02:30:31 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Feb 2022 16:35:10 GMT",
"version": "v2"
}
] | 2022-02-28 | [
[
"Lin",
"Alexander",
""
],
[
"Song",
"Andrew H.",
""
],
[
"Ba",
"Demba",
""
]
] | State-of-the-art approaches for clustering high-dimensional data utilize deep auto-encoder architectures. Many of these networks require a large number of parameters and suffer from a lack of interpretability, due to the black-box nature of the auto-encoders. We introduce Mixture Model Auto-Encoders (MixMate), a novel ... |
1511.07275 | Wojciech Zaremba | Wojciech Zaremba, Tomas Mikolov, Armand Joulin, Rob Fergus | Learning Simple Algorithms from Examples | null | null | null | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an approach for learning simple algorithms such as copying,
multi-digit addition and single digit multiplication directly from examples.
Our framework consists of a set of interfaces, accessed by a controller.
Typical interfaces are 1-D tapes or 2-D grids that hold the input and output
data. For the contro... | [
{
"created": "Mon, 23 Nov 2015 15:31:54 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Nov 2015 03:28:35 GMT",
"version": "v2"
}
] | 2015-11-25 | [
[
"Zaremba",
"Wojciech",
""
],
[
"Mikolov",
"Tomas",
""
],
[
"Joulin",
"Armand",
""
],
[
"Fergus",
"Rob",
""
]
] | We present an approach for learning simple algorithms such as copying, multi-digit addition and single digit multiplication directly from examples. Our framework consists of a set of interfaces, accessed by a controller. Typical interfaces are 1-D tapes or 2-D grids that hold the input and output data. For the controll... |
2211.13724 | Ali Harakeh | Ali Harakeh, Jordan Hu, Naiqing Guan, Steven L. Waslander, and Liam
Paull | Estimating Regression Predictive Distributions with Sample Networks | Accepted for publication in AAAI 2023. Example code at:
https://samplenet.github.io/ | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Estimating the uncertainty in deep neural network predictions is crucial for
many real-world applications. A common approach to model uncertainty is to
choose a parametric distribution and fit the data to it using maximum
likelihood estimation. The chosen parametric form can be a poor fit to the
data-generating distr... | [
{
"created": "Thu, 24 Nov 2022 17:23:29 GMT",
"version": "v1"
}
] | 2022-11-28 | [
[
"Harakeh",
"Ali",
""
],
[
"Hu",
"Jordan",
""
],
[
"Guan",
"Naiqing",
""
],
[
"Waslander",
"Steven L.",
""
],
[
"Paull",
"Liam",
""
]
] | Estimating the uncertainty in deep neural network predictions is crucial for many real-world applications. A common approach to model uncertainty is to choose a parametric distribution and fit the data to it using maximum likelihood estimation. The chosen parametric form can be a poor fit to the data-generating distrib... |
2201.01219 | Sansit Patnaik | Wei Ding and Sansit Patnaik and Fabio Semperlotti | Multiscale Nonlocal Elasticity: A Distributed Order Fractional
Formulation | 31 pages, 9 images, 3 Tables | null | null | null | cs.CE cs.NA math.NA physics.app-ph | http://creativecommons.org/licenses/by/4.0/ | This study presents a generalized multiscale nonlocal elasticity theory that
leverages distributed order fractional calculus to accurately capture
coexisting multiscale and nonlocal effects within a macroscopic continuum. The
nonlocal multiscale behavior is captured via distributed order fractional
constitutive relat... | [
{
"created": "Fri, 24 Dec 2021 23:38:07 GMT",
"version": "v1"
}
] | 2022-01-05 | [
[
"Ding",
"Wei",
""
],
[
"Patnaik",
"Sansit",
""
],
[
"Semperlotti",
"Fabio",
""
]
] | This study presents a generalized multiscale nonlocal elasticity theory that leverages distributed order fractional calculus to accurately capture coexisting multiscale and nonlocal effects within a macroscopic continuum. The nonlocal multiscale behavior is captured via distributed order fractional constitutive relatio... |
1704.07078 | Yunior Ram\'irez-Cruz | Sjouke Mauw, Yunior Ram\'irez-Cruz, Rolando Trujillo-Rasua | Rethinking $(k,\ell)$-anonymity in social graphs: $(k,\ell)$-adjacency
anonymity and $(k,\ell)$-(adjacency) anonymous transformations | null | "Conditional adjacency anonymity in social graphs under active
attacks", Knowledge and Information Systems 61(1):485-511, 2019 | 10.1007/s10115-018-1283-x | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper treats the privacy-preserving publication of social graphs in the
presence of active adversaries, that is, adversaries with the ability to
introduce sybil nodes in the graph prior to publication and leverage them to
create unique fingerprints for a set of victim nodes and re-identify them after
publication... | [
{
"created": "Mon, 24 Apr 2017 08:14:03 GMT",
"version": "v1"
}
] | 2019-09-04 | [
[
"Mauw",
"Sjouke",
""
],
[
"Ramírez-Cruz",
"Yunior",
""
],
[
"Trujillo-Rasua",
"Rolando",
""
]
] | This paper treats the privacy-preserving publication of social graphs in the presence of active adversaries, that is, adversaries with the ability to introduce sybil nodes in the graph prior to publication and leverage them to create unique fingerprints for a set of victim nodes and re-identify them after publication. ... |
1205.3181 | Sebastien Bubeck | S\'ebastien Bubeck, Tengyao Wang, Nitin Viswanathan | Multiple Identifications in Multi-Armed Bandits | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of identifying the top $m$ arms in a multi-armed bandit
game. Our proposed solution relies on a new algorithm based on successive
rejects of the seemingly bad arms, and successive accepts of the good ones.
This algorithmic contribution allows to tackle other multiple identifications
settings that... | [
{
"created": "Mon, 14 May 2012 20:10:04 GMT",
"version": "v1"
}
] | 2012-05-16 | [
[
"Bubeck",
"Sébastien",
""
],
[
"Wang",
"Tengyao",
""
],
[
"Viswanathan",
"Nitin",
""
]
] | We study the problem of identifying the top $m$ arms in a multi-armed bandit game. Our proposed solution relies on a new algorithm based on successive rejects of the seemingly bad arms, and successive accepts of the good ones. This algorithmic contribution allows to tackle other multiple identifications settings that w... |
1509.02975 | Steve Huntsman | Steve Huntsman and Arman Rezaee | De Bruijn entropy and string similarity | Extended version of a paper presented at WORDS 2015; MATLAB source
code and scripts for reproducing results are included | null | null | https://nbn-resolving.org/urn:nbn:de:gbv:8:1-zs-00000305-a5 | cs.DM cs.IT math.CO math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the notion of de Bruijn entropy of an Eulerian quiver and show
how the corresponding relative entropy can be applied to practical string
similarity problems. This approach explicitly links the combinatorial and
information-theoretical properties of words and its performance is superior to
edit distances ... | [
{
"created": "Wed, 9 Sep 2015 23:27:04 GMT",
"version": "v1"
}
] | 2022-01-24 | [
[
"Huntsman",
"Steve",
""
],
[
"Rezaee",
"Arman",
""
]
] | We introduce the notion of de Bruijn entropy of an Eulerian quiver and show how the corresponding relative entropy can be applied to practical string similarity problems. This approach explicitly links the combinatorial and information-theoretical properties of words and its performance is superior to edit distances in... |
1701.01491 | Amina Piemontese Ph.D | Amina Piemontese, and Alexandre Graell i Amat | MDS-Coded Distributed Caching for Low Delay Wireless Content Delivery | submitted to IEEE Transactions on Communications. arXiv admin note:
text overlap with arXiv:1607.00880 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the use of maximum distance separable (MDS) codes to cache
popular content to reduce the download delay of wireless content delivery. In
particular, we consider a cellular system where devices roam in an out of a
cell according to a Poisson random process. Popular content is cached in a
limited number ... | [
{
"created": "Thu, 5 Jan 2017 21:59:20 GMT",
"version": "v1"
}
] | 2017-01-09 | [
[
"Piemontese",
"Amina",
""
],
[
"Amat",
"Alexandre Graell i",
""
]
] | We investigate the use of maximum distance separable (MDS) codes to cache popular content to reduce the download delay of wireless content delivery. In particular, we consider a cellular system where devices roam in an out of a cell according to a Poisson random process. Popular content is cached in a limited number of... |
1011.0298 | Nayyar Mehmood | Nayyar Mehmood, Imran Haider Qureshi | Intuitionistic Fuzzy Ideal Extensions of {\Gamma}-Semigroups | Accepted, 11 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper the concept of the extensions of intuitionistic fuzzy ideals in
a semigroup has been extended to a {\Gamma}-Semigroups. Among other results
characterization of prime ideals in a {\Gamma}-Semigroups in terms of
intuitionistic fuzzy ideal extension has been obtained.
| [
{
"created": "Mon, 1 Nov 2010 11:54:14 GMT",
"version": "v1"
}
] | 2010-11-13 | [
[
"Mehmood",
"Nayyar",
""
],
[
"Qureshi",
"Imran Haider",
""
]
] | In this paper the concept of the extensions of intuitionistic fuzzy ideals in a semigroup has been extended to a {\Gamma}-Semigroups. Among other results characterization of prime ideals in a {\Gamma}-Semigroups in terms of intuitionistic fuzzy ideal extension has been obtained. |
2111.03362 | Moran Baruch | Moran Baruch, Nir Drucker, Lev Greenberg and Guy Moshkowich | A methodology for training homomorphicencryption friendly neural
networks | null | null | 10.1007/978-3-031-16815-4_29 | null | cs.CR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Privacy-preserving deep neural network (DNN) inference is a necessity in
different regulated industries such as healthcare, finance and retail.
Recently, homomorphic encryption (HE) has been used as a method to enable
analytics while addressing privacy concerns. HE enables secure predictions over
encrypted data. Howe... | [
{
"created": "Fri, 5 Nov 2021 10:04:15 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Nov 2021 08:22:48 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Jul 2022 19:22:02 GMT",
"version": "v3"
}
] | 2023-06-13 | [
[
"Baruch",
"Moran",
""
],
[
"Drucker",
"Nir",
""
],
[
"Greenberg",
"Lev",
""
],
[
"Moshkowich",
"Guy",
""
]
] | Privacy-preserving deep neural network (DNN) inference is a necessity in different regulated industries such as healthcare, finance and retail. Recently, homomorphic encryption (HE) has been used as a method to enable analytics while addressing privacy concerns. HE enables secure predictions over encrypted data. Howeve... |
1402.3613 | Pavel Janovsk\'y | Pavel Janovsk\'y and Michal \v{C}\'ap and Ji\v{r}\'i Vok\v{r}\'inek | Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal
Environment | Proceedings of the 13th International Conference on Autonomous Agents
and Multiagent Systems (AAMAS 2014) | null | null | null | cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Avoiding collisions is one of the vital tasks for systems of autonomous
mobile agents. We focus on the problem of finding continuous coordinated paths
for multiple mobile disc agents in a 2-d environment with polygonal obstacles.
The problem is PSPACE-hard, with the state space growing exponentially in the
number of ... | [
{
"created": "Fri, 14 Feb 2014 22:09:44 GMT",
"version": "v1"
}
] | 2014-02-18 | [
[
"Janovský",
"Pavel",
""
],
[
"Čáp",
"Michal",
""
],
[
"Vokřínek",
"Jiří",
""
]
] | Avoiding collisions is one of the vital tasks for systems of autonomous mobile agents. We focus on the problem of finding continuous coordinated paths for multiple mobile disc agents in a 2-d environment with polygonal obstacles. The problem is PSPACE-hard, with the state space growing exponentially in the number of ag... |
1704.06700 | Ahmad Nauman Ghazi | Shoaib Bakhtyar and Ahmad Nauman Ghazi | On Improving Research Methodology Course at Blekinge Institute of
Technology | Conference on Higher Education, L\"ararl\"ardom2016 Kristianstad
University Press Sweden. 2016 | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Research Methodology in Software Engineering and Computer Science (RM) is
a compulsory course that must be studied by graduate students at Blekinge
Institute of Technology (BTH) prior to undertaking their theses work. The
course is focused on teaching research methods and techniques for data
collection and analys... | [
{
"created": "Fri, 21 Apr 2017 20:11:57 GMT",
"version": "v1"
}
] | 2017-04-25 | [
[
"Bakhtyar",
"Shoaib",
""
],
[
"Ghazi",
"Ahmad Nauman",
""
]
] | The Research Methodology in Software Engineering and Computer Science (RM) is a compulsory course that must be studied by graduate students at Blekinge Institute of Technology (BTH) prior to undertaking their theses work. The course is focused on teaching research methods and techniques for data collection and analysis... |
2305.20056 | Arvind Pillai | Arvind Pillai, Subigya Nepal and Andrew Campbell | Rare Life Event Detection via Mobile Sensing Using Multi-Task Learning | 15 pages, 4 figures, CHIL 2023 (Accepted) | null | null | null | cs.LG cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Rare life events significantly impact mental health, and their detection in
behavioral studies is a crucial step towards health-based interventions. We
envision that mobile sensing data can be used to detect these anomalies.
However, the human-centered nature of the problem, combined with the
infrequency and uniquene... | [
{
"created": "Wed, 31 May 2023 17:29:24 GMT",
"version": "v1"
}
] | 2023-06-01 | [
[
"Pillai",
"Arvind",
""
],
[
"Nepal",
"Subigya",
""
],
[
"Campbell",
"Andrew",
""
]
] | Rare life events significantly impact mental health, and their detection in behavioral studies is a crucial step towards health-based interventions. We envision that mobile sensing data can be used to detect these anomalies. However, the human-centered nature of the problem, combined with the infrequency and uniqueness... |
2310.10687 | Md. Imtiaz Habib | Md. Imtiaz Habib, Abdullah Al Maruf, Md. Jobair Ahmed Nabil | An Exploration Into Web Session Security- A Systematic Literature Review | 9 pages, 8 sections, survey article | null | null | null | cs.SE cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The most common attacks against web sessions are reviewed in this paper, for
example, some attacks against web browsers' honest users attempting to create
session with trusted web browser application legally. We have assessed with
four different ways to judge the viability of a certain solution by reviewing
existing ... | [
{
"created": "Sat, 14 Oct 2023 16:22:07 GMT",
"version": "v1"
}
] | 2023-10-18 | [
[
"Habib",
"Md. Imtiaz",
""
],
[
"Maruf",
"Abdullah Al",
""
],
[
"Nabil",
"Md. Jobair Ahmed",
""
]
] | The most common attacks against web sessions are reviewed in this paper, for example, some attacks against web browsers' honest users attempting to create session with trusted web browser application legally. We have assessed with four different ways to judge the viability of a certain solution by reviewing existing se... |
2005.13811 | Thomas Studer | Thomas Studer | No-Go Theorems for Data Privacy | null | null | null | null | cs.LO cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Controlled query evaluation (CQE) is an approach to guarantee data privacy
for database and knowledge base systems. CQE-systems feature a censor function
that may distort the answer to a query in order to hide sensitive information.
We introduce a high-level formalization of controlled query evaluation and
define sev... | [
{
"created": "Thu, 28 May 2020 07:10:37 GMT",
"version": "v1"
}
] | 2020-05-29 | [
[
"Studer",
"Thomas",
""
]
] | Controlled query evaluation (CQE) is an approach to guarantee data privacy for database and knowledge base systems. CQE-systems feature a censor function that may distort the answer to a query in order to hide sensitive information. We introduce a high-level formalization of controlled query evaluation and define sever... |
2302.05520 | Eli Gafni professor | Eli Gafni and Vasileios Zikas | Synchrony/Asynchrony vs. Stationary/Mobile? The Latter is Superior...in
Theory | null | null | null | null | cs.DS | http://creativecommons.org/publicdomain/zero/1.0/ | Like Asynchrony, Mobility of faults precludes consensus. Yet, a model M in
which Consensus is solvable, has an analogue relaxed model in which Consensus
is not solvable and for which we can ask, whether Consensus is solvable if the
system initially behaves like the relaxed analogue model, but eventually morphs
into M... | [
{
"created": "Fri, 10 Feb 2023 21:49:55 GMT",
"version": "v1"
}
] | 2023-02-14 | [
[
"Gafni",
"Eli",
""
],
[
"Zikas",
"Vasileios",
""
]
] | Like Asynchrony, Mobility of faults precludes consensus. Yet, a model M in which Consensus is solvable, has an analogue relaxed model in which Consensus is not solvable and for which we can ask, whether Consensus is solvable if the system initially behaves like the relaxed analogue model, but eventually morphs into M. ... |
2101.08100 | Weixuan Zhang | Weixuan Zhang, Marco Tognon, Lionel Ott, Roland Siegwart, and Juan
Nieto | Active Model Learning using Informative Trajectories for Improved
Closed-Loop Control on Real Robots | null | null | null | null | cs.RO cs.SY eess.SY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Model-based controllers on real robots require accurate knowledge of the
system dynamics to perform optimally. For complex dynamics, first-principles
modeling is not sufficiently precise, and data-driven approaches can be
leveraged to learn a statistical model from real experiments. However, the
efficient and effecti... | [
{
"created": "Wed, 20 Jan 2021 12:54:26 GMT",
"version": "v1"
},
{
"created": "Fri, 14 May 2021 13:34:39 GMT",
"version": "v2"
}
] | 2021-05-17 | [
[
"Zhang",
"Weixuan",
""
],
[
"Tognon",
"Marco",
""
],
[
"Ott",
"Lionel",
""
],
[
"Siegwart",
"Roland",
""
],
[
"Nieto",
"Juan",
""
]
] | Model-based controllers on real robots require accurate knowledge of the system dynamics to perform optimally. For complex dynamics, first-principles modeling is not sufficiently precise, and data-driven approaches can be leveraged to learn a statistical model from real experiments. However, the efficient and effective... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.