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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1903.10289 | Andrea Tassi | Andrea Tassi and Ioannis Mavromatis and Robert J. Piechocki | A Dataset of Full-Stack ITS-G5 DSRC Communications over Licensed and
Unlicensed Bands Using a Large-Scale Urban Testbed | Manuscript submitted to Elsevier Data in Brief | null | 10.1016/j.dib.2019.104368 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A dataset of measurements of ETSI ITS-G5 Dedicated Short Range Communications
(DSRC) is presented. Our dataset consists of network interactions happening
between two On-Board Units (OBUs) and four Road Side Units (RSUs). Each OBU was
fitted onto a vehicle driven across the FLOURISH Test Track in Bristol, UK.
Each RSU... | [
{
"created": "Mon, 25 Mar 2019 13:07:52 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Apr 2019 06:33:41 GMT",
"version": "v2"
},
{
"created": "Thu, 13 Jun 2019 13:08:42 GMT",
"version": "v3"
},
{
"created": "Wed, 17 Jul 2019 09:47:07 GMT",
"version": "v4"
}
] | 2022-09-05 | [
[
"Tassi",
"Andrea",
""
],
[
"Mavromatis",
"Ioannis",
""
],
[
"Piechocki",
"Robert J.",
""
]
] | A dataset of measurements of ETSI ITS-G5 Dedicated Short Range Communications (DSRC) is presented. Our dataset consists of network interactions happening between two On-Board Units (OBUs) and four Road Side Units (RSUs). Each OBU was fitted onto a vehicle driven across the FLOURISH Test Track in Bristol, UK. Each RSU a... |
2305.13993 | Haoran Xu | Haoran Xu, Weiting Tan, Shuyue Stella Li, Yunmo Chen, Benjamin Van
Durme, Philipp Koehn, Kenton Murray | Condensing Multilingual Knowledge with Lightweight Language-Specific
Modules | Accepted at the main conference of EMNLP 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Incorporating language-specific (LS) modules is a proven method to boost
performance in multilingual machine translation. This approach bears similarity
to Mixture-of-Experts (MoE) because it does not inflate FLOPs. However, the
scalability of this approach to hundreds of languages (experts) tends to be
unmanageable ... | [
{
"created": "Tue, 23 May 2023 12:21:38 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Oct 2023 18:15:20 GMT",
"version": "v2"
},
{
"created": "Sun, 22 Oct 2023 17:52:19 GMT",
"version": "v3"
}
] | 2023-10-24 | [
[
"Xu",
"Haoran",
""
],
[
"Tan",
"Weiting",
""
],
[
"Li",
"Shuyue Stella",
""
],
[
"Chen",
"Yunmo",
""
],
[
"Van Durme",
"Benjamin",
""
],
[
"Koehn",
"Philipp",
""
],
[
"Murray",
"Kenton",
""
]
] | Incorporating language-specific (LS) modules is a proven method to boost performance in multilingual machine translation. This approach bears similarity to Mixture-of-Experts (MoE) because it does not inflate FLOPs. However, the scalability of this approach to hundreds of languages (experts) tends to be unmanageable du... |
1906.02398 | Jiawei Du | Jiawei Du, Hu Zhang, Joey Tianyi Zhou, Yi Yang, Jiashi Feng | Query-efficient Meta Attack to Deep Neural Networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Black-box attack methods aim to infer suitable attack patterns to targeted
DNN models by only using output feedback of the models and the corresponding
input queries. However, due to lack of prior and inefficiency in leveraging the
query and feedback information, existing methods are mostly query-intensive for
obtain... | [
{
"created": "Thu, 6 Jun 2019 03:49:00 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Feb 2020 12:46:24 GMT",
"version": "v2"
},
{
"created": "Sat, 15 Feb 2020 03:51:45 GMT",
"version": "v3"
}
] | 2020-02-18 | [
[
"Du",
"Jiawei",
""
],
[
"Zhang",
"Hu",
""
],
[
"Zhou",
"Joey Tianyi",
""
],
[
"Yang",
"Yi",
""
],
[
"Feng",
"Jiashi",
""
]
] | Black-box attack methods aim to infer suitable attack patterns to targeted DNN models by only using output feedback of the models and the corresponding input queries. However, due to lack of prior and inefficiency in leveraging the query and feedback information, existing methods are mostly query-intensive for obtainin... |
2302.02888 | Kim Cheng Sheang | Horacio Saggion, Sanja \v{S}tajner, Daniel Ferr\'es, Kim Cheng Sheang,
Matthew Shardlow, Kai North, Marcos Zampieri | Findings of the TSAR-2022 Shared Task on Multilingual Lexical
Simplification | null | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We report findings of the TSAR-2022 shared task on multilingual lexical
simplification, organized as part of the Workshop on Text Simplification,
Accessibility, and Readability TSAR-2022 held in conjunction with EMNLP 2022.
The task called the Natural Language Processing research community to
contribute with methods ... | [
{
"created": "Mon, 6 Feb 2023 15:53:51 GMT",
"version": "v1"
}
] | 2023-02-07 | [
[
"Saggion",
"Horacio",
""
],
[
"Štajner",
"Sanja",
""
],
[
"Ferrés",
"Daniel",
""
],
[
"Sheang",
"Kim Cheng",
""
],
[
"Shardlow",
"Matthew",
""
],
[
"North",
"Kai",
""
],
[
"Zampieri",
"Marcos",
""
]
] | We report findings of the TSAR-2022 shared task on multilingual lexical simplification, organized as part of the Workshop on Text Simplification, Accessibility, and Readability TSAR-2022 held in conjunction with EMNLP 2022. The task called the Natural Language Processing research community to contribute with methods to... |
2109.11052 | Adrien Ali Taiga | Adrien Ali Ta\"iga, William Fedus, Marlos C. Machado, Aaron Courville
and Marc G. Bellemare | On Bonus-Based Exploration Methods in the Arcade Learning Environment | Full version of arXiv:1908.02388 | Published as a conference paper at ICLR 2020 | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Research on exploration in reinforcement learning, as applied to Atari 2600
game-playing, has emphasized tackling difficult exploration problems such as
Montezuma's Revenge (Bellemare et al., 2016). Recently, bonus-based exploration
methods, which explore by augmenting the environment reward, have reached
above-human... | [
{
"created": "Wed, 22 Sep 2021 21:54:21 GMT",
"version": "v1"
}
] | 2021-09-24 | [
[
"Taïga",
"Adrien Ali",
""
],
[
"Fedus",
"William",
""
],
[
"Machado",
"Marlos C.",
""
],
[
"Courville",
"Aaron",
""
],
[
"Bellemare",
"Marc G.",
""
]
] | Research on exploration in reinforcement learning, as applied to Atari 2600 game-playing, has emphasized tackling difficult exploration problems such as Montezuma's Revenge (Bellemare et al., 2016). Recently, bonus-based exploration methods, which explore by augmenting the environment reward, have reached above-human a... |
1806.00180 | Branko Ristic | Branko Ristic, Jeremie Houssineau, Sanjeev Arulampalam | Robust TMA using the possibility particle filter | 3 figures, keywords: Target motion analysis; bearings-only tracking;
robust stochastic filtering; Monte Carlo estimation; possibility distribution | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem is target motion analysis (TMA), where the objective is to
estimate the state of a moving target from noise corrupted bearings-only
measurements. The focus is on recursive TMA, traditionally solved using the
Bayesian filters (e.g. the extended or unscented Kalman filters, particle
filters). The TMA is a d... | [
{
"created": "Fri, 1 Jun 2018 03:59:09 GMT",
"version": "v1"
}
] | 2018-06-04 | [
[
"Ristic",
"Branko",
""
],
[
"Houssineau",
"Jeremie",
""
],
[
"Arulampalam",
"Sanjeev",
""
]
] | The problem is target motion analysis (TMA), where the objective is to estimate the state of a moving target from noise corrupted bearings-only measurements. The focus is on recursive TMA, traditionally solved using the Bayesian filters (e.g. the extended or unscented Kalman filters, particle filters). The TMA is a dif... |
2109.01411 | Ziqi Zhang | Ziqi Zhang, Xingyi Song | An Exploratory Study on Utilising the Web of Linked Data for Product
Data Mining | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | The Linked Open Data practice has led to a significant growth of structured
data on the Web in the last decade. Such structured data describe real-world
entities in a machine-readable way, and have created an unprecedented
opportunity for research in the field of Natural Language Processing. However,
there is a lack ... | [
{
"created": "Fri, 3 Sep 2021 09:58:36 GMT",
"version": "v1"
},
{
"created": "Thu, 10 Feb 2022 16:32:30 GMT",
"version": "v2"
},
{
"created": "Thu, 23 Jun 2022 09:09:21 GMT",
"version": "v3"
},
{
"created": "Fri, 24 Jun 2022 12:18:41 GMT",
"version": "v4"
}
] | 2022-06-27 | [
[
"Zhang",
"Ziqi",
""
],
[
"Song",
"Xingyi",
""
]
] | The Linked Open Data practice has led to a significant growth of structured data on the Web in the last decade. Such structured data describe real-world entities in a machine-readable way, and have created an unprecedented opportunity for research in the field of Natural Language Processing. However, there is a lack of... |
2402.10216 | Hua Li | Hua Li, Lu Zhang, Ruoxi Guo, Zushang Xiao, and Rui Guo | Watertightization of Trimmed Surfaces at Intersection Boundary | 10 pages,6 figures | null | null | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a watertight technique to deal with the boundary
representation of surface-surface intersection in CAD.
Surfaces play an important role in today's geometric design. The mathematical
model of non-uniform rational B-spline surfaces (NURBS) is the mainstream and
ISO standard. In the situation of ... | [
{
"created": "Thu, 7 Dec 2023 13:29:55 GMT",
"version": "v1"
}
] | 2024-02-19 | [
[
"Li",
"Hua",
""
],
[
"Zhang",
"Lu",
""
],
[
"Guo",
"Ruoxi",
""
],
[
"Xiao",
"Zushang",
""
],
[
"Guo",
"Rui",
""
]
] | This paper introduces a watertight technique to deal with the boundary representation of surface-surface intersection in CAD. Surfaces play an important role in today's geometric design. The mathematical model of non-uniform rational B-spline surfaces (NURBS) is the mainstream and ISO standard. In the situation of surf... |
cs/0307001 | Lee Lueking | Herbert Greenlee, Robert Illingworth, Jim Kowalkowski, Anil Kumar, Lee
Lueking, Taka Yasuda, Margherita Vittone, Stephen White | Serving Database Information Using a Flexible Server in a Three Tier
Architecture | Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 4 pages. PSN THKT003 | ECONFC0303241:THKT003,2003 | null | null | cs.DC cs.DB | null | The D0 experiment at Fermilab relies on a central Oracle database for storing
all detector calibration information. Access to this data is needed by hundreds
of physics applications distributed worldwide. In order to meet the demands of
these applications from scarce resources, we have created a distributed system
th... | [
{
"created": "Tue, 1 Jul 2003 02:13:32 GMT",
"version": "v1"
}
] | 2008-11-26 | [
[
"Greenlee",
"Herbert",
""
],
[
"Illingworth",
"Robert",
""
],
[
"Kowalkowski",
"Jim",
""
],
[
"Kumar",
"Anil",
""
],
[
"Lueking",
"Lee",
""
],
[
"Yasuda",
"Taka",
""
],
[
"Vittone",
"Margherita",
""
],
... | The D0 experiment at Fermilab relies on a central Oracle database for storing all detector calibration information. Access to this data is needed by hundreds of physics applications distributed worldwide. In order to meet the demands of these applications from scarce resources, we have created a distributed system that... |
2308.05017 | Yiyou Sun | Yiyou Sun, Zhenmei Shi, Yingyu Liang, Yixuan Li | When and How Does Known Class Help Discover Unknown Ones? Provable
Understanding Through Spectral Analysis | ICML 2023 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Novel Class Discovery (NCD) aims at inferring novel classes in an unlabeled
set by leveraging prior knowledge from a labeled set with known classes.
Despite its importance, there is a lack of theoretical foundations for NCD.
This paper bridges the gap by providing an analytical framework to formalize
and investigate ... | [
{
"created": "Wed, 9 Aug 2023 15:27:21 GMT",
"version": "v1"
}
] | 2023-08-10 | [
[
"Sun",
"Yiyou",
""
],
[
"Shi",
"Zhenmei",
""
],
[
"Liang",
"Yingyu",
""
],
[
"Li",
"Yixuan",
""
]
] | Novel Class Discovery (NCD) aims at inferring novel classes in an unlabeled set by leveraging prior knowledge from a labeled set with known classes. Despite its importance, there is a lack of theoretical foundations for NCD. This paper bridges the gap by providing an analytical framework to formalize and investigate wh... |
1911.04101 | Asma Aloufi | Asma Aloufi, Peizhao Hu | Collaborative Homomorphic Computation on Data Encrypted under Multiple
Keys | 8 pages, 2 figures, In International Workshop on Privacy Engineering
(IWPE'19), co-located with IEEE Symposium on Security and Privacy (S&P'19) | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Homomorphic encryption (HE) is a promising cryptographic technique for
enabling secure collaborative machine learning in the cloud. However, support
for homomorphic computation on ciphertexts under multiple keys is inefficient.
Current solutions often require key setup before any computation or incur large
ciphertext... | [
{
"created": "Mon, 11 Nov 2019 06:30:52 GMT",
"version": "v1"
}
] | 2019-11-12 | [
[
"Aloufi",
"Asma",
""
],
[
"Hu",
"Peizhao",
""
]
] | Homomorphic encryption (HE) is a promising cryptographic technique for enabling secure collaborative machine learning in the cloud. However, support for homomorphic computation on ciphertexts under multiple keys is inefficient. Current solutions often require key setup before any computation or incur large ciphertext s... |
2207.13862 | Wenzhi Gao | Wenzhi Gao, Dongdong Ge, Yinyu Ye | HDSDP: Software for Semidefinite Programming | null | null | null | null | cs.MS math.OC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | HDSDP is a numerical software solving the semidefinite programming problems.
The main framework of HDSDP resembles the dual-scaling interior point solver
DSDP [BY2008] and several new features, including a dual method based on the
simplified homogeneous self-dual embedding, have been implemented. The
embedding techni... | [
{
"created": "Thu, 28 Jul 2022 02:35:08 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Nov 2023 01:35:10 GMT",
"version": "v2"
}
] | 2023-11-10 | [
[
"Gao",
"Wenzhi",
""
],
[
"Ge",
"Dongdong",
""
],
[
"Ye",
"Yinyu",
""
]
] | HDSDP is a numerical software solving the semidefinite programming problems. The main framework of HDSDP resembles the dual-scaling interior point solver DSDP [BY2008] and several new features, including a dual method based on the simplified homogeneous self-dual embedding, have been implemented. The embedding techniqu... |
2402.17470 | Ahmet Burakhan Koyuncu | Panqi Jia, Jue Mao, Esin Koyuncu, A. Burakhan Koyuncu, Timofey
Solovyev, Alexander Karabutov, Yin Zhao, Elena Alshina, Andre Kaup | Bit Distribution Study and Implementation of Spatial Quality Map in the
JPEG-AI Standardization | 5 pages, 3 figures, 4 tables | null | null | null | cs.CV cs.LG eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Currently, there is a high demand for neural network-based image compression
codecs. These codecs employ non-linear transforms to create compact bit
representations and facilitate faster coding speeds on devices compared to the
hand-crafted transforms used in classical frameworks. The scientific and
industrial commun... | [
{
"created": "Tue, 27 Feb 2024 12:52:44 GMT",
"version": "v1"
}
] | 2024-02-28 | [
[
"Jia",
"Panqi",
""
],
[
"Mao",
"Jue",
""
],
[
"Koyuncu",
"Esin",
""
],
[
"Koyuncu",
"A. Burakhan",
""
],
[
"Solovyev",
"Timofey",
""
],
[
"Karabutov",
"Alexander",
""
],
[
"Zhao",
"Yin",
""
],
[
"Al... | Currently, there is a high demand for neural network-based image compression codecs. These codecs employ non-linear transforms to create compact bit representations and facilitate faster coding speeds on devices compared to the hand-crafted transforms used in classical frameworks. The scientific and industrial communit... |
1408.4959 | Ruediger Willenberg | Ruediger Willenberg, Paul Chow | A Software Parallel Programming Approach to FPGA-Accelerated Computing | Presented at First International Workshop on FPGAs for Software
Programmers (FSP 2014) (arXiv:1408.4423) | null | null | FSP/2014/08 | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces an effort to incorporate reconfigurable logic (FPGA)
components into a software programming model. For this purpose, we have
implemented a hardware engine for remote memory communication between hardware
computation nodes and CPUs. The hardware engine is compatible with the API of
GASNet, a popu... | [
{
"created": "Thu, 21 Aug 2014 11:08:17 GMT",
"version": "v1"
}
] | 2014-08-22 | [
[
"Willenberg",
"Ruediger",
""
],
[
"Chow",
"Paul",
""
]
] | This paper introduces an effort to incorporate reconfigurable logic (FPGA) components into a software programming model. For this purpose, we have implemented a hardware engine for remote memory communication between hardware computation nodes and CPUs. The hardware engine is compatible with the API of GASNet, a popula... |
2205.09174 | Ehud Shapiro | Idit Keidar, Oded Naor, Ouri Poupko, and Ehud Shapiro | Cordial Miners: Fast and Efficient Consensus for Every Eventuality | null | null | 10.4230/LIPIcs.DISC.2023.26 | null | cs.DC cs.MA cs.NI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Cordial Miners are a family of efficient Byzantine Atomic Broadcast
protocols, with instances for asynchrony and eventual synchrony.
They improve the latency of state-of-the-art DAG-based protocols by almost 2X
and achieve optimal good-case complexity of O(n) by forgoing Reliable Broadcast
as a building block.
Ra... | [
{
"created": "Wed, 18 May 2022 18:45:20 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Aug 2022 02:28:16 GMT",
"version": "v2"
},
{
"created": "Thu, 11 Aug 2022 19:19:31 GMT",
"version": "v3"
},
{
"created": "Wed, 9 Nov 2022 19:34:18 GMT",
"version": "v4"
},
{
"cre... | 2024-02-14 | [
[
"Keidar",
"Idit",
""
],
[
"Naor",
"Oded",
""
],
[
"Poupko",
"Ouri",
""
],
[
"Shapiro",
"Ehud",
""
]
] | Cordial Miners are a family of efficient Byzantine Atomic Broadcast protocols, with instances for asynchrony and eventual synchrony. They improve the latency of state-of-the-art DAG-based protocols by almost 2X and achieve optimal good-case complexity of O(n) by forgoing Reliable Broadcast as a building block. Rather, ... |
1302.4946 | Helene Fargier | Helene Fargier, Jerome Lang, Roger Martin-Clouaire, Thomas Schiex | A Constraint Satisfaction Approach to Decision under Uncertainty | Appears in Proceedings of the Eleventh Conference on Uncertainty in
Artificial Intelligence (UAI1995) | null | null | UAI-P-1995-PG-167-174 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Constraint Satisfaction Problem (CSP) framework offers a simple and sound
basis for representing and solving simple decision problems, without
uncertainty. This paper is devoted to an extension of the CSP framework
enabling us to deal with some decisions problems under uncertainty. This
extension relies on a diff... | [
{
"created": "Wed, 20 Feb 2013 15:20:24 GMT",
"version": "v1"
}
] | 2013-02-21 | [
[
"Fargier",
"Helene",
""
],
[
"Lang",
"Jerome",
""
],
[
"Martin-Clouaire",
"Roger",
""
],
[
"Schiex",
"Thomas",
""
]
] | The Constraint Satisfaction Problem (CSP) framework offers a simple and sound basis for representing and solving simple decision problems, without uncertainty. This paper is devoted to an extension of the CSP framework enabling us to deal with some decisions problems under uncertainty. This extension relies on a differ... |
2212.10729 | Chenlu Zhan | Chenlu Zhan, Peng Peng, Hongsen Wang, Tao Chen, Hongwei Wang | UnICLAM:Contrastive Representation Learning with Adversarial Masking for
Unified and Interpretable Medical Vision Question Answering | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Medical Visual Question Answering (Medical-VQA) aims to to answer clinical
questions regarding radiology images, assisting doctors with decision-making
options. Nevertheless, current Medical-VQA models learn cross-modal
representations through residing vision and texture encoders in dual separate
spaces, which lead t... | [
{
"created": "Wed, 21 Dec 2022 02:48:15 GMT",
"version": "v1"
},
{
"created": "Fri, 23 Dec 2022 04:16:17 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Sep 2023 11:30:06 GMT",
"version": "v3"
}
] | 2023-09-28 | [
[
"Zhan",
"Chenlu",
""
],
[
"Peng",
"Peng",
""
],
[
"Wang",
"Hongsen",
""
],
[
"Chen",
"Tao",
""
],
[
"Wang",
"Hongwei",
""
]
] | Medical Visual Question Answering (Medical-VQA) aims to to answer clinical questions regarding radiology images, assisting doctors with decision-making options. Nevertheless, current Medical-VQA models learn cross-modal representations through residing vision and texture encoders in dual separate spaces, which lead to ... |
2301.10972 | Ting Chen | Ting Chen | On the Importance of Noise Scheduling for Diffusion Models | tech report | null | null | null | cs.CV cs.GR cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We empirically study the effect of noise scheduling strategies for denoising
diffusion generative models. There are three findings: (1) the noise scheduling
is crucial for the performance, and the optimal one depends on the task (e.g.,
image sizes), (2) when increasing the image size, the optimal noise scheduling
shi... | [
{
"created": "Thu, 26 Jan 2023 07:37:22 GMT",
"version": "v1"
},
{
"created": "Fri, 27 Jan 2023 07:39:06 GMT",
"version": "v2"
},
{
"created": "Thu, 16 Feb 2023 18:24:04 GMT",
"version": "v3"
},
{
"created": "Sun, 21 May 2023 07:07:55 GMT",
"version": "v4"
}
] | 2023-05-23 | [
[
"Chen",
"Ting",
""
]
] | We empirically study the effect of noise scheduling strategies for denoising diffusion generative models. There are three findings: (1) the noise scheduling is crucial for the performance, and the optimal one depends on the task (e.g., image sizes), (2) when increasing the image size, the optimal noise scheduling shift... |
2205.15397 | Gokul Swamy | Gokul Swamy, Nived Rajaraman, Matthew Peng, Sanjiban Choudhury, J.
Andrew Bagnell, Zhiwei Steven Wu, Jiantao Jiao, Kannan Ramchandran | Minimax Optimal Online Imitation Learning via Replay Estimation | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by-sa/4.0/ | Online imitation learning is the problem of how best to mimic expert
demonstrations, given access to the environment or an accurate simulator. Prior
work has shown that in the infinite sample regime, exact moment matching
achieves value equivalence to the expert policy. However, in the finite sample
regime, even if o... | [
{
"created": "Mon, 30 May 2022 19:29:56 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Jun 2022 15:44:22 GMT",
"version": "v2"
},
{
"created": "Sat, 11 Jun 2022 19:46:49 GMT",
"version": "v3"
},
{
"created": "Sat, 22 Oct 2022 18:36:22 GMT",
"version": "v4"
},
{
"cr... | 2023-01-18 | [
[
"Swamy",
"Gokul",
""
],
[
"Rajaraman",
"Nived",
""
],
[
"Peng",
"Matthew",
""
],
[
"Choudhury",
"Sanjiban",
""
],
[
"Bagnell",
"J. Andrew",
""
],
[
"Wu",
"Zhiwei Steven",
""
],
[
"Jiao",
"Jiantao",
""
],
... | Online imitation learning is the problem of how best to mimic expert demonstrations, given access to the environment or an accurate simulator. Prior work has shown that in the infinite sample regime, exact moment matching achieves value equivalence to the expert policy. However, in the finite sample regime, even if one... |
2403.09024 | Hyunji Lee | Hyunji Lee, Doyoung Kim, Jihoon Jun, Sejune Joo, Joel Jang,
Kyoung-Woon On, Minjoon Seo | Semiparametric Token-Sequence Co-Supervision | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we introduce a semiparametric token-sequence co-supervision
training method. It trains a language model by simultaneously leveraging
supervision from the traditional next token prediction loss which is calculated
over the parametric token embedding space and the next sequence prediction loss
which is ca... | [
{
"created": "Thu, 14 Mar 2024 01:28:13 GMT",
"version": "v1"
}
] | 2024-03-15 | [
[
"Lee",
"Hyunji",
""
],
[
"Kim",
"Doyoung",
""
],
[
"Jun",
"Jihoon",
""
],
[
"Joo",
"Sejune",
""
],
[
"Jang",
"Joel",
""
],
[
"On",
"Kyoung-Woon",
""
],
[
"Seo",
"Minjoon",
""
]
] | In this work, we introduce a semiparametric token-sequence co-supervision training method. It trains a language model by simultaneously leveraging supervision from the traditional next token prediction loss which is calculated over the parametric token embedding space and the next sequence prediction loss which is calc... |
2306.01016 | Hejie Cui | Hejie Cui, Rongmei Lin, Nasser Zalmout, Chenwei Zhang, Jingbo Shang,
Carl Yang, Xian Li | PV2TEA: Patching Visual Modality to Textual-Established Information
Extraction | ACL 2023 Findings | null | null | null | cs.CL cs.AI cs.CV cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Information extraction, e.g., attribute value extraction, has been
extensively studied and formulated based only on text. However, many attributes
can benefit from image-based extraction, like color, shape, pattern, among
others. The visual modality has long been underutilized, mainly due to
multimodal annotation dif... | [
{
"created": "Thu, 1 Jun 2023 05:39:45 GMT",
"version": "v1"
}
] | 2023-06-05 | [
[
"Cui",
"Hejie",
""
],
[
"Lin",
"Rongmei",
""
],
[
"Zalmout",
"Nasser",
""
],
[
"Zhang",
"Chenwei",
""
],
[
"Shang",
"Jingbo",
""
],
[
"Yang",
"Carl",
""
],
[
"Li",
"Xian",
""
]
] | Information extraction, e.g., attribute value extraction, has been extensively studied and formulated based only on text. However, many attributes can benefit from image-based extraction, like color, shape, pattern, among others. The visual modality has long been underutilized, mainly due to multimodal annotation diffi... |
2004.02089 | Conrad M Albrecht | Conrad M Albrecht, Marcus Freitag, Theodore G van Kessel, Siyuan Lu,
Hendrik F Hamann | Event Clustering & Event Series Characterization on Expected Frequency | null | 2017 IEEE International Conference on Big Data (Big Data) | 10.1109/BigData.2017.8258495 | null | cs.DC cs.DS cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an efficient clustering algorithm applicable to one-dimensional
data such as e.g. a series of timestamps. Given an expected frequency $\Delta
T^{-1}$, we introduce an $\mathcal{O}(N)$-efficient method of characterizing
$N$ events represented by an ordered series of timestamps $t_1,t_2,\dots,t_N$.
In practi... | [
{
"created": "Sun, 5 Apr 2020 04:06:59 GMT",
"version": "v1"
}
] | 2020-04-07 | [
[
"Albrecht",
"Conrad M",
""
],
[
"Freitag",
"Marcus",
""
],
[
"van Kessel",
"Theodore G",
""
],
[
"Lu",
"Siyuan",
""
],
[
"Hamann",
"Hendrik F",
""
]
] | We present an efficient clustering algorithm applicable to one-dimensional data such as e.g. a series of timestamps. Given an expected frequency $\Delta T^{-1}$, we introduce an $\mathcal{O}(N)$-efficient method of characterizing $N$ events represented by an ordered series of timestamps $t_1,t_2,\dots,t_N$. In practice... |
2407.04333 | Luca Comanducci | Francesca Ronchini, Luca Comanducci, Gabriele Perego, Fabio Antonacci | PAGURI: a user experience study of creative interaction with
text-to-music models | null | null | null | null | cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | In recent years, text-to-music models have been the biggest breakthrough in
automatic music generation. While they are unquestionably a showcase of
technological progress, it is not clear yet how they can be realistically
integrated into the artistic practice of musicians and music practitioners.
This paper aims to a... | [
{
"created": "Fri, 5 Jul 2024 08:15:55 GMT",
"version": "v1"
}
] | 2024-07-08 | [
[
"Ronchini",
"Francesca",
""
],
[
"Comanducci",
"Luca",
""
],
[
"Perego",
"Gabriele",
""
],
[
"Antonacci",
"Fabio",
""
]
] | In recent years, text-to-music models have been the biggest breakthrough in automatic music generation. While they are unquestionably a showcase of technological progress, it is not clear yet how they can be realistically integrated into the artistic practice of musicians and music practitioners. This paper aims to add... |
1804.08229 | Shiqi Zhang | Yuqian Jiang and Shiqi Zhang and Piyush Khandelwal and Peter Stone | Task Planning in Robotics: an Empirical Comparison of PDDL-based and
ASP-based Systems | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robots need task planning algorithms to sequence actions toward accomplishing
goals that are impossible through individual actions. Off-the-shelf task
planners can be used by intelligent robotics practitioners to solve a variety
of planning problems. However, many different planners exist, each with
different strengt... | [
{
"created": "Mon, 23 Apr 2018 02:46:36 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Jan 2019 04:29:32 GMT",
"version": "v2"
},
{
"created": "Mon, 25 Feb 2019 23:28:49 GMT",
"version": "v3"
}
] | 2019-02-27 | [
[
"Jiang",
"Yuqian",
""
],
[
"Zhang",
"Shiqi",
""
],
[
"Khandelwal",
"Piyush",
""
],
[
"Stone",
"Peter",
""
]
] | Robots need task planning algorithms to sequence actions toward accomplishing goals that are impossible through individual actions. Off-the-shelf task planners can be used by intelligent robotics practitioners to solve a variety of planning problems. However, many different planners exist, each with different strengths... |
2306.05344 | Haomin Yu | Haomin Yu, Yanru Song, Jilin Hu, Chenjuan Guo, Bin Yang | A Crystal-Specific Pre-Training Framework for Crystal Material Property
Prediction | null | null | null | null | cs.LG cond-mat.mtrl-sci | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Crystal property prediction is a crucial aspect of developing novel
materials. However, there are two technical challenges to be addressed for
speeding up the investigation of crystals. First, labeling crystal properties
is intrinsically difficult due to the high cost and time involved in physical
simulations or lab ... | [
{
"created": "Thu, 8 Jun 2023 16:46:11 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Jun 2023 08:27:55 GMT",
"version": "v2"
}
] | 2023-06-12 | [
[
"Yu",
"Haomin",
""
],
[
"Song",
"Yanru",
""
],
[
"Hu",
"Jilin",
""
],
[
"Guo",
"Chenjuan",
""
],
[
"Yang",
"Bin",
""
]
] | Crystal property prediction is a crucial aspect of developing novel materials. However, there are two technical challenges to be addressed for speeding up the investigation of crystals. First, labeling crystal properties is intrinsically difficult due to the high cost and time involved in physical simulations or lab ex... |
1904.07675 | Ricardo P\'erez-Marco | Cyril Grunspan, Ricardo P\'erez-Marco | Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks | 10 pages, 4 figures. To appear in Proceedings of Tokenomics,
International COnference on Blockchain Economics, Security and Protocols,
Paris, 2019 | null | null | null | cs.CR math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The main goal of this article is to present a direct approach for the formula
giving the long-term apparent hashrates of Selfish Mining strategies using only
elementary probabilities and combinatorics, more precisely, Dyck words. We can
avoid computing stationary probabilities on Markov chain, nor stopping times
for ... | [
{
"created": "Thu, 11 Apr 2019 23:18:46 GMT",
"version": "v1"
}
] | 2019-04-17 | [
[
"Grunspan",
"Cyril",
""
],
[
"Pérez-Marco",
"Ricardo",
""
]
] | The main goal of this article is to present a direct approach for the formula giving the long-term apparent hashrates of Selfish Mining strategies using only elementary probabilities and combinatorics, more precisely, Dyck words. We can avoid computing stationary probabilities on Markov chain, nor stopping times for Po... |
1301.0935 | Chung-Pi Lee | Chung-Pi Lee, Shih-Chun Lin, Hsuan-Jung Su and H. Vincent Poor | Multi-user lattice coding for the multiple-access relay channel | 32 pages, 5 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper considers the multi-antenna multiple access relay channel (MARC),
in which multiple users transmit messages to a common destination with the
assistance of a relay. In a variety of MARC settings, the dynamic decode and
forward (DDF) protocol is very useful due to its outstanding rate performance.
However, t... | [
{
"created": "Sat, 5 Jan 2013 19:48:48 GMT",
"version": "v1"
}
] | 2013-01-08 | [
[
"Lee",
"Chung-Pi",
""
],
[
"Lin",
"Shih-Chun",
""
],
[
"Su",
"Hsuan-Jung",
""
],
[
"Poor",
"H. Vincent",
""
]
] | This paper considers the multi-antenna multiple access relay channel (MARC), in which multiple users transmit messages to a common destination with the assistance of a relay. In a variety of MARC settings, the dynamic decode and forward (DDF) protocol is very useful due to its outstanding rate performance. However, the... |
2008.05363 | Sebastian Hofst\"atter | Sebastian Hofst\"atter, Markus Zlabinger, Mete Sertkan, Michael
Schr\"oder, Allan Hanbury | Fine-Grained Relevance Annotations for Multi-Task Document Ranking and
Question Answering | Accepted at CIKM 2020 (Resource Track) | null | null | null | cs.IR cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are many existing retrieval and question answering datasets. However,
most of them either focus on ranked list evaluation or single-candidate
question answering. This divide makes it challenging to properly evaluate
approaches concerned with ranking documents and providing snippets or answers
for a given query.... | [
{
"created": "Wed, 12 Aug 2020 14:59:50 GMT",
"version": "v1"
}
] | 2020-08-13 | [
[
"Hofstätter",
"Sebastian",
""
],
[
"Zlabinger",
"Markus",
""
],
[
"Sertkan",
"Mete",
""
],
[
"Schröder",
"Michael",
""
],
[
"Hanbury",
"Allan",
""
]
] | There are many existing retrieval and question answering datasets. However, most of them either focus on ranked list evaluation or single-candidate question answering. This divide makes it challenging to properly evaluate approaches concerned with ranking documents and providing snippets or answers for a given query. I... |
2203.03582 | Songjun Cao | Keqi Deng, Songjun Cao, Yike Zhang, Long Ma, Gaofeng Cheng, Ji Xu,
Pengyuan Zhang | Improving CTC-based speech recognition via knowledge transferring from
pre-trained language models | ICASSP 2022 | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, end-to-end automatic speech recognition models based on
connectionist temporal classification (CTC) have achieved impressive results,
especially when fine-tuned from wav2vec2.0 models. Due to the conditional
independence assumption, CTC-based models are always weaker than
attention-based encoder-decoder mod... | [
{
"created": "Tue, 22 Feb 2022 11:30:55 GMT",
"version": "v1"
}
] | 2022-03-08 | [
[
"Deng",
"Keqi",
""
],
[
"Cao",
"Songjun",
""
],
[
"Zhang",
"Yike",
""
],
[
"Ma",
"Long",
""
],
[
"Cheng",
"Gaofeng",
""
],
[
"Xu",
"Ji",
""
],
[
"Zhang",
"Pengyuan",
""
]
] | Recently, end-to-end automatic speech recognition models based on connectionist temporal classification (CTC) have achieved impressive results, especially when fine-tuned from wav2vec2.0 models. Due to the conditional independence assumption, CTC-based models are always weaker than attention-based encoder-decoder model... |
2207.06814 | Javier de la Rosa | Javier de la Rosa, Eduardo G. Ponferrada, Paulo Villegas, Pablo
Gonzalez de Prado Salas, Manu Romero, Mar{\i}a Grandury | BERTIN: Efficient Pre-Training of a Spanish Language Model using
Perplexity Sampling | Published at Procesamiento del Lenguaje Natural | Procesamiento del Lenguaje Natural, 68 (2022): 13-23 | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-sa/4.0/ | The pre-training of large language models usually requires massive amounts of
resources, both in terms of computation and data. Frequently used web sources
such as Common Crawl might contain enough noise to make this pre-training
sub-optimal. In this work, we experiment with different sampling methods from
the Spanis... | [
{
"created": "Thu, 14 Jul 2022 10:48:42 GMT",
"version": "v1"
}
] | 2022-07-15 | [
[
"de la Rosa",
"Javier",
""
],
[
"Ponferrada",
"Eduardo G.",
""
],
[
"Villegas",
"Paulo",
""
],
[
"Salas",
"Pablo Gonzalez de Prado",
""
],
[
"Romero",
"Manu",
""
],
[
"Grandury",
"Marıa",
""
]
] | The pre-training of large language models usually requires massive amounts of resources, both in terms of computation and data. Frequently used web sources such as Common Crawl might contain enough noise to make this pre-training sub-optimal. In this work, we experiment with different sampling methods from the Spanish ... |
1805.09621 | Zhe Cheng Fan | Zhe-Cheng Fan, Tak-Shing T. Chan, Yi-Hsuan Yang, and Jyh-Shing R. Jang | Backpropagation with N-D Vector-Valued Neurons Using Arbitrary Bilinear
Products | 14 pages, 8 figures, 3 tables | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vector-valued neural learning has emerged as a promising direction in deep
learning recently. Traditionally, training data for neural networks (NNs) are
formulated as a vector of scalars; however, its performance may not be optimal
since associations among adjacent scalars are not modeled. In this paper, we
propose a... | [
{
"created": "Thu, 24 May 2018 12:01:53 GMT",
"version": "v1"
}
] | 2018-05-25 | [
[
"Fan",
"Zhe-Cheng",
""
],
[
"Chan",
"Tak-Shing T.",
""
],
[
"Yang",
"Yi-Hsuan",
""
],
[
"Jang",
"Jyh-Shing R.",
""
]
] | Vector-valued neural learning has emerged as a promising direction in deep learning recently. Traditionally, training data for neural networks (NNs) are formulated as a vector of scalars; however, its performance may not be optimal since associations among adjacent scalars are not modeled. In this paper, we propose a n... |
2106.08235 | Zhaozhuo Xu | Zhaozhuo Xu, Minghao Yan, Junyan Zhang, Anshumali Shrivastava | PairConnect: A Compute-Efficient MLP Alternative to Attention | null | null | null | null | cs.LG cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transformer models have demonstrated superior performance in natural language
processing. The dot product self-attention in Transformer allows us to model
interactions between words. However, this modeling comes with significant
computational overhead. In this work, we revisit the memory-compute trade-off
associated ... | [
{
"created": "Tue, 15 Jun 2021 15:39:45 GMT",
"version": "v1"
}
] | 2021-06-16 | [
[
"Xu",
"Zhaozhuo",
""
],
[
"Yan",
"Minghao",
""
],
[
"Zhang",
"Junyan",
""
],
[
"Shrivastava",
"Anshumali",
""
]
] | Transformer models have demonstrated superior performance in natural language processing. The dot product self-attention in Transformer allows us to model interactions between words. However, this modeling comes with significant computational overhead. In this work, we revisit the memory-compute trade-off associated wi... |
2405.05170 | Sijing Xie | Sijing Xie, Chengxin Zhao, Nan Sun, Wei Li, Hefei Ling | Picking watermarks from noise (PWFN): an improved robust watermarking
model against intensive distortions | null | null | null | null | cs.MM cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Digital watermarking is the process of embedding secret information by
altering images in an undetectable way to the human eye. To increase the
robustness of the model, many deep learning-based watermarking methods use the
encoder-noise-decoder architecture by adding different noises to the noise
layer. The decoder t... | [
{
"created": "Wed, 8 May 2024 16:06:57 GMT",
"version": "v1"
},
{
"created": "Fri, 17 May 2024 15:08:17 GMT",
"version": "v2"
}
] | 2024-05-20 | [
[
"Xie",
"Sijing",
""
],
[
"Zhao",
"Chengxin",
""
],
[
"Sun",
"Nan",
""
],
[
"Li",
"Wei",
""
],
[
"Ling",
"Hefei",
""
]
] | Digital watermarking is the process of embedding secret information by altering images in an undetectable way to the human eye. To increase the robustness of the model, many deep learning-based watermarking methods use the encoder-noise-decoder architecture by adding different noises to the noise layer. The decoder the... |
2404.03663 | Man Yao | Man Yao and Jiakui Hu and Tianxiang Hu and Yifan Xu and Zhaokun Zhou
and Yonghong Tian and Bo Xu and Guoqi Li | Spike-driven Transformer V2: Meta Spiking Neural Network Architecture
Inspiring the Design of Next-generation Neuromorphic Chips | Accepted by ICLR2024. Code and Model:
https://github.com/BICLab/Spike-Driven-Transformer-V2 | null | null | null | cs.NE cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neuromorphic computing, which exploits Spiking Neural Networks (SNNs) on
neuromorphic chips, is a promising energy-efficient alternative to traditional
AI. CNN-based SNNs are the current mainstream of neuromorphic computing. By
contrast, no neuromorphic chips are designed especially for Transformer-based
SNNs, which ... | [
{
"created": "Thu, 15 Feb 2024 13:26:18 GMT",
"version": "v1"
}
] | 2024-04-08 | [
[
"Yao",
"Man",
""
],
[
"Hu",
"Jiakui",
""
],
[
"Hu",
"Tianxiang",
""
],
[
"Xu",
"Yifan",
""
],
[
"Zhou",
"Zhaokun",
""
],
[
"Tian",
"Yonghong",
""
],
[
"Xu",
"Bo",
""
],
[
"Li",
"Guoqi",
""
... | Neuromorphic computing, which exploits Spiking Neural Networks (SNNs) on neuromorphic chips, is a promising energy-efficient alternative to traditional AI. CNN-based SNNs are the current mainstream of neuromorphic computing. By contrast, no neuromorphic chips are designed especially for Transformer-based SNNs, which ha... |
2111.04344 | Chengzhi Zhang | Yi Zhao, Lifan Liu, Chengzhi Zhang | Is Coronavirus-Related Research Becoming More Interdisciplinary? A
Perspective of Co-occurrence Analysis and Diversity Measure of Scientific
Articles | null | null | 10.1016/j.techfore.2021.121344 | null | cs.DL cs.CY | http://creativecommons.org/licenses/by/4.0/ | The outbreak of coronavirus disease 2019 (COVID-19) has had a significant
repercussion on the health, economy, politics and environment, making
coronavirus-related issues more complicated and difficult to solve adequately
by relying on a single field. Interdisciplinary research can provide an
effective solution to co... | [
{
"created": "Mon, 8 Nov 2021 09:05:36 GMT",
"version": "v1"
}
] | 2021-11-09 | [
[
"Zhao",
"Yi",
""
],
[
"Liu",
"Lifan",
""
],
[
"Zhang",
"Chengzhi",
""
]
] | The outbreak of coronavirus disease 2019 (COVID-19) has had a significant repercussion on the health, economy, politics and environment, making coronavirus-related issues more complicated and difficult to solve adequately by relying on a single field. Interdisciplinary research can provide an effective solution to comp... |
1903.07037 | Ido Cohn | Ido Cohn, Itay Laish, Genady Beryozkin, Gang Li, Izhak Shafran, Idan
Szpektor, Tzvika Hartman, Avinatan Hassidim, Yossi Matias | Audio De-identification: A New Entity Recognition Task | Accepted to NAACL 2019 Industry Track | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Named Entity Recognition (NER) has been mostly studied in the context of
written text. Specifically, NER is an important step in de-identification
(de-ID) of medical records, many of which are recorded conversations between a
patient and a doctor. In such recordings, audio spans with personal information
should be re... | [
{
"created": "Sun, 17 Mar 2019 07:07:44 GMT",
"version": "v1"
},
{
"created": "Sun, 5 May 2019 06:36:02 GMT",
"version": "v2"
}
] | 2019-05-07 | [
[
"Cohn",
"Ido",
""
],
[
"Laish",
"Itay",
""
],
[
"Beryozkin",
"Genady",
""
],
[
"Li",
"Gang",
""
],
[
"Shafran",
"Izhak",
""
],
[
"Szpektor",
"Idan",
""
],
[
"Hartman",
"Tzvika",
""
],
[
"Hassidim",
... | Named Entity Recognition (NER) has been mostly studied in the context of written text. Specifically, NER is an important step in de-identification (de-ID) of medical records, many of which are recorded conversations between a patient and a doctor. In such recordings, audio spans with personal information should be reda... |
2201.10164 | Kazuya Horibe | Kazuya Horibe, Yuanxiang Fan, Yutaka Nakamura, Hiroshi Ishiguro | Investigating the impact of free energy based behavior on human in
human-agent interaction | 5 pages, 5 figures, AROB2022 | null | null | null | cs.HC cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Humans communicate non-verbally by sharing physical rhythms, such as nodding
and gestures, to involve each other. This sharing of physicality creates a
sense of unity and makes humans feel involved with others. In this paper, we
developed a new body motion generation system based on the free-energy
principle (FEP), w... | [
{
"created": "Tue, 25 Jan 2022 08:08:30 GMT",
"version": "v1"
}
] | 2022-01-26 | [
[
"Horibe",
"Kazuya",
""
],
[
"Fan",
"Yuanxiang",
""
],
[
"Nakamura",
"Yutaka",
""
],
[
"Ishiguro",
"Hiroshi",
""
]
] | Humans communicate non-verbally by sharing physical rhythms, such as nodding and gestures, to involve each other. This sharing of physicality creates a sense of unity and makes humans feel involved with others. In this paper, we developed a new body motion generation system based on the free-energy principle (FEP), whi... |
1807.05686 | Bruno Vavala | Mic Bowman, Andrea Miele, Michael Steiner, Bruno Vavala | Private Data Objects: an Overview | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present Private Data Objects (PDOs), a technology that enables mutually
untrusted parties to run smart contracts over private data. PDOs result from
the integration of a distributed ledger and Intel Secure Guard Extensions
(SGX). In particular, contracts run off-ledger in secure enclaves using Intel
SGX, which pre... | [
{
"created": "Mon, 16 Jul 2018 06:03:56 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Nov 2018 22:49:21 GMT",
"version": "v2"
}
] | 2018-11-07 | [
[
"Bowman",
"Mic",
""
],
[
"Miele",
"Andrea",
""
],
[
"Steiner",
"Michael",
""
],
[
"Vavala",
"Bruno",
""
]
] | We present Private Data Objects (PDOs), a technology that enables mutually untrusted parties to run smart contracts over private data. PDOs result from the integration of a distributed ledger and Intel Secure Guard Extensions (SGX). In particular, contracts run off-ledger in secure enclaves using Intel SGX, which prese... |
2204.10419 | Oliver Limoyo | Oliver Limoyo, Trevor Ablett, and Jonathan Kelly | Learning Sequential Latent Variable Models from Multimodal Time Series
Data | In: Petrovic, I., Menegatti, E., Markovi\'c, I. (eds) Intelligent
Autonomous Systems 17. IAS 2022. Lecture Notes in Networks and Systems, vol
577. Springer, Cham | null | 10.1007/978-3-031-22216-0_35 | null | cs.LG cs.AI cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sequential modelling of high-dimensional data is an important problem that
appears in many domains including model-based reinforcement learning and
dynamics identification for control. Latent variable models applied to
sequential data (i.e., latent dynamics models) have been shown to be a
particularly effective proba... | [
{
"created": "Thu, 21 Apr 2022 21:59:24 GMT",
"version": "v1"
},
{
"created": "Fri, 20 Jan 2023 07:11:44 GMT",
"version": "v2"
}
] | 2023-01-23 | [
[
"Limoyo",
"Oliver",
""
],
[
"Ablett",
"Trevor",
""
],
[
"Kelly",
"Jonathan",
""
]
] | Sequential modelling of high-dimensional data is an important problem that appears in many domains including model-based reinforcement learning and dynamics identification for control. Latent variable models applied to sequential data (i.e., latent dynamics models) have been shown to be a particularly effective probabi... |
2406.14099 | Federico Ruggeri | Federico Ruggeri, Eleonora Misino, Arianna Muti, Katerina Korre, Paolo
Torroni, Alberto Barr\'on-Cede\~no | Let Guidelines Guide You: A Prescriptive Guideline-Centered Data
Annotation Methodology | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | We introduce the Guideline-Centered annotation process, a novel data
annotation methodology focused on reporting the annotation guidelines
associated with each data sample. We identify three main limitations of the
standard prescriptive annotation process and describe how the
Guideline-Centered methodology overcomes ... | [
{
"created": "Thu, 20 Jun 2024 08:24:57 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Jul 2024 15:38:17 GMT",
"version": "v2"
}
] | 2024-07-03 | [
[
"Ruggeri",
"Federico",
""
],
[
"Misino",
"Eleonora",
""
],
[
"Muti",
"Arianna",
""
],
[
"Korre",
"Katerina",
""
],
[
"Torroni",
"Paolo",
""
],
[
"Barrón-Cedeño",
"Alberto",
""
]
] | We introduce the Guideline-Centered annotation process, a novel data annotation methodology focused on reporting the annotation guidelines associated with each data sample. We identify three main limitations of the standard prescriptive annotation process and describe how the Guideline-Centered methodology overcomes th... |
2106.03893 | Devin Kreuzer | Devin Kreuzer, Dominique Beaini, William L. Hamilton, Vincent
L\'etourneau and Prudencio Tossou | Rethinking Graph Transformers with Spectral Attention | Accepted in Proceedings of NeurIPS 2021 | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In recent years, the Transformer architecture has proven to be very
successful in sequence processing, but its application to other data
structures, such as graphs, has remained limited due to the difficulty of
properly defining positions. Here, we present the $\textit{Spectral Attention
Network}$ (SAN), which uses a... | [
{
"created": "Mon, 7 Jun 2021 18:11:11 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Jun 2021 01:24:23 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Oct 2021 16:09:50 GMT",
"version": "v3"
}
] | 2021-10-28 | [
[
"Kreuzer",
"Devin",
""
],
[
"Beaini",
"Dominique",
""
],
[
"Hamilton",
"William L.",
""
],
[
"Létourneau",
"Vincent",
""
],
[
"Tossou",
"Prudencio",
""
]
] | In recent years, the Transformer architecture has proven to be very successful in sequence processing, but its application to other data structures, such as graphs, has remained limited due to the difficulty of properly defining positions. Here, we present the $\textit{Spectral Attention Network}$ (SAN), which uses a l... |
2404.16692 | Markus Huff | Lydia Uhler, Verena Jordan, J\"urgen Buder, Markus Huff, Frank
Papenmeier | Influence of Solution Efficiency and Valence of Instruction on Additive
and Subtractive Solution Strategies in Humans and GPT-4 | 29 pages, 2 figures | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We explored the addition bias, a cognitive tendency to prefer adding elements
over removing them to alter an initial state or structure, by conducting four
preregistered experiments examining the problem-solving behavior of both humans
and OpenAl's GPT-4 large language model. The experiments involved 588
participants... | [
{
"created": "Thu, 25 Apr 2024 15:53:00 GMT",
"version": "v1"
}
] | 2024-04-26 | [
[
"Uhler",
"Lydia",
""
],
[
"Jordan",
"Verena",
""
],
[
"Buder",
"Jürgen",
""
],
[
"Huff",
"Markus",
""
],
[
"Papenmeier",
"Frank",
""
]
] | We explored the addition bias, a cognitive tendency to prefer adding elements over removing them to alter an initial state or structure, by conducting four preregistered experiments examining the problem-solving behavior of both humans and OpenAl's GPT-4 large language model. The experiments involved 588 participants f... |
2102.12962 | Rui Yang | Rui Yang, Jiafei Lyu, Yu Yang, Jiangpeng Yan, Feng Luo, Dijun Luo,
Lanqing Li, Xiu Li | Bias-reduced Multi-step Hindsight Experience Replay for Efficient
Multi-goal Reinforcement Learning | 20pages, 8 figures | null | null | null | cs.LG cs.AI cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-goal reinforcement learning is widely applied in planning and robot
manipulation. Two main challenges in multi-goal reinforcement learning are
sparse rewards and sample inefficiency. Hindsight Experience Replay (HER) aims
to tackle the two challenges via goal relabeling. However, HER-related works
still need mi... | [
{
"created": "Thu, 25 Feb 2021 16:05:57 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Jun 2021 04:55:42 GMT",
"version": "v2"
},
{
"created": "Mon, 26 Sep 2022 15:42:17 GMT",
"version": "v3"
}
] | 2022-09-27 | [
[
"Yang",
"Rui",
""
],
[
"Lyu",
"Jiafei",
""
],
[
"Yang",
"Yu",
""
],
[
"Yan",
"Jiangpeng",
""
],
[
"Luo",
"Feng",
""
],
[
"Luo",
"Dijun",
""
],
[
"Li",
"Lanqing",
""
],
[
"Li",
"Xiu",
""
]
... | Multi-goal reinforcement learning is widely applied in planning and robot manipulation. Two main challenges in multi-goal reinforcement learning are sparse rewards and sample inefficiency. Hindsight Experience Replay (HER) aims to tackle the two challenges via goal relabeling. However, HER-related works still need mill... |
2107.08922 | Zhi Liu | Zhi Liu and Nikhil Garg | Test-optional Policies: Overcoming Strategic Behavior and Informational
Gaps | null | null | null | null | cs.GT stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the Covid-19 pandemic, more than 500 US-based colleges and
universities went "test-optional" for admissions and promised that they would
not penalize applicants for not submitting test scores, part of a longer trend
to rethink the role of testing in college admissions. However, it remains
unclear how (and whet... | [
{
"created": "Mon, 19 Jul 2021 14:36:53 GMT",
"version": "v1"
}
] | 2021-07-20 | [
[
"Liu",
"Zhi",
""
],
[
"Garg",
"Nikhil",
""
]
] | Due to the Covid-19 pandemic, more than 500 US-based colleges and universities went "test-optional" for admissions and promised that they would not penalize applicants for not submitting test scores, part of a longer trend to rethink the role of testing in college admissions. However, it remains unclear how (and whethe... |
1702.07489 | Krishna Sivalingam | Dhathri R. Purohith and Krishna M. Sivalingam | SIFM: A network architecture for seamless flow mobility between LTE and
WiFi networks - Analysis and Testbed Implementation | null | Springer CSI Transactions on ICT, March 2019 | 10.1007/s40012-019-00214-1 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper deals with cellular (e.g. LTE) networks that selectively offload
the mobile data traffic onto WiFi (IEEE 802.11) networks to improve network
performance. We propose the Seamless Internetwork Flow Mobility (SIFM)
architecture that provides seamless flow-mobility support using concepts of
Software Defined Ne... | [
{
"created": "Fri, 24 Feb 2017 08:20:29 GMT",
"version": "v1"
}
] | 2020-07-07 | [
[
"Purohith",
"Dhathri R.",
""
],
[
"Sivalingam",
"Krishna M.",
""
]
] | This paper deals with cellular (e.g. LTE) networks that selectively offload the mobile data traffic onto WiFi (IEEE 802.11) networks to improve network performance. We propose the Seamless Internetwork Flow Mobility (SIFM) architecture that provides seamless flow-mobility support using concepts of Software Defined Netw... |
1103.4399 | Sylvain Schmitz | Sylvain Schmitz and Philippe Schnoebelen | Multiply-Recursive Upper Bounds with Higman's Lemma | null | In Aceto, L., Henzinger, M., and Sgall, J., editors, ICALP 2011,
38th International Colloquium on Automata, Languages and Programming, volume
6756 of Lecture Notes in Computer Science, pages 441--452. Springer
Heidelberg | 10.1007/978-3-642-22012-8_35 | null | cs.LO cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a new analysis for the length of controlled bad sequences in
well-quasi-orderings based on Higman's Lemma. This leads to tight
multiply-recursive upper bounds that readily apply to several verification
algorithms for well-structured systems.
| [
{
"created": "Tue, 22 Mar 2011 22:03:34 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Jul 2011 11:27:14 GMT",
"version": "v2"
}
] | 2011-07-20 | [
[
"Schmitz",
"Sylvain",
""
],
[
"Schnoebelen",
"Philippe",
""
]
] | We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman's Lemma. This leads to tight multiply-recursive upper bounds that readily apply to several verification algorithms for well-structured systems. |
1701.06141 | Tianli Liao | Nan Li, Tianli Liao, Chao Wang | Perception-based energy functions in seam-cutting | 5 pages, 6 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image stitching is challenging in consumer-level photography, due to
alignment difficulties in unconstrained shooting environment. Recent studies
show that seam-cutting approaches can effectively relieve artifacts generated
by local misalignment. Normally, seam-cutting is described in terms of energy
minimization, ho... | [
{
"created": "Sun, 22 Jan 2017 09:25:34 GMT",
"version": "v1"
}
] | 2017-01-24 | [
[
"Li",
"Nan",
""
],
[
"Liao",
"Tianli",
""
],
[
"Wang",
"Chao",
""
]
] | Image stitching is challenging in consumer-level photography, due to alignment difficulties in unconstrained shooting environment. Recent studies show that seam-cutting approaches can effectively relieve artifacts generated by local misalignment. Normally, seam-cutting is described in terms of energy minimization, howe... |
2207.01024 | Yota Otachi | Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi | Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited | 25 pages, 2 figures, ESA 2022 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a graph and two vertex sets satisfying a certain feasibility condition,
a reconfiguration problem asks whether we can reach one vertex set from the
other by repeating prescribed modification steps while maintaining feasibility.
In this setting, Mouawad et al. [IPEC 2014] presented an algorithmic
meta-theorem fo... | [
{
"created": "Sun, 3 Jul 2022 12:38:39 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Dec 2022 13:33:57 GMT",
"version": "v2"
}
] | 2022-12-29 | [
[
"Gima",
"Tatsuya",
""
],
[
"Ito",
"Takehiro",
""
],
[
"Kobayashi",
"Yasuaki",
""
],
[
"Otachi",
"Yota",
""
]
] | Given a graph and two vertex sets satisfying a certain feasibility condition, a reconfiguration problem asks whether we can reach one vertex set from the other by repeating prescribed modification steps while maintaining feasibility. In this setting, Mouawad et al. [IPEC 2014] presented an algorithmic meta-theorem for ... |
2109.05084 | Christoforos Mavrogiannis | Christoforos Mavrogiannis, Krishna Balasubramanian, Sriyash Poddar,
Anush Gandra, Siddhartha S. Srinivasa | Winding Through: Crowd Navigation via Topological Invariance | Final version to appear at IEEE RA-L - minor acknowledgments fix | null | null | null | cs.RO cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We focus on robot navigation in crowded environments. The challenge of
predicting the motion of a crowd around a robot makes it hard to ensure human
safety and comfort. Recent approaches often employ end-to-end techniques for
robot control or deep architectures for high-fidelity human motion prediction.
While these m... | [
{
"created": "Fri, 10 Sep 2021 19:31:06 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Jul 2022 18:45:04 GMT",
"version": "v2"
},
{
"created": "Wed, 9 Nov 2022 20:22:24 GMT",
"version": "v3"
},
{
"created": "Tue, 22 Nov 2022 19:08:07 GMT",
"version": "v4"
}
] | 2022-11-24 | [
[
"Mavrogiannis",
"Christoforos",
""
],
[
"Balasubramanian",
"Krishna",
""
],
[
"Poddar",
"Sriyash",
""
],
[
"Gandra",
"Anush",
""
],
[
"Srinivasa",
"Siddhartha S.",
""
]
] | We focus on robot navigation in crowded environments. The challenge of predicting the motion of a crowd around a robot makes it hard to ensure human safety and comfort. Recent approaches often employ end-to-end techniques for robot control or deep architectures for high-fidelity human motion prediction. While these met... |
2403.12433 | Rui Yang | Rui Yang, Evgenios M. Kornaropoulos, Yue Cheng | Algorithmic Complexity Attacks on Dynamic Learned Indexes | VLDB 2024 | null | null | null | cs.DB cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learned Index Structures (LIS) view a sorted index as a model that learns the
data distribution, takes a data element key as input, and outputs the predicted
position of the key. The original LIS can only handle lookup operations with no
support for updates, rendering it impractical to use for typical workloads. To
a... | [
{
"created": "Tue, 19 Mar 2024 04:46:56 GMT",
"version": "v1"
}
] | 2024-03-20 | [
[
"Yang",
"Rui",
""
],
[
"Kornaropoulos",
"Evgenios M.",
""
],
[
"Cheng",
"Yue",
""
]
] | Learned Index Structures (LIS) view a sorted index as a model that learns the data distribution, takes a data element key as input, and outputs the predicted position of the key. The original LIS can only handle lookup operations with no support for updates, rendering it impractical to use for typical workloads. To add... |
2108.02005 | Heman Shakeri | Ali Tavasoli, Teague Henry, Heman Shakeri | A purely data-driven framework for prediction, optimization, and control
of networked processes: application to networked SIS epidemic model | null | null | null | null | cs.SI cs.AI cs.LG cs.SY eess.SY math.OC | http://creativecommons.org/licenses/by/4.0/ | Networks are landmarks of many complex phenomena where interweaving
interactions between different agents transform simple local rule-sets into
nonlinear emergent behaviors. While some recent studies unveil associations
between the network structure and the underlying dynamical process, identifying
stochastic nonline... | [
{
"created": "Sun, 1 Aug 2021 03:57:10 GMT",
"version": "v1"
}
] | 2021-08-05 | [
[
"Tavasoli",
"Ali",
""
],
[
"Henry",
"Teague",
""
],
[
"Shakeri",
"Heman",
""
]
] | Networks are landmarks of many complex phenomena where interweaving interactions between different agents transform simple local rule-sets into nonlinear emergent behaviors. While some recent studies unveil associations between the network structure and the underlying dynamical process, identifying stochastic nonlinear... |
2110.02482 | James Bailey | James P. Bailey | $O\left(1/T\right)$ Time-Average Convergence in a Generalization of
Multiagent Zero-Sum Games | null | null | null | null | cs.GT cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a generalization of zero-sum network multiagent matrix games and
prove that alternating gradient descent converges to the set of Nash equilibria
at rate $O(1/T)$ for this set of games. Alternating gradient descent obtains
this convergence guarantee while using fixed learning rates that are four times
lar... | [
{
"created": "Wed, 6 Oct 2021 03:29:21 GMT",
"version": "v1"
}
] | 2021-10-07 | [
[
"Bailey",
"James P.",
""
]
] | We introduce a generalization of zero-sum network multiagent matrix games and prove that alternating gradient descent converges to the set of Nash equilibria at rate $O(1/T)$ for this set of games. Alternating gradient descent obtains this convergence guarantee while using fixed learning rates that are four times large... |
0909.1608 | Guangliang Chen | G. Chen and G. Lerman | Motion Segmentation by SCC on the Hopkins 155 Database | Accepted to 2009 ICCV Workshop on Dynamical Vision | Computer Vision Workshops (ICCV Workshops), 2009 IEEE 12th
International Conference on, 2009, pp. 759 - 764 | 10.1109/ICCVW.2009.5457626 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We apply the Spectral Curvature Clustering (SCC) algorithm to a benchmark
database of 155 motion sequences, and show that it outperforms all other
state-of-the-art methods. The average misclassification rate by SCC is 1.41%
for sequences having two motions and 4.85% for three motions.
| [
{
"created": "Wed, 9 Sep 2009 02:12:22 GMT",
"version": "v1"
}
] | 2012-10-08 | [
[
"Chen",
"G.",
""
],
[
"Lerman",
"G.",
""
]
] | We apply the Spectral Curvature Clustering (SCC) algorithm to a benchmark database of 155 motion sequences, and show that it outperforms all other state-of-the-art methods. The average misclassification rate by SCC is 1.41% for sequences having two motions and 4.85% for three motions. |
2212.06373 | Jiang Li | Guoqing Lv, Jiang Li, Xiaoping Wang, Zhigang Zeng | InferEM: Inferring the Speaker's Intention for Empathetic Dialogue
Generation | Accepted by the 45th Annual Meeting of the Cognitive Science Society
(CogSci 2023) | null | null | null | cs.CL cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current approaches to empathetic response generation typically encode the
entire dialogue history directly and put the output into a decoder to generate
friendly feedback. These methods focus on modelling contextual information but
neglect capturing the direct intention of the speaker. We argue that the last
utteranc... | [
{
"created": "Tue, 13 Dec 2022 05:12:40 GMT",
"version": "v1"
},
{
"created": "Thu, 19 Jan 2023 17:56:49 GMT",
"version": "v2"
},
{
"created": "Tue, 28 Mar 2023 03:55:11 GMT",
"version": "v3"
},
{
"created": "Tue, 18 Apr 2023 11:47:23 GMT",
"version": "v4"
},
{
"c... | 2023-11-28 | [
[
"Lv",
"Guoqing",
""
],
[
"Li",
"Jiang",
""
],
[
"Wang",
"Xiaoping",
""
],
[
"Zeng",
"Zhigang",
""
]
] | Current approaches to empathetic response generation typically encode the entire dialogue history directly and put the output into a decoder to generate friendly feedback. These methods focus on modelling contextual information but neglect capturing the direct intention of the speaker. We argue that the last utterance ... |
2209.12678 | Thom Lake | Thom Lake | Flexible Job Classification with Zero-Shot Learning | To be published in RecSys in HR'22 | null | null | null | cs.CL cs.LG cs.NE | http://creativecommons.org/licenses/by/4.0/ | Using a taxonomy to organize information requires classifying objects
(documents, images, etc) with appropriate taxonomic classes. The flexible
nature of zero-shot learning is appealing for this task because it allows
classifiers to naturally adapt to taxonomy modifications. This work studies
zero-shot multi-label do... | [
{
"created": "Tue, 30 Aug 2022 18:18:21 GMT",
"version": "v1"
}
] | 2022-09-27 | [
[
"Lake",
"Thom",
""
]
] | Using a taxonomy to organize information requires classifying objects (documents, images, etc) with appropriate taxonomic classes. The flexible nature of zero-shot learning is appealing for this task because it allows classifiers to naturally adapt to taxonomy modifications. This work studies zero-shot multi-label docu... |
1910.00034 | Laltu Sardar | Laltu Sardar and Sushmita Ruj | FSPVDsse: A Forward Secure Publicly Verifiable Dynamic SSE scheme | 17 pages, Published in ProvSec 2019 | Provable Security (2019), 355-371 | 10.1007/978-3-030-31919-9_23 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A symmetric searchable encryption (SSE) scheme allows a client (data owner)
to search on encrypted data outsourced to an untrusted cloud server. The search
may either be a single keyword search or a complex query search like
conjunctive or Boolean keyword search. Information leakage is quite high for
dynamic SSE, whe... | [
{
"created": "Mon, 30 Sep 2019 18:04:20 GMT",
"version": "v1"
}
] | 2019-10-02 | [
[
"Sardar",
"Laltu",
""
],
[
"Ruj",
"Sushmita",
""
]
] | A symmetric searchable encryption (SSE) scheme allows a client (data owner) to search on encrypted data outsourced to an untrusted cloud server. The search may either be a single keyword search or a complex query search like conjunctive or Boolean keyword search. Information leakage is quite high for dynamic SSE, where... |
1703.01622 | Marc Aubreville | Marc Aubreville, Christian Knipfer, Nicolai Oetter, Christian
Jaremenko, Erik Rodner, Joachim Denzler, Christopher Bohr, Helmut Neumann,
Florian Stelzle and Andreas Maier | Automatic Classification of Cancerous Tissue in Laserendomicroscopy
Images of the Oral Cavity using Deep Learning | 12 pages, 5 figures | Scientific Reports 7, Article number: 11979 (2017) | 10.1038/s41598-017-12320-8 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Oral Squamous Cell Carcinoma (OSCC) is a common type of cancer of the oral
epithelium. Despite their high impact on mortality, sufficient screening
methods for early diagnosis of OSCC often lack accuracy and thus OSCCs are
mostly diagnosed at a late stage. Early detection and accurate outline
estimation of OSCCs woul... | [
{
"created": "Sun, 5 Mar 2017 16:48:01 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Mar 2017 10:58:24 GMT",
"version": "v2"
}
] | 2017-09-21 | [
[
"Aubreville",
"Marc",
""
],
[
"Knipfer",
"Christian",
""
],
[
"Oetter",
"Nicolai",
""
],
[
"Jaremenko",
"Christian",
""
],
[
"Rodner",
"Erik",
""
],
[
"Denzler",
"Joachim",
""
],
[
"Bohr",
"Christopher",
""... | Oral Squamous Cell Carcinoma (OSCC) is a common type of cancer of the oral epithelium. Despite their high impact on mortality, sufficient screening methods for early diagnosis of OSCC often lack accuracy and thus OSCCs are mostly diagnosed at a late stage. Early detection and accurate outline estimation of OSCCs would ... |
1804.00954 | Thomas Vogel | Thomas Vogel (1) ((1) Humboldt-Universit\"at zu Berlin, Germany) | mRUBiS: An Exemplar for Model-Based Architectural Self-Healing and
Self-Optimization | null | SEAMS'18: 13th International Symposium on Software Engineering for
Adaptive and Self-Managing Systems, May 28-29, 2018, Gothenburg, Sweden | 10.1145/3194133.3194161 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Self-adaptive software systems are often structured into an adaptation engine
that manages an adaptable software by operating on a runtime model that
represents the architecture of the software (model-based architectural
self-adaptation). Despite the popularity of such approaches, existing exemplars
provide applicati... | [
{
"created": "Tue, 3 Apr 2018 13:40:49 GMT",
"version": "v1"
}
] | 2018-04-04 | [
[
"Vogel",
"Thomas",
"",
"Humboldt-Universität zu Berlin, Germany"
]
] | Self-adaptive software systems are often structured into an adaptation engine that manages an adaptable software by operating on a runtime model that represents the architecture of the software (model-based architectural self-adaptation). Despite the popularity of such approaches, existing exemplars provide application... |
1905.11340 | Kimon Fountoulakis | S. Das, J. Demmel, K. Fountoulakis, L. Grigori, M. W. Mahoney, S. Yang | Parallel and Communication Avoiding Least Angle Regression | 21 pages, 8 figures, 3 tables | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We are interested in parallelizing the Least Angle Regression (LARS)
algorithm for fitting linear regression models to high-dimensional data. We
consider two parallel and communication avoiding versions of the basic LARS
algorithm. The two algorithms have different asymptotic costs and practical
performance. One offe... | [
{
"created": "Mon, 27 May 2019 17:00:16 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Dec 2019 07:19:06 GMT",
"version": "v2"
},
{
"created": "Sat, 12 Sep 2020 22:00:10 GMT",
"version": "v3"
}
] | 2020-09-15 | [
[
"Das",
"S.",
""
],
[
"Demmel",
"J.",
""
],
[
"Fountoulakis",
"K.",
""
],
[
"Grigori",
"L.",
""
],
[
"Mahoney",
"M. W.",
""
],
[
"Yang",
"S.",
""
]
] | We are interested in parallelizing the Least Angle Regression (LARS) algorithm for fitting linear regression models to high-dimensional data. We consider two parallel and communication avoiding versions of the basic LARS algorithm. The two algorithms have different asymptotic costs and practical performance. One offers... |
1904.09841 | Cameron Musco | Cameron Musco and Christopher Musco and David P. Woodruff | Simple Heuristics Yield Provable Algorithms for Masked Low-Rank
Approximation | ITCS 2021 | null | null | null | cs.DS cs.LG cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In $masked\ low-rank\ approximation$, one is given $A \in \mathbb{R}^{n
\times n}$ and binary mask matrix $W \in \{0,1\}^{n \times n}$. The goal is to
find a rank-$k$ matrix $L$ for which: $$cost(L) = \sum_{i=1}^{n} \sum_{j =
1}^{n} W_{i,j} \cdot (A_{i,j} - L_{i,j} )^2 \leq OPT + \epsilon \|A\|_F^2 ,$$
where $OPT = \... | [
{
"created": "Mon, 22 Apr 2019 13:01:07 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Feb 2020 14:55:26 GMT",
"version": "v2"
},
{
"created": "Fri, 17 Apr 2020 17:33:07 GMT",
"version": "v3"
},
{
"created": "Mon, 30 Nov 2020 05:32:14 GMT",
"version": "v4"
}
] | 2020-12-01 | [
[
"Musco",
"Cameron",
""
],
[
"Musco",
"Christopher",
""
],
[
"Woodruff",
"David P.",
""
]
] | In $masked\ low-rank\ approximation$, one is given $A \in \mathbb{R}^{n \times n}$ and binary mask matrix $W \in \{0,1\}^{n \times n}$. The goal is to find a rank-$k$ matrix $L$ for which: $$cost(L) = \sum_{i=1}^{n} \sum_{j = 1}^{n} W_{i,j} \cdot (A_{i,j} - L_{i,j} )^2 \leq OPT + \epsilon \|A\|_F^2 ,$$ where $OPT = \mi... |
2210.10865 | Thomas Lew | Thomas Lew, Sumeet Singh, Mario Prats, Jeffrey Bingham, Jonathan
Weisz, Benjie Holson, Xiaohan Zhang, Vikas Sindhwani, Yao Lu, Fei Xia, Peng
Xu, Tingnan Zhang, Jie Tan, Montserrat Gonzalez | Robotic Table Wiping via Reinforcement Learning and Whole-body
Trajectory Optimization | null | null | null | null | cs.RO cs.AI cs.LG cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a framework to enable multipurpose assistive mobile robots to
autonomously wipe tables to clean spills and crumbs. This problem is
challenging, as it requires planning wiping actions while reasoning over
uncertain latent dynamics of crumbs and spills captured via high-dimensional
visual observations. Simul... | [
{
"created": "Wed, 19 Oct 2022 20:12:43 GMT",
"version": "v1"
}
] | 2022-10-21 | [
[
"Lew",
"Thomas",
""
],
[
"Singh",
"Sumeet",
""
],
[
"Prats",
"Mario",
""
],
[
"Bingham",
"Jeffrey",
""
],
[
"Weisz",
"Jonathan",
""
],
[
"Holson",
"Benjie",
""
],
[
"Zhang",
"Xiaohan",
""
],
[
"Sind... | We propose a framework to enable multipurpose assistive mobile robots to autonomously wipe tables to clean spills and crumbs. This problem is challenging, as it requires planning wiping actions while reasoning over uncertain latent dynamics of crumbs and spills captured via high-dimensional visual observations. Simulta... |
2203.12775 | Muhammad Mohtasim Sajjad | Muhammad Mohtasim Sajjad, Dhammika Jayalath, Yu-Chu Tian, and Carlos
J. Bernardos | ZSM-based Management and Orchestration of 3GPP Network Slicing: An
Architectural Framework and Deployment Options | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Driven by closed-loop automation, the Zero-Touch Network and Services
Management (ZSM) framework offers invigorating features for the end-to-end
management and orchestration of a sliced network. Although ZSM is considered a
promising framework by 3GPP, there is a lack of concrete ZSM-based solutions
for the 3GPP Netw... | [
{
"created": "Wed, 23 Mar 2022 23:57:38 GMT",
"version": "v1"
}
] | 2022-03-25 | [
[
"Sajjad",
"Muhammad Mohtasim",
""
],
[
"Jayalath",
"Dhammika",
""
],
[
"Tian",
"Yu-Chu",
""
],
[
"Bernardos",
"Carlos J.",
""
]
] | Driven by closed-loop automation, the Zero-Touch Network and Services Management (ZSM) framework offers invigorating features for the end-to-end management and orchestration of a sliced network. Although ZSM is considered a promising framework by 3GPP, there is a lack of concrete ZSM-based solutions for the 3GPP Networ... |
2408.08087 | Xingxing Yang | Huiyu Zhai, Guang Jin, Xingxing Yang, Guosheng Kang | ColorMamba: Towards High-quality NIR-to-RGB Spectral Translation with
Mamba | Code is available at https://github.com/AlexYangxx/ColorMamba | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Translating NIR to the visible spectrum is challenging due to cross-domain
complexities. Current models struggle to balance a broad receptive field with
computational efficiency, limiting practical use. Although the Selective
Structured State Space Model, especially the improved version, Mamba, excels in
generative t... | [
{
"created": "Thu, 15 Aug 2024 11:29:13 GMT",
"version": "v1"
}
] | 2024-08-16 | [
[
"Zhai",
"Huiyu",
""
],
[
"Jin",
"Guang",
""
],
[
"Yang",
"Xingxing",
""
],
[
"Kang",
"Guosheng",
""
]
] | Translating NIR to the visible spectrum is challenging due to cross-domain complexities. Current models struggle to balance a broad receptive field with computational efficiency, limiting practical use. Although the Selective Structured State Space Model, especially the improved version, Mamba, excels in generative tas... |
1905.12155 | Matteo Dell'Amico Ph.D. | Michael Mitzenmacher and Matteo Dell'Amico | The Supermarket Model with Known and Predicted Service Times | Revision, 16 pages, 22 figures. Published at IEEE TPDS | null | 10.1109/TPDS.2022.3146195 | null | cs.PF cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The supermarket model refers to a system with a large number of queues, where
new customers choose d queues at random and join the one with the fewest
customers. This model demonstrates the power of even small amounts of choice,
as compared to simply joining a queue chosen uniformly at random, for load
balancing syst... | [
{
"created": "Thu, 23 May 2019 15:33:45 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Oct 2020 14:44:09 GMT",
"version": "v2"
},
{
"created": "Sat, 22 Jan 2022 14:26:00 GMT",
"version": "v3"
},
{
"created": "Thu, 17 Feb 2022 08:30:37 GMT",
"version": "v4"
}
] | 2022-02-18 | [
[
"Mitzenmacher",
"Michael",
""
],
[
"Dell'Amico",
"Matteo",
""
]
] | The supermarket model refers to a system with a large number of queues, where new customers choose d queues at random and join the one with the fewest customers. This model demonstrates the power of even small amounts of choice, as compared to simply joining a queue chosen uniformly at random, for load balancing system... |
1703.01958 | David Hallac | David Hallac, Youngsuk Park, Stephen Boyd, Jure Leskovec | Network Inference via the Time-Varying Graphical Lasso | null | null | null | null | cs.LG cs.SI math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many important problems can be modeled as a system of interconnected
entities, where each entity is recording time-dependent observations or
measurements. In order to spot trends, detect anomalies, and interpret the
temporal dynamics of such data, it is essential to understand the relationships
between the different ... | [
{
"created": "Mon, 6 Mar 2017 16:35:48 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Jun 2017 01:07:39 GMT",
"version": "v2"
}
] | 2017-06-13 | [
[
"Hallac",
"David",
""
],
[
"Park",
"Youngsuk",
""
],
[
"Boyd",
"Stephen",
""
],
[
"Leskovec",
"Jure",
""
]
] | Many important problems can be modeled as a system of interconnected entities, where each entity is recording time-dependent observations or measurements. In order to spot trends, detect anomalies, and interpret the temporal dynamics of such data, it is essential to understand the relationships between the different en... |
2403.05358 | Jacopo Lenti | Jacopo Lenti, Fabrizio Silvestri, Gianmarco De Francisci Morales | Variational Inference of Parameters in Opinion Dynamics Models | null | null | null | null | cs.CY cs.LG cs.SI stat.ML | http://creativecommons.org/licenses/by/4.0/ | Despite the frequent use of agent-based models (ABMs) for studying social
phenomena, parameter estimation remains a challenge, often relying on costly
simulation-based heuristics. This work uses variational inference to estimate
the parameters of an opinion dynamics ABM, by transforming the estimation
problem into an... | [
{
"created": "Fri, 8 Mar 2024 14:45:18 GMT",
"version": "v1"
}
] | 2024-03-11 | [
[
"Lenti",
"Jacopo",
""
],
[
"Silvestri",
"Fabrizio",
""
],
[
"Morales",
"Gianmarco De Francisci",
""
]
] | Despite the frequent use of agent-based models (ABMs) for studying social phenomena, parameter estimation remains a challenge, often relying on costly simulation-based heuristics. This work uses variational inference to estimate the parameters of an opinion dynamics ABM, by transforming the estimation problem into an o... |
2104.02387 | Tina Raissi | Tina Raissi, Eugen Beck, Ralf Schl\"uter, Hermann Ney | Towards Consistent Hybrid HMM Acoustic Modeling | null | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High-performance hybrid automatic speech recognition (ASR) systems are often
trained with clustered triphone outputs, and thus require a complex training
pipeline to generate the clustering. The same complex pipeline is often
utilized in order to generate an alignment for use in frame-wise cross-entropy
training. In ... | [
{
"created": "Tue, 6 Apr 2021 09:24:01 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Apr 2021 07:51:36 GMT",
"version": "v2"
},
{
"created": "Tue, 12 Oct 2021 11:52:41 GMT",
"version": "v3"
}
] | 2021-10-13 | [
[
"Raissi",
"Tina",
""
],
[
"Beck",
"Eugen",
""
],
[
"Schlüter",
"Ralf",
""
],
[
"Ney",
"Hermann",
""
]
] | High-performance hybrid automatic speech recognition (ASR) systems are often trained with clustered triphone outputs, and thus require a complex training pipeline to generate the clustering. The same complex pipeline is often utilized in order to generate an alignment for use in frame-wise cross-entropy training. In th... |
2310.09847 | Xiaoming Li Dr. | Xiaoming Li, Hubert Normandin-Taillon, Chun Wang, Xiao Huang | XRMDN: An Extended Recurrent Mixture Density Network for Short-Term
Probabilistic Rider Demand Forecasting with High Volatility | 11 pages, 14 figures, 5 tables | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | In the realm of Mobility-on-Demand (MoD) systems, the forecasting of rider
demand is a cornerstone for operational decision-making and system
optimization. Traditional forecasting methodologies primarily yield point
estimates, thereby neglecting the inherent uncertainty within demand
projections. Moreover, MoD demand... | [
{
"created": "Sun, 15 Oct 2023 14:18:42 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Mar 2024 13:49:52 GMT",
"version": "v2"
}
] | 2024-03-06 | [
[
"Li",
"Xiaoming",
""
],
[
"Normandin-Taillon",
"Hubert",
""
],
[
"Wang",
"Chun",
""
],
[
"Huang",
"Xiao",
""
]
] | In the realm of Mobility-on-Demand (MoD) systems, the forecasting of rider demand is a cornerstone for operational decision-making and system optimization. Traditional forecasting methodologies primarily yield point estimates, thereby neglecting the inherent uncertainty within demand projections. Moreover, MoD demand l... |
0809.4882 | Aleksandrs Slivkins | Robert Kleinberg, Aleksandrs Slivkins and Eli Upfal | Multi-Armed Bandits in Metric Spaces | 16 pages, 0 figures | null | null | null | cs.DS cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a multi-armed bandit problem, an online algorithm chooses from a set of
strategies in a sequence of trials so as to maximize the total payoff of the
chosen strategies. While the performance of bandit algorithms with a small
finite strategy set is quite well understood, bandit problems with large
strategy sets are ... | [
{
"created": "Mon, 29 Sep 2008 01:58:13 GMT",
"version": "v1"
}
] | 2008-09-30 | [
[
"Kleinberg",
"Robert",
""
],
[
"Slivkins",
"Aleksandrs",
""
],
[
"Upfal",
"Eli",
""
]
] | In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials so as to maximize the total payoff of the chosen strategies. While the performance of bandit algorithms with a small finite strategy set is quite well understood, bandit problems with large strategy sets are st... |
1706.03170 | Amirhossein Tavanaei | Amirhossein Tavanaei and Anthony Maida | Bio-Inspired Multi-Layer Spiking Neural Network Extracts Discriminative
Features from Speech Signals | null | Neural Information Processing. ICONIP 2017. Lecture Notes in
Computer Science, vol 10639 | 10.1007/978-3-319-70136-3_95 | null | cs.NE cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spiking neural networks (SNNs) enable power-efficient implementations due to
their sparse, spike-based coding scheme. This paper develops a bio-inspired SNN
that uses unsupervised learning to extract discriminative features from speech
signals, which can subsequently be used in a classifier. The architecture
consists... | [
{
"created": "Sat, 10 Jun 2017 02:14:42 GMT",
"version": "v1"
}
] | 2017-11-23 | [
[
"Tavanaei",
"Amirhossein",
""
],
[
"Maida",
"Anthony",
""
]
] | Spiking neural networks (SNNs) enable power-efficient implementations due to their sparse, spike-based coding scheme. This paper develops a bio-inspired SNN that uses unsupervised learning to extract discriminative features from speech signals, which can subsequently be used in a classifier. The architecture consists o... |
1611.03019 | Pascal Mainini | Pascal Mainini and Annett Laube-Rosenpflanzer | Access Control in Linked Data Using WebID | Full version of arXiv:1610.04405 | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Linked Data technologies become increasingly important in many domains. Key
factors for their breakthrough are security and trust, especially when sensible
or personal data are involved. Classical means for access control lack
granularity when parts of the Linked Data graph must be protected. The WebID,
combining sem... | [
{
"created": "Wed, 9 Nov 2016 17:21:35 GMT",
"version": "v1"
}
] | 2016-11-10 | [
[
"Mainini",
"Pascal",
""
],
[
"Laube-Rosenpflanzer",
"Annett",
""
]
] | Linked Data technologies become increasingly important in many domains. Key factors for their breakthrough are security and trust, especially when sensible or personal data are involved. Classical means for access control lack granularity when parts of the Linked Data graph must be protected. The WebID, combining seman... |
2404.01976 | Kento Nishi | Kento Nishi, Junsik Kim, Wanhua Li, Hanspeter Pfister | Joint-Task Regularization for Partially Labeled Multi-Task Learning | Accepted paper to CVPR 2024 (main conference) | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Multi-task learning has become increasingly popular in the machine learning
field, but its practicality is hindered by the need for large, labeled
datasets. Most multi-task learning methods depend on fully labeled datasets
wherein each input example is accompanied by ground-truth labels for all target
tasks. Unfortun... | [
{
"created": "Tue, 2 Apr 2024 14:16:59 GMT",
"version": "v1"
}
] | 2024-04-03 | [
[
"Nishi",
"Kento",
""
],
[
"Kim",
"Junsik",
""
],
[
"Li",
"Wanhua",
""
],
[
"Pfister",
"Hanspeter",
""
]
] | Multi-task learning has become increasingly popular in the machine learning field, but its practicality is hindered by the need for large, labeled datasets. Most multi-task learning methods depend on fully labeled datasets wherein each input example is accompanied by ground-truth labels for all target tasks. Unfortunat... |
2110.04476 | Christian Wallraven | Doo Yon Kim, Christian Wallraven | Label quality in AffectNet: results of crowd-based re-annotation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | AffectNet is one of the most popular resources for facial expression
recognition (FER) on relatively unconstrained in-the-wild images. Given that
images were annotated by only one annotator with limited consistency checks on
the data, however, label quality and consistency may be limited. Here, we take
a similar appr... | [
{
"created": "Sat, 9 Oct 2021 06:48:08 GMT",
"version": "v1"
}
] | 2021-10-12 | [
[
"Kim",
"Doo Yon",
""
],
[
"Wallraven",
"Christian",
""
]
] | AffectNet is one of the most popular resources for facial expression recognition (FER) on relatively unconstrained in-the-wild images. Given that images were annotated by only one annotator with limited consistency checks on the data, however, label quality and consistency may be limited. Here, we take a similar approa... |
2004.02757 | Yuanhan Mo | Yuanhan Mo and Shuo Wang and Chengliang Dai and Rui Zhou and Zhongzhao
Teng and Wenjia Bai and Yike Guo | Efficient Deep Representation Learning by Adaptive Latent Space Sampling | null | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Supervised deep learning requires a large amount of training samples with
annotations (e.g. label class for classification task, pixel- or voxel-wised
label map for segmentation tasks), which are expensive and time-consuming to
obtain. During the training of a deep neural network, the annotated samples are
fed into t... | [
{
"created": "Thu, 19 Mar 2020 22:17:02 GMT",
"version": "v1"
},
{
"created": "Sun, 12 Apr 2020 18:25:55 GMT",
"version": "v2"
}
] | 2020-04-14 | [
[
"Mo",
"Yuanhan",
""
],
[
"Wang",
"Shuo",
""
],
[
"Dai",
"Chengliang",
""
],
[
"Zhou",
"Rui",
""
],
[
"Teng",
"Zhongzhao",
""
],
[
"Bai",
"Wenjia",
""
],
[
"Guo",
"Yike",
""
]
] | Supervised deep learning requires a large amount of training samples with annotations (e.g. label class for classification task, pixel- or voxel-wised label map for segmentation tasks), which are expensive and time-consuming to obtain. During the training of a deep neural network, the annotated samples are fed into the... |
1011.3268 | Brendan Lucier | Brendan Lucier, Renato Paes Leme | Improved Social Welfare Bounds for GSP at Equilibrium | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Generalized Second Price auction is the primary method by which sponsered
search advertisements are sold. We study the performance of this auction under
various equilibrium concepts. In particular, we demonstrate that the Bayesian
Price of Anarchy is at most $2(1-1/e)^{-1} \approx 3.16$, significantly
improving u... | [
{
"created": "Sun, 14 Nov 2010 23:53:27 GMT",
"version": "v1"
}
] | 2010-11-16 | [
[
"Lucier",
"Brendan",
""
],
[
"Leme",
"Renato Paes",
""
]
] | The Generalized Second Price auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction under various equilibrium concepts. In particular, we demonstrate that the Bayesian Price of Anarchy is at most $2(1-1/e)^{-1} \approx 3.16$, significantly improving upo... |
2103.03759 | Jean Le'Clerc Arrastia | Jean Le'Clerc Arrastia, Nick Heilenk\"otter, Daniel Otero Baguer, Lena
Hauberg-Lotte, Tobias Boskamp, Sonja Hetzer, Nicole Duschner, J\"org
Schaller, and Peter Maa{\ss} | Deeply supervised UNet for semantic segmentation to assist
dermatopathological assessment of Basal Cell Carcinoma (BCC) | null | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Accurate and fast assessment of resection margins is an essential part of a
dermatopathologist's clinical routine. In this work, we successfully develop a
deep learning method to assist the pathologists by marking critical regions
that have a high probability of exhibiting pathological features in Whole Slide
Images ... | [
{
"created": "Fri, 5 Mar 2021 15:39:55 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Mar 2021 21:56:14 GMT",
"version": "v2"
}
] | 2021-03-10 | [
[
"Arrastia",
"Jean Le'Clerc",
""
],
[
"Heilenkötter",
"Nick",
""
],
[
"Baguer",
"Daniel Otero",
""
],
[
"Hauberg-Lotte",
"Lena",
""
],
[
"Boskamp",
"Tobias",
""
],
[
"Hetzer",
"Sonja",
""
],
[
"Duschner",
"Nicol... | Accurate and fast assessment of resection margins is an essential part of a dermatopathologist's clinical routine. In this work, we successfully develop a deep learning method to assist the pathologists by marking critical regions that have a high probability of exhibiting pathological features in Whole Slide Images (W... |
1701.04693 | Sepehr Valipour | Sepehr Valipour, Camilo Perez, Martin Jagersand | Incremental Learning for Robot Perception through HRI | null | null | null | null | cs.RO cs.HC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scene understanding and object recognition is a difficult to achieve yet
crucial skill for robots. Recently, Convolutional Neural Networks (CNN), have
shown success in this task. However, there is still a gap between their
performance on image datasets and real-world robotics scenarios. We present a
novel paradigm fo... | [
{
"created": "Tue, 17 Jan 2017 14:29:05 GMT",
"version": "v1"
}
] | 2017-01-18 | [
[
"Valipour",
"Sepehr",
""
],
[
"Perez",
"Camilo",
""
],
[
"Jagersand",
"Martin",
""
]
] | Scene understanding and object recognition is a difficult to achieve yet crucial skill for robots. Recently, Convolutional Neural Networks (CNN), have shown success in this task. However, there is still a gap between their performance on image datasets and real-world robotics scenarios. We present a novel paradigm for ... |
2003.04754 | {\L}ukasz D\k{e}bowski | {\L}ukasz D\k{e}bowski | On a Class of Markov Order Estimators Based on PPM and Other Universal
Codes | 17 pages, no figures. We thank Boris Ryabko for pointing out to us
his very relevant references, which we failed to cite in the first draft of
this paper. We apologize for this unintentional omission | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate a class of estimators of the Markov order for stationary
ergodic processes which form a slight modification of the constructions by
Merhav, Gutman, and Ziv in 1989 as well as by Ryabko, Astola, and Malyutov in
2006 and 2016. All the considered estimators compare the estimate of the
entropy rate given b... | [
{
"created": "Tue, 10 Mar 2020 14:14:18 GMT",
"version": "v1"
},
{
"created": "Mon, 23 Mar 2020 09:44:14 GMT",
"version": "v2"
}
] | 2020-03-24 | [
[
"Dębowski",
"Łukasz",
""
]
] | We investigate a class of estimators of the Markov order for stationary ergodic processes which form a slight modification of the constructions by Merhav, Gutman, and Ziv in 1989 as well as by Ryabko, Astola, and Malyutov in 2006 and 2016. All the considered estimators compare the estimate of the entropy rate given by ... |
0704.3120 | Oliver Henkel | Oliver Henkel | Space Time Codes from Permutation Codes | null | Proc. IEEE GlobeCom, San Francisco, California, Nov. 2006 | null | null | cs.IT math.IT | null | A new class of space time codes with high performance is presented. The code
design utilizes tailor-made permutation codes, which are known to have large
minimal distances as spherical codes. A geometric connection between spherical
and space time codes has been used to translate them into the final space time
codes.... | [
{
"created": "Tue, 24 Apr 2007 05:45:30 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Henkel",
"Oliver",
""
]
] | A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. S... |
2109.08068 | Riadh Belkebir | Riadh Belkebir and Nizar Habash | Automatic Error Type Annotation for Arabic | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We present ARETA, an automatic error type annotation system for Modern
Standard Arabic. We design ARETA to address Arabic's morphological richness and
orthographic ambiguity. We base our error taxonomy on the Arabic Learner Corpus
(ALC) Error Tagset with some modifications. ARETA achieves a performance of
85.8% (micr... | [
{
"created": "Thu, 16 Sep 2021 15:50:11 GMT",
"version": "v1"
}
] | 2021-09-17 | [
[
"Belkebir",
"Riadh",
""
],
[
"Habash",
"Nizar",
""
]
] | We present ARETA, an automatic error type annotation system for Modern Standard Arabic. We design ARETA to address Arabic's morphological richness and orthographic ambiguity. We base our error taxonomy on the Arabic Learner Corpus (ALC) Error Tagset with some modifications. ARETA achieves a performance of 85.8% (micro ... |
2211.07393 | Isabella Degen | Isabella Degen, Zahraa S. Abdallah | Temporal patterns in insulin needs for Type 1 diabetes | Submitted and accepted for presentation as a poster at the NeurIPS22
Time series for Health workshop, https://timeseriesforhealth.github.io/ | null | 10.48550/arxiv.2211.07393 | null | cs.LG q-bio.QM stat.ML | http://creativecommons.org/licenses/by/4.0/ | Type 1 Diabetes (T1D) is a chronic condition where the body produces little
or no insulin, a hormone required for the cells to use blood glucose (BG) for
energy and to regulate BG levels in the body. Finding the right insulin dose
and time remains a complex, challenging and as yet unsolved control task. In
this study... | [
{
"created": "Mon, 14 Nov 2022 14:19:50 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Nov 2022 11:09:54 GMT",
"version": "v2"
}
] | 2022-11-18 | [
[
"Degen",
"Isabella",
""
],
[
"Abdallah",
"Zahraa S.",
""
]
] | Type 1 Diabetes (T1D) is a chronic condition where the body produces little or no insulin, a hormone required for the cells to use blood glucose (BG) for energy and to regulate BG levels in the body. Finding the right insulin dose and time remains a complex, challenging and as yet unsolved control task. In this study, ... |
1802.02598 | Matthew Klawonn | Matthew Klawonn and Eric Heim | Generating Triples with Adversarial Networks for Scene Graph
Construction | Accepted to AAAI 2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Driven by successes in deep learning, computer vision research has begun to
move beyond object detection and image classification to more sophisticated
tasks like image captioning or visual question answering. Motivating such
endeavors is the desire for models to capture not only objects present in an
image, but more... | [
{
"created": "Wed, 7 Feb 2018 19:12:31 GMT",
"version": "v1"
}
] | 2018-02-09 | [
[
"Klawonn",
"Matthew",
""
],
[
"Heim",
"Eric",
""
]
] | Driven by successes in deep learning, computer vision research has begun to move beyond object detection and image classification to more sophisticated tasks like image captioning or visual question answering. Motivating such endeavors is the desire for models to capture not only objects present in an image, but more f... |
2101.03652 | Hao Wu | Hao Wu, Junhao Gan, Zhewei Wei, Rui Zhang | Unifying the Global and Local Approaches: An Efficient Power Iteration
with Forward Push | 12 pages | null | null | null | cs.DS | http://creativecommons.org/licenses/by/4.0/ | Personalized PageRank (PPR) is a critical measure of the importance of a node
t to a source node s in a graph. The Single-Source PPR (SSPPR) query computes
the PPR's of all the nodes with respect to s on a directed graph $G$ with $n$
nodes and $m$ edges, and it is an essential operation widely used in graph
applicati... | [
{
"created": "Mon, 11 Jan 2021 01:05:48 GMT",
"version": "v1"
},
{
"created": "Sun, 25 Apr 2021 00:24:08 GMT",
"version": "v2"
}
] | 2021-04-27 | [
[
"Wu",
"Hao",
""
],
[
"Gan",
"Junhao",
""
],
[
"Wei",
"Zhewei",
""
],
[
"Zhang",
"Rui",
""
]
] | Personalized PageRank (PPR) is a critical measure of the importance of a node t to a source node s in a graph. The Single-Source PPR (SSPPR) query computes the PPR's of all the nodes with respect to s on a directed graph $G$ with $n$ nodes and $m$ edges, and it is an essential operation widely used in graph application... |
2106.01737 | Idan Mehalel | Yuval Filmus and Idan Mehalel | Optimal sets of questions for Twenty Questions | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the distributional Twenty Questions game, Bob chooses a number $x$ from
$1$ to $n$ according to a distribution $\mu$, and Alice (who knows $\mu$)
attempts to identify $x$ using Yes/No questions, which Bob answers truthfully.
Her goal is to minimize the expected number of questions.
The optimal strategy for the T... | [
{
"created": "Thu, 3 Jun 2021 10:33:49 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Mar 2024 13:01:12 GMT",
"version": "v2"
}
] | 2024-03-20 | [
[
"Filmus",
"Yuval",
""
],
[
"Mehalel",
"Idan",
""
]
] | In the distributional Twenty Questions game, Bob chooses a number $x$ from $1$ to $n$ according to a distribution $\mu$, and Alice (who knows $\mu$) attempts to identify $x$ using Yes/No questions, which Bob answers truthfully. Her goal is to minimize the expected number of questions. The optimal strategy for the Twent... |
1708.06334 | S\'ergio Matos | Carlos Viana-Ferreira, Ant\'onio Guerra, Jo\~ao F. Silva, S\'ergio
Matos, Carlos Costa | An Intelligent Cloud Storage Gateway for Medical Imaging | Preprint to be published in Journal of Medical Systems. 8 pages, 5
figures | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Historically, medical imaging repositories have been supported by indoor
infrastructures. However, the amount of diagnostic imaging procedures has
continuously increased over the last decades, imposing several challenges
associated with the storage volume, data redundancy and availability. Cloud
platforms are focused... | [
{
"created": "Thu, 27 Jul 2017 11:10:44 GMT",
"version": "v1"
}
] | 2017-08-22 | [
[
"Viana-Ferreira",
"Carlos",
""
],
[
"Guerra",
"António",
""
],
[
"Silva",
"João F.",
""
],
[
"Matos",
"Sérgio",
""
],
[
"Costa",
"Carlos",
""
]
] | Historically, medical imaging repositories have been supported by indoor infrastructures. However, the amount of diagnostic imaging procedures has continuously increased over the last decades, imposing several challenges associated with the storage volume, data redundancy and availability. Cloud platforms are focused o... |
2403.10923 | David Rundel | David Rundel, Julius Kobialka, Constantin von Crailsheim, Matthias
Feurer, Thomas Nagler, David R\"ugamer | Interpretable Machine Learning for TabPFN | This preprint has not undergone peer review or any post-submission
improvements or corrections. The Version of Record of this contribution is
published in Explainable Artificial Intelligence, and is available online at
https://doi.org/10.1007/978-3-031-63797-1_23 | null | 10.1007/978-3-031-63797-1_23 | null | cs.LG cs.AI stat.CO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recently developed Prior-Data Fitted Networks (PFNs) have shown very
promising results for applications in low-data regimes. The TabPFN model, a
special case of PFNs for tabular data, is able to achieve state-of-the-art
performance on a variety of classification tasks while producing posterior
predictive distribu... | [
{
"created": "Sat, 16 Mar 2024 13:35:15 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Jul 2024 16:10:52 GMT",
"version": "v2"
}
] | 2024-07-24 | [
[
"Rundel",
"David",
""
],
[
"Kobialka",
"Julius",
""
],
[
"von Crailsheim",
"Constantin",
""
],
[
"Feurer",
"Matthias",
""
],
[
"Nagler",
"Thomas",
""
],
[
"Rügamer",
"David",
""
]
] | The recently developed Prior-Data Fitted Networks (PFNs) have shown very promising results for applications in low-data regimes. The TabPFN model, a special case of PFNs for tabular data, is able to achieve state-of-the-art performance on a variety of classification tasks while producing posterior predictive distributi... |
2304.12376 | Yaroslav Golubev | Anastasiia Birillo, Elizaveta Artser, Yaroslav Golubev, Maria Tigina,
Hieke Keuning, Nikolay Vyahhi, Timofey Bryksin | Detecting Code Quality Issues in Pre-written Templates of Programming
Tasks in Online Courses | Accepted to ITiCSE'23, 7 pages, 3 figures | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we developed an algorithm for detecting code quality issues in
the templates of online programming tasks, validated it, and conducted an
empirical study on the dataset of student solutions. The algorithm consists of
analyzing recurring unfixed issues in solutions of different students, matching
them wit... | [
{
"created": "Mon, 24 Apr 2023 18:13:27 GMT",
"version": "v1"
}
] | 2023-04-26 | [
[
"Birillo",
"Anastasiia",
""
],
[
"Artser",
"Elizaveta",
""
],
[
"Golubev",
"Yaroslav",
""
],
[
"Tigina",
"Maria",
""
],
[
"Keuning",
"Hieke",
""
],
[
"Vyahhi",
"Nikolay",
""
],
[
"Bryksin",
"Timofey",
""
... | In this work, we developed an algorithm for detecting code quality issues in the templates of online programming tasks, validated it, and conducted an empirical study on the dataset of student solutions. The algorithm consists of analyzing recurring unfixed issues in solutions of different students, matching them with ... |
2004.00094 | Bram Renting | Bram M. Renting (1), Holger H. Hoos (2), Catholijn M. Jonker (1 and 2)
((1) Delft University of Technology, (2) Leiden University) | Automated Configuration of Negotiation Strategies | Appears in Proceedings of the 19th International Conference on
Autonomous Agents and Multiagent Systems (AAMAS 2020) | http://ifaamas.org/Proceedings/aamas2020/pdfs/p1116.pdf | null | null | cs.MA cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Bidding and acceptance strategies have a substantial impact on the outcome of
negotiations in scenarios with linear additive and nonlinear utility functions.
Over the years, it has become clear that there is no single best strategy for
all negotiation settings, yet many fixed strategies are still being developed.
We ... | [
{
"created": "Tue, 31 Mar 2020 20:31:33 GMT",
"version": "v1"
}
] | 2020-09-15 | [
[
"Renting",
"Bram M.",
"",
"Delft University of Technology"
],
[
"Hoos",
"Holger H.",
"",
"Leiden University"
],
[
"Jonker",
"Catholijn M.",
"",
"1 and 2"
]
] | Bidding and acceptance strategies have a substantial impact on the outcome of negotiations in scenarios with linear additive and nonlinear utility functions. Over the years, it has become clear that there is no single best strategy for all negotiation settings, yet many fixed strategies are still being developed. We en... |
1807.04073 | Weiping Zheng | Weiping Zheng, Zhenyao Mo, Jiantao Yi | A punishment voting algorithm based on super categories construction for
acoustic scene classification | There is a minor mistake found in the voting process. So, We are very
sorry about this mistake and request to withdraw this manuscript | null | null | null | cs.SD cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In acoustic scene classification researches, audio segment is usually split
into multiple samples. Majority voting is then utilized to ensemble the results
of the samples. In this paper, we propose a punishment voting algorithm based
on the super categories construction method for acoustic scene classification.
Speci... | [
{
"created": "Wed, 11 Jul 2018 11:14:19 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Mar 2021 05:14:42 GMT",
"version": "v2"
}
] | 2021-03-31 | [
[
"Zheng",
"Weiping",
""
],
[
"Mo",
"Zhenyao",
""
],
[
"Yi",
"Jiantao",
""
]
] | In acoustic scene classification researches, audio segment is usually split into multiple samples. Majority voting is then utilized to ensemble the results of the samples. In this paper, we propose a punishment voting algorithm based on the super categories construction method for acoustic scene classification. Specifi... |
2009.13294 | Rohit Rawat | Rohit Rawat | Virtual Proximity Citation (VCP): A Supervised Deep Learning Method to
Relate Uncited Papers On Grounds of Citation Proximity | null | null | null | null | cs.DL cs.IR cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | Citation based approaches have seen good progress for recommending research
papers using citations in the paper. Citation proximity analysis which uses the
in-text citation proximity to find relatedness between two research papers is
better than co-citation analysis and bibliographic analysis. However, one
common pro... | [
{
"created": "Fri, 25 Sep 2020 12:24:00 GMT",
"version": "v1"
}
] | 2020-09-29 | [
[
"Rawat",
"Rohit",
""
]
] | Citation based approaches have seen good progress for recommending research papers using citations in the paper. Citation proximity analysis which uses the in-text citation proximity to find relatedness between two research papers is better than co-citation analysis and bibliographic analysis. However, one common probl... |
2205.04899 | Denis Avrilionis | Denis Avrilionis, Thomas Hardjono | From Trade-only to Zero-Value NFTs: The Asset Proxy NFT Paradigm in Web3 | 15 pages, 2 figures | null | null | null | cs.SE cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Many implementations of smart contracts available in NFT marketplaces today
allow the modification of NFT token attributes, without any specific mechanism
to control the consistency with off-chain metadata. We believe this is a
weakness in overall design of NFTs today. We propose a computation model called
the Asset ... | [
{
"created": "Fri, 6 May 2022 18:02:18 GMT",
"version": "v1"
},
{
"created": "Wed, 11 May 2022 03:43:10 GMT",
"version": "v2"
}
] | 2022-05-12 | [
[
"Avrilionis",
"Denis",
""
],
[
"Hardjono",
"Thomas",
""
]
] | Many implementations of smart contracts available in NFT marketplaces today allow the modification of NFT token attributes, without any specific mechanism to control the consistency with off-chain metadata. We believe this is a weakness in overall design of NFTs today. We propose a computation model called the Asset Pr... |
2106.10056 | Wensheng Xia | Wensheng Xia, Ying Li, Lan Zhang, Zhonghai Wu, Xiaoyong Yuan | A Vertical Federated Learning Framework for Horizontally Partitioned
Labels | 10 pages, 6 figures | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vertical federated learning is a collaborative machine learning framework to
train deep leaning models on vertically partitioned data with
privacy-preservation. It attracts much attention both from academia and
industry. Unfortunately, applying most existing vertical federated learning
methods in real-world applicati... | [
{
"created": "Fri, 18 Jun 2021 11:10:11 GMT",
"version": "v1"
}
] | 2021-06-21 | [
[
"Xia",
"Wensheng",
""
],
[
"Li",
"Ying",
""
],
[
"Zhang",
"Lan",
""
],
[
"Wu",
"Zhonghai",
""
],
[
"Yuan",
"Xiaoyong",
""
]
] | Vertical federated learning is a collaborative machine learning framework to train deep leaning models on vertically partitioned data with privacy-preservation. It attracts much attention both from academia and industry. Unfortunately, applying most existing vertical federated learning methods in real-world application... |
2408.08273 | John O'Connor | John O'Connor | ESCape the ClassRoom | null | null | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Educational Escape Rooms (EER's), through their use of immersive storytelling
and practical application of abstract concepts, present a novel new technique
for engaging learners in a variety of subjects. However, there is a significant
time and materials investment required to build new physical Escape Rooms, and
pri... | [
{
"created": "Thu, 15 Aug 2024 17:18:33 GMT",
"version": "v1"
}
] | 2024-08-16 | [
[
"O'Connor",
"John",
""
]
] | Educational Escape Rooms (EER's), through their use of immersive storytelling and practical application of abstract concepts, present a novel new technique for engaging learners in a variety of subjects. However, there is a significant time and materials investment required to build new physical Escape Rooms, and prior... |
1112.2930 | Zachary Friggstad | Zachary Friggstad | Multiple Traveling Salesmen in Asymmetric Metrics | 19 Pages, 3 Figures. First revision fixes a broken reference and adds
to the discussion for General 2-ATSPP | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider some generalizations of the Asymmetric Traveling Salesman Path
problem. Suppose we have an asymmetric metric G = (V,A) with two distinguished
nodes s,t. We are also given a positive integer k. The goal is to find k paths
of minimum total cost from s to t whose union spans all nodes. We call this the
k-Per... | [
{
"created": "Tue, 13 Dec 2011 15:59:58 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Dec 2011 14:35:31 GMT",
"version": "v2"
}
] | 2011-12-15 | [
[
"Friggstad",
"Zachary",
""
]
] | We consider some generalizations of the Asymmetric Traveling Salesman Path problem. Suppose we have an asymmetric metric G = (V,A) with two distinguished nodes s,t. We are also given a positive integer k. The goal is to find k paths of minimum total cost from s to t whose union spans all nodes. We call this the k-Perso... |
cs/0611142 | Mounira Kourjieh | Yannick Chevalier (IRIT), Mounira Kourjieh (IRIT) | A Symbolic Intruder Model for Hash-Collision Attacks | null | CSTVA'06, France (25/09/2006) | null | null | cs.CR | null | In the recent years, several practical methods have been published to compute
collisions on some commonly used hash functions. In this paper we present a
method to take into account, at the symbolic level, that an intruder actively
attacking a protocol execution may use these collision algorithms in reasonable
time d... | [
{
"created": "Tue, 28 Nov 2006 14:09:53 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Chevalier",
"Yannick",
"",
"IRIT"
],
[
"Kourjieh",
"Mounira",
"",
"IRIT"
]
] | In the recent years, several practical methods have been published to compute collisions on some commonly used hash functions. In this paper we present a method to take into account, at the symbolic level, that an intruder actively attacking a protocol execution may use these collision algorithms in reasonable time dur... |
2208.11910 | Jinhong Kim | Jinhong Kim, Yongjun Ahn, and Byonghyo Shim | Massive Data Generation for Deep Learning-aided Wireless Systems Using
Meta Learning and Generative Adversarial Network | null | null | 10.1109/TVT.2022.3204835 | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-nd/4.0/ | As an entirely-new paradigm to design the communication systems, deep
learning (DL), an approach that the machine learns the desired wireless
function, has received much attention recently. In order to fully realize the
benefit of DL-aided wireless system, we need to collect a large number of
training samples. Unfort... | [
{
"created": "Thu, 25 Aug 2022 07:45:31 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Kim",
"Jinhong",
""
],
[
"Ahn",
"Yongjun",
""
],
[
"Shim",
"Byonghyo",
""
]
] | As an entirely-new paradigm to design the communication systems, deep learning (DL), an approach that the machine learns the desired wireless function, has received much attention recently. In order to fully realize the benefit of DL-aided wireless system, we need to collect a large number of training samples. Unfortun... |
2107.11862 | Jan Brabec | Jan Brabec, Lukas Machlica | Decision-forest voting scheme for classification of rare classes in
network intrusion detection | \copyright 2018 IEEE. Personal use of this material is permitted.
Permission from IEEE must be obtained for all other uses, in any current or
future media, including reprinting/republishing this material for advertising
or promotional purposes, creating new collective works, for resale or
redistribution to serv... | 2018 IEEE International Conference on Systems, Man, and
Cybernetics (SMC), 2018, pp. 3325-3330 | 10.1109/SMC.2018.00563 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, Bayesian based aggregation of decision trees in an ensemble
(decision forest) is investigated. The focus is laid on multi-class
classification with number of samples significantly skewed toward one of the
classes. The algorithm leverages out-of-bag datasets to estimate prediction
errors of individual t... | [
{
"created": "Sun, 25 Jul 2021 18:01:12 GMT",
"version": "v1"
}
] | 2021-07-27 | [
[
"Brabec",
"Jan",
""
],
[
"Machlica",
"Lukas",
""
]
] | In this paper, Bayesian based aggregation of decision trees in an ensemble (decision forest) is investigated. The focus is laid on multi-class classification with number of samples significantly skewed toward one of the classes. The algorithm leverages out-of-bag datasets to estimate prediction errors of individual tre... |
2309.14094 | Yao Shi | Yao Shi, Ming Li | VoiceLens: Controllable Speaker Generation and Editing with Flow | null | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Currently, many multi-speaker speech synthesis and voice conversion systems
address speaker variations with an embedding vector. Modeling it directly
allows new voices outside of training data to be synthesized. GMM based
approaches such as Tacospawn are favored in literature for this generation
task, but there are s... | [
{
"created": "Mon, 25 Sep 2023 12:37:03 GMT",
"version": "v1"
}
] | 2023-09-26 | [
[
"Shi",
"Yao",
""
],
[
"Li",
"Ming",
""
]
] | Currently, many multi-speaker speech synthesis and voice conversion systems address speaker variations with an embedding vector. Modeling it directly allows new voices outside of training data to be synthesized. GMM based approaches such as Tacospawn are favored in literature for this generation task, but there are sti... |
1107.0607 | Achaleshwar Sahai | Achaleshwar Sahai, Gaurav Patel, Ashutosh Sabharwal | Pushing the limits of Full-duplex: Design and Real-time Implementation | 12 page Rice University technical report | null | null | TREE1104 | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work has shown the feasibility of single-channel full-duplex wireless
physical layer, allowing nodes to send and receive in the same frequency band
at the same time. In this report, we first design and implement a real-time
64-subcarrier 10 MHz full-duplex OFDM physical layer, FD-PHY. The proposed
FD-PHY not o... | [
{
"created": "Mon, 4 Jul 2011 12:35:50 GMT",
"version": "v1"
}
] | 2011-07-05 | [
[
"Sahai",
"Achaleshwar",
""
],
[
"Patel",
"Gaurav",
""
],
[
"Sabharwal",
"Ashutosh",
""
]
] | Recent work has shown the feasibility of single-channel full-duplex wireless physical layer, allowing nodes to send and receive in the same frequency band at the same time. In this report, we first design and implement a real-time 64-subcarrier 10 MHz full-duplex OFDM physical layer, FD-PHY. The proposed FD-PHY not onl... |
2211.14177 | Giang Nguyen | Giang Nguyen | Overcoming Catastrophic Forgetting by XAI | Master of Science Thesis at KAIST; 24 pages; Keywords: continual
learning, catastrophic forgetting, XAI, attribution map, interpretability | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Explaining the behaviors of deep neural networks, usually considered as black
boxes, is critical especially when they are now being adopted over diverse
aspects of human life. Taking the advantages of interpretable machine learning
(interpretable ML), this work proposes a novel tool called Catastrophic
Forgetting Dis... | [
{
"created": "Fri, 25 Nov 2022 15:32:07 GMT",
"version": "v1"
}
] | 2022-11-28 | [
[
"Nguyen",
"Giang",
""
]
] | Explaining the behaviors of deep neural networks, usually considered as black boxes, is critical especially when they are now being adopted over diverse aspects of human life. Taking the advantages of interpretable machine learning (interpretable ML), this work proposes a novel tool called Catastrophic Forgetting Disse... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.