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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2112.04468 | Ching-Yun Ko | Ching-Yun Ko, Jeet Mohapatra, Sijia Liu, Pin-Yu Chen, Luca Daniel,
Lily Weng | Revisiting Contrastive Learning through the Lens of Neighborhood
Component Analysis: an Integrated Framework | null | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a seminal tool in self-supervised representation learning, contrastive
learning has gained unprecedented attention in recent years. In essence,
contrastive learning aims to leverage pairs of positive and negative samples
for representation learning, which relates to exploiting neighborhood
information in a feature... | [
{
"created": "Wed, 8 Dec 2021 18:54:11 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Jan 2022 21:09:45 GMT",
"version": "v2"
}
] | 2022-02-01 | [
[
"Ko",
"Ching-Yun",
""
],
[
"Mohapatra",
"Jeet",
""
],
[
"Liu",
"Sijia",
""
],
[
"Chen",
"Pin-Yu",
""
],
[
"Daniel",
"Luca",
""
],
[
"Weng",
"Lily",
""
]
] | As a seminal tool in self-supervised representation learning, contrastive learning has gained unprecedented attention in recent years. In essence, contrastive learning aims to leverage pairs of positive and negative samples for representation learning, which relates to exploiting neighborhood information in a feature s... |
1305.6110 | EPTCS | Emil Sekerinski (McMaster University), Tian Zhang (McMaster
University) | On a New Notion of Partial Refinement | In Proceedings Refine 2013, arXiv:1305.5634 | EPTCS 115, 2013, pp. 1-14 | 10.4204/EPTCS.115.1 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Formal specification techniques allow expressing idealized specifications,
which abstract from restrictions that may arise in implementations. However,
partial implementations are universal in software development due to practical
limitations. Our goal is to contribute to a method of program refinement that
allows fo... | [
{
"created": "Mon, 27 May 2013 05:39:43 GMT",
"version": "v1"
}
] | 2013-05-28 | [
[
"Sekerinski",
"Emil",
"",
"McMaster University"
],
[
"Zhang",
"Tian",
"",
"McMaster\n University"
]
] | Formal specification techniques allow expressing idealized specifications, which abstract from restrictions that may arise in implementations. However, partial implementations are universal in software development due to practical limitations. Our goal is to contribute to a method of program refinement that allows for ... |
2202.08808 | Alexander van der Grinten | Alexander van der Grinten, Geert Custers, Duy Le Thanh, Henning
Meyerhenke | Fast Dynamic Updates and Dynamic SpGEMM on MPI-Distributed Graphs | various updates | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sparse matrix multiplication (SpGEMM) is a fundamental kernel used in many
diverse application areas, both numerical and discrete. For example, many
algebraic graph algorithms rely on SpGEMM in the tropical semiring to compute
shortest paths in graphs. Recently, SpGEMM has received growing attention
regarding impleme... | [
{
"created": "Thu, 17 Feb 2022 18:23:43 GMT",
"version": "v1"
},
{
"created": "Sat, 19 Feb 2022 11:19:14 GMT",
"version": "v2"
},
{
"created": "Tue, 31 May 2022 05:39:06 GMT",
"version": "v3"
}
] | 2022-06-01 | [
[
"van der Grinten",
"Alexander",
""
],
[
"Custers",
"Geert",
""
],
[
"Thanh",
"Duy Le",
""
],
[
"Meyerhenke",
"Henning",
""
]
] | Sparse matrix multiplication (SpGEMM) is a fundamental kernel used in many diverse application areas, both numerical and discrete. For example, many algebraic graph algorithms rely on SpGEMM in the tropical semiring to compute shortest paths in graphs. Recently, SpGEMM has received growing attention regarding implement... |
1806.03110 | Kun Cheng | Kun Cheng, Qiming Lu, Hongbo Xie, Qi Shen, Shengkai Liao, and Chengzhi
Peng | Multi-Code-Rate Correction Technique with IR-QC-LDPC: An application to
QKD | Rewrite this article | null | 10.21629/JSEE.2019.04.02 | null | cs.IT math.IT physics.app-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we report an encoding and decoding method for
irregular-quasic-cyclic low-density parity-check (IR-QC-LDPC) codes with multi
rates. The algorithm is applicable to parity-check matrices which have
dual-diagonal parity structure. The decoding adopts normalized min-sum
algorithm(NMSA). The whole verificat... | [
{
"created": "Fri, 8 Jun 2018 12:16:28 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Mar 2019 06:42:30 GMT",
"version": "v2"
}
] | 2019-10-31 | [
[
"Cheng",
"Kun",
""
],
[
"Lu",
"Qiming",
""
],
[
"Xie",
"Hongbo",
""
],
[
"Shen",
"Qi",
""
],
[
"Liao",
"Shengkai",
""
],
[
"Peng",
"Chengzhi",
""
]
] | In this paper, we report an encoding and decoding method for irregular-quasic-cyclic low-density parity-check (IR-QC-LDPC) codes with multi rates. The algorithm is applicable to parity-check matrices which have dual-diagonal parity structure. The decoding adopts normalized min-sum algorithm(NMSA). The whole verificatio... |
2206.15263 | Yoji Yamato | Yoji Yamato | Proposal of deployment reconfiguration for environment adaptation | 6 pages, 5 figures, in Japanese, IEICE Technical Report, ICM2022-13,
July 2022 | null | null | IEICE Technical Report, ICM2022-13, July 2022 | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To use heterogeneous hardware, programmers needed sufficient technical skills
such as OpenMP, CUDA, and OpenCL. Therefore, I have proposed
environment-adaptive software that enables high-performance operation by
automatically converting and configuring the code once written, and have been
working on automatic convers... | [
{
"created": "Thu, 30 Jun 2022 13:12:00 GMT",
"version": "v1"
}
] | 2022-07-01 | [
[
"Yamato",
"Yoji",
""
]
] | To use heterogeneous hardware, programmers needed sufficient technical skills such as OpenMP, CUDA, and OpenCL. Therefore, I have proposed environment-adaptive software that enables high-performance operation by automatically converting and configuring the code once written, and have been working on automatic conversio... |
1811.10964 | Jian Jiao | Jian Jiao, Jichao Jiao, Yaokai Mo, Weilun Liu, Zhongliang Deng | MagicVO: End-to-End Monocular Visual Odometry through Deep
Bi-directional Recurrent Convolutional Neural Network | 9 pages,5 figures,CVPR2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a new framework to solve the problem of monocular visual
odometry, called MagicVO . Based on Convolutional Neural Network (CNN) and
Bi-directional LSTM (Bi-LSTM), MagicVO outputs a 6-DoF absolute-scale pose at
each position of the camera with a sequence of continuous monocular images as
input. It ... | [
{
"created": "Tue, 27 Nov 2018 13:22:32 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Nov 2018 02:13:06 GMT",
"version": "v2"
}
] | 2018-11-29 | [
[
"Jiao",
"Jian",
""
],
[
"Jiao",
"Jichao",
""
],
[
"Mo",
"Yaokai",
""
],
[
"Liu",
"Weilun",
""
],
[
"Deng",
"Zhongliang",
""
]
] | This paper proposes a new framework to solve the problem of monocular visual odometry, called MagicVO . Based on Convolutional Neural Network (CNN) and Bi-directional LSTM (Bi-LSTM), MagicVO outputs a 6-DoF absolute-scale pose at each position of the camera with a sequence of continuous monocular images as input. It no... |
1007.4723 | L.T. Handoko | A. A. Waskita, N. A. Prasetyo, Z. Akbar, L. T. Handoko | Public Infrastructure for Monte Carlo Simulation: publicMC@BATAN | 6 pages | AIP Conf. Proc. 1244 (2010) 190-195 | 10.1063/1.3462759 | FISIKALIPI-09031 | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The first cluster-based public computing for Monte Carlo simulation in
Indonesia is introduced. The system has been developed to enable public to
perform Monte Carlo simulation on a parallel computer through an integrated and
user friendly dynamic web interface. The beta version, so called
publicMC@BATAN, has been re... | [
{
"created": "Tue, 27 Jul 2010 13:58:10 GMT",
"version": "v1"
}
] | 2010-12-14 | [
[
"Waskita",
"A. A.",
""
],
[
"Prasetyo",
"N. A.",
""
],
[
"Akbar",
"Z.",
""
],
[
"Handoko",
"L. T.",
""
]
] | The first cluster-based public computing for Monte Carlo simulation in Indonesia is introduced. The system has been developed to enable public to perform Monte Carlo simulation on a parallel computer through an integrated and user friendly dynamic web interface. The beta version, so called publicMC@BATAN, has been rele... |
2109.04901 | Kung-Hsiang Huang | Kung-Hsiang Huang, Sam Tang and Nanyun Peng | Document-level Entity-based Extraction as Template Generation | 13 pages. EMNLP 2021 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Document-level entity-based extraction (EE), aiming at extracting
entity-centric information such as entity roles and entity relations, is key to
automatic knowledge acquisition from text corpora for various domains. Most
document-level EE systems build extractive models, which struggle to model
long-term dependencie... | [
{
"created": "Fri, 10 Sep 2021 14:18:22 GMT",
"version": "v1"
}
] | 2021-09-13 | [
[
"Huang",
"Kung-Hsiang",
""
],
[
"Tang",
"Sam",
""
],
[
"Peng",
"Nanyun",
""
]
] | Document-level entity-based extraction (EE), aiming at extracting entity-centric information such as entity roles and entity relations, is key to automatic knowledge acquisition from text corpora for various domains. Most document-level EE systems build extractive models, which struggle to model long-term dependencies ... |
1407.0265 | Evangelos Stromatias Mr. | Evangelos Stromatias and John Marsland | Supervised learning in Spiking Neural Networks with Limited Precision:
SNN/LP | 7 pages, originally submitted to IJCNN 2012 | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A new supervised learning algorithm, SNN/LP, is proposed for Spiking Neural
Networks. This novel algorithm uses limited precision for both synaptic weights
and synaptic delays; 3 bits in each case. Also a genetic algorithm is used for
the supervised training. The results are comparable or better than previously
publi... | [
{
"created": "Tue, 1 Jul 2014 14:50:36 GMT",
"version": "v1"
}
] | 2014-07-02 | [
[
"Stromatias",
"Evangelos",
""
],
[
"Marsland",
"John",
""
]
] | A new supervised learning algorithm, SNN/LP, is proposed for Spiking Neural Networks. This novel algorithm uses limited precision for both synaptic weights and synaptic delays; 3 bits in each case. Also a genetic algorithm is used for the supervised training. The results are comparable or better than previously publish... |
2109.08941 | Praveen Tirupattur | Praveen Tirupattur, Christian Schulze, Andreas Dengel | Violence Detection in Videos | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In the recent years, there has been a tremendous increase in the amount of
video content uploaded to social networking and video sharing websites like
Facebook and Youtube. As of result of this, the risk of children getting
exposed to adult and violent content on the web also increased. To address this
issue, an appr... | [
{
"created": "Sat, 18 Sep 2021 14:33:40 GMT",
"version": "v1"
}
] | 2021-09-21 | [
[
"Tirupattur",
"Praveen",
""
],
[
"Schulze",
"Christian",
""
],
[
"Dengel",
"Andreas",
""
]
] | In the recent years, there has been a tremendous increase in the amount of video content uploaded to social networking and video sharing websites like Facebook and Youtube. As of result of this, the risk of children getting exposed to adult and violent content on the web also increased. To address this issue, an approa... |
1312.6568 | Ekaterina Komendantskaya Dr | Ekaterina Komendantskaya, John Power and Martin Schmidt | Coalgebraic Logic Programming: from Semantics to Implementation | Accepted for publication in Journal of Logic and Computation, 2014 | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Coinductive definitions, such as that of an infinite stream, may often be
described by elegant logic programs, but ones for which SLD-refutation is of no
value as SLD-derivations fall into infinite loops. Such definitions give rise
to questions of lazy corecursive derivations and parallelism, as execution of
such log... | [
{
"created": "Mon, 23 Dec 2013 15:19:27 GMT",
"version": "v1"
}
] | 2013-12-24 | [
[
"Komendantskaya",
"Ekaterina",
""
],
[
"Power",
"John",
""
],
[
"Schmidt",
"Martin",
""
]
] | Coinductive definitions, such as that of an infinite stream, may often be described by elegant logic programs, but ones for which SLD-refutation is of no value as SLD-derivations fall into infinite loops. Such definitions give rise to questions of lazy corecursive derivations and parallelism, as execution of such logic... |
2305.05247 | Aryan Jadon | Aryan Jadon, Shashank Kumar | Leveraging Generative AI Models for Synthetic Data Generation in
Healthcare: Balancing Research and Privacy | 4 pages, 3 figures | 2023 International Conference on Smart Applications,
Communications and Networking (SmartNets) | 10.1109/SmartNets58706.2023.10215825 | null | cs.LG cs.AI cs.CR | http://creativecommons.org/licenses/by/4.0/ | The widespread adoption of electronic health records and digital healthcare
data has created a demand for data-driven insights to enhance patient outcomes,
diagnostics, and treatments. However, using real patient data presents privacy
and regulatory challenges, including compliance with HIPAA and GDPR. Synthetic
data... | [
{
"created": "Tue, 9 May 2023 08:12:44 GMT",
"version": "v1"
}
] | 2023-11-15 | [
[
"Jadon",
"Aryan",
""
],
[
"Kumar",
"Shashank",
""
]
] | The widespread adoption of electronic health records and digital healthcare data has created a demand for data-driven insights to enhance patient outcomes, diagnostics, and treatments. However, using real patient data presents privacy and regulatory challenges, including compliance with HIPAA and GDPR. Synthetic data g... |
2303.06315 | Ji Zhang | Ji Zhang, Lianli Gao, Xu Luo, Hengtao Shen and Jingkuan Song | DETA: Denoised Task Adaptation for Few-Shot Learning | 10 pages, 5 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | Test-time task adaptation in few-shot learning aims to adapt a pre-trained
task-agnostic model for capturing taskspecific knowledge of the test task, rely
only on few-labeled support samples. Previous approaches generally focus on
developing advanced algorithms to achieve the goal, while neglecting the
inherent probl... | [
{
"created": "Sat, 11 Mar 2023 05:23:20 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Sep 2023 06:35:44 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Dec 2023 00:39:48 GMT",
"version": "v3"
}
] | 2023-12-19 | [
[
"Zhang",
"Ji",
""
],
[
"Gao",
"Lianli",
""
],
[
"Luo",
"Xu",
""
],
[
"Shen",
"Hengtao",
""
],
[
"Song",
"Jingkuan",
""
]
] | Test-time task adaptation in few-shot learning aims to adapt a pre-trained task-agnostic model for capturing taskspecific knowledge of the test task, rely only on few-labeled support samples. Previous approaches generally focus on developing advanced algorithms to achieve the goal, while neglecting the inherent problem... |
2106.13385 | Omar Abdel Wahab | Omar Abdel Wahab, Ali Mustafa, Andr\'e Bertrand Abisseck Bamatakina | Trends, Politics, Sentiments, and Misinformation: Understanding People's
Reactions to COVID-19 During its Early Stages | 13 pages, 6 figures | null | null | null | cs.SI cs.IT math.IT | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The sudden outbreak of COVID-19 resulted in large volumes of data shared on
different social media platforms. Analyzing and visualizing these data is
doubtlessly essential to having a deep understanding of the pandemic's impacts
on people's lives and their reactions to them. In this work, we conduct a
large-scale spa... | [
{
"created": "Fri, 25 Jun 2021 01:49:45 GMT",
"version": "v1"
}
] | 2021-06-28 | [
[
"Wahab",
"Omar Abdel",
""
],
[
"Mustafa",
"Ali",
""
],
[
"Bamatakina",
"André Bertrand Abisseck",
""
]
] | The sudden outbreak of COVID-19 resulted in large volumes of data shared on different social media platforms. Analyzing and visualizing these data is doubtlessly essential to having a deep understanding of the pandemic's impacts on people's lives and their reactions to them. In this work, we conduct a large-scale spati... |
2206.13373 | Sabah Al-Fedaghi Dr. | Sabah Al-Fedaghi | Conceptual Modeling of Actions | 11 pages, 23 figures | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Modeling in software engineering includes constructing static, dynamic, and
behavioral representations. In describing system behavior, actions and states
are two of the most commonly used concepts. In this paper, we focus on the
notion of action. It generally held that the meaning of the concept of action
is not that... | [
{
"created": "Mon, 27 Jun 2022 15:34:13 GMT",
"version": "v1"
}
] | 2022-06-28 | [
[
"Al-Fedaghi",
"Sabah",
""
]
] | Modeling in software engineering includes constructing static, dynamic, and behavioral representations. In describing system behavior, actions and states are two of the most commonly used concepts. In this paper, we focus on the notion of action. It generally held that the meaning of the concept of action is not that e... |
2305.15084 | Arian Bakhtiarnia | B{\l}a\.zej Leporowski, Arian Bakhtiarnia, Nicole Bonnici, Adrian
Muscat, Luca Zanella, Yiming Wang and Alexandros Iosifidis | Audio-Visual Dataset and Method for Anomaly Detection in Traffic Videos | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce the first audio-visual dataset for traffic anomaly detection
taken from real-world scenes, called MAVAD, with a diverse range of weather and
illumination conditions. In addition, we propose a novel method named AVACA
that combines visual and audio features extracted from video sequences by means
of cross... | [
{
"created": "Wed, 24 May 2023 12:02:42 GMT",
"version": "v1"
}
] | 2023-05-25 | [
[
"Leporowski",
"Błażej",
""
],
[
"Bakhtiarnia",
"Arian",
""
],
[
"Bonnici",
"Nicole",
""
],
[
"Muscat",
"Adrian",
""
],
[
"Zanella",
"Luca",
""
],
[
"Wang",
"Yiming",
""
],
[
"Iosifidis",
"Alexandros",
""
... | We introduce the first audio-visual dataset for traffic anomaly detection taken from real-world scenes, called MAVAD, with a diverse range of weather and illumination conditions. In addition, we propose a novel method named AVACA that combines visual and audio features extracted from video sequences by means of cross-a... |
1109.6348 | A. Roy | A. Roy | Fault Tolerant Boolean Satisfiability | null | Journal Of Artificial Intelligence Research, Volume 25, pages
503-527, 2006 | 10.1613/jair.1914 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A delta-model is a satisfying assignment of a Boolean formula for which any
small alteration, such as a single bit flip, can be repaired by flips to some
small number of other bits, yielding a new satisfying assignment. These
satisfying assignments represent robust solutions to optimization problems
(e.g., scheduling... | [
{
"created": "Wed, 28 Sep 2011 20:37:53 GMT",
"version": "v1"
}
] | 2011-09-30 | [
[
"Roy",
"A.",
""
]
] | A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) ... |
2005.07569 | Debayan Ganguly | Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray | Two-way Nanoscale automata | null | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we show the all final subclass of two-way Watson-Crick
automata have the same computational power as the classical two-way
Watson-Crick automata. Here we compare the computational power of two-way
Watson-Crick automata and two-way Quantum finite automata and we observe that
two-way Watson-Crick automat... | [
{
"created": "Sun, 19 Apr 2020 06:45:20 GMT",
"version": "v1"
}
] | 2020-05-18 | [
[
"Ganguly",
"Debayan",
""
],
[
"Chatterjee",
"Kingshuk",
""
],
[
"Ray",
"Kumar Sankar",
""
]
] | In this paper, we show the all final subclass of two-way Watson-Crick automata have the same computational power as the classical two-way Watson-Crick automata. Here we compare the computational power of two-way Watson-Crick automata and two-way Quantum finite automata and we observe that two-way Watson-Crick automata ... |
2103.03198 | Denis Merigoux | Denis Merigoux, Nicolas Chataing, Jonathan Protzenko | Catala: A Programming Language for the Law | null | null | 10.1145/3473582 | null | cs.PL | http://creativecommons.org/licenses/by/4.0/ | Law at large underpins modern society, codifying and governing many aspects
of citizens' daily lives. Oftentimes, law is subject to interpretation, debate
and challenges throughout various courts and jurisdictions. But in some other
areas, law leaves little room for interpretation, and essentially aims to
rigorously ... | [
{
"created": "Thu, 4 Mar 2021 18:03:15 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Jul 2021 22:06:50 GMT",
"version": "v2"
}
] | 2021-07-06 | [
[
"Merigoux",
"Denis",
""
],
[
"Chataing",
"Nicolas",
""
],
[
"Protzenko",
"Jonathan",
""
]
] | Law at large underpins modern society, codifying and governing many aspects of citizens' daily lives. Oftentimes, law is subject to interpretation, debate and challenges throughout various courts and jurisdictions. But in some other areas, law leaves little room for interpretation, and essentially aims to rigorously de... |
2211.09325 | Harry Zhang Mr. | Chuer Pan, Brian Okorn, Harry Zhang, Ben Eisner, David Held | TAX-Pose: Task-Specific Cross-Pose Estimation for Robot Manipulation | Conference on Robot Learning (CoRL), 2022. Supplementary material is
available at https://sites.google.com/view/tax-pose/home | null | null | null | cs.RO cs.AI cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How do we imbue robots with the ability to efficiently manipulate unseen
objects and transfer relevant skills based on demonstrations? End-to-end
learning methods often fail to generalize to novel objects or unseen
configurations. Instead, we focus on the task-specific pose relationship
between relevant parts of inte... | [
{
"created": "Thu, 17 Nov 2022 04:06:16 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Apr 2023 03:10:27 GMT",
"version": "v2"
},
{
"created": "Thu, 2 May 2024 16:04:19 GMT",
"version": "v3"
}
] | 2024-05-03 | [
[
"Pan",
"Chuer",
""
],
[
"Okorn",
"Brian",
""
],
[
"Zhang",
"Harry",
""
],
[
"Eisner",
"Ben",
""
],
[
"Held",
"David",
""
]
] | How do we imbue robots with the ability to efficiently manipulate unseen objects and transfer relevant skills based on demonstrations? End-to-end learning methods often fail to generalize to novel objects or unseen configurations. Instead, we focus on the task-specific pose relationship between relevant parts of intera... |
1104.4842 | Mark Davenport | Mark A. Davenport, Jason N. Laska, John R. Treichler, and Richard G.
Baraniuk | The Pros and Cons of Compressive Sensing for Wideband Signal
Acquisition: Noise Folding vs. Dynamic Range | null | null | 10.1109/TSP.2012.2201149 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressive sensing (CS) exploits the sparsity present in many signals to
reduce the number of measurements needed for digital acquisition. With this
reduction would come, in theory, commensurate reductions in the size, weight,
power consumption, and/or monetary cost of both signal sensors and any
associated communic... | [
{
"created": "Tue, 26 Apr 2011 05:05:29 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Jul 2011 14:40:45 GMT",
"version": "v2"
},
{
"created": "Wed, 14 Dec 2011 05:31:53 GMT",
"version": "v3"
},
{
"created": "Thu, 31 May 2012 01:37:55 GMT",
"version": "v4"
}
] | 2015-05-28 | [
[
"Davenport",
"Mark A.",
""
],
[
"Laska",
"Jason N.",
""
],
[
"Treichler",
"John R.",
""
],
[
"Baraniuk",
"Richard G.",
""
]
] | Compressive sensing (CS) exploits the sparsity present in many signals to reduce the number of measurements needed for digital acquisition. With this reduction would come, in theory, commensurate reductions in the size, weight, power consumption, and/or monetary cost of both signal sensors and any associated communicat... |
2102.09631 | Bradley Baker | Bradley T. Baker, Aashis Khanal, Vince D. Calhoun, Barak Pearlmutter,
Sergey M. Plis | Peering Beyond the Gradient Veil with Distributed Auto Differentiation | 8 pages, 6 figures | null | null | null | cs.LG cs.DC | http://creativecommons.org/licenses/by/4.0/ | Although distributed machine learning has opened up many new and exciting
research frontiers, fragmentation of models and data across different machines,
nodes, and sites still results in considerable communication overhead, impeding
reliable training in real-world contexts.
The focus on gradients as the primary sh... | [
{
"created": "Thu, 18 Feb 2021 21:46:27 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Feb 2021 19:29:53 GMT",
"version": "v2"
},
{
"created": "Thu, 3 Feb 2022 18:06:39 GMT",
"version": "v3"
}
] | 2022-02-04 | [
[
"Baker",
"Bradley T.",
""
],
[
"Khanal",
"Aashis",
""
],
[
"Calhoun",
"Vince D.",
""
],
[
"Pearlmutter",
"Barak",
""
],
[
"Plis",
"Sergey M.",
""
]
] | Although distributed machine learning has opened up many new and exciting research frontiers, fragmentation of models and data across different machines, nodes, and sites still results in considerable communication overhead, impeding reliable training in real-world contexts. The focus on gradients as the primary shared... |
1708.03903 | Danupon Nanongkai | Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak | Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde
O(n^{5/4})$ Rounds | Minor corrections in Section 4 | null | null | null | cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study computing {\em all-pairs shortest paths} (APSP) on distributed
networks (the CONGEST model). The goal is for every node in the (weighted)
network to know the distance from every other node using communication. The
problem admits $(1+o(1))$-approximation $\tilde O(n)$-time algorithms
~\cite{LenzenP-podc15,Nan... | [
{
"created": "Sun, 13 Aug 2017 13:27:47 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Nov 2017 09:50:24 GMT",
"version": "v2"
}
] | 2017-11-07 | [
[
"Huang",
"Chien-Chung",
""
],
[
"Nanongkai",
"Danupon",
""
],
[
"Saranurak",
"Thatchaphol",
""
]
] | We study computing {\em all-pairs shortest paths} (APSP) on distributed networks (the CONGEST model). The goal is for every node in the (weighted) network to know the distance from every other node using communication. The problem admits $(1+o(1))$-approximation $\tilde O(n)$-time algorithms ~\cite{LenzenP-podc15,Nanon... |
2404.17454 | Yueyang Ding | Kaichen Xu, Yueyang Ding, Suyang Hou, Weiqiang Zhan, Nisang Chen, Jun
Wang, Xiaobo Sun | Domain Adaptive and Fine-grained Anomaly Detection for Single-cell
Sequencing Data and Beyond | 17 pages, 2 figures. Accepted by IJCAI 2024 | null | null | null | cs.LG cs.AI q-bio.QM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fined-grained anomalous cell detection from affected tissues is critical for
clinical diagnosis and pathological research. Single-cell sequencing data
provide unprecedented opportunities for this task. However, current anomaly
detection methods struggle to handle domain shifts prevalent in multi-sample
and multi-doma... | [
{
"created": "Fri, 26 Apr 2024 14:48:24 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Apr 2024 16:14:26 GMT",
"version": "v2"
}
] | 2024-05-01 | [
[
"Xu",
"Kaichen",
""
],
[
"Ding",
"Yueyang",
""
],
[
"Hou",
"Suyang",
""
],
[
"Zhan",
"Weiqiang",
""
],
[
"Chen",
"Nisang",
""
],
[
"Wang",
"Jun",
""
],
[
"Sun",
"Xiaobo",
""
]
] | Fined-grained anomalous cell detection from affected tissues is critical for clinical diagnosis and pathological research. Single-cell sequencing data provide unprecedented opportunities for this task. However, current anomaly detection methods struggle to handle domain shifts prevalent in multi-sample and multi-domain... |
1901.09311 | Liwei Wang | Kefan Dong, Yuanhao Wang, Xiaoyu Chen, Liwei Wang | Q-learning with UCB Exploration is Sample Efficient for Infinite-Horizon
MDP | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A fundamental question in reinforcement learning is whether model-free
algorithms are sample efficient. Recently, Jin et al. \cite{jin2018q} proposed
a Q-learning algorithm with UCB exploration policy, and proved it has nearly
optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt
Q-learning wi... | [
{
"created": "Sun, 27 Jan 2019 03:44:42 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Sep 2019 02:09:54 GMT",
"version": "v2"
}
] | 2019-09-30 | [
[
"Dong",
"Kefan",
""
],
[
"Wang",
"Yuanhao",
""
],
[
"Chen",
"Xiaoyu",
""
],
[
"Wang",
"Liwei",
""
]
] | A fundamental question in reinforcement learning is whether model-free algorithms are sample efficient. Recently, Jin et al. \cite{jin2018q} proposed a Q-learning algorithm with UCB exploration policy, and proved it has nearly optimal regret bound for finite-horizon episodic MDP. In this paper, we adapt Q-learning with... |
2207.06218 | Sebastiano Vigna | Paolo Boldi, Flavio Furia, Sebastiano Vigna | Monotonicity in Undirected Networks | arXiv admin note: text overlap with arXiv:2202.01044 | null | null | null | cs.SI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Is it always beneficial to create a new relationship (have a new
follower/friend) in a social network? This question can be formally stated as a
property of the centrality measure that defines the importance of the actors of
the network. Score monotonicity means that adding an arc increases the
centrality score of th... | [
{
"created": "Wed, 13 Jul 2022 14:21:44 GMT",
"version": "v1"
}
] | 2022-07-14 | [
[
"Boldi",
"Paolo",
""
],
[
"Furia",
"Flavio",
""
],
[
"Vigna",
"Sebastiano",
""
]
] | Is it always beneficial to create a new relationship (have a new follower/friend) in a social network? This question can be formally stated as a property of the centrality measure that defines the importance of the actors of the network. Score monotonicity means that adding an arc increases the centrality score of the ... |
2306.13310 | Chengmei Yang | Chengmei Yang, Shuai Jiang, Bowei He, Chen Ma, and Lianghua He | Mutually Guided Few-shot Learning for Relational Triple Extraction | Accepted by ICASSP 2023 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge graphs (KGs), containing many entity-relation-entity triples,
provide rich information for downstream applications. Although extracting
triples from unstructured texts has been widely explored, most of them require
a large number of labeled instances. The performance will drop dramatically
when only few lab... | [
{
"created": "Fri, 23 Jun 2023 06:15:54 GMT",
"version": "v1"
}
] | 2023-06-26 | [
[
"Yang",
"Chengmei",
""
],
[
"Jiang",
"Shuai",
""
],
[
"He",
"Bowei",
""
],
[
"Ma",
"Chen",
""
],
[
"He",
"Lianghua",
""
]
] | Knowledge graphs (KGs), containing many entity-relation-entity triples, provide rich information for downstream applications. Although extracting triples from unstructured texts has been widely explored, most of them require a large number of labeled instances. The performance will drop dramatically when only few label... |
2109.10986 | Bruno Arcanjo Mr | Bruno Arcanjo, Bruno Ferrarini, Michael Milford, Klaus D.
McDonald-Maier and Shoaib Ehsan | An Efficient and Scalable Collection of Fly-inspired Voting Units for
Visual Place Recognition in Changing Environments | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | State-of-the-art visual place recognition performance is currently being
achieved utilizing deep learning based approaches. Despite the recent efforts
in designing lightweight convolutional neural network based models, these can
still be too expensive for the most hardware restricted robot applications.
Low-overhead ... | [
{
"created": "Wed, 22 Sep 2021 19:01:20 GMT",
"version": "v1"
}
] | 2021-09-24 | [
[
"Arcanjo",
"Bruno",
""
],
[
"Ferrarini",
"Bruno",
""
],
[
"Milford",
"Michael",
""
],
[
"McDonald-Maier",
"Klaus D.",
""
],
[
"Ehsan",
"Shoaib",
""
]
] | State-of-the-art visual place recognition performance is currently being achieved utilizing deep learning based approaches. Despite the recent efforts in designing lightweight convolutional neural network based models, these can still be too expensive for the most hardware restricted robot applications. Low-overhead VP... |
1704.07238 | Pedro Hecht | Pedro Hecht | Post-Quantum Cryptography: S381 Cyclic Subgroup of High Order | 9 pages, 13 figures | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Currently there is an active Post-Quantum Cryptography (PQC) solutions
search, which attempts to find cryptographic protocols resistant to attacks by
means of for instance Shor polynomial time algorithm for numerical field
problems like integer factorization (IFP) or the discrete logarithm (DLP). The
use of non-commu... | [
{
"created": "Mon, 24 Apr 2017 13:57:40 GMT",
"version": "v1"
}
] | 2017-04-25 | [
[
"Hecht",
"Pedro",
""
]
] | Currently there is an active Post-Quantum Cryptography (PQC) solutions search, which attempts to find cryptographic protocols resistant to attacks by means of for instance Shor polynomial time algorithm for numerical field problems like integer factorization (IFP) or the discrete logarithm (DLP). The use of non-commuta... |
2110.03414 | Mikolaj Kegler | Neil Scheidwasser-Clow, Mikolaj Kegler, Pierre Beckmann, Milos Cernak | SERAB: A multi-lingual benchmark for speech emotion recognition | Submitted to ICASSP 2022 | null | null | null | cs.SD cs.AI cs.LG eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent developments in speech emotion recognition (SER) often leverage deep
neural networks (DNNs). Comparing and benchmarking different DNN models can
often be tedious due to the use of different datasets and evaluation protocols.
To facilitate the process, here, we present the Speech Emotion Recognition
Adaptation ... | [
{
"created": "Thu, 7 Oct 2021 13:01:34 GMT",
"version": "v1"
}
] | 2021-10-08 | [
[
"Scheidwasser-Clow",
"Neil",
""
],
[
"Kegler",
"Mikolaj",
""
],
[
"Beckmann",
"Pierre",
""
],
[
"Cernak",
"Milos",
""
]
] | Recent developments in speech emotion recognition (SER) often leverage deep neural networks (DNNs). Comparing and benchmarking different DNN models can often be tedious due to the use of different datasets and evaluation protocols. To facilitate the process, here, we present the Speech Emotion Recognition Adaptation Be... |
2302.02128 | Mashrin Srivastava | Nayana Bannur and Mashrin Srivastava and Harsha Vardhan | Interaction Order Prediction for Temporal Graphs | null | null | null | null | cs.SI cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Link prediction in graphs is a task that has been widely investigated. It has
been applied in various domains such as knowledge graph completion,
content/item recommendation, social network recommendations and so on. The
initial focus of most research was on link prediction in static graphs.
However, there has recent... | [
{
"created": "Sat, 4 Feb 2023 08:19:13 GMT",
"version": "v1"
}
] | 2023-02-07 | [
[
"Bannur",
"Nayana",
""
],
[
"Srivastava",
"Mashrin",
""
],
[
"Vardhan",
"Harsha",
""
]
] | Link prediction in graphs is a task that has been widely investigated. It has been applied in various domains such as knowledge graph completion, content/item recommendation, social network recommendations and so on. The initial focus of most research was on link prediction in static graphs. However, there has recently... |
1803.04856 | Chinmaya Mishra | Elias J Griffith, Chinmaya Mishra, Jason F. Ralph, Simon Maskell | A System for the Generation of Synthetic Wide Area Aerial Surveillance
Imagery | v1 (Accepted for publication in Simulation Modelling Practice and
Theory) | null | null | null | cs.OH cs.SY eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The development, benchmarking and validation of aerial Persistent
Surveillance (PS) algorithms requires access to specialist Wide Area Aerial
Surveillance (WAAS) datasets. Such datasets are difficult to obtain and are
often extremely large both in spatial resolution and temporal duration. This
paper outlines an appro... | [
{
"created": "Tue, 13 Mar 2018 14:51:21 GMT",
"version": "v1"
}
] | 2018-03-14 | [
[
"Griffith",
"Elias J",
""
],
[
"Mishra",
"Chinmaya",
""
],
[
"Ralph",
"Jason F.",
""
],
[
"Maskell",
"Simon",
""
]
] | The development, benchmarking and validation of aerial Persistent Surveillance (PS) algorithms requires access to specialist Wide Area Aerial Surveillance (WAAS) datasets. Such datasets are difficult to obtain and are often extremely large both in spatial resolution and temporal duration. This paper outlines an approac... |
2210.14458 | Zahra Esmaeilbeig | Zahra Esmaeilbeig, Arian Eamaz, Kumar Vijay Mishra, and Mojtaba
Soltanalian | Joint Waveform and Passive Beamformer Design in Multi-IRS-Aided Radar | null | null | null | null | cs.IT eess.SP math.IT math.OC | http://creativecommons.org/licenses/by/4.0/ | Intelligent reflecting surface (IRS) technology has recently attracted a
significant interest in non-light-of-sight radar remote sensing. Prior works
have largely focused on designing single IRS beamformers for this problem. For
the first time in the literature, this paper considers multi-IRS-aided
multiple-input mul... | [
{
"created": "Wed, 26 Oct 2022 04:10:47 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Oct 2022 20:02:53 GMT",
"version": "v2"
},
{
"created": "Sun, 12 Mar 2023 05:11:29 GMT",
"version": "v3"
}
] | 2023-03-14 | [
[
"Esmaeilbeig",
"Zahra",
""
],
[
"Eamaz",
"Arian",
""
],
[
"Mishra",
"Kumar Vijay",
""
],
[
"Soltanalian",
"Mojtaba",
""
]
] | Intelligent reflecting surface (IRS) technology has recently attracted a significant interest in non-light-of-sight radar remote sensing. Prior works have largely focused on designing single IRS beamformers for this problem. For the first time in the literature, this paper considers multi-IRS-aided multiple-input multi... |
2301.05137 | Vitaliy Kurlin | Olga Anosova and Vitaliy Kurlin | Density functions of periodic sequences of continuous events | 16 pages, 12 figures, the latest version is maintained at
http://kurlin.org/projects/periodic-geometry/densities-sequences-intervals.pdf.
arXiv admin note: text overlap with arXiv:2205.02226 | null | null | null | cs.CG math.MG | http://creativecommons.org/licenses/by/4.0/ | Periodic Geometry studies isometry invariants of periodic point sets that are
also continuous under perturbations. The motivations come from periodic
crystals whose structures are determined in a rigid form but any minimal cells
can discontinuously change due to small noise in measurements. For any integer
k>=0, the ... | [
{
"created": "Thu, 12 Jan 2023 16:44:29 GMT",
"version": "v1"
}
] | 2023-01-13 | [
[
"Anosova",
"Olga",
""
],
[
"Kurlin",
"Vitaliy",
""
]
] | Periodic Geometry studies isometry invariants of periodic point sets that are also continuous under perturbations. The motivations come from periodic crystals whose structures are determined in a rigid form but any minimal cells can discontinuously change due to small noise in measurements. For any integer k>=0, the de... |
2309.05792 | Remko Proesmans | Remko Proesmans and Francis wyffels | Seamless Integration of Tactile Sensors for Cobots | Accepted at RoboTac 2023 workshop, IROS2023 | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The development of tactile sensing is expected to enhance robotic systems in
handling complex objects like deformables or reflective materials. However,
readily available industrial grippers generally lack tactile feedback, which
has led researchers to develop their own tactile sensors, resulting in a wide
range of s... | [
{
"created": "Mon, 11 Sep 2023 19:49:57 GMT",
"version": "v1"
}
] | 2023-09-13 | [
[
"Proesmans",
"Remko",
""
],
[
"wyffels",
"Francis",
""
]
] | The development of tactile sensing is expected to enhance robotic systems in handling complex objects like deformables or reflective materials. However, readily available industrial grippers generally lack tactile feedback, which has led researchers to develop their own tactile sensors, resulting in a wide range of sen... |
2001.03229 | Sen Lin | Sen Lin, Guang Yang and Junshan Zhang | Real-Time Edge Intelligence in the Making: A Collaborative Learning
Framework via Federated Meta-Learning | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many IoT applications at the network edge demand intelligent decisions in a
real-time manner. The edge device alone, however, often cannot achieve
real-time edge intelligence due to its constrained computing resources and
limited local data. To tackle these challenges, we propose a platform-aided
collaborative learni... | [
{
"created": "Thu, 9 Jan 2020 21:37:42 GMT",
"version": "v1"
},
{
"created": "Fri, 8 May 2020 23:54:45 GMT",
"version": "v2"
}
] | 2020-05-12 | [
[
"Lin",
"Sen",
""
],
[
"Yang",
"Guang",
""
],
[
"Zhang",
"Junshan",
""
]
] | Many IoT applications at the network edge demand intelligent decisions in a real-time manner. The edge device alone, however, often cannot achieve real-time edge intelligence due to its constrained computing resources and limited local data. To tackle these challenges, we propose a platform-aided collaborative learning... |
1106.2872 | Yu Zhang | Yuxin Deng, Yu Zhang | Program Equivalence in Linear Contexts | Technical report, Laboratory for Computer Science, ISCAS | null | null | ISCAS-SKLCS-11-04 | cs.PL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Program equivalence in linear contexts, where programs are used or executed
exactly once, is an important issue in programming languages. However, existing
techniques like those based on bisimulations and logical relations only target
at contextual equivalence in the usual (non-linear) functional languages, and
fail ... | [
{
"created": "Wed, 15 Jun 2011 04:48:17 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Oct 2011 05:15:38 GMT",
"version": "v2"
}
] | 2011-10-12 | [
[
"Deng",
"Yuxin",
""
],
[
"Zhang",
"Yu",
""
]
] | Program equivalence in linear contexts, where programs are used or executed exactly once, is an important issue in programming languages. However, existing techniques like those based on bisimulations and logical relations only target at contextual equivalence in the usual (non-linear) functional languages, and fail in... |
1909.02060 | Tatsunori Hashimoto | Yonatan Oren, Shiori Sagawa, Tatsunori B. Hashimoto, Percy Liang | Distributionally Robust Language Modeling | Camera ready version for EMNLP | null | null | null | cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Language models are generally trained on data spanning a wide range of topics
(e.g., news, reviews, fiction), but they might be applied to an a priori
unknown target distribution (e.g., restaurant reviews). In this paper, we first
show that training on text outside the test distribution can degrade test
performance w... | [
{
"created": "Wed, 4 Sep 2019 19:07:33 GMT",
"version": "v1"
}
] | 2019-09-06 | [
[
"Oren",
"Yonatan",
""
],
[
"Sagawa",
"Shiori",
""
],
[
"Hashimoto",
"Tatsunori B.",
""
],
[
"Liang",
"Percy",
""
]
] | Language models are generally trained on data spanning a wide range of topics (e.g., news, reviews, fiction), but they might be applied to an a priori unknown target distribution (e.g., restaurant reviews). In this paper, we first show that training on text outside the test distribution can degrade test performance whe... |
2301.07316 | Kanghao Chen | Kanghao Chen, Sijia Liu, Ruixuan Wang and Wei-Shi Zheng | Adaptively Integrated Knowledge Distillation and Prediction Uncertainty
for Continual Learning | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current deep learning models often suffer from catastrophic forgetting of old
knowledge when continually learning new knowledge. Existing strategies to
alleviate this issue often fix the trade-off between keeping old knowledge
(stability) and learning new knowledge (plasticity). However, the
stability-plasticity trad... | [
{
"created": "Wed, 18 Jan 2023 05:36:06 GMT",
"version": "v1"
}
] | 2023-01-19 | [
[
"Chen",
"Kanghao",
""
],
[
"Liu",
"Sijia",
""
],
[
"Wang",
"Ruixuan",
""
],
[
"Zheng",
"Wei-Shi",
""
]
] | Current deep learning models often suffer from catastrophic forgetting of old knowledge when continually learning new knowledge. Existing strategies to alleviate this issue often fix the trade-off between keeping old knowledge (stability) and learning new knowledge (plasticity). However, the stability-plasticity trade-... |
2207.12100 | Yunsheng Pang | Yunsheng Pang, Qiuhong Ke, Hossein Rahmani, James Bailey, Jun Liu | IGFormer: Interaction Graph Transformer for Skeleton-based Human
Interaction Recognition | Accepted by ECCV 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human interaction recognition is very important in many applications. One
crucial cue in recognizing an interaction is the interactive body parts. In
this work, we propose a novel Interaction Graph Transformer (IGFormer) network
for skeleton-based interaction recognition via modeling the interactive body
parts as gra... | [
{
"created": "Mon, 25 Jul 2022 12:11:15 GMT",
"version": "v1"
}
] | 2022-07-26 | [
[
"Pang",
"Yunsheng",
""
],
[
"Ke",
"Qiuhong",
""
],
[
"Rahmani",
"Hossein",
""
],
[
"Bailey",
"James",
""
],
[
"Liu",
"Jun",
""
]
] | Human interaction recognition is very important in many applications. One crucial cue in recognizing an interaction is the interactive body parts. In this work, we propose a novel Interaction Graph Transformer (IGFormer) network for skeleton-based interaction recognition via modeling the interactive body parts as graph... |
2102.13089 | Clare Lyle | Clare Lyle, Mark Rowland, Georg Ostrovski, Will Dabney | On The Effect of Auxiliary Tasks on Representation Dynamics | AISTATS 2021 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | While auxiliary tasks play a key role in shaping the representations learnt
by reinforcement learning agents, much is still unknown about the mechanisms
through which this is achieved. This work develops our understanding of the
relationship between auxiliary tasks, environment structure, and
representations by analy... | [
{
"created": "Thu, 25 Feb 2021 18:56:11 GMT",
"version": "v1"
}
] | 2021-02-26 | [
[
"Lyle",
"Clare",
""
],
[
"Rowland",
"Mark",
""
],
[
"Ostrovski",
"Georg",
""
],
[
"Dabney",
"Will",
""
]
] | While auxiliary tasks play a key role in shaping the representations learnt by reinforcement learning agents, much is still unknown about the mechanisms through which this is achieved. This work develops our understanding of the relationship between auxiliary tasks, environment structure, and representations by analysi... |
2304.02108 | David M Berry | David M. Berry | Explanatory Publics: Explainability and Democratic Thought | 22 pages | in Balaskas, B. and Rito, C. (Eds.) Fabricating Publics: The
Dissemination of Culture in the Post-truth Era, Open Humanities Press | null | null | cs.CY | http://creativecommons.org/licenses/by-sa/4.0/ | In order to legitimate and defend democratic politics under conditions of
computational capital, my aim is to contribute a notion of what I am calling
explanatory publics. I will explore what is at stake when we question the
social and political effects of the disruptive technologies, networks and
values that are hid... | [
{
"created": "Tue, 4 Apr 2023 20:25:13 GMT",
"version": "v1"
}
] | 2023-04-06 | [
[
"Berry",
"David M.",
""
]
] | In order to legitimate and defend democratic politics under conditions of computational capital, my aim is to contribute a notion of what I am calling explanatory publics. I will explore what is at stake when we question the social and political effects of the disruptive technologies, networks and values that are hidde... |
2105.11119 | Hongyu Gong | Hongyu Gong, Alberto Valido, Katherine M. Ingram, Giulia Fanti, Suma
Bhat, Dorothy L. Espelage | Abusive Language Detection in Heterogeneous Contexts: Dataset Collection
and the Role of Supervised Attention | AAAI 2021 (AI for Social Impact track) | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Abusive language is a massive problem in online social platforms. Existing
abusive language detection techniques are particularly ill-suited to comments
containing heterogeneous abusive language patterns, i.e., both abusive and
non-abusive parts. This is due in part to the lack of datasets that explicitly
annotate he... | [
{
"created": "Mon, 24 May 2021 06:50:19 GMT",
"version": "v1"
}
] | 2021-05-25 | [
[
"Gong",
"Hongyu",
""
],
[
"Valido",
"Alberto",
""
],
[
"Ingram",
"Katherine M.",
""
],
[
"Fanti",
"Giulia",
""
],
[
"Bhat",
"Suma",
""
],
[
"Espelage",
"Dorothy L.",
""
]
] | Abusive language is a massive problem in online social platforms. Existing abusive language detection techniques are particularly ill-suited to comments containing heterogeneous abusive language patterns, i.e., both abusive and non-abusive parts. This is due in part to the lack of datasets that explicitly annotate hete... |
1306.3551 | Justus Piater | Michael Zillich, Maren Bennewitz, Maria Fox, Justus Piater, Dejan
Pangercic | Proceedings of the 2nd Workshop on Robots in Clutter: Preparing robots
for the real world (Berlin, 2013) | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This volume represents the proceedings of the 2nd Workshop on Robots in
Clutter: Preparing robots for the real world, held June 27, 2013, at the
Robotics: Science and Systems conference in Berlin, Germany.
| [
{
"created": "Sat, 15 Jun 2013 07:14:19 GMT",
"version": "v1"
}
] | 2013-06-18 | [
[
"Zillich",
"Michael",
""
],
[
"Bennewitz",
"Maren",
""
],
[
"Fox",
"Maria",
""
],
[
"Piater",
"Justus",
""
],
[
"Pangercic",
"Dejan",
""
]
] | This volume represents the proceedings of the 2nd Workshop on Robots in Clutter: Preparing robots for the real world, held June 27, 2013, at the Robotics: Science and Systems conference in Berlin, Germany. |
1804.02813 | Takumi Ichimura | Takumi Ichimura, Kosuke Tanabe, Toshiyuki Yamashita | An Adaptive Learning Method of Personality Trait Based Mood in Mental
State Transition Network by Recurrent Neural Network | 6 pages, 9 figures, Proc. of IEEE 7th International Workshop on
Computational Intelligence and Applications (IWCIA2014) | null | 10.1109/IWCIA.2014.6988081 | null | cs.HC cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mental State Transition Network (MSTN) is a basic concept of approximating to
human psychological and mental responses. A stimulus calculated by Emotion
Generating Calculations (EGC) method can cause the transition of mood from an
emotional state to others. In this paper, the agent can interact with human to
realize ... | [
{
"created": "Mon, 9 Apr 2018 04:41:27 GMT",
"version": "v1"
}
] | 2018-04-10 | [
[
"Ichimura",
"Takumi",
""
],
[
"Tanabe",
"Kosuke",
""
],
[
"Yamashita",
"Toshiyuki",
""
]
] | Mental State Transition Network (MSTN) is a basic concept of approximating to human psychological and mental responses. A stimulus calculated by Emotion Generating Calculations (EGC) method can cause the transition of mood from an emotional state to others. In this paper, the agent can interact with human to realize sm... |
1412.3507 | Ilan Cohen | Yossi Azar and Ilan Reuven Cohen and Debmalya Panigrahi | Online Covering with Convex Objectives and Applications | null | null | null | null | cs.DS cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give an algorithmic framework for minimizing general convex objectives
(that are differentiable and monotone non-decreasing) over a set of covering
constraints that arrive online. This substantially extends previous work on
online covering for linear objectives (Alon {\em et al.}, STOC 2003) and online
covering wi... | [
{
"created": "Thu, 11 Dec 2014 00:35:03 GMT",
"version": "v1"
}
] | 2014-12-12 | [
[
"Azar",
"Yossi",
""
],
[
"Cohen",
"Ilan Reuven",
""
],
[
"Panigrahi",
"Debmalya",
""
]
] | We give an algorithmic framework for minimizing general convex objectives (that are differentiable and monotone non-decreasing) over a set of covering constraints that arrive online. This substantially extends previous work on online covering for linear objectives (Alon {\em et al.}, STOC 2003) and online covering with... |
2210.16294 | Jayesh Gupta | Jayesh K. Gupta, Sai Vemprala, Ashish Kapoor | Learning Modular Simulations for Homogeneous Systems | First two authors contributed equally. Accepted at NeurIPS 2022 | null | null | null | cs.LG cs.MA | http://creativecommons.org/licenses/by-sa/4.0/ | Complex systems are often decomposed into modular subsystems for engineering
tractability. Although various equation based white-box modeling techniques
make use of such structure, learning based methods have yet to incorporate
these ideas broadly. We present a modular simulation framework for modeling
homogeneous mu... | [
{
"created": "Fri, 28 Oct 2022 17:48:01 GMT",
"version": "v1"
}
] | 2022-10-31 | [
[
"Gupta",
"Jayesh K.",
""
],
[
"Vemprala",
"Sai",
""
],
[
"Kapoor",
"Ashish",
""
]
] | Complex systems are often decomposed into modular subsystems for engineering tractability. Although various equation based white-box modeling techniques make use of such structure, learning based methods have yet to incorporate these ideas broadly. We present a modular simulation framework for modeling homogeneous mult... |
2401.02143 | Cheng-Te Li | Cheng-Te Li, Yu-Che Tsai, Chih-Yao Chen, Jay Chiehen Liao | Graph Neural Networks for Tabular Data Learning: A Survey with Taxonomy
and Directions | Under review, ongoing work, Github page:
https://github.com/Roytsai27/awesome-GNN4TDL | null | null | null | cs.LG cs.AI cs.IR cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this survey, we dive into Tabular Data Learning (TDL) using Graph Neural
Networks (GNNs), a domain where deep learning-based approaches have
increasingly shown superior performance in both classification and regression
tasks compared to traditional methods. The survey highlights a critical gap in
deep neural TDL m... | [
{
"created": "Thu, 4 Jan 2024 08:49:10 GMT",
"version": "v1"
}
] | 2024-01-05 | [
[
"Li",
"Cheng-Te",
""
],
[
"Tsai",
"Yu-Che",
""
],
[
"Chen",
"Chih-Yao",
""
],
[
"Liao",
"Jay Chiehen",
""
]
] | In this survey, we dive into Tabular Data Learning (TDL) using Graph Neural Networks (GNNs), a domain where deep learning-based approaches have increasingly shown superior performance in both classification and regression tasks compared to traditional methods. The survey highlights a critical gap in deep neural TDL met... |
2110.07209 | Shen Liu | Shen Liu, Meirong Ma, Hao Yuan, Jianchao Zhu, Yuanbin Wu, Man Lan | A Dual-Attention Neural Network for Pun Location and Using Pun-Gloss
Pairs for Interpretation | null | NLPCC 2021 | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Pun location is to identify the punning word (usually a word or a phrase that
makes the text ambiguous) in a given short text, and pun interpretation is to
find out two different meanings of the punning word. Most previous studies
adopt limited word senses obtained by WSD(Word Sense Disambiguation) technique
or pronu... | [
{
"created": "Thu, 14 Oct 2021 08:15:04 GMT",
"version": "v1"
}
] | 2021-10-15 | [
[
"Liu",
"Shen",
""
],
[
"Ma",
"Meirong",
""
],
[
"Yuan",
"Hao",
""
],
[
"Zhu",
"Jianchao",
""
],
[
"Wu",
"Yuanbin",
""
],
[
"Lan",
"Man",
""
]
] | Pun location is to identify the punning word (usually a word or a phrase that makes the text ambiguous) in a given short text, and pun interpretation is to find out two different meanings of the punning word. Most previous studies adopt limited word senses obtained by WSD(Word Sense Disambiguation) technique or pronunc... |
1811.07358 | Ankur Kulkarni | Sharu Theresa Jose and Ankur A. Kulkarni | Shannon meets von Neumann: A Minimax Theorem for Channel Coding in the
Presence of a Jammer | Submitted to the IEEE Transactions on Information Theory | null | null | null | cs.IT cs.GT cs.SY math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the setting of channel coding over a family of channels whose state
is controlled by an adversarial jammer by viewing it as a zero-sum game between
a finite blocklength encoder-decoder team, and the jammer. The encoder-decoder
team choose stochastic encoding and decoding strategies to minimize the average
pr... | [
{
"created": "Sun, 18 Nov 2018 17:15:36 GMT",
"version": "v1"
}
] | 2018-11-20 | [
[
"Jose",
"Sharu Theresa",
""
],
[
"Kulkarni",
"Ankur A.",
""
]
] | We study the setting of channel coding over a family of channels whose state is controlled by an adversarial jammer by viewing it as a zero-sum game between a finite blocklength encoder-decoder team, and the jammer. The encoder-decoder team choose stochastic encoding and decoding strategies to minimize the average prob... |
2210.04834 | Charith Peris | Charith Peris, Lizhen Tan, Thomas Gueudre, Turan Gojayev, Pan Wei,
Gokmen Oz | Knowledge Distillation Transfer Sets and their Impact on Downstream NLU
Tasks | 7 pages, 2 figures, 2 tables (+ 4 tables in Appendix), Accepted to
EMNLP 2022 (industry track) | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Teacher-student knowledge distillation is a popular technique for compressing
today's prevailing large language models into manageable sizes that fit
low-latency downstream applications. Both the teacher and the choice of
transfer set used for distillation are crucial ingredients in creating a high
quality student. Y... | [
{
"created": "Mon, 10 Oct 2022 16:49:52 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Oct 2022 14:25:43 GMT",
"version": "v2"
},
{
"created": "Mon, 17 Oct 2022 20:10:40 GMT",
"version": "v3"
}
] | 2022-10-19 | [
[
"Peris",
"Charith",
""
],
[
"Tan",
"Lizhen",
""
],
[
"Gueudre",
"Thomas",
""
],
[
"Gojayev",
"Turan",
""
],
[
"Wei",
"Pan",
""
],
[
"Oz",
"Gokmen",
""
]
] | Teacher-student knowledge distillation is a popular technique for compressing today's prevailing large language models into manageable sizes that fit low-latency downstream applications. Both the teacher and the choice of transfer set used for distillation are crucial ingredients in creating a high quality student. Yet... |
2308.09959 | Karl W\"ust | Karl W\"ust, Giacomo Giuliari, Markus Legner, Jean-Pierre Smith, Marc
Wyss, Jules Bachmann, Juan A. Garcia-Pardo, Adrian Perrig | Hummingbird: Fast, Flexible, and Fair Inter-Domain Bandwidth
Reservations | 20 pages, 15 figures | null | null | null | cs.NI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The current Internet lacks quality-of-service guarantees for real-time
applications like video calls and gaming, cloud-based systems, financial
transactions, telesurgery, and other remote applications that benefit from
reliable communication. To address this problem, this paper introduces
Hummingbird: a novel, lightw... | [
{
"created": "Sat, 19 Aug 2023 09:27:46 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Sep 2023 09:17:15 GMT",
"version": "v2"
},
{
"created": "Mon, 29 Jan 2024 14:12:04 GMT",
"version": "v3"
}
] | 2024-01-30 | [
[
"Wüst",
"Karl",
""
],
[
"Giuliari",
"Giacomo",
""
],
[
"Legner",
"Markus",
""
],
[
"Smith",
"Jean-Pierre",
""
],
[
"Wyss",
"Marc",
""
],
[
"Bachmann",
"Jules",
""
],
[
"Garcia-Pardo",
"Juan A.",
""
],
[... | The current Internet lacks quality-of-service guarantees for real-time applications like video calls and gaming, cloud-based systems, financial transactions, telesurgery, and other remote applications that benefit from reliable communication. To address this problem, this paper introduces Hummingbird: a novel, lightwei... |
2310.19091 | Unai Fischer Abaigar | Unai Fischer-Abaigar, Christoph Kern, Noam Barda and Frauke Kreuter | Bridging the Gap: Towards an Expanded Toolkit for ML-Supported
Decision-Making in the Public Sector | null | null | null | null | cs.LG cs.CY cs.HC stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine Learning (ML) systems are becoming instrumental in the public sector,
with applications spanning areas like criminal justice, social welfare,
financial fraud detection, and public health. While these systems offer great
potential benefits to institutional decision-making processes, such as improved
efficiency... | [
{
"created": "Sun, 29 Oct 2023 17:44:48 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Apr 2024 08:38:50 GMT",
"version": "v2"
}
] | 2024-04-29 | [
[
"Fischer-Abaigar",
"Unai",
""
],
[
"Kern",
"Christoph",
""
],
[
"Barda",
"Noam",
""
],
[
"Kreuter",
"Frauke",
""
]
] | Machine Learning (ML) systems are becoming instrumental in the public sector, with applications spanning areas like criminal justice, social welfare, financial fraud detection, and public health. While these systems offer great potential benefits to institutional decision-making processes, such as improved efficiency a... |
2007.16030 | Farbod Taymouri | Farbod Taymouri, Marcello La Rosa | Encoder-Decoder Generative Adversarial Nets for Suffix Generation and
Remaining Time Prediction of Business Process Models | arXiv admin note: substantial text overlap with arXiv:2003.11268 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes an encoder-decoder architecture grounded on Generative
Adversarial Networks (GANs), that generates a sequence of activities and their
timestamps in an end-to-end way. GANs work well with differentiable data such
as images. However, a suffix is a sequence of categorical items. To this end,
we use t... | [
{
"created": "Thu, 30 Jul 2020 03:39:17 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Oct 2020 09:49:24 GMT",
"version": "v2"
}
] | 2020-10-20 | [
[
"Taymouri",
"Farbod",
""
],
[
"La Rosa",
"Marcello",
""
]
] | This paper proposes an encoder-decoder architecture grounded on Generative Adversarial Networks (GANs), that generates a sequence of activities and their timestamps in an end-to-end way. GANs work well with differentiable data such as images. However, a suffix is a sequence of categorical items. To this end, we use the... |
1110.3655 | Jorge Silva L | Jorge Luiz e Silva and Joelmir Jose Lopes and Bruno de Abreu Silva and
Antonio Carlos Fernandes da Silva | Accelerating Algorithms using a Dataflow Graph in a Reconfigurable
System | 13 pages, 8 figures, 1 listing, 1 algorithm, 1 Table | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, the acceleration of algorithms using a design of a field
programmable gate array (FPGA) as a prototype of a static dataflow architecture
is discussed. The static dataflow architecture using operators interconnected
by parallel buses was implemented. Accelerating algorithms using a dataflow
graph in a r... | [
{
"created": "Mon, 17 Oct 2011 13:00:10 GMT",
"version": "v1"
}
] | 2015-03-13 | [
[
"Silva",
"Jorge Luiz e",
""
],
[
"Lopes",
"Joelmir Jose",
""
],
[
"Silva",
"Bruno de Abreu",
""
],
[
"da Silva",
"Antonio Carlos Fernandes",
""
]
] | In this paper, the acceleration of algorithms using a design of a field programmable gate array (FPGA) as a prototype of a static dataflow architecture is discussed. The static dataflow architecture using operators interconnected by parallel buses was implemented. Accelerating algorithms using a dataflow graph in a rec... |
2307.03823 | Sireesh Gururaja | Sireesh Gururaja, Ritam Dutt, Tinglong Liao, Carolyn Rose | Linguistic representations for fewer-shot relation extraction across
domains | ACL 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work has demonstrated the positive impact of incorporating linguistic
representations as additional context and scaffolding on the in-domain
performance of several NLP tasks. We extend this work by exploring the impact
of linguistic representations on cross-domain performance in a few-shot
transfer setting. An... | [
{
"created": "Fri, 7 Jul 2023 20:35:12 GMT",
"version": "v1"
}
] | 2023-07-11 | [
[
"Gururaja",
"Sireesh",
""
],
[
"Dutt",
"Ritam",
""
],
[
"Liao",
"Tinglong",
""
],
[
"Rose",
"Carolyn",
""
]
] | Recent work has demonstrated the positive impact of incorporating linguistic representations as additional context and scaffolding on the in-domain performance of several NLP tasks. We extend this work by exploring the impact of linguistic representations on cross-domain performance in a few-shot transfer setting. An i... |
1704.06942 | Diego Perez Liebana Dr. | Rauca D. Gaina and Simon M. Lucas and Diego Perez-Liebana | Population Seeding Techniques for Rolling Horizon Evolution in General
Video Game Playing | Proceedings of the IEEE Conference on Evolutionary Computation 2017 | null | null | null | cs.AI cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While Monte Carlo Tree Search and closely related methods have dominated
General Video Game Playing, recent research has demonstrated the promise of
Rolling Horizon Evolutionary Algorithms as an interesting alternative. However,
there is little attention paid to population initialization techniques in the
setting of ... | [
{
"created": "Sun, 23 Apr 2017 15:53:29 GMT",
"version": "v1"
}
] | 2017-04-25 | [
[
"Gaina",
"Rauca D.",
""
],
[
"Lucas",
"Simon M.",
""
],
[
"Perez-Liebana",
"Diego",
""
]
] | While Monte Carlo Tree Search and closely related methods have dominated General Video Game Playing, recent research has demonstrated the promise of Rolling Horizon Evolutionary Algorithms as an interesting alternative. However, there is little attention paid to population initialization techniques in the setting of ge... |
2109.12028 | Antonios Anastasopoulos | Fahim Faisal, Antonios Anastasopoulos | Investigating Post-pretraining Representation Alignment for
Cross-Lingual Question Answering | Accepted at MRQA Workshop 2021 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human knowledge is collectively encoded in the roughly 6500 languages spoken
around the world, but it is not distributed equally across languages. Hence,
for information-seeking question answering (QA) systems to adequately serve
speakers of all languages, they need to operate cross-lingually. In this work
we investi... | [
{
"created": "Fri, 24 Sep 2021 15:32:45 GMT",
"version": "v1"
}
] | 2021-09-27 | [
[
"Faisal",
"Fahim",
""
],
[
"Anastasopoulos",
"Antonios",
""
]
] | Human knowledge is collectively encoded in the roughly 6500 languages spoken around the world, but it is not distributed equally across languages. Hence, for information-seeking question answering (QA) systems to adequately serve speakers of all languages, they need to operate cross-lingually. In this work we investiga... |
1511.05888 | Nicole Schweikardt | Frederik Harwath (Goethe-Universit\~At Frankfurt am Main), Lucas
Heimberg (Humboldt-Universit\~At zu Berlin), Nicole Schweikardt
(Humboldt-Universit\~At zu Berlin) | Preservation and decomposition theorems for bounded degree structures | 42 pages and 3 figures. This is the full version of: Frederik
Harwath, Lucas Heimberg, and Nicole Schweikardt. Preservation and
decomposition theorems for bounded degree structures. In Joint Meeting of the
23rd EACSL Annual Conference on Computer Science Logic (CSL) and the 29th
Annual ACM/IEEE Symposium on Log... | Logical Methods in Computer Science, Volume 11, Issue 4 (December
29, 2015) lmcs:1618 | 10.2168/LMCS-11(4:17)2015 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide elementary algorithms for two preservation theorems for
first-order sentences (FO) on the class \^ad of all finite structures of degree
at most d: For each FO-sentence that is preserved under extensions
(homomorphisms) on \^ad, a \^ad-equivalent existential (existential-positive)
FO-sentence can be constru... | [
{
"created": "Wed, 18 Nov 2015 17:25:28 GMT",
"version": "v1"
},
{
"created": "Sun, 27 Dec 2015 19:38:36 GMT",
"version": "v2"
}
] | 2017-01-11 | [
[
"Harwath",
"Frederik",
"",
"Goethe-UniversitÃt Frankfurt am Main"
],
[
"Heimberg",
"Lucas",
"",
"Humboldt-UniversitÃt zu Berlin"
],
[
"Schweikardt",
"Nicole",
"",
"Humboldt-UniversitÃt zu Berlin"
]
] | We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a \^ad-equivalent existential (existential-positive) FO-sentence can be construct... |
2007.05811 | Ruslan Morozov | Ruslan Morozov | Efficient List Decoding of Convolutional Polar Codes | 10 pages, 6 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An efficient implementation of min-sum SC/list decoding of convolutional
polar codes is proposed. The complexity of the proposed implementation of SC
decoding is more than two times smaller than the straightforward
implementation. Moreover, the proposed list decoding algorithm does not require
to copy any LLRs during... | [
{
"created": "Sat, 11 Jul 2020 16:40:07 GMT",
"version": "v1"
}
] | 2020-07-14 | [
[
"Morozov",
"Ruslan",
""
]
] | An efficient implementation of min-sum SC/list decoding of convolutional polar codes is proposed. The complexity of the proposed implementation of SC decoding is more than two times smaller than the straightforward implementation. Moreover, the proposed list decoding algorithm does not require to copy any LLRs during d... |
1805.06515 | Michael Gastpar | Krishnan Eswaran and Michael Gastpar | Remote Source Coding under Gaussian Noise : Dueling Roles of Power and
Entropy Power | null | null | 10.1109/TIT.2019.2897842 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The distributed remote source coding (so-called CEO) problem is studied in
the case where the underlying source, not necessarily Gaussian, has finite
differential entropy and the observation noise is Gaussian. The main result is
a new lower bound for the sum-rate-distortion function under arbitrary
distortion measure... | [
{
"created": "Wed, 16 May 2018 20:37:31 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Feb 2019 14:30:59 GMT",
"version": "v2"
}
] | 2019-02-08 | [
[
"Eswaran",
"Krishnan",
""
],
[
"Gastpar",
"Michael",
""
]
] | The distributed remote source coding (so-called CEO) problem is studied in the case where the underlying source, not necessarily Gaussian, has finite differential entropy and the observation noise is Gaussian. The main result is a new lower bound for the sum-rate-distortion function under arbitrary distortion measures.... |
1903.02852 | Thomas Drugman | Thomas Drugman, Janne Pylkkonen, Reinhard Kneser | Active and Semi-Supervised Learning in ASR: Benefits on the Acoustic and
Language Models | null | Interspeech, pp. 2318-2322, 2016 | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of this paper is to simulate the benefits of jointly applying active
learning (AL) and semi-supervised training (SST) in a new speech recognition
application. Our data selection approach relies on confidence filtering, and
its impact on both the acoustic and language models (AM and LM) is studied.
While AL i... | [
{
"created": "Thu, 7 Mar 2019 11:38:36 GMT",
"version": "v1"
}
] | 2019-03-08 | [
[
"Drugman",
"Thomas",
""
],
[
"Pylkkonen",
"Janne",
""
],
[
"Kneser",
"Reinhard",
""
]
] | The goal of this paper is to simulate the benefits of jointly applying active learning (AL) and semi-supervised training (SST) in a new speech recognition application. Our data selection approach relies on confidence filtering, and its impact on both the acoustic and language models (AM and LM) is studied. While AL is ... |
2401.08661 | Di Chen | Di Chen, Hao Li, Zhicheng Jin, Huizhao Tu and Meixin Zhu | Risk-anticipatory autonomous driving strategies considering vehicles'
weights, based on hierarchical deep reinforcement learning | 14 pages, 5 figures, 6 tables | null | null | null | cs.RO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autonomous vehicles (AVs) have the potential to prevent accidents caused by
drivers errors and reduce road traffic risks. Due to the nature of heavy
vehicles, whose collisions cause more serious crashes, the weights of vehicles
need to be considered when making driving strategies aimed at reducing the
potential risks... | [
{
"created": "Wed, 27 Dec 2023 06:03:34 GMT",
"version": "v1"
},
{
"created": "Tue, 7 May 2024 07:07:59 GMT",
"version": "v2"
}
] | 2024-05-08 | [
[
"Chen",
"Di",
""
],
[
"Li",
"Hao",
""
],
[
"Jin",
"Zhicheng",
""
],
[
"Tu",
"Huizhao",
""
],
[
"Zhu",
"Meixin",
""
]
] | Autonomous vehicles (AVs) have the potential to prevent accidents caused by drivers errors and reduce road traffic risks. Due to the nature of heavy vehicles, whose collisions cause more serious crashes, the weights of vehicles need to be considered when making driving strategies aimed at reducing the potential risks a... |
2108.02113 | Hao Wang | Hao Wang, Yue Deng, Linyuan L\"u, Guanrong Chen | Hyperparameter-free and Explainable Whole Graph Embedding | null | null | null | null | cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graphs can be used to describe complex systems. Recently, whole graph
embedding (graph representation learning) can compress a graph into a compact
lower-dimension vector while preserving intrinsic properties, earning much
attention. However, most graph embedding methods have problems such as tedious
parameter tuning... | [
{
"created": "Wed, 4 Aug 2021 15:30:52 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Aug 2021 06:21:42 GMT",
"version": "v2"
},
{
"created": "Sun, 6 Feb 2022 16:25:37 GMT",
"version": "v3"
}
] | 2022-02-08 | [
[
"Wang",
"Hao",
""
],
[
"Deng",
"Yue",
""
],
[
"Lü",
"Linyuan",
""
],
[
"Chen",
"Guanrong",
""
]
] | Graphs can be used to describe complex systems. Recently, whole graph embedding (graph representation learning) can compress a graph into a compact lower-dimension vector while preserving intrinsic properties, earning much attention. However, most graph embedding methods have problems such as tedious parameter tuning o... |
2307.01209 | Zhibai Jia | Zhibai Jia | Multi-Dialectal Representation Learning of Sinitic Phonology | Accepted by ACL 2023 Student Research Workshop | null | null | null | cs.CL cs.LG cs.SI | http://creativecommons.org/licenses/by/4.0/ | Machine learning techniques have shown their competence for representing and
reasoning in symbolic systems such as language and phonology. In Sinitic
Historical Phonology, notable tasks that could benefit from machine learning
include the comparison of dialects and reconstruction of proto-languages
systems. Motivated... | [
{
"created": "Fri, 30 Jun 2023 02:37:25 GMT",
"version": "v1"
}
] | 2023-07-06 | [
[
"Jia",
"Zhibai",
""
]
] | Machine learning techniques have shown their competence for representing and reasoning in symbolic systems such as language and phonology. In Sinitic Historical Phonology, notable tasks that could benefit from machine learning include the comparison of dialects and reconstruction of proto-languages systems. Motivated b... |
1406.5759 | Abm Moniruzzaman | A B M Moniruzzaman, Kawser Wazed Nafi and Syed Akther Hossain | An Experimental Study of Load Balancing of OpenNebula Open-Source Cloud
Computing Platform | 6 pages | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cloud Computing is becoming a viable computing solution for services oriented
computing. Several open-source cloud solutions are available to these supports.
Open-source software stacks offer a huge amount of customizability without huge
licensing fees. As a result, open source software are widely used for designing
... | [
{
"created": "Sun, 22 Jun 2014 20:40:07 GMT",
"version": "v1"
}
] | 2014-06-24 | [
[
"Moniruzzaman",
"A B M",
""
],
[
"Nafi",
"Kawser Wazed",
""
],
[
"Hossain",
"Syed Akther",
""
]
] | Cloud Computing is becoming a viable computing solution for services oriented computing. Several open-source cloud solutions are available to these supports. Open-source software stacks offer a huge amount of customizability without huge licensing fees. As a result, open source software are widely used for designing cl... |
cs/0010031 | Ming-Yang Kao | Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, and Ming-Yang Kao | Opportunity Cost Algorithms for Combinatorial Auctions | null | null | null | DIMACS TR 2000-27 | cs.CE cs.DS | null | Two general algorithms based on opportunity costs are given for approximating
a revenue-maximizing set of bids an auctioneer should accept, in a
combinatorial auction in which each bidder offers a price for some subset of
the available goods and the auctioneer can only accept non-intersecting bids.
Since this problem... | [
{
"created": "Tue, 24 Oct 2000 17:14:01 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Akcoglu",
"Karhan",
""
],
[
"Aspnes",
"James",
""
],
[
"DasGupta",
"Bhaskar",
""
],
[
"Kao",
"Ming-Yang",
""
]
] | Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each bidder offers a price for some subset of the available goods and the auctioneer can only accept non-intersecting bids. Since this problem i... |
2201.01800 | Claudio Fantinuoli | Claudio Fantinuoli, Giulia Marchesini, David Landan, Lukas Horak | KUDO Interpreter Assist: Automated Real-time Support for Remote
Interpretation | Accepted at TC43 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | High-quality human interpretation requires linguistic and factual preparation
as well as the ability to retrieve information in real-time. This situation
becomes particularly relevant in the context of remote simultaneous
interpreting (RSI) where time-to-event may be short, posing new challenges to
professional inter... | [
{
"created": "Wed, 5 Jan 2022 19:38:06 GMT",
"version": "v1"
}
] | 2022-01-07 | [
[
"Fantinuoli",
"Claudio",
""
],
[
"Marchesini",
"Giulia",
""
],
[
"Landan",
"David",
""
],
[
"Horak",
"Lukas",
""
]
] | High-quality human interpretation requires linguistic and factual preparation as well as the ability to retrieve information in real-time. This situation becomes particularly relevant in the context of remote simultaneous interpreting (RSI) where time-to-event may be short, posing new challenges to professional interpr... |
0911.2900 | Tobias Kretz | Tobias Kretz | Computation Speed of the F.A.S.T. Model | Accepted as contribution to "Traffic and Granular Flow 2009"
proceedings. This is a slightly extended version | null | null | null | cs.MA physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The F.A.S.T. model for microscopic simulation of pedestrians was formulated
with the idea of parallelizability and small computation times in general in
mind, but so far it was never demonstrated, if it can in fact be implemented
efficiently for execution on a multi-core or multi-CPU system. In this
contribution resu... | [
{
"created": "Sun, 15 Nov 2009 18:09:08 GMT",
"version": "v1"
}
] | 2010-01-20 | [
[
"Kretz",
"Tobias",
""
]
] | The F.A.S.T. model for microscopic simulation of pedestrians was formulated with the idea of parallelizability and small computation times in general in mind, but so far it was never demonstrated, if it can in fact be implemented efficiently for execution on a multi-core or multi-CPU system. In this contribution result... |
2309.00381 | Nick Brown | Nick Brown, Maurice Jamieson, Joseph Lee, Paul Wang | Is RISC-V ready for HPC prime-time: Evaluating the 64-core Sophon SG2042
RISC-V CPU | Author accepted version of paper in ACM Workshops of The
International Conference on High Performance Computing, Network, Storage, and
Analysis (SC-W 2023) | null | 10.1145/3624062.3624234 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Sophon SG2042 is the world's first commodity 64-core RISC-V CPU for high
performance workloads and an important question is whether the SG2042 has the
potential to encourage the HPC community to embrace RISC-V.
In this paper we undertaking a performance exploration of the SG2042 against
existing RISC-V hardware... | [
{
"created": "Fri, 1 Sep 2023 10:35:32 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Oct 2023 08:52:10 GMT",
"version": "v2"
}
] | 2023-10-04 | [
[
"Brown",
"Nick",
""
],
[
"Jamieson",
"Maurice",
""
],
[
"Lee",
"Joseph",
""
],
[
"Wang",
"Paul",
""
]
] | The Sophon SG2042 is the world's first commodity 64-core RISC-V CPU for high performance workloads and an important question is whether the SG2042 has the potential to encourage the HPC community to embrace RISC-V. In this paper we undertaking a performance exploration of the SG2042 against existing RISC-V hardware and... |
1206.2656 | Couvreur Alain | Alain Couvreur, Nicolas Delfosse, Gilles Z\'emor | A Construction of Quantum LDPC Codes from Cayley Graphs | The material in this paper was presented in part at ISIT 2011. This
article is published in IEEE Transactions on Information Theory. We point out
that the second step of the proof of Proposition VI.2 in the published
version (Proposition 25 in the present version and Proposition 18 in the ISIT
extended abstract... | IEEE Trans. Inform. Theory. 59(9). 6087-6098. 2013 | null | null | cs.IT math.CO math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison
and Shokrollahi. It is based on the Cayley graph of Fn together with a set of
generators regarded as the columns of the parity-check matrix of a classical
code. We give a general lower bound on the minimum distance of the Quantum code
in $\ma... | [
{
"created": "Tue, 12 Jun 2012 20:11:53 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Feb 2013 12:48:38 GMT",
"version": "v2"
},
{
"created": "Tue, 17 Dec 2013 16:12:19 GMT",
"version": "v3"
}
] | 2013-12-18 | [
[
"Couvreur",
"Alain",
""
],
[
"Delfosse",
"Nicolas",
""
],
[
"Zémor",
"Gilles",
""
]
] | We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the columns of the parity-check matrix of a classical code. We give a general lower bound on the minimum distance of the Quantum code in $\math... |
2401.14428 | Asif Ali Khan | Asif Ali Khan, Jo\~ao Paulo C. De Lima, Hamid Farzaneh, Jeronimo
Castrillon | The Landscape of Compute-near-memory and Compute-in-memory: A Research
and Commercial Overview | null | null | null | null | cs.AR | http://creativecommons.org/licenses/by/4.0/ | In today's data-centric world, where data fuels numerous application domains,
with machine learning at the forefront, handling the enormous volume of data
efficiently in terms of time and energy presents a formidable challenge.
Conventional computing systems and accelerators are continually being pushed to
their limi... | [
{
"created": "Wed, 24 Jan 2024 11:40:17 GMT",
"version": "v1"
}
] | 2024-01-29 | [
[
"Khan",
"Asif Ali",
""
],
[
"De Lima",
"João Paulo C.",
""
],
[
"Farzaneh",
"Hamid",
""
],
[
"Castrillon",
"Jeronimo",
""
]
] | In today's data-centric world, where data fuels numerous application domains, with machine learning at the forefront, handling the enormous volume of data efficiently in terms of time and energy presents a formidable challenge. Conventional computing systems and accelerators are continually being pushed to their limits... |
2011.14995 | Edgar Fajardo | Edgar Fajardo, Frank Wuerthwein, Brian Bockelman, Miron Livny, Greg
Thain, James Alexander Clark, Peter Couvares and Josh Willis | Adapting LIGO workflows to run in the Open Science Grid | null | null | null | null | cs.DC physics.comp-ph | http://creativecommons.org/licenses/by/4.0/ | During the first observation run the LIGO collaboration needed to offload
some of its most, intense CPU workflows from its dedicated computing sites to
opportunistic resources. Open Science Grid enabled LIGO to run PyCbC, RIFT and
Bayeswave workflows to seamlessly run in a combination of owned and
opportunistic resou... | [
{
"created": "Mon, 30 Nov 2020 17:02:38 GMT",
"version": "v1"
}
] | 2020-12-01 | [
[
"Fajardo",
"Edgar",
""
],
[
"Wuerthwein",
"Frank",
""
],
[
"Bockelman",
"Brian",
""
],
[
"Livny",
"Miron",
""
],
[
"Thain",
"Greg",
""
],
[
"Clark",
"James Alexander",
""
],
[
"Couvares",
"Peter",
""
],
... | During the first observation run the LIGO collaboration needed to offload some of its most, intense CPU workflows from its dedicated computing sites to opportunistic resources. Open Science Grid enabled LIGO to run PyCbC, RIFT and Bayeswave workflows to seamlessly run in a combination of owned and opportunistic resourc... |
1005.1497 | Shekhar Chandra | Shekhar S. Chandra | Fast Digital Convolutions using Bit-Shifts | 4 pages, 2 figures, submitted to IEEE Signal Processing Letters | null | null | null | cs.NA cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An exact, one-to-one transform is presented that not only allows digital
circular convolutions, but is free from multiplications and quantisation errors
for transform lengths of arbitrary powers of two. The transform is analogous to
the Discrete Fourier Transform, with the canonical harmonics replaced by a set
of cyc... | [
{
"created": "Mon, 10 May 2010 11:28:50 GMT",
"version": "v1"
}
] | 2010-05-11 | [
[
"Chandra",
"Shekhar S.",
""
]
] | An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the Discrete Fourier Transform, with the canonical harmonics replaced by a set of cycli... |
1002.0411 | Dakshina Ranjan Kisku | Dakshina Ranjan Kisku, Ajita Rattani, Enrico Grosso, Massimo
Tistarelli | Face Identification by SIFT-based Complete Graph Topology | 6 pages, 7 figures, AutoId 2007 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/3.0/ | This paper presents a new face identification system based on Graph Matching
Technique on SIFT features extracted from face images. Although SIFT features
have been successfully used for general object detection and recognition, only
recently they were applied to face recognition. This paper further investigates
the ... | [
{
"created": "Tue, 2 Feb 2010 08:00:33 GMT",
"version": "v1"
}
] | 2010-02-03 | [
[
"Kisku",
"Dakshina Ranjan",
""
],
[
"Rattani",
"Ajita",
""
],
[
"Grosso",
"Enrico",
""
],
[
"Tistarelli",
"Massimo",
""
]
] | This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully used for general object detection and recognition, only recently they were applied to face recognition. This paper further investigates the pe... |
cs/0104006 | Menno van Zaanen | Menno van Zaanen | ABL: Alignment-Based Learning | 7 pages | Proceedings of the 18th International Conference on Computational
Linguistics (COLING); Saarbrucken, Germany. pages 961-967 | null | null | cs.LG cs.CL | null | This paper introduces a new type of grammar learning algorithm, inspired by
string edit distance (Wagner and Fischer, 1974). The algorithm takes a corpus
of flat sentences as input and returns a corpus of labelled, bracketed
sentences. The method works on pairs of unstructured sentences that have one or
more words in... | [
{
"created": "Tue, 3 Apr 2001 14:20:26 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"van Zaanen",
"Menno",
""
]
] | This paper introduces a new type of grammar learning algorithm, inspired by string edit distance (Wagner and Fischer, 1974). The algorithm takes a corpus of flat sentences as input and returns a corpus of labelled, bracketed sentences. The method works on pairs of unstructured sentences that have one or more words in c... |
2209.11910 | Bin Wang | Bin Wang, Chen Zhang, Chengwei Wei, Haizhou Li | A Focused Study on Sequence Length for Dialogue Summarization | Preprint version - ICASSP submission | null | null | null | cs.CL cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Output length is critical to dialogue summarization systems. The dialogue
summary length is determined by multiple factors, including dialogue
complexity, summary objective, and personal preferences. In this work, we
approach dialogue summary length from three perspectives. First, we analyze the
length differences be... | [
{
"created": "Sat, 24 Sep 2022 02:49:48 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Oct 2022 03:55:03 GMT",
"version": "v2"
}
] | 2022-10-28 | [
[
"Wang",
"Bin",
""
],
[
"Zhang",
"Chen",
""
],
[
"Wei",
"Chengwei",
""
],
[
"Li",
"Haizhou",
""
]
] | Output length is critical to dialogue summarization systems. The dialogue summary length is determined by multiple factors, including dialogue complexity, summary objective, and personal preferences. In this work, we approach dialogue summary length from three perspectives. First, we analyze the length differences betw... |
1902.06328 | Jinyong Hou | Jinyong Hou, Xuejie Ding, Jeremiah D. Deng, Stephen Cranefield | Unsupervised Domain Adaptation using Deep Networks with Cross-Grafted
Stacks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current deep domain adaptation methods used in computer vision have mainly
focused on learning discriminative and domain-invariant features across
different domains. In this paper, we present a novel approach that bridges the
domain gap by projecting the source and target domains into a common
association space throu... | [
{
"created": "Sun, 17 Feb 2019 21:29:06 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Mar 2019 02:25:47 GMT",
"version": "v2"
}
] | 2019-03-26 | [
[
"Hou",
"Jinyong",
""
],
[
"Ding",
"Xuejie",
""
],
[
"Deng",
"Jeremiah D.",
""
],
[
"Cranefield",
"Stephen",
""
]
] | Current deep domain adaptation methods used in computer vision have mainly focused on learning discriminative and domain-invariant features across different domains. In this paper, we present a novel approach that bridges the domain gap by projecting the source and target domains into a common association space through... |
1204.0844 | Abhishek Ghosh | Abhishek Ghosh, Sudhakar Pamarti | Mitigating Timing Errors in Time-Interleaved ADCs: a signal conditioning
approach | 4 pages, 4 figures, submitted to Mid-West Symposium on Circuits and
Systems, 2012 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Novel techniques based on signal-conditioning are presented to mitigate
timing errors in time-interleaved ADCs. A theoretical bound on the achievable
spurious signal content, on applying the techniques, is also derived.
Behavioral simulations corroborating the same are presented.
| [
{
"created": "Wed, 4 Apr 2012 01:32:23 GMT",
"version": "v1"
}
] | 2012-04-05 | [
[
"Ghosh",
"Abhishek",
""
],
[
"Pamarti",
"Sudhakar",
""
]
] | Novel techniques based on signal-conditioning are presented to mitigate timing errors in time-interleaved ADCs. A theoretical bound on the achievable spurious signal content, on applying the techniques, is also derived. Behavioral simulations corroborating the same are presented. |
2006.02692 | Egor Ershov I | E.I. Ershov, A.V. Belokopytov, A.V. Savchik | Problems of dataset creation for light source estimation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The paper describes our experience collecting a new dataset for the light
source estimation problem in a single image. The analysis of existing color
targets is presented along with various technical and scientific aspects
essential for data collection. The paper also contains an announcement of an
upcoming 2-nd Inte... | [
{
"created": "Thu, 4 Jun 2020 08:20:30 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Jun 2020 07:51:53 GMT",
"version": "v2"
}
] | 2020-06-08 | [
[
"Ershov",
"E. I.",
""
],
[
"Belokopytov",
"A. V.",
""
],
[
"Savchik",
"A. V.",
""
]
] | The paper describes our experience collecting a new dataset for the light source estimation problem in a single image. The analysis of existing color targets is presented along with various technical and scientific aspects essential for data collection. The paper also contains an announcement of an upcoming 2-nd Intern... |
1807.06574 | John Halloran | Rishabh Iyer, John T. Halloran, Kai Wei | Jensen: An Easily-Extensible C++ Toolkit for Production-Level Machine
Learning and Convex Optimization | null | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces Jensen, an easily extensible and scalable toolkit for
production-level machine learning and convex optimization. Jensen implements a
framework of convex (or loss) functions, convex optimization algorithms
(including Gradient Descent, L-BFGS, Stochastic Gradient Descent, Conjugate
Gradient, etc.)... | [
{
"created": "Tue, 17 Jul 2018 17:31:59 GMT",
"version": "v1"
}
] | 2018-07-18 | [
[
"Iyer",
"Rishabh",
""
],
[
"Halloran",
"John T.",
""
],
[
"Wei",
"Kai",
""
]
] | This paper introduces Jensen, an easily extensible and scalable toolkit for production-level machine learning and convex optimization. Jensen implements a framework of convex (or loss) functions, convex optimization algorithms (including Gradient Descent, L-BFGS, Stochastic Gradient Descent, Conjugate Gradient, etc.), ... |
1907.06840 | Kamil Khadiev | Kamil Khadiev, Ilnaz Mannapov and Liliya Safina | The Quantum Version Of Classification Decision Tree Constructing
Algorithm C5.0 | null | CEUR Workshop Proceedings, Volume 2500, paper 6, 2019 | null | null | cs.LG quant-ph stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the paper, we focus on complexity of C5.0 algorithm for constructing
decision tree classifier that is the models for the classification problem from
machine learning. In classical case the decision tree is constructed in
$O(hd(NM+N \log N))$ running time, where $M$ is a number of classes, $N$ is the
size of a trai... | [
{
"created": "Tue, 16 Jul 2019 04:53:48 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Khadiev",
"Kamil",
""
],
[
"Mannapov",
"Ilnaz",
""
],
[
"Safina",
"Liliya",
""
]
] | In the paper, we focus on complexity of C5.0 algorithm for constructing decision tree classifier that is the models for the classification problem from machine learning. In classical case the decision tree is constructed in $O(hd(NM+N \log N))$ running time, where $M$ is a number of classes, $N$ is the size of a traini... |
2306.12461 | Raul Ramos-Poll\'an | Ra\'ul Ramos-Poll\'an, Fabio A. Gonz\'alez | On-orbit model training for satellite imagery with label proportions | 16 pages, 13 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This work addresses the challenge of training supervised machine or deep
learning models on orbiting platforms where we are generally constrained by
limited on-board hardware capabilities and restricted uplink bandwidths to
upload. We aim at enabling orbiting spacecrafts to (1) continuously train a
lightweight model ... | [
{
"created": "Wed, 21 Jun 2023 12:16:36 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Dec 2023 00:48:37 GMT",
"version": "v2"
}
] | 2023-12-12 | [
[
"Ramos-Pollán",
"Raúl",
""
],
[
"González",
"Fabio A.",
""
]
] | This work addresses the challenge of training supervised machine or deep learning models on orbiting platforms where we are generally constrained by limited on-board hardware capabilities and restricted uplink bandwidths to upload. We aim at enabling orbiting spacecrafts to (1) continuously train a lightweight model as... |
2403.16964 | Tao Lu | Mulin Yu, Tao Lu, Linning Xu, Lihan Jiang, Yuanbo Xiangli, Bo Dai | GSDF: 3DGS Meets SDF for Improved Rendering and Reconstruction | Project page: https://city-super.github.io/GSDF | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Presenting a 3D scene from multiview images remains a core and long-standing
challenge in computer vision and computer graphics. Two main requirements lie
in rendering and reconstruction. Notably, SOTA rendering quality is usually
achieved with neural volumetric rendering techniques, which rely on aggregated
point/pr... | [
{
"created": "Mon, 25 Mar 2024 17:22:11 GMT",
"version": "v1"
}
] | 2024-03-26 | [
[
"Yu",
"Mulin",
""
],
[
"Lu",
"Tao",
""
],
[
"Xu",
"Linning",
""
],
[
"Jiang",
"Lihan",
""
],
[
"Xiangli",
"Yuanbo",
""
],
[
"Dai",
"Bo",
""
]
] | Presenting a 3D scene from multiview images remains a core and long-standing challenge in computer vision and computer graphics. Two main requirements lie in rendering and reconstruction. Notably, SOTA rendering quality is usually achieved with neural volumetric rendering techniques, which rely on aggregated point/prim... |
1407.0414 | Marc Toussaint | Marc Toussaint | Newton methods for k-order Markov Constrained Motion Problems | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This is a documentation of a framework for robot motion optimization that
aims to draw on classical constrained optimization methods. With one exception
the underlying algorithms are classical ones: Gauss-Newton (with adaptive step
size and damping), Augmented Lagrangian, log-barrier, etc. The exception is a
novel an... | [
{
"created": "Tue, 1 Jul 2014 21:45:48 GMT",
"version": "v1"
}
] | 2014-07-03 | [
[
"Toussaint",
"Marc",
""
]
] | This is a documentation of a framework for robot motion optimization that aims to draw on classical constrained optimization methods. With one exception the underlying algorithms are classical ones: Gauss-Newton (with adaptive step size and damping), Augmented Lagrangian, log-barrier, etc. The exception is a novel any-... |
2103.07554 | Florian Kreyssig | Adnan Haider and Chao Zhang and Florian L. Kreyssig and Philip C.
Woodland | A Distributed Optimisation Framework Combining Natural Gradient with
Hessian-Free for Discriminative Sequence Training | null | null | null | null | cs.LG cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel natural gradient and Hessian-free (NGHF)
optimisation framework for neural network training that can operate efficiently
in a distributed manner. It relies on the linear conjugate gradient (CG)
algorithm to combine the natural gradient (NG) method with local curvature
information from Hess... | [
{
"created": "Fri, 12 Mar 2021 22:18:34 GMT",
"version": "v1"
}
] | 2021-03-16 | [
[
"Haider",
"Adnan",
""
],
[
"Zhang",
"Chao",
""
],
[
"Kreyssig",
"Florian L.",
""
],
[
"Woodland",
"Philip C.",
""
]
] | This paper presents a novel natural gradient and Hessian-free (NGHF) optimisation framework for neural network training that can operate efficiently in a distributed manner. It relies on the linear conjugate gradient (CG) algorithm to combine the natural gradient (NG) method with local curvature information from Hessia... |
2311.02082 | Cedric Berger | Miguel AP Oliveira, Stephane Manara, Bruno Mol\'e, Thomas Muller,
Aur\'elien Guillouche, Lysann Hesske, Bruce Jordan, Gilles Hubert, Chinmay
Kulkarni, Pralipta Jagdev and Cedric R. Berger | Semantic Modelling of Organizational Knowledge as a Basis for Enterprise
Data Governance 4.0 -- Application to a Unified Clinical Data Model | null | null | null | null | cs.AI cs.IR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Individuals and organizations cope with an always-growing amount of data,
which is heterogeneous in its contents and formats. An adequate data management
process yielding data quality and control over its lifecycle is a prerequisite
to getting value out of this data and minimizing inherent risks related to
multiple u... | [
{
"created": "Fri, 20 Oct 2023 19:36:03 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Nov 2023 19:54:57 GMT",
"version": "v2"
},
{
"created": "Thu, 23 Nov 2023 21:30:39 GMT",
"version": "v3"
}
] | 2023-11-27 | [
[
"Oliveira",
"Miguel AP",
""
],
[
"Manara",
"Stephane",
""
],
[
"Molé",
"Bruno",
""
],
[
"Muller",
"Thomas",
""
],
[
"Guillouche",
"Aurélien",
""
],
[
"Hesske",
"Lysann",
""
],
[
"Jordan",
"Bruce",
""
],
... | Individuals and organizations cope with an always-growing amount of data, which is heterogeneous in its contents and formats. An adequate data management process yielding data quality and control over its lifecycle is a prerequisite to getting value out of this data and minimizing inherent risks related to multiple usa... |
1909.04002 | Charuta Pethe | Charuta Pethe, Steven Skiena | The Trumpiest Trump? Identifying a Subject's Most Characteristic Tweets | 11 pages, 4 figures. Accepted at EMNLP-IJCNLP 2019 as a long paper | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The sequence of documents produced by any given author varies in style and
content, but some documents are more typical or representative of the source
than others. We quantify the extent to which a given short text is
characteristic of a specific person, using a dataset of tweets from fifteen
celebrities. Such analy... | [
{
"created": "Mon, 9 Sep 2019 17:28:40 GMT",
"version": "v1"
}
] | 2019-09-10 | [
[
"Pethe",
"Charuta",
""
],
[
"Skiena",
"Steven",
""
]
] | The sequence of documents produced by any given author varies in style and content, but some documents are more typical or representative of the source than others. We quantify the extent to which a given short text is characteristic of a specific person, using a dataset of tweets from fifteen celebrities. Such analysi... |
1610.06294 | Wengu Chen | Wengu Chen and Yaling Li | The high order block RIP condition for signal recovery | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the recovery of block sparse signals, whose
nonzero entries appear in blocks (or clusters) rather than spread arbitrarily
throughout the signal, from incomplete linear measurement. A high order
sufficient condition based on block RIP is obtained to guarantee the stable
recovery of all block... | [
{
"created": "Thu, 20 Oct 2016 05:55:23 GMT",
"version": "v1"
}
] | 2016-10-21 | [
[
"Chen",
"Wengu",
""
],
[
"Li",
"Yaling",
""
]
] | In this paper, we consider the recovery of block sparse signals, whose nonzero entries appear in blocks (or clusters) rather than spread arbitrarily throughout the signal, from incomplete linear measurement. A high order sufficient condition based on block RIP is obtained to guarantee the stable recovery of all block s... |
2310.07132 | Youssef Mroueh | Apoorva Nitsure, Youssef Mroueh, Mattia Rigotti, Kristjan Greenewald,
Brian Belgodere, Mikhail Yurochkin, Jiri Navratil, Igor Melnyk, and Jerret
Ross | Risk Aware Benchmarking of Large Language Models | ICML 2024 | null | null | null | cs.LG math.ST q-fin.RM stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a distributional framework for benchmarking socio-technical risks
of foundation models with quantified statistical significance. Our approach
hinges on a new statistical relative testing based on first and second order
stochastic dominance of real random variables. We show that the second order
statistics ... | [
{
"created": "Wed, 11 Oct 2023 02:08:37 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Jan 2024 14:38:20 GMT",
"version": "v2"
},
{
"created": "Sun, 9 Jun 2024 18:26:34 GMT",
"version": "v3"
}
] | 2024-06-11 | [
[
"Nitsure",
"Apoorva",
""
],
[
"Mroueh",
"Youssef",
""
],
[
"Rigotti",
"Mattia",
""
],
[
"Greenewald",
"Kristjan",
""
],
[
"Belgodere",
"Brian",
""
],
[
"Yurochkin",
"Mikhail",
""
],
[
"Navratil",
"Jiri",
""... | We propose a distributional framework for benchmarking socio-technical risks of foundation models with quantified statistical significance. Our approach hinges on a new statistical relative testing based on first and second order stochastic dominance of real random variables. We show that the second order statistics in... |
2406.17196 | Barron Han | Barron Han, Oron Sabag, Victoria Kostina, Babak Hassibi | Coded Kalman Filtering over MIMO Gaussian Channels with Feedback | Accepted for presentation at the 2024 IEEE International Symposium on
Information Theory | null | null | null | cs.IT cs.SY eess.SY math.IT | http://creativecommons.org/licenses/by/4.0/ | We consider the problem of remotely stabilizing a linear dynamical system. In
this setting, a sensor co-located with the system communicates the system's
state to a controller over a noisy communication channel with feedback. The
objective of the controller (decoder) is to use the channel outputs to estimate
the vect... | [
{
"created": "Tue, 25 Jun 2024 00:54:09 GMT",
"version": "v1"
}
] | 2024-06-26 | [
[
"Han",
"Barron",
""
],
[
"Sabag",
"Oron",
""
],
[
"Kostina",
"Victoria",
""
],
[
"Hassibi",
"Babak",
""
]
] | We consider the problem of remotely stabilizing a linear dynamical system. In this setting, a sensor co-located with the system communicates the system's state to a controller over a noisy communication channel with feedback. The objective of the controller (decoder) is to use the channel outputs to estimate the vector... |
2205.12698 | Jo\~ao Sedoc | Damilola Omitaomu, Shabnam Tafreshi, Tingting Liu, Sven Buechel, Chris
Callison-Burch, Johannes Eichstaedt, Lyle Ungar, Jo\~ao Sedoc | Empathic Conversations: A Multi-level Dataset of Contextualized
Conversations | 21 pages | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Empathy is a cognitive and emotional reaction to an observed situation of
others. Empathy has recently attracted interest because it has numerous
applications in psychology and AI, but it is unclear how different forms of
empathy (e.g., self-report vs counterpart other-report, concern vs. distress)
interact with othe... | [
{
"created": "Wed, 25 May 2022 11:56:29 GMT",
"version": "v1"
}
] | 2022-05-26 | [
[
"Omitaomu",
"Damilola",
""
],
[
"Tafreshi",
"Shabnam",
""
],
[
"Liu",
"Tingting",
""
],
[
"Buechel",
"Sven",
""
],
[
"Callison-Burch",
"Chris",
""
],
[
"Eichstaedt",
"Johannes",
""
],
[
"Ungar",
"Lyle",
""
... | Empathy is a cognitive and emotional reaction to an observed situation of others. Empathy has recently attracted interest because it has numerous applications in psychology and AI, but it is unclear how different forms of empathy (e.g., self-report vs counterpart other-report, concern vs. distress) interact with other ... |
1908.09138 | Jiwei Li | Yuxian Meng, Xiaoya Li, Zijun Sun and Jiwei Li | Query-Based Named Entity Recognition | Please refer to the full version of this paper: A unified framework
for named entity recognition arXiv:1910.11476 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a new strategy for the task of named entity
recognition (NER). We cast the task as a query-based machine reading
comprehension task: e.g., the task of extracting entities with PER is
formalized as answering the question of "which person is mentioned in the text
?". Such a strategy comes with... | [
{
"created": "Sat, 24 Aug 2019 13:42:57 GMT",
"version": "v1"
},
{
"created": "Sat, 2 Nov 2019 15:12:22 GMT",
"version": "v2"
}
] | 2019-11-05 | [
[
"Meng",
"Yuxian",
""
],
[
"Li",
"Xiaoya",
""
],
[
"Sun",
"Zijun",
""
],
[
"Li",
"Jiwei",
""
]
] | In this paper, we propose a new strategy for the task of named entity recognition (NER). We cast the task as a query-based machine reading comprehension task: e.g., the task of extracting entities with PER is formalized as answering the question of "which person is mentioned in the text ?". Such a strategy comes with t... |
1910.04424 | Boris Ruf | Boris Ruf, Matteo Sammarco, Marcin Detyniecki | Contract Statements Knowledge Service for Chatbots | null | null | null | null | cs.AI cs.CL cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Towards conversational agents that are capable of handling more complex
questions on contractual conditions, formalizing contract statements in a
machine readable way is crucial. However, constructing a formal model which
captures the full scope of a contract proves difficult due to the overall
complexity its set of ... | [
{
"created": "Thu, 10 Oct 2019 08:25:42 GMT",
"version": "v1"
}
] | 2019-10-11 | [
[
"Ruf",
"Boris",
""
],
[
"Sammarco",
"Matteo",
""
],
[
"Detyniecki",
"Marcin",
""
]
] | Towards conversational agents that are capable of handling more complex questions on contractual conditions, formalizing contract statements in a machine readable way is crucial. However, constructing a formal model which captures the full scope of a contract proves difficult due to the overall complexity its set of ru... |
1907.01631 | Jeffrey Barratt | Jeffrey Barratt, Brian Zhang | Cache-Friendly Search Trees; or, In Which Everything Beats std::set | null | null | null | null | cs.DS cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While a lot of work in theoretical computer science has gone into optimizing
the runtime and space usage of data structures, such work very often neglects a
very important component of modern computers: the cache. In doing so, very
often, data structures are developed that achieve theoretically-good runtimes
but are ... | [
{
"created": "Tue, 2 Jul 2019 20:55:47 GMT",
"version": "v1"
}
] | 2019-07-04 | [
[
"Barratt",
"Jeffrey",
""
],
[
"Zhang",
"Brian",
""
]
] | While a lot of work in theoretical computer science has gone into optimizing the runtime and space usage of data structures, such work very often neglects a very important component of modern computers: the cache. In doing so, very often, data structures are developed that achieve theoretically-good runtimes but are sl... |
1611.04581 | Peter Jin | Peter H. Jin, Qiaochu Yuan, Forrest Iandola, Kurt Keutzer | How to scale distributed deep learning? | Extended version of paper accepted at ML Sys 2016 (at NIPS 2016) | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Training time on large datasets for deep neural networks is the principal
workflow bottleneck in a number of important applications of deep learning,
such as object classification and detection in automatic driver assistance
systems (ADAS). To minimize training time, the training of a deep neural
network must be scal... | [
{
"created": "Mon, 14 Nov 2016 20:59:54 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Jin",
"Peter H.",
""
],
[
"Yuan",
"Qiaochu",
""
],
[
"Iandola",
"Forrest",
""
],
[
"Keutzer",
"Kurt",
""
]
] | Training time on large datasets for deep neural networks is the principal workflow bottleneck in a number of important applications of deep learning, such as object classification and detection in automatic driver assistance systems (ADAS). To minimize training time, the training of a deep neural network must be scaled... |
1710.04908 | Meihao Chen | Meihao Chen, Zhuoru Lin, Kyunghyun Cho | Graph Convolutional Networks for Classification with a Structured Label
Space | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is a usual practice to ignore any structural information underlying
classes in multi-class classification. In this paper, we propose a graph
convolutional network (GCN) augmented neural network classifier to exploit a
known, underlying graph structure of labels. The proposed approach resembles an
(approximate) inf... | [
{
"created": "Thu, 12 Oct 2017 02:39:18 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Feb 2018 07:21:29 GMT",
"version": "v2"
}
] | 2018-02-23 | [
[
"Chen",
"Meihao",
""
],
[
"Lin",
"Zhuoru",
""
],
[
"Cho",
"Kyunghyun",
""
]
] | It is a usual practice to ignore any structural information underlying classes in multi-class classification. In this paper, we propose a graph convolutional network (GCN) augmented neural network classifier to exploit a known, underlying graph structure of labels. The proposed approach resembles an (approximate) infer... |
2309.06611 | Lennart Reiher | Jean-Pierre Busch, Lennart Reiher, Lutz Eckstein | Enabling the Deployment of Any-Scale Robotic Applications in
Microservice Architectures through Automated Containerization | 6 pages; Submitted to IEEE International Conference on Robotics and
Automation (ICRA) 2024 | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In an increasingly automated world -- from warehouse robots to self-driving
cars -- streamlining the development and deployment process and operations of
robotic applications becomes ever more important. Automated DevOps processes
and microservice architectures have already proven successful in other domains
such as ... | [
{
"created": "Tue, 12 Sep 2023 21:32:25 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Sep 2023 07:44:06 GMT",
"version": "v2"
}
] | 2023-09-18 | [
[
"Busch",
"Jean-Pierre",
""
],
[
"Reiher",
"Lennart",
""
],
[
"Eckstein",
"Lutz",
""
]
] | In an increasingly automated world -- from warehouse robots to self-driving cars -- streamlining the development and deployment process and operations of robotic applications becomes ever more important. Automated DevOps processes and microservice architectures have already proven successful in other domains such as la... |
2010.08146 | Wenbin Zhang | Wenbin Zhang and Liang Zhao | Online Decision Trees with Fairness | arXiv admin note: substantial text overlap with arXiv:1907.07237 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While artificial intelligence (AI)-based decision-making systems are
increasingly popular, significant concerns on the potential discrimination
during the AI decision-making process have been observed. For example, the
distribution of predictions is usually biased and dependents on the sensitive
attributes (e.g., gen... | [
{
"created": "Thu, 15 Oct 2020 02:50:13 GMT",
"version": "v1"
}
] | 2020-10-19 | [
[
"Zhang",
"Wenbin",
""
],
[
"Zhao",
"Liang",
""
]
] | While artificial intelligence (AI)-based decision-making systems are increasingly popular, significant concerns on the potential discrimination during the AI decision-making process have been observed. For example, the distribution of predictions is usually biased and dependents on the sensitive attributes (e.g., gende... |
2304.09949 | Guanfang Dong | Guanfang Dong, Chenqiu Zhao, Xichen Pan, Anup Basu | Learning Temporal Distribution and Spatial Correlation Towards Universal
Moving Object Segmentation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The goal of moving object segmentation is separating moving objects from
stationary backgrounds in videos. One major challenge in this problem is how to
develop a universal model for videos from various natural scenes since previous
methods are often effective only in specific scenes. In this paper, we propose
a meth... | [
{
"created": "Wed, 19 Apr 2023 20:03:09 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Aug 2023 22:41:03 GMT",
"version": "v2"
},
{
"created": "Tue, 5 Mar 2024 23:55:01 GMT",
"version": "v3"
},
{
"created": "Fri, 8 Mar 2024 00:00:10 GMT",
"version": "v4"
}
] | 2024-03-11 | [
[
"Dong",
"Guanfang",
""
],
[
"Zhao",
"Chenqiu",
""
],
[
"Pan",
"Xichen",
""
],
[
"Basu",
"Anup",
""
]
] | The goal of moving object segmentation is separating moving objects from stationary backgrounds in videos. One major challenge in this problem is how to develop a universal model for videos from various natural scenes since previous methods are often effective only in specific scenes. In this paper, we propose a method... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.