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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1705.06401 | Kostas Alexis PhD | Frank Mascarich, Taylor Wilson, Tung Dang, Shehryar Khattak, Christos
Papachristos, Kostas Alexis | Towards Robotically Supported Decommissioning of Nuclear Sites | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper overviews certain radiation detection, perception, and planning
challenges for nuclearized robotics that aim to support the waste management
and decommissioning mission. To enable the autonomous monitoring, inspection
and multi-modal characterization of nuclear sites, we discuss important
problems relevant... | [
{
"created": "Thu, 18 May 2017 02:58:23 GMT",
"version": "v1"
}
] | 2017-05-19 | [
[
"Mascarich",
"Frank",
""
],
[
"Wilson",
"Taylor",
""
],
[
"Dang",
"Tung",
""
],
[
"Khattak",
"Shehryar",
""
],
[
"Papachristos",
"Christos",
""
],
[
"Alexis",
"Kostas",
""
]
] | This paper overviews certain radiation detection, perception, and planning challenges for nuclearized robotics that aim to support the waste management and decommissioning mission. To enable the autonomous monitoring, inspection and multi-modal characterization of nuclear sites, we discuss important problems relevant t... |
1304.2946 | Baofeng Wu | Jia Zheng, Baofeng Wu, Yufu Chen, Zhuojun Liu | Constructing $2m$-variable Boolean functions with optimal algebraic
immunity based on polar decomposition of $\mathbb{F}_{2^{2m}}^*$ | 20 pages | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Constructing $2m$-variable Boolean functions with optimal algebraic immunity
based on decomposition of additive group of the finite field
$\mathbb{F}_{2^{2m}}$ seems to be a promising approach since Tu and Deng's
work. In this paper, we consider the same problem in a new way. Based on polar
decomposition of the multi... | [
{
"created": "Wed, 10 Apr 2013 13:18:05 GMT",
"version": "v1"
}
] | 2013-04-11 | [
[
"Zheng",
"Jia",
""
],
[
"Wu",
"Baofeng",
""
],
[
"Chen",
"Yufu",
""
],
[
"Liu",
"Zhuojun",
""
]
] | Constructing $2m$-variable Boolean functions with optimal algebraic immunity based on decomposition of additive group of the finite field $\mathbb{F}_{2^{2m}}$ seems to be a promising approach since Tu and Deng's work. In this paper, we consider the same problem in a new way. Based on polar decomposition of the multipl... |
2201.09178 | Serdar Kadioglu | Xin Wang, Serdar Kadioglu | Dichotomic Pattern Mining with Applications to Intent Prediction from
Semi-Structured Clickstream Datasets | The AAAI-22 Workshop on Knowledge Discovery from Unstructured Data in
Financial Services (KDF@AAAI'22) | null | null | null | cs.AI cs.IR cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We introduce a pattern mining framework that operates on semi-structured
datasets and exploits the dichotomy between outcomes. Our approach takes
advantage of constraint reasoning to find sequential patterns that occur
frequently and exhibit desired properties. This allows the creation of novel
pattern embeddings tha... | [
{
"created": "Sun, 23 Jan 2022 05:00:50 GMT",
"version": "v1"
}
] | 2022-01-25 | [
[
"Wang",
"Xin",
""
],
[
"Kadioglu",
"Serdar",
""
]
] | We introduce a pattern mining framework that operates on semi-structured datasets and exploits the dichotomy between outcomes. Our approach takes advantage of constraint reasoning to find sequential patterns that occur frequently and exhibit desired properties. This allows the creation of novel pattern embeddings that ... |
2206.01192 | Marcus Hutter | Marcus Hutter and Steven Hansen | Uniqueness and Complexity of Inverse MDP Models | 34 pages, 4 fgures | null | null | null | cs.LG cs.CC | http://creativecommons.org/licenses/by/4.0/ | What is the action sequence aa'a" that was likely responsible for reaching
state s"' (from state s) in 3 steps? Addressing such questions is important in
causal reasoning and in reinforcement learning. Inverse "MDP" models
p(aa'a"|ss"') can be used to answer them. In the traditional "forward" view,
transition "matrix... | [
{
"created": "Thu, 2 Jun 2022 17:52:10 GMT",
"version": "v1"
}
] | 2022-06-03 | [
[
"Hutter",
"Marcus",
""
],
[
"Hansen",
"Steven",
""
]
] | What is the action sequence aa'a" that was likely responsible for reaching state s"' (from state s) in 3 steps? Addressing such questions is important in causal reasoning and in reinforcement learning. Inverse "MDP" models p(aa'a"|ss"') can be used to answer them. In the traditional "forward" view, transition "matrix" ... |
1904.05553 | Phu Lai | Phu Lai, Qiang He, Mohamed Abdelrazek, Feifei Chen, John Hosking, John
Grundy, Yun Yang | Optimal Edge User Allocation in Edge Computing with Variable Sized
Vector Bin Packing | null | null | 10.1007/978-3-030-03596-9_15 | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | In mobile edge computing, edge servers are geographically distributed around
base stations placed near end-users to provide highly accessible and efficient
computing capacities and services. In the mobile edge computing environment, a
service provider can deploy its service on hired edge servers to reduce
end-to-end ... | [
{
"created": "Thu, 11 Apr 2019 07:06:04 GMT",
"version": "v1"
}
] | 2019-04-12 | [
[
"Lai",
"Phu",
""
],
[
"He",
"Qiang",
""
],
[
"Abdelrazek",
"Mohamed",
""
],
[
"Chen",
"Feifei",
""
],
[
"Hosking",
"John",
""
],
[
"Grundy",
"John",
""
],
[
"Yang",
"Yun",
""
]
] | In mobile edge computing, edge servers are geographically distributed around base stations placed near end-users to provide highly accessible and efficient computing capacities and services. In the mobile edge computing environment, a service provider can deploy its service on hired edge servers to reduce end-to-end se... |
2304.06049 | Kevin Chang | Kevin Chang, Nathan Dahlin, Rahul Jain and Pierluigi Nuzzo | Exact and Cost-Effective Automated Transformation of Neural Network
Controllers to Decision Tree Controllers | null | null | null | null | cs.LG cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the past decade, neural network (NN)-based controllers have demonstrated
remarkable efficacy in a variety of decision-making tasks. However, their
black-box nature and the risk of unexpected behaviors and surprising results
pose a challenge to their deployment in real-world systems with strong
guarantees of corr... | [
{
"created": "Tue, 11 Apr 2023 19:52:30 GMT",
"version": "v1"
},
{
"created": "Sat, 16 Sep 2023 00:52:18 GMT",
"version": "v2"
}
] | 2023-09-19 | [
[
"Chang",
"Kevin",
""
],
[
"Dahlin",
"Nathan",
""
],
[
"Jain",
"Rahul",
""
],
[
"Nuzzo",
"Pierluigi",
""
]
] | Over the past decade, neural network (NN)-based controllers have demonstrated remarkable efficacy in a variety of decision-making tasks. However, their black-box nature and the risk of unexpected behaviors and surprising results pose a challenge to their deployment in real-world systems with strong guarantees of correc... |
2004.03868 | Dieuwke Hupkes | Diana Rodr\'iguez Luna, Edoardo Maria Ponti, Dieuwke Hupkes, Elia
Bruni | Internal and external pressures on language emergence: least effort,
object constancy and frequency | Accepted for EMNLP-findings | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In previous work, artificial agents were shown to achieve almost perfect
accuracy in referential games where they have to communicate to identify
images. Nevertheless, the resulting communication protocols rarely display
salient features of natural languages, such as compositionality. In this paper,
we propose some r... | [
{
"created": "Wed, 8 Apr 2020 08:12:41 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Jul 2020 17:48:06 GMT",
"version": "v2"
},
{
"created": "Tue, 13 Oct 2020 09:29:44 GMT",
"version": "v3"
}
] | 2020-10-14 | [
[
"Luna",
"Diana Rodríguez",
""
],
[
"Ponti",
"Edoardo Maria",
""
],
[
"Hupkes",
"Dieuwke",
""
],
[
"Bruni",
"Elia",
""
]
] | In previous work, artificial agents were shown to achieve almost perfect accuracy in referential games where they have to communicate to identify images. Nevertheless, the resulting communication protocols rarely display salient features of natural languages, such as compositionality. In this paper, we propose some rea... |
1306.2347 | Sivan Sabato | Sivan Sabato and Anand D. Sarwate and Nathan Srebro | Auditing: Active Learning with Outcome-Dependent Query Costs | Corrections in section 5 | Neural Information Processing Systems 26 (NIPS), 512-520, 2013 | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a learning setting in which unlabeled data is free, and the cost
of a label depends on its value, which is not known in advance. We study binary
classification in an extreme case, where the algorithm only pays for negative
labels. Our motivation are applications such as fraud detection, in which
investigat... | [
{
"created": "Mon, 10 Jun 2013 20:18:48 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Sep 2013 17:57:33 GMT",
"version": "v2"
},
{
"created": "Tue, 15 Oct 2013 18:27:07 GMT",
"version": "v3"
},
{
"created": "Sun, 12 Jul 2015 10:11:57 GMT",
"version": "v4"
}
] | 2015-07-14 | [
[
"Sabato",
"Sivan",
""
],
[
"Sarwate",
"Anand D.",
""
],
[
"Srebro",
"Nathan",
""
]
] | We propose a learning setting in which unlabeled data is free, and the cost of a label depends on its value, which is not known in advance. We study binary classification in an extreme case, where the algorithm only pays for negative labels. Our motivation are applications such as fraud detection, in which investigatin... |
1409.7286 | Vinay Vaishampayan | Antonio Campello and Vinay A. Vaishampayan | Reliability of Erasure Coded Storage Systems: A Geometric Approach | 28 pages. 8 figures. Presented in part at IEEE International
Conference on BigData 2013, Santa Clara, CA, Oct. 2013 and to be presented in
part at 2014 IEEE Information Theory Workshop, Tasmania, Australia, Nov.
2014. New analysis added May 2015. Further Update Aug. 2015 | null | 10.1109/TIT.2015.2477401 | null | cs.DC cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the probability of data loss, or equivalently, the reliability
function for an erasure coded distributed data storage system under worst case
conditions. Data loss in an erasure coded system depends on probability
distributions for the disk repair duration and the disk failure duration. In
previous works,... | [
{
"created": "Thu, 25 Sep 2014 15:12:15 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Apr 2015 12:50:56 GMT",
"version": "v2"
},
{
"created": "Thu, 21 May 2015 21:47:39 GMT",
"version": "v3"
},
{
"created": "Thu, 20 Aug 2015 03:37:26 GMT",
"version": "v4"
}
] | 2016-11-18 | [
[
"Campello",
"Antonio",
""
],
[
"Vaishampayan",
"Vinay A.",
""
]
] | We consider the probability of data loss, or equivalently, the reliability function for an erasure coded distributed data storage system under worst case conditions. Data loss in an erasure coded system depends on probability distributions for the disk repair duration and the disk failure duration. In previous works, t... |
cs/0504004 | Henning Bostelmann | Henning Bostelmann | Statistical analysis of quality measures for mobile ad hoc networks | Master's thesis; 78 pages, 10 figures | null | null | null | cs.NI cs.DM | null | How can the quality of a mobile ad hoc network (MANET) be quantified? This
work aims at an answer based on the lower network layers, i.e. on connectivity
between the wireless nodes, using statistical methods. A number of different
quality measures are introduced and classified according to their scaling
behaviour. Th... | [
{
"created": "Sat, 2 Apr 2005 23:19:43 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Bostelmann",
"Henning",
""
]
] | How can the quality of a mobile ad hoc network (MANET) be quantified? This work aims at an answer based on the lower network layers, i.e. on connectivity between the wireless nodes, using statistical methods. A number of different quality measures are introduced and classified according to their scaling behaviour. They... |
2205.00718 | Hermann Kroll | Hermann Kroll and Florian Pl\"otzky and Jan Pirklbauer and Wolf-Tilo
Balke | What a Publication Tells You -- Benefits of Narrative Information Access
in Digital Libraries | Accepted at JCDL2022, 8 pages, 1 figure | null | 10.1145/3529372.3530928 | null | cs.DL | http://creativecommons.org/licenses/by/4.0/ | Knowledge bases allow effective access paths in digital libraries. Here users
can specify their information need as graph patterns for precise searches and
structured overviews (by allowing variables in queries). But especially when
considering textual sources that contain narrative information, i.e., short
stories o... | [
{
"created": "Mon, 2 May 2022 08:14:40 GMT",
"version": "v1"
},
{
"created": "Tue, 3 May 2022 05:40:01 GMT",
"version": "v2"
},
{
"created": "Wed, 4 May 2022 05:59:06 GMT",
"version": "v3"
}
] | 2022-05-05 | [
[
"Kroll",
"Hermann",
""
],
[
"Plötzky",
"Florian",
""
],
[
"Pirklbauer",
"Jan",
""
],
[
"Balke",
"Wolf-Tilo",
""
]
] | Knowledge bases allow effective access paths in digital libraries. Here users can specify their information need as graph patterns for precise searches and structured overviews (by allowing variables in queries). But especially when considering textual sources that contain narrative information, i.e., short stories of ... |
2102.07981 | Mingbao Lin | Mingbao Lin, Rongrong Ji, Zihan Xu, Baochang Zhang, Fei Chao, Chia-Wen
Lin, Ling Shao | SiMaN: Sign-to-Magnitude Network Binarization | Accepted by IEEE TPAMI, 2022 | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Binary neural networks (BNNs) have attracted broad research interest due to
their efficient storage and computational ability. Nevertheless, a significant
challenge of BNNs lies in handling discrete constraints while ensuring bit
entropy maximization, which typically makes their weight optimization very
difficult. Ex... | [
{
"created": "Tue, 16 Feb 2021 07:03:51 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Mar 2021 12:51:21 GMT",
"version": "v2"
},
{
"created": "Tue, 4 Oct 2022 17:24:54 GMT",
"version": "v3"
}
] | 2022-10-05 | [
[
"Lin",
"Mingbao",
""
],
[
"Ji",
"Rongrong",
""
],
[
"Xu",
"Zihan",
""
],
[
"Zhang",
"Baochang",
""
],
[
"Chao",
"Fei",
""
],
[
"Lin",
"Chia-Wen",
""
],
[
"Shao",
"Ling",
""
]
] | Binary neural networks (BNNs) have attracted broad research interest due to their efficient storage and computational ability. Nevertheless, a significant challenge of BNNs lies in handling discrete constraints while ensuring bit entropy maximization, which typically makes their weight optimization very difficult. Exis... |
2205.06226 | Zixin Wen | Zixin Wen, Yuanzhi Li | The Mechanism of Prediction Head in Non-contrastive Self-supervised
Learning | 88 pages, comments welcome | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Recently the surprising discovery of the Bootstrap Your Own Latent (BYOL)
method by Grill et al. shows the negative term in contrastive loss can be
removed if we add the so-called prediction head to the network. This initiated
the research of non-contrastive self-supervised learning. It is mysterious why
even when th... | [
{
"created": "Thu, 12 May 2022 17:15:53 GMT",
"version": "v1"
},
{
"created": "Sat, 14 May 2022 05:04:42 GMT",
"version": "v2"
},
{
"created": "Sun, 15 Jan 2023 23:51:28 GMT",
"version": "v3"
}
] | 2023-01-18 | [
[
"Wen",
"Zixin",
""
],
[
"Li",
"Yuanzhi",
""
]
] | Recently the surprising discovery of the Bootstrap Your Own Latent (BYOL) method by Grill et al. shows the negative term in contrastive loss can be removed if we add the so-called prediction head to the network. This initiated the research of non-contrastive self-supervised learning. It is mysterious why even when ther... |
2104.13092 | Bin Cao | Mingrui Cao, Long Zhang, Bin Cao | Towards On-Device Federated Learning: A Direct Acyclic Graph-based
Blockchain Approach | null | null | null | null | cs.DC cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the distributed characteristics of Federated Learning (FL), the
vulnerability of global model and coordination of devices are the main
obstacle. As a promising solution of decentralization, scalability and
security, leveraging blockchain in FL has attracted much attention in recent
years. However, the traditio... | [
{
"created": "Tue, 27 Apr 2021 10:29:38 GMT",
"version": "v1"
}
] | 2021-04-28 | [
[
"Cao",
"Mingrui",
""
],
[
"Zhang",
"Long",
""
],
[
"Cao",
"Bin",
""
]
] | Due to the distributed characteristics of Federated Learning (FL), the vulnerability of global model and coordination of devices are the main obstacle. As a promising solution of decentralization, scalability and security, leveraging blockchain in FL has attracted much attention in recent years. However, the traditiona... |
2301.04101 | Matthew Wallingford | Matthew Wallingford, Aditya Kusupati, Alex Fang, Vivek Ramanujan,
Aniruddha Kembhavi, Roozbeh Mottaghi, Ali Farhadi | Neural Radiance Field Codebooks | 19 pages, 8 figures, 9 tables | International Conference on Learning Representations 2023 | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Compositional representations of the world are a promising step towards
enabling high-level scene understanding and efficient transfer to downstream
tasks. Learning such representations for complex scenes and tasks remains an
open challenge. Towards this goal, we introduce Neural Radiance Field Codebooks
(NRC), a sca... | [
{
"created": "Tue, 10 Jan 2023 18:03:48 GMT",
"version": "v1"
},
{
"created": "Sun, 30 Apr 2023 09:25:38 GMT",
"version": "v2"
}
] | 2023-05-02 | [
[
"Wallingford",
"Matthew",
""
],
[
"Kusupati",
"Aditya",
""
],
[
"Fang",
"Alex",
""
],
[
"Ramanujan",
"Vivek",
""
],
[
"Kembhavi",
"Aniruddha",
""
],
[
"Mottaghi",
"Roozbeh",
""
],
[
"Farhadi",
"Ali",
""
]... | Compositional representations of the world are a promising step towards enabling high-level scene understanding and efficient transfer to downstream tasks. Learning such representations for complex scenes and tasks remains an open challenge. Towards this goal, we introduce Neural Radiance Field Codebooks (NRC), a scala... |
1008.0823 | Adrian Paschke | Adrian Paschke, Alexander Kozlenkov, Harold Boley | A Homogeneous Reaction Rule Language for Complex Event Processing | In Proc. 2nd International Workshop on Event Drive Architecture and
Event Processing Systems (EDA-PS 2007) at VLDB 2007 | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Event-driven automation of reactive functionalities for complex event
processing is an urgent need in today's distributed service-oriented
architectures and Web-based event-driven environments. An important problem to
be addressed is how to correctly and efficiently capture and process the
event-based behavioral, rea... | [
{
"created": "Wed, 4 Aug 2010 17:05:33 GMT",
"version": "v1"
}
] | 2010-08-05 | [
[
"Paschke",
"Adrian",
""
],
[
"Kozlenkov",
"Alexander",
""
],
[
"Boley",
"Harold",
""
]
] | Event-driven automation of reactive functionalities for complex event processing is an urgent need in today's distributed service-oriented architectures and Web-based event-driven environments. An important problem to be addressed is how to correctly and efficiently capture and process the event-based behavioral, react... |
1607.00964 | Koosha Pourtahmasi Roshandeh | Koosha Pourtahmasi Roshandeh, Masoud Ardakani and Chintha Tellambura | A general framework for weighted sum-rate and common-rate optimization | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a framework for solving a class of optimization
problems encountered in a range of power allocation problems in wireless relay
networks. In particular, power allocation for weighted sum-rate and common-rate
optimization problems fall in this framework. Subject to some conditions on the
regio... | [
{
"created": "Mon, 4 Jul 2016 17:12:35 GMT",
"version": "v1"
}
] | 2016-07-05 | [
[
"Roshandeh",
"Koosha Pourtahmasi",
""
],
[
"Ardakani",
"Masoud",
""
],
[
"Tellambura",
"Chintha",
""
]
] | In this paper, we propose a framework for solving a class of optimization problems encountered in a range of power allocation problems in wireless relay networks. In particular, power allocation for weighted sum-rate and common-rate optimization problems fall in this framework. Subject to some conditions on the region ... |
2408.04725 | Saleh Darzi | Saleh Darzi, Attila A. Yavuz | Counter Denial of Service for Next-Generation Networks within the
Artificial Intelligence and Post-Quantum Era | 10 Pages, 1 Figure, 2 Tables | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Given the rise in cyber threats to networked systems, coupled with the
proliferation of AI techniques and enhanced processing capabilities, Denial of
Service (DoS) attacks are becoming increasingly sophisticated and easily
executable. They target system availability, compromising entire systems
without breaking under... | [
{
"created": "Thu, 8 Aug 2024 18:47:31 GMT",
"version": "v1"
}
] | 2024-08-12 | [
[
"Darzi",
"Saleh",
""
],
[
"Yavuz",
"Attila A.",
""
]
] | Given the rise in cyber threats to networked systems, coupled with the proliferation of AI techniques and enhanced processing capabilities, Denial of Service (DoS) attacks are becoming increasingly sophisticated and easily executable. They target system availability, compromising entire systems without breaking underly... |
2105.02827 | Eklavya Sharma | Arindam Khan, Eklavya Sharma | Tight Approximation Algorithms for Geometric Bin Packing with Skewed
Items | null | null | null | null | cs.CG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the Two-dimensional Bin Packing (2BP) problem, we are given a set of
rectangles of height and width at most one and our goal is to find an
axis-aligned nonoverlapping packing of these rectangles into the minimum number
of unit square bins. The problem admits no APTAS and the current best
approximation ratio is $1.... | [
{
"created": "Thu, 6 May 2021 17:16:11 GMT",
"version": "v1"
}
] | 2021-05-07 | [
[
"Khan",
"Arindam",
""
],
[
"Sharma",
"Eklavya",
""
]
] | In the Two-dimensional Bin Packing (2BP) problem, we are given a set of rectangles of height and width at most one and our goal is to find an axis-aligned nonoverlapping packing of these rectangles into the minimum number of unit square bins. The problem admits no APTAS and the current best approximation ratio is $1.40... |
2009.07265 | Kelvin C.K. Chan | Kelvin C.K. Chan, Xintao Wang, Ke Yu, Chao Dong, Chen Change Loy | Understanding Deformable Alignment in Video Super-Resolution | Tech report, 15 pages, 19 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deformable convolution, originally proposed for the adaptation to geometric
variations of objects, has recently shown compelling performance in aligning
multiple frames and is increasingly adopted for video super-resolution. Despite
its remarkable performance, its underlying mechanism for alignment remains
unclear. I... | [
{
"created": "Tue, 15 Sep 2020 17:55:06 GMT",
"version": "v1"
}
] | 2020-09-16 | [
[
"Chan",
"Kelvin C. K.",
""
],
[
"Wang",
"Xintao",
""
],
[
"Yu",
"Ke",
""
],
[
"Dong",
"Chao",
""
],
[
"Loy",
"Chen Change",
""
]
] | Deformable convolution, originally proposed for the adaptation to geometric variations of objects, has recently shown compelling performance in aligning multiple frames and is increasingly adopted for video super-resolution. Despite its remarkable performance, its underlying mechanism for alignment remains unclear. In ... |
1208.4138 | Zahoor Khan | Ashraf Mohammed Iqbal, Abidalrahman Moh'd, Zahoor Khan | Semi-supervised Clustering Ensemble by Voting | The International Conference on Information and Communication Systems
(ICICS 2009), Amman, Jordan | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clustering ensemble is one of the most recent advances in unsupervised
learning. It aims to combine the clustering results obtained using different
algorithms or from different runs of the same clustering algorithm for the same
data set, this is accomplished using on a consensus function, the efficiency
and accuracy ... | [
{
"created": "Mon, 20 Aug 2012 23:21:10 GMT",
"version": "v1"
}
] | 2012-08-22 | [
[
"Iqbal",
"Ashraf Mohammed",
""
],
[
"Moh'd",
"Abidalrahman",
""
],
[
"Khan",
"Zahoor",
""
]
] | Clustering ensemble is one of the most recent advances in unsupervised learning. It aims to combine the clustering results obtained using different algorithms or from different runs of the same clustering algorithm for the same data set, this is accomplished using on a consensus function, the efficiency and accuracy of... |
2102.11394 | Jan Achterhold | Jan Achterhold and Joerg Stueckler | Explore the Context: Optimal Data Collection for Context-Conditional
Dynamics Models | Accepted for publication at the 24th International Conference on
Artificial Intelligence and Statistics (AISTATS) 2021, with supplementary
material | null | null | null | cs.LG cs.RO cs.SY eess.SY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we learn dynamics models for parametrized families of
dynamical systems with varying properties. The dynamics models are formulated
as stochastic processes conditioned on a latent context variable which is
inferred from observed transitions of the respective system. The probabilistic
formulation allows... | [
{
"created": "Mon, 22 Feb 2021 22:52:39 GMT",
"version": "v1"
}
] | 2021-02-24 | [
[
"Achterhold",
"Jan",
""
],
[
"Stueckler",
"Joerg",
""
]
] | In this paper, we learn dynamics models for parametrized families of dynamical systems with varying properties. The dynamics models are formulated as stochastic processes conditioned on a latent context variable which is inferred from observed transitions of the respective system. The probabilistic formulation allows u... |
1002.1167 | Vishal Goyal | A. K. Ojha, A. K. Das | Geometric Programming Problem with Co-Efficients and Exponents
Associated with Binary Numbers | International Journal of Computer Science Issues, IJCSI, Vol. 7,
Issue 1, No. 2, January 2010,
http://ijcsi.org/articles/Geometric-Programming-Problem-with-Co-Efficients-and-Exponents-Associated-with-Binary-Numbers.php | International Journal of Computer Science Issues, IJCSI, Vol. 7,
Issue 1, No. 2, January 2010,
http://ijcsi.org/articles/Geometric-Programming-Problem-with-Co-Efficients-and-Exponents-Associated-with-Binary-Numbers.php | null | null | cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Geometric programming (GP) provides a power tool for solving a variety of
optimization problems. In the real world, many applications of geometric
programming (GP) are engineering design problems in which some of the problem
parameters are estimating of actual values. This paper develops a solution
procedure to solve... | [
{
"created": "Fri, 5 Feb 2010 09:29:23 GMT",
"version": "v1"
}
] | 2010-02-08 | [
[
"Ojha",
"A. K.",
""
],
[
"Das",
"A. K.",
""
]
] | Geometric programming (GP) provides a power tool for solving a variety of optimization problems. In the real world, many applications of geometric programming (GP) are engineering design problems in which some of the problem parameters are estimating of actual values. This paper develops a solution procedure to solve n... |
2011.09318 | Jieli Liu | Jiajing Wu, Jieli Liu, Yijing Zhao, Zibin Zheng | Analysis of Cryptocurrency Transactions from a Network Perspective: An
Overview | null | null | 10.1016/j.jnca.2021.103139 | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As one of the most important and famous applications of blockchain
technology, cryptocurrency has attracted extensive attention recently.
Empowered by blockchain technology, all the transaction records of
cryptocurrencies are irreversible and recorded in the blocks. These transaction
records containing rich informati... | [
{
"created": "Wed, 18 Nov 2020 14:39:02 GMT",
"version": "v1"
},
{
"created": "Sat, 7 Aug 2021 15:44:34 GMT",
"version": "v2"
}
] | 2022-01-20 | [
[
"Wu",
"Jiajing",
""
],
[
"Liu",
"Jieli",
""
],
[
"Zhao",
"Yijing",
""
],
[
"Zheng",
"Zibin",
""
]
] | As one of the most important and famous applications of blockchain technology, cryptocurrency has attracted extensive attention recently. Empowered by blockchain technology, all the transaction records of cryptocurrencies are irreversible and recorded in the blocks. These transaction records containing rich information... |
1909.01910 | Valerio Formicola Dr. | Vincenzo Giuliano and Valerio Formicola | ICSrange: A Simulation-based Cyber Range Platform for Industrial Control
Systems | Student Forum paper of the 15th European Dependable Computing
Conference (EDCC 2019) | null | null | null | cs.CR cs.SY eess.SY | http://creativecommons.org/licenses/by-sa/4.0/ | Maintenance staff of Industrial Control Systems (ICS) is generally not aware
about information technologies, and even less about cyber security problems.
The scary impact of cyber attacks in the industrial world calls for tools to
train defensive skills and test effective security measures. Cyber range offers
this op... | [
{
"created": "Wed, 4 Sep 2019 16:03:08 GMT",
"version": "v1"
}
] | 2019-09-05 | [
[
"Giuliano",
"Vincenzo",
""
],
[
"Formicola",
"Valerio",
""
]
] | Maintenance staff of Industrial Control Systems (ICS) is generally not aware about information technologies, and even less about cyber security problems. The scary impact of cyber attacks in the industrial world calls for tools to train defensive skills and test effective security measures. Cyber range offers this oppo... |
1803.04798 | Banu Kabakulak | Banu Kabakulak, Z. Caner Ta\c{s}k{\i}n, and Ali Emre Pusane | A Branch-Price-and-Cut Algorithm for Optimal Decoding of LDPC Codes | 30 pages, 4 figures, 7 tables | null | null | null | cs.IT math.IT math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Channel coding aims to minimize errors that occur during the transmission of
digital information from one place to another. Low-density parity-check (LDPC)
codes can detect and correct transmission errors if one encodes the original
information by adding redundant bits. In practice, heuristic iterative decoding
algor... | [
{
"created": "Tue, 13 Mar 2018 13:41:09 GMT",
"version": "v1"
}
] | 2018-03-14 | [
[
"Kabakulak",
"Banu",
""
],
[
"Taşkın",
"Z. Caner",
""
],
[
"Pusane",
"Ali Emre",
""
]
] | Channel coding aims to minimize errors that occur during the transmission of digital information from one place to another. Low-density parity-check (LDPC) codes can detect and correct transmission errors if one encodes the original information by adding redundant bits. In practice, heuristic iterative decoding algorit... |
2310.17325 | Xiaoyu Liu | Xiaoyu Liu, Jiaxin Yuan, Bang An, Yuancheng Xu, Yifan Yang, Furong
Huang | C-Disentanglement: Discovering Causally-Independent Generative Factors
under an Inductive Bias of Confounder | accepted to Neurips 2023 | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Representation learning assumes that real-world data is generated by a few
semantically meaningful generative factors (i.e., sources of variation) and
aims to discover them in the latent space. These factors are expected to be
causally disentangled, meaning that distinct factors are encoded into separate
latent varia... | [
{
"created": "Thu, 26 Oct 2023 11:44:42 GMT",
"version": "v1"
}
] | 2023-10-27 | [
[
"Liu",
"Xiaoyu",
""
],
[
"Yuan",
"Jiaxin",
""
],
[
"An",
"Bang",
""
],
[
"Xu",
"Yuancheng",
""
],
[
"Yang",
"Yifan",
""
],
[
"Huang",
"Furong",
""
]
] | Representation learning assumes that real-world data is generated by a few semantically meaningful generative factors (i.e., sources of variation) and aims to discover them in the latent space. These factors are expected to be causally disentangled, meaning that distinct factors are encoded into separate latent variabl... |
1908.03605 | Manjunath Narayana | Nandan Banerjee, Ryan C. Connolly, Dimitri Lisin, Jimmy Briggs,
Manjunath Narayana, Mario E. Munich | View management for lifelong visual maps | IEEE International Conference on Intelligent Robots and Systems
(IROS), 2019 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The time complexity of making observations and loop closures in a graph-based
visual SLAM system is a function of the number of views stored. Clever
algorithms, such as approximate nearest neighbor search, can make this function
sub-linear. Despite this, over time the number of views can still grow to a
point at whic... | [
{
"created": "Fri, 9 Aug 2019 19:26:56 GMT",
"version": "v1"
}
] | 2019-08-13 | [
[
"Banerjee",
"Nandan",
""
],
[
"Connolly",
"Ryan C.",
""
],
[
"Lisin",
"Dimitri",
""
],
[
"Briggs",
"Jimmy",
""
],
[
"Narayana",
"Manjunath",
""
],
[
"Munich",
"Mario E.",
""
]
] | The time complexity of making observations and loop closures in a graph-based visual SLAM system is a function of the number of views stored. Clever algorithms, such as approximate nearest neighbor search, can make this function sub-linear. Despite this, over time the number of views can still grow to a point at which ... |
1501.04979 | Thomas Goldstein | Tom Goldstein, Christoph Studer, Richard Baraniuk | FASTA: A Generalized Implementation of Forward-Backward Splitting | null | null | null | null | cs.MS cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This is a user manual for the software package FASTA.
| [
{
"created": "Fri, 16 Jan 2015 01:22:55 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Aug 2015 16:54:50 GMT",
"version": "v2"
},
{
"created": "Wed, 20 Jan 2016 23:51:33 GMT",
"version": "v3"
}
] | 2016-01-22 | [
[
"Goldstein",
"Tom",
""
],
[
"Studer",
"Christoph",
""
],
[
"Baraniuk",
"Richard",
""
]
] | This is a user manual for the software package FASTA. |
2403.18447 | Inhwan Bae | Inhwan Bae and Junoh Lee and Hae-Gon Jeon | Can Language Beat Numerical Regression? Language-Based Multimodal
Trajectory Prediction | Accepted at CVPR 2024 | null | null | null | cs.CL cs.CV cs.LG cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Language models have demonstrated impressive ability in context understanding
and generative performance. Inspired by the recent success of language
foundation models, in this paper, we propose LMTraj (Language-based Multimodal
Trajectory predictor), which recasts the trajectory prediction task into a sort
of questio... | [
{
"created": "Wed, 27 Mar 2024 11:06:44 GMT",
"version": "v1"
}
] | 2024-03-28 | [
[
"Bae",
"Inhwan",
""
],
[
"Lee",
"Junoh",
""
],
[
"Jeon",
"Hae-Gon",
""
]
] | Language models have demonstrated impressive ability in context understanding and generative performance. Inspired by the recent success of language foundation models, in this paper, we propose LMTraj (Language-based Multimodal Trajectory predictor), which recasts the trajectory prediction task into a sort of question-... |
2108.03900 | Jiexia Ye | Jiexia Ye, Juanjuan Zhao, Furong Zheng, Chengzhong Xu | Completion and Augmentation based Spatiotemporal Deep Learning Approach
for Short-Term Metro Origin-Destination Matrix Prediction under Limited
Observable Data | 16 pages, 13 figures, 6 tables | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Short-term OD flow (i.e. the number of passenger traveling between stations)
prediction is crucial to traffic management in metro systems. Due to the
delayed effect in latest complete OD flow collection, complex spatiotemporal
correlations of OD flows in high dimension, it is more challengeable than other
traffic pre... | [
{
"created": "Mon, 9 Aug 2021 09:32:42 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Aug 2021 03:15:34 GMT",
"version": "v2"
},
{
"created": "Tue, 19 Oct 2021 01:51:43 GMT",
"version": "v3"
},
{
"created": "Fri, 12 Nov 2021 08:32:25 GMT",
"version": "v4"
},
{
"cr... | 2022-10-19 | [
[
"Ye",
"Jiexia",
""
],
[
"Zhao",
"Juanjuan",
""
],
[
"Zheng",
"Furong",
""
],
[
"Xu",
"Chengzhong",
""
]
] | Short-term OD flow (i.e. the number of passenger traveling between stations) prediction is crucial to traffic management in metro systems. Due to the delayed effect in latest complete OD flow collection, complex spatiotemporal correlations of OD flows in high dimension, it is more challengeable than other traffic predi... |
2406.07302 | Julen Etxaniz | Julen Etxaniz and Gorka Azkune and Aitor Soroa and Oier Lopez de
Lacalle and Mikel Artetxe | BertaQA: How Much Do Language Models Know About Local Culture? | null | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Large Language Models (LLMs) exhibit extensive knowledge about the world, but
most evaluations have been limited to global or anglocentric subjects. This
raises the question of how well these models perform on topics relevant to
other cultures, whose presence on the web is not that prominent. To address
this gap, we ... | [
{
"created": "Tue, 11 Jun 2024 14:30:34 GMT",
"version": "v1"
}
] | 2024-06-12 | [
[
"Etxaniz",
"Julen",
""
],
[
"Azkune",
"Gorka",
""
],
[
"Soroa",
"Aitor",
""
],
[
"de Lacalle",
"Oier Lopez",
""
],
[
"Artetxe",
"Mikel",
""
]
] | Large Language Models (LLMs) exhibit extensive knowledge about the world, but most evaluations have been limited to global or anglocentric subjects. This raises the question of how well these models perform on topics relevant to other cultures, whose presence on the web is not that prominent. To address this gap, we in... |
1508.00691 | Che Lin | Po-Chun Fu, Pei-Rong Li, Li-Ming Wei, Chang-Lin Chen, and Che Lin | Deterministic Differential Search Algorithm for Distributed Sensor/Relay
Networks | 2 pages, 1 figure, conference | null | null | null | cs.IT cs.DC cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For distributed sensor/relay networks, high reliability and power efficiency
are often required. However, several implementation issues arise in practice.
One such problem is that all the distributed transmitters have limited power
supply since the power source of the transmitters cannot be recharged
continually. To ... | [
{
"created": "Tue, 4 Aug 2015 08:00:25 GMT",
"version": "v1"
}
] | 2015-08-05 | [
[
"Fu",
"Po-Chun",
""
],
[
"Li",
"Pei-Rong",
""
],
[
"Wei",
"Li-Ming",
""
],
[
"Chen",
"Chang-Lin",
""
],
[
"Lin",
"Che",
""
]
] | For distributed sensor/relay networks, high reliability and power efficiency are often required. However, several implementation issues arise in practice. One such problem is that all the distributed transmitters have limited power supply since the power source of the transmitters cannot be recharged continually. To re... |
1112.3785 | Salvador Abreu | Theofrastos Mantadelis and Gerda Janssens | Nesting Probabilistic Inference | Online Proceedings of the 11th International Colloquium on
Implementation of Constraint LOgic Programming Systems (CICLOPS 2011),
Lexington, KY, U.S.A., July 10, 2011 | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When doing inference in ProbLog, a probabilistic extension of Prolog, we
extend SLD resolution with some additional bookkeeping. This additional
information is used to compute the probabilistic results for a probabilistic
query. In Prolog's SLD, goals are nested very naturally. In ProbLog's SLD,
nesting probabilistic... | [
{
"created": "Fri, 16 Dec 2011 12:25:28 GMT",
"version": "v1"
}
] | 2011-12-19 | [
[
"Mantadelis",
"Theofrastos",
""
],
[
"Janssens",
"Gerda",
""
]
] | When doing inference in ProbLog, a probabilistic extension of Prolog, we extend SLD resolution with some additional bookkeeping. This additional information is used to compute the probabilistic results for a probabilistic query. In Prolog's SLD, goals are nested very naturally. In ProbLog's SLD, nesting probabilistic q... |
1108.3426 | Bogdan Aman | Livio Bioglio, Cristina Calcagno, Mario Coppo, Ferruccio Damiani, Eva
Sciacca, Salvatore Spinella, Angelo Troina | A Spatial Calculus of Wrapped Compartments | Presented at MeCBIC 2011 | null | null | MeCBIC/2011/05 | cs.LO cs.CE cs.ET q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Calculus of Wrapped Compartments (CWC) is a recently proposed modelling
language for the representation and simulation of biological systems behaviour.
Although CWC has no explicit structure modelling a spatial geometry, its
compartment labelling feature can be exploited to model various examples of
spatial inter... | [
{
"created": "Wed, 17 Aug 2011 09:00:56 GMT",
"version": "v1"
}
] | 2011-08-18 | [
[
"Bioglio",
"Livio",
""
],
[
"Calcagno",
"Cristina",
""
],
[
"Coppo",
"Mario",
""
],
[
"Damiani",
"Ferruccio",
""
],
[
"Sciacca",
"Eva",
""
],
[
"Spinella",
"Salvatore",
""
],
[
"Troina",
"Angelo",
""
]
] | The Calculus of Wrapped Compartments (CWC) is a recently proposed modelling language for the representation and simulation of biological systems behaviour. Although CWC has no explicit structure modelling a spatial geometry, its compartment labelling feature can be exploited to model various examples of spatial interac... |
2312.15102 | Wassim Kabbani | Wassim Kabbani, Christoph Busch, Kiran Raja | Robust Sclera Segmentation for Skin-tone Agnostic Face Image Quality
Assessment | null | BIOSIG 2023. Gesellschaft f\"ur Informatik e.V. ISSN: 1617-5468.
ISBN: 978-3-88579-733-3 | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Face image quality assessment (FIQA) is crucial for obtaining good face
recognition performance. FIQA algorithms should be robust and insensitive to
demographic factors. The eye sclera has a consistent whitish color in all
humans regardless of their age, ethnicity and skin-tone. This work proposes a
robust sclera seg... | [
{
"created": "Fri, 22 Dec 2023 22:49:11 GMT",
"version": "v1"
}
] | 2023-12-27 | [
[
"Kabbani",
"Wassim",
""
],
[
"Busch",
"Christoph",
""
],
[
"Raja",
"Kiran",
""
]
] | Face image quality assessment (FIQA) is crucial for obtaining good face recognition performance. FIQA algorithms should be robust and insensitive to demographic factors. The eye sclera has a consistent whitish color in all humans regardless of their age, ethnicity and skin-tone. This work proposes a robust sclera segme... |
1301.2561 | Hiroki Sayama | Hiroki Sayama, Irene Pestov, Jeffrey Schmidt, Benjamin James Bush,
Chun Wong, Junichi Yamanoi, and Thilo Gross | Modeling complex systems with adaptive networks | 24 pages, 11 figures, 3 tables | Computers and Mathematics with Applications, 65, 1645-1664 (2013) | 10.1016/j.camwa.2012.12.005 | null | cs.SI nlin.AO physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adaptive networks are a novel class of dynamical networks whose topologies
and states coevolve. Many real-world complex systems can be modeled as adaptive
networks, including social networks, transportation networks, neural networks
and biological networks. In this paper, we introduce fundamental concepts and
unique ... | [
{
"created": "Fri, 11 Jan 2013 17:59:20 GMT",
"version": "v1"
}
] | 2017-05-29 | [
[
"Sayama",
"Hiroki",
""
],
[
"Pestov",
"Irene",
""
],
[
"Schmidt",
"Jeffrey",
""
],
[
"Bush",
"Benjamin James",
""
],
[
"Wong",
"Chun",
""
],
[
"Yamanoi",
"Junichi",
""
],
[
"Gross",
"Thilo",
""
]
] | Adaptive networks are a novel class of dynamical networks whose topologies and states coevolve. Many real-world complex systems can be modeled as adaptive networks, including social networks, transportation networks, neural networks and biological networks. In this paper, we introduce fundamental concepts and unique pr... |
2212.13184 | Peiyu Chen | Peiyu Chen, Weipeng Guan, Peng Lu | ESVIO: Event-based Stereo Visual Inertial Odometry | null | IEEE Robotics and Automation Letters (Volume: 8, Issue: 6, June
2023) | 10.1109/LRA.2023.3269950 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Event cameras that asynchronously output low-latency event streams provide
great opportunities for state estimation under challenging situations. Despite
event-based visual odometry having been extensively studied in recent years,
most of them are based on monocular and few research on stereo event vision. In
this pa... | [
{
"created": "Mon, 26 Dec 2022 15:11:01 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Apr 2023 16:13:12 GMT",
"version": "v2"
},
{
"created": "Mon, 11 Mar 2024 02:17:03 GMT",
"version": "v3"
}
] | 2024-03-12 | [
[
"Chen",
"Peiyu",
""
],
[
"Guan",
"Weipeng",
""
],
[
"Lu",
"Peng",
""
]
] | Event cameras that asynchronously output low-latency event streams provide great opportunities for state estimation under challenging situations. Despite event-based visual odometry having been extensively studied in recent years, most of them are based on monocular and few research on stereo event vision. In this pape... |
1003.0167 | Atri Rudra | Nikhil Bansal, Anupam Gupta, Viswanath Nagarajan and Atri Rudra | When LP is the Cure for Your Matching Woes: Approximating Stochastic
Matchings | This paper has been withdrawn due to new merged paper
arXiv:1008.5356v1 | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This results in this paper have been merged with the result in
arXiv:1002.3763v1
The authors would like to withdraw this version.
Please see arXiv:1008.5356v1 for the merged version.
| [
{
"created": "Sun, 28 Feb 2010 06:32:18 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Sep 2010 01:29:37 GMT",
"version": "v2"
}
] | 2010-09-06 | [
[
"Bansal",
"Nikhil",
""
],
[
"Gupta",
"Anupam",
""
],
[
"Nagarajan",
"Viswanath",
""
],
[
"Rudra",
"Atri",
""
]
] | This results in this paper have been merged with the result in arXiv:1002.3763v1 The authors would like to withdraw this version. Please see arXiv:1008.5356v1 for the merged version. |
2402.14152 | Jonathan Ku | Jonathan Ku, Junyao Zhang, Haoxuan Shan, Saichand Samudrala, Jiawen
Wu, Qilin Zheng, Ziru Li, JV Rajendran, Yiran Chen | ModSRAM: Algorithm-Hardware Co-Design for Large Number Modular
Multiplication in SRAM | DAC 2024 | null | null | null | cs.AR cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Elliptic curve cryptography (ECC) is widely used in security applications
such as public key cryptography (PKC) and zero-knowledge proofs (ZKP). ECC is
composed of modular arithmetic, where modular multiplication takes most of the
processing time. Computational complexity and memory constraints of ECC limit
the perfo... | [
{
"created": "Wed, 21 Feb 2024 22:26:44 GMT",
"version": "v1"
}
] | 2024-02-23 | [
[
"Ku",
"Jonathan",
""
],
[
"Zhang",
"Junyao",
""
],
[
"Shan",
"Haoxuan",
""
],
[
"Samudrala",
"Saichand",
""
],
[
"Wu",
"Jiawen",
""
],
[
"Zheng",
"Qilin",
""
],
[
"Li",
"Ziru",
""
],
[
"Rajendran",
... | Elliptic curve cryptography (ECC) is widely used in security applications such as public key cryptography (PKC) and zero-knowledge proofs (ZKP). ECC is composed of modular arithmetic, where modular multiplication takes most of the processing time. Computational complexity and memory constraints of ECC limit the perform... |
2305.01876 | Siyu Yuan | Siyu Yuan, Deqing Yang, Jinxi Liu, Shuyu Tian, Jiaqing Liang, Yanghua
Xiao, Rui Xie | Causality-aware Concept Extraction based on Knowledge-guided Prompting | Accepted to ACL 2023 | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Concepts benefit natural language understanding but are far from complete in
existing knowledge graphs (KGs). Recently, pre-trained language models (PLMs)
have been widely used in text-based concept extraction (CE). However, PLMs tend
to mine the co-occurrence associations from massive corpus as pre-trained
knowledge... | [
{
"created": "Wed, 3 May 2023 03:36:20 GMT",
"version": "v1"
},
{
"created": "Thu, 4 May 2023 02:16:38 GMT",
"version": "v2"
},
{
"created": "Sun, 7 May 2023 03:02:12 GMT",
"version": "v3"
},
{
"created": "Wed, 10 May 2023 01:15:45 GMT",
"version": "v4"
},
{
"crea... | 2023-06-13 | [
[
"Yuan",
"Siyu",
""
],
[
"Yang",
"Deqing",
""
],
[
"Liu",
"Jinxi",
""
],
[
"Tian",
"Shuyu",
""
],
[
"Liang",
"Jiaqing",
""
],
[
"Xiao",
"Yanghua",
""
],
[
"Xie",
"Rui",
""
]
] | Concepts benefit natural language understanding but are far from complete in existing knowledge graphs (KGs). Recently, pre-trained language models (PLMs) have been widely used in text-based concept extraction (CE). However, PLMs tend to mine the co-occurrence associations from massive corpus as pre-trained knowledge r... |
1106.0855 | Eyal Ackerman | Eyal Ackerman, Tsachik Gelander, and Rom Pinchasi | Ice-Creams and Wedge Graphs | 7 pages | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | What is the minimum angle $\alpha >0$ such that given any set of
$\alpha$-directional antennas (that is, antennas each of which can communicate
along a wedge of angle $\alpha$), one can always assign a direction to each
antenna such that the resulting communication graph is connected? Here two
antennas are connected ... | [
{
"created": "Sat, 4 Jun 2011 20:24:50 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Jul 2011 13:07:44 GMT",
"version": "v2"
}
] | 2011-07-26 | [
[
"Ackerman",
"Eyal",
""
],
[
"Gelander",
"Tsachik",
""
],
[
"Pinchasi",
"Rom",
""
]
] | What is the minimum angle $\alpha >0$ such that given any set of $\alpha$-directional antennas (that is, antennas each of which can communicate along a wedge of angle $\alpha$), one can always assign a direction to each antenna such that the resulting communication graph is connected? Here two antennas are connected by... |
1303.5438 | Yang Xiang | Yang Xiang, David L. Poole, Michael P. Beddoes | Exploring Localization in Bayesian Networks for Large Expert Systems | Appears in Proceedings of the Eighth Conference on Uncertainty in
Artificial Intelligence (UAI1992) | null | null | UAI-P-1992-PG-344-351 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current Bayesian net representations do not consider structure in the domain
and include all variables in a homogeneous network. At any time, a human
reasoner in a large domain may direct his attention to only one of a number of
natural subdomains, i.e., there is ?localization' of queries and evidence. In
such a case... | [
{
"created": "Wed, 13 Mar 2013 12:56:04 GMT",
"version": "v1"
}
] | 2013-03-25 | [
[
"Xiang",
"Yang",
""
],
[
"Poole",
"David L.",
""
],
[
"Beddoes",
"Michael P.",
""
]
] | Current Bayesian net representations do not consider structure in the domain and include all variables in a homogeneous network. At any time, a human reasoner in a large domain may direct his attention to only one of a number of natural subdomains, i.e., there is ?localization' of queries and evidence. In such a case, ... |
1904.08701 | Nils Rexin | Nils Rexin, Marcel Musch and Klaus Dietmayer | Fusion of Object Tracking and Dynamic Occupancy Grid Map | null | 2019 IEEE Intelligent Transportation Systems Conference (ITSC),
Auckland, New Zealand, 2019, pp. 4121-4127 | 10.1109/ITSC.2019.8917048 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Environment modeling in autonomous driving is realized by two fundamental
approaches, grid-based and feature-based approach. Both methods interpret the
environment differently and show some situation-dependent beneficial
realizations. In order to use the advantages of both methods, a combination
makes sense. This wor... | [
{
"created": "Thu, 18 Apr 2019 11:32:09 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Jul 2019 09:35:45 GMT",
"version": "v2"
},
{
"created": "Thu, 5 Dec 2019 09:53:08 GMT",
"version": "v3"
}
] | 2019-12-06 | [
[
"Rexin",
"Nils",
""
],
[
"Musch",
"Marcel",
""
],
[
"Dietmayer",
"Klaus",
""
]
] | Environment modeling in autonomous driving is realized by two fundamental approaches, grid-based and feature-based approach. Both methods interpret the environment differently and show some situation-dependent beneficial realizations. In order to use the advantages of both methods, a combination makes sense. This work ... |
1102.2506 | Behrouz Maham | Behrouz Maham and Are Hj{\o}rungnes | Opportunistic Relaying for Space-Time Coded Cooperation with Multiple
Antenna Terminals | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a wireless relay network with multiple antenna terminals over
Rayleigh fading channels, and apply distributed space-time coding (DSTC) in
amplify-and-forward (A&F) mode. The A&F scheme is used in a way that each relay
transmits a scaled version of the linear combination of the received symbols.
It turns o... | [
{
"created": "Sat, 12 Feb 2011 12:28:41 GMT",
"version": "v1"
}
] | 2011-02-15 | [
[
"Maham",
"Behrouz",
""
],
[
"Hjørungnes",
"Are",
""
]
] | We consider a wireless relay network with multiple antenna terminals over Rayleigh fading channels, and apply distributed space-time coding (DSTC) in amplify-and-forward (A&F) mode. The A&F scheme is used in a way that each relay transmits a scaled version of the linear combination of the received symbols. It turns out... |
2106.06761 | Robert Burduk | Robert Burduk | Relearning ensemble selection based on new generated features | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The ensemble methods are meta-algorithms that combine several base machine
learning techniques to increase the effectiveness of the classification. Many
existing committees of classifiers use the classifier selection process to
determine the optimal set of base classifiers. In this article, we propose the
classifiers... | [
{
"created": "Sat, 12 Jun 2021 12:45:32 GMT",
"version": "v1"
}
] | 2021-06-15 | [
[
"Burduk",
"Robert",
""
]
] | The ensemble methods are meta-algorithms that combine several base machine learning techniques to increase the effectiveness of the classification. Many existing committees of classifiers use the classifier selection process to determine the optimal set of base classifiers. In this article, we propose the classifiers s... |
1502.04925 | Andrei Asinowski | Andrei Asinowski, G\"unter Rote | Point sets with many non-crossing matchings | 33 pages, 19 figures, 2 tables | Computational Geometry, Theory and Applications 68 (2018), 7-33 | 10.1016/j.comgeo.2017.05.006 | null | cs.CG cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The maximum number of non-crossing straight-line perfect matchings that a set
of $n$ points in the plane can have is known to be $O(10.0438^n)$ and
$\Omega^*(3^n)$. The lower bound, due to Garc\'ia, Noy, and Tejel (2000) is
attained by the double chain, which has $\Theta(3^n n^{O(1)})$ such matchings.
We reprove this... | [
{
"created": "Tue, 17 Feb 2015 15:28:52 GMT",
"version": "v1"
}
] | 2017-11-20 | [
[
"Asinowski",
"Andrei",
""
],
[
"Rote",
"Günter",
""
]
] | The maximum number of non-crossing straight-line perfect matchings that a set of $n$ points in the plane can have is known to be $O(10.0438^n)$ and $\Omega^*(3^n)$. The lower bound, due to Garc\'ia, Noy, and Tejel (2000) is attained by the double chain, which has $\Theta(3^n n^{O(1)})$ such matchings. We reprove this b... |
2202.06027 | Wei Jing | Tianying Wang, En Yen Puang, Marcus Lee, Yan Wu, Wei Jing | End-to-end Reinforcement Learning of Robotic Manipulation with Robust
Keypoints Representation | 8 pages | null | null | null | cs.RO cs.CV | http://creativecommons.org/licenses/by/4.0/ | We present an end-to-end Reinforcement Learning(RL) framework for robotic
manipulation tasks, using a robust and efficient keypoints representation. The
proposed method learns keypoints from camera images as the state
representation, through a self-supervised autoencoder architecture. The
keypoints encode the geometr... | [
{
"created": "Sat, 12 Feb 2022 09:58:09 GMT",
"version": "v1"
}
] | 2022-02-15 | [
[
"Wang",
"Tianying",
""
],
[
"Puang",
"En Yen",
""
],
[
"Lee",
"Marcus",
""
],
[
"Wu",
"Yan",
""
],
[
"Jing",
"Wei",
""
]
] | We present an end-to-end Reinforcement Learning(RL) framework for robotic manipulation tasks, using a robust and efficient keypoints representation. The proposed method learns keypoints from camera images as the state representation, through a self-supervised autoencoder architecture. The keypoints encode the geometric... |
2312.06309 | Max Hahn-Klimroth | Max Hahn-Klimroth, Paul W. Dierkes, Matthias W. Kleespies | An unsupervised learning approach to evaluate questionnaire data -- what
one can learn from violations of measurement invariance | null | null | 10.5334/dsj-2024-013 | null | cs.LG stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In several branches of the social sciences and humanities, surveys based on
standardized questionnaires are a prominent research tool. While there are a
variety of ways to analyze the data, some standard procedures have become
established. When those surveys want to analyze differences in the answer
patterns of diffe... | [
{
"created": "Mon, 11 Dec 2023 11:31:41 GMT",
"version": "v1"
}
] | 2024-03-28 | [
[
"Hahn-Klimroth",
"Max",
""
],
[
"Dierkes",
"Paul W.",
""
],
[
"Kleespies",
"Matthias W.",
""
]
] | In several branches of the social sciences and humanities, surveys based on standardized questionnaires are a prominent research tool. While there are a variety of ways to analyze the data, some standard procedures have become established. When those surveys want to analyze differences in the answer patterns of differe... |
2005.08610 | Sadaf Salehkalaibar | Sadaf Salehkalaibar and Michele Wigger | Distributed Hypothesis Testing with Variable-Length Coding | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of distributed testing against independence with variable-length
coding is considered when the \emph{average} and not the \emph{maximum}
communication load is constrained as in previous works. The paper characterizes
the optimum type-II error exponent of a single sensor single decision center
system given... | [
{
"created": "Mon, 18 May 2020 11:47:47 GMT",
"version": "v1"
}
] | 2020-05-19 | [
[
"Salehkalaibar",
"Sadaf",
""
],
[
"Wigger",
"Michele",
""
]
] | The problem of distributed testing against independence with variable-length coding is considered when the \emph{average} and not the \emph{maximum} communication load is constrained as in previous works. The paper characterizes the optimum type-II error exponent of a single sensor single decision center system given a... |
2006.08900 | Ao Zhang | Ao Zhang and Jinwen Ma | DefenseVGAE: Defending against Adversarial Attacks on Graph Data via a
Variational Graph Autoencoder | 11 pages, 2 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph neural networks (GNNs) achieve remarkable performance for tasks on
graph data. However, recent works show they are extremely vulnerable to
adversarial structural perturbations, making their outcomes unreliable. In this
paper, we propose DefenseVGAE, a novel framework leveraging variational graph
autoencoders(VG... | [
{
"created": "Tue, 16 Jun 2020 03:30:23 GMT",
"version": "v1"
}
] | 2020-06-17 | [
[
"Zhang",
"Ao",
""
],
[
"Ma",
"Jinwen",
""
]
] | Graph neural networks (GNNs) achieve remarkable performance for tasks on graph data. However, recent works show they are extremely vulnerable to adversarial structural perturbations, making their outcomes unreliable. In this paper, we propose DefenseVGAE, a novel framework leveraging variational graph autoencoders(VGAE... |
2306.01863 | Yixin Xu | Yixin Xu, Yi Xiao, Zijian Zhao, Franz M\"uller, Alptekin Vardar, Xiao
Gong, Sumitha George, Thomas K\"ampfe, Vijaykrishnan Narayanan, Kai Ni | Embedding Security into Ferroelectric FET Array via In-Situ Memory
Operation | null | null | null | null | cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Non-volatile memories (NVMs) have the potential to reshape next-generation
memory systems because of their promising properties of near-zero leakage power
consumption, high density and non-volatility. However, NVMs also face critical
security threats that exploit the non-volatile property. Compared to volatile
memory... | [
{
"created": "Fri, 2 Jun 2023 18:35:29 GMT",
"version": "v1"
}
] | 2023-06-06 | [
[
"Xu",
"Yixin",
""
],
[
"Xiao",
"Yi",
""
],
[
"Zhao",
"Zijian",
""
],
[
"Müller",
"Franz",
""
],
[
"Vardar",
"Alptekin",
""
],
[
"Gong",
"Xiao",
""
],
[
"George",
"Sumitha",
""
],
[
"Kämpfe",
"Th... | Non-volatile memories (NVMs) have the potential to reshape next-generation memory systems because of their promising properties of near-zero leakage power consumption, high density and non-volatility. However, NVMs also face critical security threats that exploit the non-volatile property. Compared to volatile memory, ... |
2402.07588 | Tinashe Handina | Tinashe Handina and Eric Mazumdar | Understanding Model Selection For Learning In Strategic Environments | Reworded title, fixed typos and changed organization from previous
version | null | null | null | cs.GT cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | The deployment of ever-larger machine learning models reflects a growing
consensus that the more expressive the model class one optimizes
over$\unicode{x2013}$and the more data one has access to$\unicode{x2013}$the
more one can improve performance. As models get deployed in a variety of
real-world scenarios, they ine... | [
{
"created": "Mon, 12 Feb 2024 11:41:42 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Feb 2024 18:49:51 GMT",
"version": "v2"
},
{
"created": "Sat, 1 Jun 2024 23:16:05 GMT",
"version": "v3"
}
] | 2024-06-04 | [
[
"Handina",
"Tinashe",
""
],
[
"Mazumdar",
"Eric",
""
]
] | The deployment of ever-larger machine learning models reflects a growing consensus that the more expressive the model class one optimizes over$\unicode{x2013}$and the more data one has access to$\unicode{x2013}$the more one can improve performance. As models get deployed in a variety of real-world scenarios, they inevi... |
1908.07380 | Omar Rivasplata | Omar Rivasplata, Vikram M Tankasali, Csaba Szepesvari | PAC-Bayes with Backprop | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore the family of methods "PAC-Bayes with Backprop" (PBB) to train
probabilistic neural networks by minimizing PAC-Bayes bounds. We present two
training objectives, one derived from a previously known PAC-Bayes bound, and a
second one derived from a novel PAC-Bayes bound. Both training objectives are
evaluated... | [
{
"created": "Mon, 19 Aug 2019 13:27:08 GMT",
"version": "v1"
},
{
"created": "Wed, 21 Aug 2019 10:18:05 GMT",
"version": "v2"
},
{
"created": "Fri, 23 Aug 2019 08:16:40 GMT",
"version": "v3"
},
{
"created": "Mon, 30 Sep 2019 12:32:30 GMT",
"version": "v4"
},
{
"c... | 2019-10-07 | [
[
"Rivasplata",
"Omar",
""
],
[
"Tankasali",
"Vikram M",
""
],
[
"Szepesvari",
"Csaba",
""
]
] | We explore the family of methods "PAC-Bayes with Backprop" (PBB) to train probabilistic neural networks by minimizing PAC-Bayes bounds. We present two training objectives, one derived from a previously known PAC-Bayes bound, and a second one derived from a novel PAC-Bayes bound. Both training objectives are evaluated o... |
1807.00687 | Tom Kelly | Tom Kelly, Niloy J. Mitra | Simplifying Urban Data Fusion with BigSUR | Architecture_MPS under review | null | null | null | cs.GR | http://creativecommons.org/publicdomain/zero/1.0/ | Our ability to understand data has always lagged behind our ability to
collect it. This is particularly true in urban environments, where mass data
capture is particularly valuable, but the objects captured are more varied,
denser, and complex. To understand the structure and content of the
environment, we must proce... | [
{
"created": "Mon, 2 Jul 2018 14:14:57 GMT",
"version": "v1"
}
] | 2018-07-03 | [
[
"Kelly",
"Tom",
""
],
[
"Mitra",
"Niloy J.",
""
]
] | Our ability to understand data has always lagged behind our ability to collect it. This is particularly true in urban environments, where mass data capture is particularly valuable, but the objects captured are more varied, denser, and complex. To understand the structure and content of the environment, we must process... |
1405.3393 | Gregory Duck | Gregory J. Duck and Remy Haemmerle and Martin Sulzmann | On Termination, Confluence and Consistent CHR-based Type Inference | null | Theory and Practice of Logic Programming 14 (2014) 619-632 | 10.1017/S1471068414000246 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the application of Constraint Handling Rules (CHR) for the
specification of type inference systems, such as that used by Haskell.
Confluence of CHR guarantees that the answer provided by type inference is
correct and consistent. The standard method for establishing confluence relies
on an assumption that ... | [
{
"created": "Wed, 14 May 2014 07:51:39 GMT",
"version": "v1"
}
] | 2020-02-19 | [
[
"Duck",
"Gregory J.",
""
],
[
"Haemmerle",
"Remy",
""
],
[
"Sulzmann",
"Martin",
""
]
] | We consider the application of Constraint Handling Rules (CHR) for the specification of type inference systems, such as that used by Haskell. Confluence of CHR guarantees that the answer provided by type inference is correct and consistent. The standard method for establishing confluence relies on an assumption that th... |
2404.11052 | Mohammad Shiri | Mohammad Shiri, Monalika Padma Reddy, Jiangwen Sun | Supervised Contrastive Vision Transformer for Breast Histopathological
Image Classification | 8 pages, 7 figures | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Invasive ductal carcinoma (IDC) is the most prevalent form of breast cancer.
Breast tissue histopathological examination is critical in diagnosing and
classifying breast cancer. Although existing methods have shown promising
results, there is still room for improvement in the classification accuracy and
generalizatio... | [
{
"created": "Wed, 17 Apr 2024 03:51:55 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Apr 2024 01:59:27 GMT",
"version": "v2"
}
] | 2024-04-19 | [
[
"Shiri",
"Mohammad",
""
],
[
"Reddy",
"Monalika Padma",
""
],
[
"Sun",
"Jiangwen",
""
]
] | Invasive ductal carcinoma (IDC) is the most prevalent form of breast cancer. Breast tissue histopathological examination is critical in diagnosing and classifying breast cancer. Although existing methods have shown promising results, there is still room for improvement in the classification accuracy and generalization ... |
2303.02618 | Yanjie Song | Yanjie Song, P. N. Suganthan, Witold Pedrycz, Junwei Ou, Yongming He,
Yingwu Chen, Yutong Wu | Ensemble Reinforcement Learning: A Survey | 34 pages | null | null | null | cs.LG cs.AI cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement Learning (RL) has emerged as a highly effective technique for
addressing various scientific and applied problems. Despite its success,
certain complex tasks remain challenging to be addressed solely with a single
model and algorithm. In response, ensemble reinforcement learning (ERL), a
promising approa... | [
{
"created": "Sun, 5 Mar 2023 09:26:44 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Apr 2023 08:43:54 GMT",
"version": "v2"
},
{
"created": "Wed, 13 Dec 2023 13:27:25 GMT",
"version": "v3"
}
] | 2023-12-14 | [
[
"Song",
"Yanjie",
""
],
[
"Suganthan",
"P. N.",
""
],
[
"Pedrycz",
"Witold",
""
],
[
"Ou",
"Junwei",
""
],
[
"He",
"Yongming",
""
],
[
"Chen",
"Yingwu",
""
],
[
"Wu",
"Yutong",
""
]
] | Reinforcement Learning (RL) has emerged as a highly effective technique for addressing various scientific and applied problems. Despite its success, certain complex tasks remain challenging to be addressed solely with a single model and algorithm. In response, ensemble reinforcement learning (ERL), a promising approach... |
2109.10385 | Kishan Chandan | Kishan Chandan, Jack Albertson, Xiaohan Zhang, Xiaoyang Zhang, Yao
Liu, Shiqi Zhang | Learning to Guide Human Attention on Mobile Telepresence Robots with 360
Vision | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile telepresence robots (MTRs) allow people to navigate and interact with
a remote environment that is in a place other than the person's true location.
Thanks to the recent advances in 360 degree vision, many MTRs are now equipped
with an all-degree visual perception capability. However, people's visual field
hor... | [
{
"created": "Tue, 21 Sep 2021 18:15:05 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Feb 2022 16:49:26 GMT",
"version": "v2"
}
] | 2022-02-28 | [
[
"Chandan",
"Kishan",
""
],
[
"Albertson",
"Jack",
""
],
[
"Zhang",
"Xiaohan",
""
],
[
"Zhang",
"Xiaoyang",
""
],
[
"Liu",
"Yao",
""
],
[
"Zhang",
"Shiqi",
""
]
] | Mobile telepresence robots (MTRs) allow people to navigate and interact with a remote environment that is in a place other than the person's true location. Thanks to the recent advances in 360 degree vision, many MTRs are now equipped with an all-degree visual perception capability. However, people's visual field horiz... |
2311.11753 | Sai Amrit Patnaik | Sai Amrit Patnaik, Shivali Chansoriya, Anil K. Jain, Anoop M.
Namboodiri | AdvGen: Physical Adversarial Attack on Face Presentation Attack
Detection Systems | 10 pages, 9 figures, Accepted to the International Joint Conference
on Biometrics (IJCB 2023) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Evaluating the risk level of adversarial images is essential for safely
deploying face authentication models in the real world. Popular approaches for
physical-world attacks, such as print or replay attacks, suffer from some
limitations, like including physical and geometrical artifacts. Recently,
adversarial attacks... | [
{
"created": "Mon, 20 Nov 2023 13:28:42 GMT",
"version": "v1"
}
] | 2023-11-21 | [
[
"Patnaik",
"Sai Amrit",
""
],
[
"Chansoriya",
"Shivali",
""
],
[
"Jain",
"Anil K.",
""
],
[
"Namboodiri",
"Anoop M.",
""
]
] | Evaluating the risk level of adversarial images is essential for safely deploying face authentication models in the real world. Popular approaches for physical-world attacks, such as print or replay attacks, suffer from some limitations, like including physical and geometrical artifacts. Recently, adversarial attacks h... |
1802.10488 | Pierre Laroche | Gais Alhadi, Imed Kacem, Pierre Laroche, and Izzeldin M. Osman | An Approximate Pareto Set for Minimizing the Maximum Lateness and
Makespan on Parallel Machines | submitted to Sose 2018 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the two-parallel machines scheduling problem, with the aim of
minimizing the maximum lateness and the makespan. Formally, the problem is
defined as follows. We have to schedule a set J of n jobs on two identical
machines. Each job i in J has a processing time p_i and a delivery time q_i.
Each machine can ... | [
{
"created": "Wed, 28 Feb 2018 15:49:11 GMT",
"version": "v1"
}
] | 2018-03-01 | [
[
"Alhadi",
"Gais",
""
],
[
"Kacem",
"Imed",
""
],
[
"Laroche",
"Pierre",
""
],
[
"Osman",
"Izzeldin M.",
""
]
] | We consider the two-parallel machines scheduling problem, with the aim of minimizing the maximum lateness and the makespan. Formally, the problem is defined as follows. We have to schedule a set J of n jobs on two identical machines. Each job i in J has a processing time p_i and a delivery time q_i. Each machine can on... |
2106.15821 | Eduardo G. Altmann | Charles C. Hyland, Yuanming Tao, Lamiae Azizi, Martin Gerlach, Tiago
P. Peixoto, and Eduardo G. Altmann | Multilayer Networks for Text Analysis with Multiple Data Types | 17 pages, 6 figures | EPJ Data Science volume 10, Article number: 33 (2021) | 10.1140/epjds/s13688-021-00288-5 | null | cs.SI physics.soc-ph stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We are interested in the widespread problem of clustering documents and
finding topics in large collections of written documents in the presence of
metadata and hyperlinks. To tackle the challenge of accounting for these
different types of datasets, we propose a novel framework based on Multilayer
Networks and Stocha... | [
{
"created": "Wed, 30 Jun 2021 05:47:39 GMT",
"version": "v1"
}
] | 2021-07-01 | [
[
"Hyland",
"Charles C.",
""
],
[
"Tao",
"Yuanming",
""
],
[
"Azizi",
"Lamiae",
""
],
[
"Gerlach",
"Martin",
""
],
[
"Peixoto",
"Tiago P.",
""
],
[
"Altmann",
"Eduardo G.",
""
]
] | We are interested in the widespread problem of clustering documents and finding topics in large collections of written documents in the presence of metadata and hyperlinks. To tackle the challenge of accounting for these different types of datasets, we propose a novel framework based on Multilayer Networks and Stochast... |
1804.09196 | Stephen Hagen | Edward D. Ramirez and Stephen J. Hagen | The quantitative measure and statistical distribution of fame | 17 pages, 6 figures | null | 10.1371/journal.pone.0200196 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fame and celebrity play an ever-increasing role in our culture. However,
despite the cultural and economic importance of fame and its gradations, there
exists no consensus method for quantifying the fame of an individual, or of
comparing that of two individuals. We argue that, even if fame is difficult to
measure wit... | [
{
"created": "Tue, 24 Apr 2018 18:18:23 GMT",
"version": "v1"
}
] | 2018-09-05 | [
[
"Ramirez",
"Edward D.",
""
],
[
"Hagen",
"Stephen J.",
""
]
] | Fame and celebrity play an ever-increasing role in our culture. However, despite the cultural and economic importance of fame and its gradations, there exists no consensus method for quantifying the fame of an individual, or of comparing that of two individuals. We argue that, even if fame is difficult to measure with ... |
2103.05062 | Fr\'ed\'eric Lemoine PhD | Fr\'ed\'eric Lemoine (1), Tatiana Aubonnet (1 and 2) and No\"emie
Simoni (2) ((1) Conservatoire National des Arts et M\'etiers (CNAM), CEDRIC,
Paris, France., (2) T\'el\'ecom-Paris, Palaiseau, France.) | Self-Assemble-Featured Internet of Things | 21 pages, 16 figures | Future Generation Computer Systems 112 (2020) 41-57 | 10.1016/j.future.2020.05.012 | null | cs.SE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The Internet of Things supports various industrial applications. The
cooperation and coordination of smart things are a promising strategy for
satisfying requirements that are beyond the capacity of a single smart thing.
One of the major challenges for today's software engineering is the management
of large and compl... | [
{
"created": "Mon, 8 Mar 2021 20:37:45 GMT",
"version": "v1"
}
] | 2021-03-10 | [
[
"Lemoine",
"Frédéric",
"",
"1 and 2"
],
[
"Aubonnet",
"Tatiana",
"",
"1 and 2"
],
[
"Simoni",
"Noëmie",
""
]
] | The Internet of Things supports various industrial applications. The cooperation and coordination of smart things are a promising strategy for satisfying requirements that are beyond the capacity of a single smart thing. One of the major challenges for today's software engineering is the management of large and complex... |
2007.00266 | Ben Bogin | Ben Bogin, Sanjay Subramanian, Matt Gardner, Jonathan Berant | Latent Compositional Representations Improve Systematic Generalization
in Grounded Question Answering | Accepted for publication in Transactions of the Association for
Computational Linguistics (TACL), 2020. Author's final version | null | null | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Answering questions that involve multi-step reasoning requires decomposing
them and using the answers of intermediate steps to reach the final answer.
However, state-of-the-art models in grounded question answering often do not
explicitly perform decomposition, leading to difficulties in generalization to
out-of-dist... | [
{
"created": "Wed, 1 Jul 2020 06:22:51 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Nov 2020 14:35:21 GMT",
"version": "v2"
},
{
"created": "Tue, 10 Nov 2020 06:22:21 GMT",
"version": "v3"
}
] | 2020-11-11 | [
[
"Bogin",
"Ben",
""
],
[
"Subramanian",
"Sanjay",
""
],
[
"Gardner",
"Matt",
""
],
[
"Berant",
"Jonathan",
""
]
] | Answering questions that involve multi-step reasoning requires decomposing them and using the answers of intermediate steps to reach the final answer. However, state-of-the-art models in grounded question answering often do not explicitly perform decomposition, leading to difficulties in generalization to out-of-distri... |
2312.15742 | Xiang Li | Li Xiang and Junbo Yin and Wei Li and Cheng-Zhong Xu and Ruigang Yang
and Jianbing Shen | DI-V2X: Learning Domain-Invariant Representation for
Vehicle-Infrastructure Collaborative 3D Object Detection | aaai2024 | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vehicle-to-Everything (V2X) collaborative perception has recently gained
significant attention due to its capability to enhance scene understanding by
integrating information from various agents, e.g., vehicles, and
infrastructure. However, current works often treat the information from each
agent equally, ignoring t... | [
{
"created": "Mon, 25 Dec 2023 14:40:46 GMT",
"version": "v1"
}
] | 2023-12-27 | [
[
"Xiang",
"Li",
""
],
[
"Yin",
"Junbo",
""
],
[
"Li",
"Wei",
""
],
[
"Xu",
"Cheng-Zhong",
""
],
[
"Yang",
"Ruigang",
""
],
[
"Shen",
"Jianbing",
""
]
] | Vehicle-to-Everything (V2X) collaborative perception has recently gained significant attention due to its capability to enhance scene understanding by integrating information from various agents, e.g., vehicles, and infrastructure. However, current works often treat the information from each agent equally, ignoring the... |
2110.15548 | Tatpong Katanyukul | Pisit Nakjai and Jiradej Ponsawat and Tatpong Katanyukul | Latent Cognizance: What Machine Really Learns | 6 pages | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite overwhelming achievements in recognition accuracy, extending an
open-set capability -- ability to identify when the question is out of scope --
remains greatly challenging in a scalable machine learning inference. A recent
research has discovered Latent Cognizance (LC) -- an insight on a recognition
mechanism... | [
{
"created": "Fri, 29 Oct 2021 05:26:38 GMT",
"version": "v1"
}
] | 2021-11-01 | [
[
"Nakjai",
"Pisit",
""
],
[
"Ponsawat",
"Jiradej",
""
],
[
"Katanyukul",
"Tatpong",
""
]
] | Despite overwhelming achievements in recognition accuracy, extending an open-set capability -- ability to identify when the question is out of scope -- remains greatly challenging in a scalable machine learning inference. A recent research has discovered Latent Cognizance (LC) -- an insight on a recognition mechanism b... |
2401.00788 | Terry Yue Zhuo | Terry Yue Zhuo, Armel Zebaze, Nitchakarn Suppattarachai, Leandro von
Werra, Harm de Vries, Qian Liu, Niklas Muennighoff | Astraios: Parameter-Efficient Instruction Tuning Code Large Language
Models | 25 pages (12 main), 19 figures, 8 tables | null | null | null | cs.CL cs.AI cs.SE | http://creativecommons.org/licenses/by/4.0/ | The high cost of full-parameter fine-tuning (FFT) of Large Language Models
(LLMs) has led to a series of parameter-efficient fine-tuning (PEFT) methods.
However, it remains unclear which methods provide the best cost-performance
trade-off at different model scales. We introduce Astraios, a suite of 28
instruction-tun... | [
{
"created": "Mon, 1 Jan 2024 15:30:19 GMT",
"version": "v1"
}
] | 2024-01-02 | [
[
"Zhuo",
"Terry Yue",
""
],
[
"Zebaze",
"Armel",
""
],
[
"Suppattarachai",
"Nitchakarn",
""
],
[
"von Werra",
"Leandro",
""
],
[
"de Vries",
"Harm",
""
],
[
"Liu",
"Qian",
""
],
[
"Muennighoff",
"Niklas",
""... | The high cost of full-parameter fine-tuning (FFT) of Large Language Models (LLMs) has led to a series of parameter-efficient fine-tuning (PEFT) methods. However, it remains unclear which methods provide the best cost-performance trade-off at different model scales. We introduce Astraios, a suite of 28 instruction-tuned... |
1609.04051 | Nika Haghtalab | Avrim Blum, Ioannis Caragiannis, Nika Haghtalab, Ariel D. Procaccia,
Eviatar B. Procaccia, Rohit Vaish | Opting Into Optimal Matchings | null | null | null | null | cs.DS math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We revisit the problem of designing optimal, individually rational matching
mechanisms (in a general sense, allowing for cycles in directed graphs), where
each player --- who is associated with a subset of vertices --- matches as many
of his own vertices when he opts into the matching mechanism as when he opts
out. W... | [
{
"created": "Tue, 13 Sep 2016 21:04:31 GMT",
"version": "v1"
}
] | 2016-09-15 | [
[
"Blum",
"Avrim",
""
],
[
"Caragiannis",
"Ioannis",
""
],
[
"Haghtalab",
"Nika",
""
],
[
"Procaccia",
"Ariel D.",
""
],
[
"Procaccia",
"Eviatar B.",
""
],
[
"Vaish",
"Rohit",
""
]
] | We revisit the problem of designing optimal, individually rational matching mechanisms (in a general sense, allowing for cycles in directed graphs), where each player --- who is associated with a subset of vertices --- matches as many of his own vertices when he opts into the matching mechanism as when he opts out. We ... |
2007.13250 | Yichen Zhang | Yichen Zhang and Jianzhe Liu and Feng Qiu and Tianqi Hong and Rui Yao | Deep Active Learning for Solvability Prediction in Power Systems | null | null | null | null | cs.LG cs.SY eess.SY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditional methods for solvability region analysis can only have inner
approximations with inconclusive conservatism. Machine learning methods have
been proposed to approach the real region. In this letter, we propose a deep
active learning framework for power system solvability prediction. Compared
with the passive... | [
{
"created": "Mon, 27 Jul 2020 00:13:09 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Dec 2020 07:30:08 GMT",
"version": "v2"
}
] | 2020-12-23 | [
[
"Zhang",
"Yichen",
""
],
[
"Liu",
"Jianzhe",
""
],
[
"Qiu",
"Feng",
""
],
[
"Hong",
"Tianqi",
""
],
[
"Yao",
"Rui",
""
]
] | Traditional methods for solvability region analysis can only have inner approximations with inconclusive conservatism. Machine learning methods have been proposed to approach the real region. In this letter, we propose a deep active learning framework for power system solvability prediction. Compared with the passive l... |
2003.13667 | Karim Banawan | Sajani Vithana and Karim Banawan and Sennur Ulukus | Semantic Private Information Retrieval | submitted for publication | null | null | null | cs.IT cs.CR eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the problem of semantic private information retrieval
(semantic PIR). In semantic PIR, a user retrieves a message out of $K$
independent messages stored in $N$ replicated and non-colluding databases
without revealing the identity of the desired message to any individual
database. The messages come with... | [
{
"created": "Mon, 30 Mar 2020 17:51:57 GMT",
"version": "v1"
}
] | 2020-03-31 | [
[
"Vithana",
"Sajani",
""
],
[
"Banawan",
"Karim",
""
],
[
"Ulukus",
"Sennur",
""
]
] | We investigate the problem of semantic private information retrieval (semantic PIR). In semantic PIR, a user retrieves a message out of $K$ independent messages stored in $N$ replicated and non-colluding databases without revealing the identity of the desired message to any individual database. The messages come with \... |
2403.13841 | Zhongqi Yang | Zhongqi Yang, Yuning Wang, Ken S. Yamashita, Maryam Sabah, Elahe
Khatibi, Iman Azimi, Nikil Dutt, Jessica L. Borelli, and Amir M. Rahmani | Integrating Wearable Sensor Data and Self-reported Diaries for
Personalized Affect Forecasting | Accepted by Connected Health: Applications, Systems and Engineering
Technologies (CHASE) 2024 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Emotional states, as indicators of affect, are pivotal to overall health,
making their accurate prediction before onset crucial. Current studies are
primarily centered on immediate short-term affect detection using data from
wearable and mobile devices. These studies typically focus on objective sensory
measures, oft... | [
{
"created": "Sat, 16 Mar 2024 17:24:38 GMT",
"version": "v1"
},
{
"created": "Sat, 23 Mar 2024 18:27:49 GMT",
"version": "v2"
}
] | 2024-03-26 | [
[
"Yang",
"Zhongqi",
""
],
[
"Wang",
"Yuning",
""
],
[
"Yamashita",
"Ken S.",
""
],
[
"Sabah",
"Maryam",
""
],
[
"Khatibi",
"Elahe",
""
],
[
"Azimi",
"Iman",
""
],
[
"Dutt",
"Nikil",
""
],
[
"Borelli"... | Emotional states, as indicators of affect, are pivotal to overall health, making their accurate prediction before onset crucial. Current studies are primarily centered on immediate short-term affect detection using data from wearable and mobile devices. These studies typically focus on objective sensory measures, often... |
2101.08024 | Zhonghao Zhang | Zhonghao Zhang and Yipeng Liu and Xingyu Cao and Fei Wen and Ce Zhu | Scalable Deep Compressive Sensing | null | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning has been used to image compressive sensing (CS) for enhanced
reconstruction performance. However, most existing deep learning methods train
different models for different subsampling ratios, which brings additional
hardware burden. In this paper, we develop a general framework named scalable
deep compre... | [
{
"created": "Wed, 20 Jan 2021 08:42:50 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Jan 2021 02:53:03 GMT",
"version": "v2"
}
] | 2021-01-25 | [
[
"Zhang",
"Zhonghao",
""
],
[
"Liu",
"Yipeng",
""
],
[
"Cao",
"Xingyu",
""
],
[
"Wen",
"Fei",
""
],
[
"Zhu",
"Ce",
""
]
] | Deep learning has been used to image compressive sensing (CS) for enhanced reconstruction performance. However, most existing deep learning methods train different models for different subsampling ratios, which brings additional hardware burden. In this paper, we develop a general framework named scalable deep compress... |
2012.06881 | Muhammad Fayaz | Muhammad Fayaz, Wenqiang Yi, Yuanwei Liu, and Arumugam Nallanathan | Transmit Power Pool Design for Grant-Free NOMA-IoT Networks via Deep
Reinforcement Learning | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Grant-free non-orthogonal multiple access (GF-NOMA) is a potential multiple
access framework for short-packet internet-of-things (IoT) networks to enhance
connectivity. However, the resource allocation problem in GF-NOMA is
challenging due to the absence of closed-loop power control. We design a
prototype of transmit... | [
{
"created": "Sat, 12 Dec 2020 18:26:55 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Jun 2021 10:05:13 GMT",
"version": "v2"
}
] | 2021-06-04 | [
[
"Fayaz",
"Muhammad",
""
],
[
"Yi",
"Wenqiang",
""
],
[
"Liu",
"Yuanwei",
""
],
[
"Nallanathan",
"Arumugam",
""
]
] | Grant-free non-orthogonal multiple access (GF-NOMA) is a potential multiple access framework for short-packet internet-of-things (IoT) networks to enhance connectivity. However, the resource allocation problem in GF-NOMA is challenging due to the absence of closed-loop power control. We design a prototype of transmit p... |
1801.07145 | Eric Alcaide | Eric Alcaide | E-swish: Adjusting Activations to Different Network Depths | null | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Activation functions have a notorious impact on neural networks on both
training and testing the models against the desired problem. Currently, the
most used activation function is the Rectified Linear Unit (ReLU). This paper
introduces a new and novel activation function, closely related with the new
activation $Swi... | [
{
"created": "Mon, 22 Jan 2018 15:40:29 GMT",
"version": "v1"
}
] | 2018-01-23 | [
[
"Alcaide",
"Eric",
""
]
] | Activation functions have a notorious impact on neural networks on both training and testing the models against the desired problem. Currently, the most used activation function is the Rectified Linear Unit (ReLU). This paper introduces a new and novel activation function, closely related with the new activation $Swish... |
1908.03106 | Jesse Hoey | Jesse Hoey and Neil J. MacKinnon | "Conservatives Overfit, Liberals Underfit": The Social-Psychological
Control of Affect and Uncertainty | This is an extended version of the paper presented at SE-THEMOS
workshop at ACII 2019 in Cambridge England. Version 2 and 3 of this article
added sections on reinforcement learning(2.6 and 5.6), and a section on
neuroscience and the relation between cognition and affect (2.4) | null | null | null | cs.AI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The presence of artificial agents in human social networks is growing. From
chatbots to robots, human experience in the developed world is moving towards a
socio-technical system in which agents can be technological or biological, with
increasingly blurred distinctions between. Given that emotion is a key element
of ... | [
{
"created": "Thu, 8 Aug 2019 15:04:52 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Aug 2019 01:19:23 GMT",
"version": "v2"
},
{
"created": "Sun, 1 Sep 2019 11:21:51 GMT",
"version": "v3"
}
] | 2019-09-04 | [
[
"Hoey",
"Jesse",
""
],
[
"MacKinnon",
"Neil J.",
""
]
] | The presence of artificial agents in human social networks is growing. From chatbots to robots, human experience in the developed world is moving towards a socio-technical system in which agents can be technological or biological, with increasingly blurred distinctions between. Given that emotion is a key element of hu... |
1211.2065 | Lingyang Song | Chen Xu, Lingyang Song, Zhu Han, Qun Zhao, Xiaoli Wang, Xiang Cheng,
and Bingli Jiao | Efficiency Resource Allocation for Device-to-Device Underlay
Communication Systems: A Reverse Iterative Combinatorial Auction Based
Approach | 26 pages, 6 fgures; IEEE Journals on Selected Areas in
Communications, 2012 | null | 10.1109/JSAC.2013.SUP.0513031 | null | cs.GT cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Peer-to-peer communication has been recently considered as a popular issue
for local area services. An innovative resource allocation scheme is proposed
to improve the performance of mobile peer-to-peer, i.e., device-to-device
(D2D), communications as an underlay in the downlink (DL) cellular networks. To
optimize th... | [
{
"created": "Fri, 9 Nov 2012 07:59:50 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Xu",
"Chen",
""
],
[
"Song",
"Lingyang",
""
],
[
"Han",
"Zhu",
""
],
[
"Zhao",
"Qun",
""
],
[
"Wang",
"Xiaoli",
""
],
[
"Cheng",
"Xiang",
""
],
[
"Jiao",
"Bingli",
""
]
] | Peer-to-peer communication has been recently considered as a popular issue for local area services. An innovative resource allocation scheme is proposed to improve the performance of mobile peer-to-peer, i.e., device-to-device (D2D), communications as an underlay in the downlink (DL) cellular networks. To optimize the ... |
2201.08354 | Wolfgang Fuhl | Wolfgang Fuhl | HPCGen: Hierarchical K-Means Clustering and Level Based Principal
Components for Scan Path Genaration | null | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a new approach for decomposing scan paths and its
utility for generating new scan paths. For this purpose, we use the K-Means
clustering procedure to the raw gaze data and subsequently iteratively to find
more clusters in the found clusters. The found clusters are grouped for each
level in t... | [
{
"created": "Wed, 19 Jan 2022 16:22:57 GMT",
"version": "v1"
}
] | 2022-01-21 | [
[
"Fuhl",
"Wolfgang",
""
]
] | In this paper, we present a new approach for decomposing scan paths and its utility for generating new scan paths. For this purpose, we use the K-Means clustering procedure to the raw gaze data and subsequently iteratively to find more clusters in the found clusters. The found clusters are grouped for each level in the... |
2102.00382 | Ruchit Agrawal | Ruchit Agrawal, Daniel Wolff, Simon Dixon | Structure-Aware Audio-to-Score Alignment using Progressively Dilated
Convolutional Neural Networks | ICASSP 2021 camera-ready version. Copyrights belong to IEEE | null | null | null | cs.SD cs.LG eess.AS | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The identification of structural differences between a music performance and
the score is a challenging yet integral step of audio-to-score alignment, an
important subtask of music information retrieval. We present a novel method to
detect such differences between the score and performance for a given piece of
music ... | [
{
"created": "Sun, 31 Jan 2021 05:14:58 GMT",
"version": "v1"
},
{
"created": "Sun, 14 Feb 2021 04:52:40 GMT",
"version": "v2"
}
] | 2021-02-16 | [
[
"Agrawal",
"Ruchit",
""
],
[
"Wolff",
"Daniel",
""
],
[
"Dixon",
"Simon",
""
]
] | The identification of structural differences between a music performance and the score is a challenging yet integral step of audio-to-score alignment, an important subtask of music information retrieval. We present a novel method to detect such differences between the score and performance for a given piece of music us... |
1310.2748 | Ramin Khalili | Juhoon Kim, Ramin Khalili, Anja Feldmann, Yung-Chih Chen, Don Towsley | Multi-Source Multi-Path HTTP (mHTTP): A Proposal | 12 pages | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Today, most devices have multiple network interfaces. Coupled with
wide-spread replication of popular content at multiple locations, this provides
substantial path diversity in the Internet. We propose Multi-source Multipath
HTTP, mHTTP, which takes advantage of all existing types of path diversity in
the Internet. m... | [
{
"created": "Thu, 10 Oct 2013 09:57:34 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Dec 2013 18:48:51 GMT",
"version": "v2"
},
{
"created": "Tue, 10 Dec 2013 09:52:27 GMT",
"version": "v3"
}
] | 2013-12-11 | [
[
"Kim",
"Juhoon",
""
],
[
"Khalili",
"Ramin",
""
],
[
"Feldmann",
"Anja",
""
],
[
"Chen",
"Yung-Chih",
""
],
[
"Towsley",
"Don",
""
]
] | Today, most devices have multiple network interfaces. Coupled with wide-spread replication of popular content at multiple locations, this provides substantial path diversity in the Internet. We propose Multi-source Multipath HTTP, mHTTP, which takes advantage of all existing types of path diversity in the Internet. mHT... |
1606.08948 | Vishal Sharma | Vishal Chandra Sharma, Ganesh Gopalakrishnan, Sriram Krishnamoorthy | PRESAGE: Protecting Structured Address Generation against Soft Errors | null | null | null | null | cs.SE cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern computer scaling trends in pursuit of larger component counts and
power efficiency have, unfortunately, lead to less reliable hardware and
consequently soft errors escaping into application data ("silent data
corruptions"). Techniques to enhance system resilience hinge on the
availability of efficient error de... | [
{
"created": "Wed, 29 Jun 2016 04:06:41 GMT",
"version": "v1"
}
] | 2016-07-05 | [
[
"Sharma",
"Vishal Chandra",
""
],
[
"Gopalakrishnan",
"Ganesh",
""
],
[
"Krishnamoorthy",
"Sriram",
""
]
] | Modern computer scaling trends in pursuit of larger component counts and power efficiency have, unfortunately, lead to less reliable hardware and consequently soft errors escaping into application data ("silent data corruptions"). Techniques to enhance system resilience hinge on the availability of efficient error dete... |
2105.07741 | Michael Murray | Michael Murray, Vinayak Abrol, Jared Tanner | Activation function design for deep networks: linearity and effective
initialisation | 33 pages, 10 figures, paper code and scripts are hosted at
https://github.com/Cross-Caps/AFLI | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | The activation function deployed in a deep neural network has great influence
on the performance of the network at initialisation, which in turn has
implications for training. In this paper we study how to avoid two problems at
initialisation identified in prior works: rapid convergence of pairwise input
correlations... | [
{
"created": "Mon, 17 May 2021 11:30:46 GMT",
"version": "v1"
}
] | 2021-05-18 | [
[
"Murray",
"Michael",
""
],
[
"Abrol",
"Vinayak",
""
],
[
"Tanner",
"Jared",
""
]
] | The activation function deployed in a deep neural network has great influence on the performance of the network at initialisation, which in turn has implications for training. In this paper we study how to avoid two problems at initialisation identified in prior works: rapid convergence of pairwise input correlations, ... |
1908.02571 | Afshin Sadeghi | Afshin Sadeghi and Jens Lehmann | Linking Physicians to Medical Research Results via Knowledge Graph
Embeddings and Twitter | AI for Good, Data Science for Social Good, Machine learning for
Social Good, Twitter Data, Knowledge Graph Embeddings, Medical Research | ECML SOGOOD 2019 | null | null | cs.SI cs.AI cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Informing professionals about the latest research results in their field is a
particularly important task in the field of health care, since any development
in this field directly improves the health status of the patients. Meanwhile,
social media is an infrastructure that allows public instant sharing of
information... | [
{
"created": "Wed, 24 Jul 2019 10:15:40 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Dec 2019 14:37:36 GMT",
"version": "v2"
},
{
"created": "Fri, 21 Feb 2020 14:25:56 GMT",
"version": "v3"
}
] | 2020-02-24 | [
[
"Sadeghi",
"Afshin",
""
],
[
"Lehmann",
"Jens",
""
]
] | Informing professionals about the latest research results in their field is a particularly important task in the field of health care, since any development in this field directly improves the health status of the patients. Meanwhile, social media is an infrastructure that allows public instant sharing of information, ... |
2008.12647 | Yiren Lu | Yiren Lu, Jonathan Tompson | ADAIL: Adaptive Adversarial Imitation Learning | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the ADaptive Adversarial Imitation Learning (ADAIL) algorithm for
learning adaptive policies that can be transferred between environments of
varying dynamics, by imitating a small number of demonstrations collected from
a single source domain. This is an important problem in robotic learning
because in rea... | [
{
"created": "Sun, 23 Aug 2020 06:11:00 GMT",
"version": "v1"
}
] | 2020-08-31 | [
[
"Lu",
"Yiren",
""
],
[
"Tompson",
"Jonathan",
""
]
] | We present the ADaptive Adversarial Imitation Learning (ADAIL) algorithm for learning adaptive policies that can be transferred between environments of varying dynamics, by imitating a small number of demonstrations collected from a single source domain. This is an important problem in robotic learning because in real ... |
2204.00488 | Bruno Jos\'e Olivieri de Souza | Breno Perricone, Thiago Lamenza, Marcelo Paulon, Bruno Jose Olivieri
de Souza, Markus Endler | GrADyS-GS -- A ground station for managing field experiments with
Autonomous Vehicles and Wireless Sensor Networks | null | null | null | null | cs.RO cs.DC | http://creativecommons.org/licenses/by/4.0/ | In many kinds of research, collecting data is tailored to individual
research. It is usual to use dedicated and not reusable software to collect
data. GrADyS Ground Station framework (GrADyS-GS) aims to collect data in a
reusable manner with dynamic background tools. This technical report describes
GrADyS-GS, a groun... | [
{
"created": "Fri, 1 Apr 2022 14:48:02 GMT",
"version": "v1"
}
] | 2022-04-04 | [
[
"Perricone",
"Breno",
""
],
[
"Lamenza",
"Thiago",
""
],
[
"Paulon",
"Marcelo",
""
],
[
"de Souza",
"Bruno Jose Olivieri",
""
],
[
"Endler",
"Markus",
""
]
] | In many kinds of research, collecting data is tailored to individual research. It is usual to use dedicated and not reusable software to collect data. GrADyS Ground Station framework (GrADyS-GS) aims to collect data in a reusable manner with dynamic background tools. This technical report describes GrADyS-GS, a ground ... |
2005.12840 | Michelangelo Misuraca | Michelangelo Misuraca, Alessia Forciniti, Germana Scepi, Maria Spano | Sentiment Analysis for Education with R: packages, methods and practical
applications | null | null | null | null | cs.IR stat.AP stat.CO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Sentiment Analysis (SA) refers to a family of techniques at the crossroads of
statistics, natural language processing, and computational linguistics. The
primary goal is to detect the semantic orientation of individual opinions and
comments expressed in written texts. There are several practical applications
of SA in... | [
{
"created": "Fri, 8 May 2020 14:10:43 GMT",
"version": "v1"
}
] | 2020-05-27 | [
[
"Misuraca",
"Michelangelo",
""
],
[
"Forciniti",
"Alessia",
""
],
[
"Scepi",
"Germana",
""
],
[
"Spano",
"Maria",
""
]
] | Sentiment Analysis (SA) refers to a family of techniques at the crossroads of statistics, natural language processing, and computational linguistics. The primary goal is to detect the semantic orientation of individual opinions and comments expressed in written texts. There are several practical applications of SA in s... |
2305.16635 | Jaehun Jung | Jaehun Jung, Peter West, Liwei Jiang, Faeze Brahman, Ximing Lu,
Jillian Fisher, Taylor Sorensen, Yejin Choi | Impossible Distillation: from Low-Quality Model to High-Quality Dataset
& Model for Summarization and Paraphrasing | NAACL 2024 | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We present Impossible Distillation, a novel framework for paraphrasing and
sentence summarization, that distills a high-quality dataset and model from a
low-quality teacher that itself cannot perform these tasks. Unlike prior works
that rely on an extreme-scale teacher model (e.g., GPT3) or task-specific
architecture... | [
{
"created": "Fri, 26 May 2023 05:19:24 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Mar 2024 16:14:04 GMT",
"version": "v2"
},
{
"created": "Fri, 5 Apr 2024 20:10:51 GMT",
"version": "v3"
}
] | 2024-04-09 | [
[
"Jung",
"Jaehun",
""
],
[
"West",
"Peter",
""
],
[
"Jiang",
"Liwei",
""
],
[
"Brahman",
"Faeze",
""
],
[
"Lu",
"Ximing",
""
],
[
"Fisher",
"Jillian",
""
],
[
"Sorensen",
"Taylor",
""
],
[
"Choi",
... | We present Impossible Distillation, a novel framework for paraphrasing and sentence summarization, that distills a high-quality dataset and model from a low-quality teacher that itself cannot perform these tasks. Unlike prior works that rely on an extreme-scale teacher model (e.g., GPT3) or task-specific architecture, ... |
2310.03225 | Akifumi Wachi | Akifumi Wachi, Wataru Hashimoto, Xun Shen, Kazumune Hashimoto | Safe Exploration in Reinforcement Learning: A Generalized Formulation
and Algorithms | Accepted to NeurIPS 2023 | null | null | null | cs.LG cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Safe exploration is essential for the practical use of reinforcement learning
(RL) in many real-world scenarios. In this paper, we present a generalized safe
exploration (GSE) problem as a unified formulation of common safe exploration
problems. We then propose a solution of the GSE problem in the form of a
meta-algo... | [
{
"created": "Thu, 5 Oct 2023 00:47:09 GMT",
"version": "v1"
}
] | 2023-10-06 | [
[
"Wachi",
"Akifumi",
""
],
[
"Hashimoto",
"Wataru",
""
],
[
"Shen",
"Xun",
""
],
[
"Hashimoto",
"Kazumune",
""
]
] | Safe exploration is essential for the practical use of reinforcement learning (RL) in many real-world scenarios. In this paper, we present a generalized safe exploration (GSE) problem as a unified formulation of common safe exploration problems. We then propose a solution of the GSE problem in the form of a meta-algori... |
1510.02574 | Jun Lin | Jun Lin, Chenrong Xiong and Zhiyuan Yan | A High Throughput List Decoder Architecture for Polar Codes | submitted to IEEE TVLSI | null | 10.1109/TVLSI.2015.2499777 | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While long polar codes can achieve the capacity of arbitrary binary-input
discrete memoryless channels when decoded by a low complexity successive
cancelation (SC) algorithm, the error performance of the SC algorithm is
inferior for polar codes with finite block lengths. The cyclic redundancy check
(CRC) aided succes... | [
{
"created": "Fri, 9 Oct 2015 06:11:34 GMT",
"version": "v1"
}
] | 2016-11-17 | [
[
"Lin",
"Jun",
""
],
[
"Xiong",
"Chenrong",
""
],
[
"Yan",
"Zhiyuan",
""
]
] | While long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels when decoded by a low complexity successive cancelation (SC) algorithm, the error performance of the SC algorithm is inferior for polar codes with finite block lengths. The cyclic redundancy check (CRC) aided successi... |
2403.02437 | Hyejun Jeong | Hyejun Jeong, Shiqing Ma, Amir Houmansadr | SoK: Challenges and Opportunities in Federated Unlearning | null | null | null | null | cs.LG cs.AI cs.DC | http://creativecommons.org/licenses/by/4.0/ | Federated learning (FL), introduced in 2017, facilitates collaborative
learning between non-trusting parties with no need for the parties to
explicitly share their data among themselves. This allows training models on
user data while respecting privacy regulations such as GDPR and CPRA. However,
emerging privacy requ... | [
{
"created": "Mon, 4 Mar 2024 19:35:08 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Jun 2024 19:00:03 GMT",
"version": "v2"
}
] | 2024-06-07 | [
[
"Jeong",
"Hyejun",
""
],
[
"Ma",
"Shiqing",
""
],
[
"Houmansadr",
"Amir",
""
]
] | Federated learning (FL), introduced in 2017, facilitates collaborative learning between non-trusting parties with no need for the parties to explicitly share their data among themselves. This allows training models on user data while respecting privacy regulations such as GDPR and CPRA. However, emerging privacy requir... |
2206.09391 | Jiaming Zhang | Jiaming Zhang, Qi Yi, Jitao Sang | Towards Adversarial Attack on Vision-Language Pre-training Models | Accepted by ACM MM2022. Code is available in GitHub | null | null | null | cs.LG cs.CL cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While vision-language pre-training model (VLP) has shown revolutionary
improvements on various vision-language (V+L) tasks, the studies regarding its
adversarial robustness remain largely unexplored. This paper studied the
adversarial attack on popular VLP models and V+L tasks. First, we analyzed the
performance of a... | [
{
"created": "Sun, 19 Jun 2022 12:55:45 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Oct 2022 02:32:02 GMT",
"version": "v2"
}
] | 2022-10-21 | [
[
"Zhang",
"Jiaming",
""
],
[
"Yi",
"Qi",
""
],
[
"Sang",
"Jitao",
""
]
] | While vision-language pre-training model (VLP) has shown revolutionary improvements on various vision-language (V+L) tasks, the studies regarding its adversarial robustness remain largely unexplored. This paper studied the adversarial attack on popular VLP models and V+L tasks. First, we analyzed the performance of adv... |
2107.00842 | Yingying Zhu | Hongji Yang, Xiufan Lu and Yingying Zhu | Cross-view Geo-localization with Evolving Transformer | Under Review | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In this work, we address the problem of cross-view geo-localization, which
estimates the geospatial location of a street view image by matching it with a
database of geo-tagged aerial images. The cross-view matching task is extremely
challenging due to drastic appearance and geometry differences across views.
Unlike ... | [
{
"created": "Fri, 2 Jul 2021 05:33:14 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Jul 2021 02:23:48 GMT",
"version": "v2"
}
] | 2021-07-06 | [
[
"Yang",
"Hongji",
""
],
[
"Lu",
"Xiufan",
""
],
[
"Zhu",
"Yingying",
""
]
] | In this work, we address the problem of cross-view geo-localization, which estimates the geospatial location of a street view image by matching it with a database of geo-tagged aerial images. The cross-view matching task is extremely challenging due to drastic appearance and geometry differences across views. Unlike ex... |
1801.00280 | Ganhua Wu | Ganhua Wu | Efficient priority queueing routing strategy on mobile networks | null | null | 10.1142/S0217984918501373 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile networks are intriguing in recent years due to their practical
implications. Previous routing strategies for improving transport efficiency
have little attention what order should the packets be forwarded, just simply
used first-in-first-out queue discipline. Here we apply priority queueing
discipline to short... | [
{
"created": "Sun, 31 Dec 2017 13:15:35 GMT",
"version": "v1"
}
] | 2018-04-18 | [
[
"Wu",
"Ganhua",
""
]
] | Mobile networks are intriguing in recent years due to their practical implications. Previous routing strategies for improving transport efficiency have little attention what order should the packets be forwarded, just simply used first-in-first-out queue discipline. Here we apply priority queueing discipline to shortes... |
1502.00695 | Rudra Kumar madapuri | Rudra Kumar M and A Ananda Rao | Assessing the Fault Proneness Degree (DFP) by Estimating the Impact of
Change Request Artifacts Correlation | Originally published in Eighth International Conference on Data
Mining and Warehousing (ICDMW-2014), Further the extended version is selected
to publish in International Journal of Information Processing, volume 8 and
issue 4, 2014 | International Journal of Information Processing, 8(4), 35-44, 2014 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Exploring the impact of change requests applied to a software maintenance
project helps to assess the fault-proneness of the change request to be handled
further, which is perhaps a bug fix or even a new feature demand. In practice,
the major development community stores change requests and related data using
bug tra... | [
{
"created": "Tue, 3 Feb 2015 00:48:44 GMT",
"version": "v1"
}
] | 2015-02-04 | [
[
"M",
"Rudra Kumar",
""
],
[
"Rao",
"A Ananda",
""
]
] | Exploring the impact of change requests applied to a software maintenance project helps to assess the fault-proneness of the change request to be handled further, which is perhaps a bug fix or even a new feature demand. In practice, the major development community stores change requests and related data using bug track... |
1609.05702 | Pavlos Sermpezis | Pavlos Sermpezis, Gavriil Chaviaras, Petros Gigis, and Xenofontas
Dimitropoulos | Monitor, Detect, Mitigate: Combating BGP Prefix Hijacking in Real-Time
with ARTEMIS | null | In Proceedings of the ACM SIGCOMM 2016 Conference (SIGCOMM '16),
625-626 | 10.1145/2934872.2959078 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Border Gateway Protocol (BGP) is globally used by Autonomous Systems
(ASes) to establish route paths for IP prefixes in the Internet. Due to the
lack of authentication in BGP, an AS can hijack IP prefixes owned by other ASes
(i.e., announce illegitimate route paths), impacting thus the Internet routing
system and... | [
{
"created": "Mon, 19 Sep 2016 13:04:18 GMT",
"version": "v1"
}
] | 2016-11-09 | [
[
"Sermpezis",
"Pavlos",
""
],
[
"Chaviaras",
"Gavriil",
""
],
[
"Gigis",
"Petros",
""
],
[
"Dimitropoulos",
"Xenofontas",
""
]
] | The Border Gateway Protocol (BGP) is globally used by Autonomous Systems (ASes) to establish route paths for IP prefixes in the Internet. Due to the lack of authentication in BGP, an AS can hijack IP prefixes owned by other ASes (i.e., announce illegitimate route paths), impacting thus the Internet routing system and e... |
2210.00440 | Bumjun Jung | Bumjun Jung, Yusuke Mukuta, Tatsuya Harada | Grouped self-attention mechanism for a memory-efficient Transformer | 10 pages, 3 figures, under review as a conference paper at ICLR 2023 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Time-series data analysis is important because numerous real-world tasks such
as forecasting weather, electricity consumption, and stock market involve
predicting data that vary over time. Time-series data are generally recorded
over a long period of observation with long sequences owing to their periodic
characteris... | [
{
"created": "Sun, 2 Oct 2022 06:58:49 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Oct 2022 09:11:14 GMT",
"version": "v2"
}
] | 2022-10-07 | [
[
"Jung",
"Bumjun",
""
],
[
"Mukuta",
"Yusuke",
""
],
[
"Harada",
"Tatsuya",
""
]
] | Time-series data analysis is important because numerous real-world tasks such as forecasting weather, electricity consumption, and stock market involve predicting data that vary over time. Time-series data are generally recorded over a long period of observation with long sequences owing to their periodic characteristi... |
1402.3757 | Weina Wang | Weina Wang, Lei Ying and Junshan Zhang | On the Relation Between Identifiability, Differential Privacy and
Mutual-Information Privacy | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates the relation between three different notions of
privacy: identifiability, differential privacy and mutual-information privacy.
Under a unified privacy-distortion framework, where the distortion is defined
to be the Hamming distance of the input and output databases, we establish some
fundament... | [
{
"created": "Sun, 16 Feb 2014 05:43:33 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Jun 2014 21:07:24 GMT",
"version": "v2"
},
{
"created": "Sat, 22 Aug 2015 07:25:47 GMT",
"version": "v3"
}
] | 2015-08-25 | [
[
"Wang",
"Weina",
""
],
[
"Ying",
"Lei",
""
],
[
"Zhang",
"Junshan",
""
]
] | This paper investigates the relation between three different notions of privacy: identifiability, differential privacy and mutual-information privacy. Under a unified privacy-distortion framework, where the distortion is defined to be the Hamming distance of the input and output databases, we establish some fundamental... |
2310.16406 | Ahmed Mohamed Hussain | Saeif Al-Hazbi, Ahmed Hussain, Savio Sciancalepore, Gabriele Oligeri,
Panos Papadimitratos | Radio Frequency Fingerprinting via Deep Learning: Challenges and
Opportunities | Authors version; Accepted for the 20th International Wireless
Communications and Mobile Computing (IWCMC) Security Symposium, 2024 | null | null | null | cs.CR cs.AI eess.SP | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Radio Frequency Fingerprinting (RFF) techniques promise to authenticate
wireless devices at the physical layer based on inherent hardware imperfections
introduced during manufacturing. Such RF transmitter imperfections are
reflected into over-the-air signals, allowing receivers to accurately identify
the RF transmitt... | [
{
"created": "Wed, 25 Oct 2023 06:45:49 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Apr 2024 16:47:50 GMT",
"version": "v2"
}
] | 2024-04-16 | [
[
"Al-Hazbi",
"Saeif",
""
],
[
"Hussain",
"Ahmed",
""
],
[
"Sciancalepore",
"Savio",
""
],
[
"Oligeri",
"Gabriele",
""
],
[
"Papadimitratos",
"Panos",
""
]
] | Radio Frequency Fingerprinting (RFF) techniques promise to authenticate wireless devices at the physical layer based on inherent hardware imperfections introduced during manufacturing. Such RF transmitter imperfections are reflected into over-the-air signals, allowing receivers to accurately identify the RF transmittin... |
1403.4445 | Artur Je\.z | Artur Je\.z | A really simple approximation of smallest grammar | Accepted for CPM 2014 | null | null | null | cs.DS cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a really simple linear-time algorithm constructing a
context-free grammar of size O(g log (N/g)) for the input string, where N is
the size of the input string and g the size of the optimal grammar generating
this string. The algorithm works for arbitrary size alphabets, but the running
time i... | [
{
"created": "Tue, 18 Mar 2014 13:27:46 GMT",
"version": "v1"
}
] | 2014-03-19 | [
[
"Jeż",
"Artur",
""
]
] | In this paper we present a really simple linear-time algorithm constructing a context-free grammar of size O(g log (N/g)) for the input string, where N is the size of the input string and g the size of the optimal grammar generating this string. The algorithm works for arbitrary size alphabets, but the running time is ... |
2303.01669 | Yangyang Shu | Yangyang Shu, Anton van den Hengel, Lingqiao Liu | Learning Common Rationale to Improve Self-Supervised Representation for
Fine-Grained Visual Recognition Problems | CVPR 2023 | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Self-supervised learning (SSL) strategies have demonstrated remarkable
performance in various recognition tasks. However, both our preliminary
investigation and recent studies suggest that they may be less effective in
learning representations for fine-grained visual recognition (FGVR) since many
features helpful for... | [
{
"created": "Fri, 3 Mar 2023 02:07:40 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Jul 2023 06:40:49 GMT",
"version": "v2"
}
] | 2023-07-28 | [
[
"Shu",
"Yangyang",
""
],
[
"Hengel",
"Anton van den",
""
],
[
"Liu",
"Lingqiao",
""
]
] | Self-supervised learning (SSL) strategies have demonstrated remarkable performance in various recognition tasks. However, both our preliminary investigation and recent studies suggest that they may be less effective in learning representations for fine-grained visual recognition (FGVR) since many features helpful for o... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.