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
2312.13115
Youjia Li
Youjia Li, Jianjun Shi, Zheng Zhang
A Novel Approach for Rapid Development Based on ChatGPT and Prompt Engineering
null
null
null
null
cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Code generation stands as a powerful technique in modern software development, improving development efficiency, reducing errors, and fostering standardization and consistency. Recently, ChatGPT has exhibited immense potential in automatic code generation. However, existing researches on code generation lack guidance...
[ { "created": "Wed, 20 Dec 2023 15:36:13 GMT", "version": "v1" }, { "created": "Thu, 21 Dec 2023 03:28:41 GMT", "version": "v2" } ]
2023-12-22
[ [ "Li", "Youjia", "" ], [ "Shi", "Jianjun", "" ], [ "Zhang", "Zheng", "" ] ]
Code generation stands as a powerful technique in modern software development, improving development efficiency, reducing errors, and fostering standardization and consistency. Recently, ChatGPT has exhibited immense potential in automatic code generation. However, existing researches on code generation lack guidance f...
1705.01963
Ray Li
Venkatesan Guruswami and Ray Li
Polynomial time decodable codes for the binary deletion channel
arXiv admin note: substantial text overlap with arXiv:1612.06335. The published version of this paper incorrectly states the alphabet size in Theorem 3.4. This version states the result correctly
IEEE Trans. Information Theory 65(4): 2171 - 2178 (2019)
null
null
cs.IT cs.DS math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In the random deletion channel, each bit is deleted independently with probability $p$. For the random deletion channel, the existence of codes of rate $(1-p)/9$, and thus bounded away from $0$ for any $p < 1$, has been known. We give an explicit construction with polynomial time encoding and deletion correction algo...
[ { "created": "Thu, 4 May 2017 18:18:07 GMT", "version": "v1" }, { "created": "Wed, 26 Jul 2017 17:10:26 GMT", "version": "v2" }, { "created": "Tue, 11 Jun 2019 23:12:58 GMT", "version": "v3" } ]
2019-06-13
[ [ "Guruswami", "Venkatesan", "" ], [ "Li", "Ray", "" ] ]
In the random deletion channel, each bit is deleted independently with probability $p$. For the random deletion channel, the existence of codes of rate $(1-p)/9$, and thus bounded away from $0$ for any $p < 1$, has been known. We give an explicit construction with polynomial time encoding and deletion correction algori...
2311.07763
Brian Barr PhD
Brian Barr, Noah Fatsi, Leif Hancox-Li, Peter Richter, Daniel Proano, and Caleb Mok
The Disagreement Problem in Faithfulness Metrics
6 pages (excluding refs and appendix)
null
null
null
cs.LG cs.AI
http://creativecommons.org/licenses/by-nc-sa/4.0/
The field of explainable artificial intelligence (XAI) aims to explain how black-box machine learning models work. Much of the work centers around the holy grail of providing post-hoc feature attributions to any model architecture. While the pace of innovation around novel methods has slowed down, the question remain...
[ { "created": "Mon, 13 Nov 2023 21:26:24 GMT", "version": "v1" } ]
2023-11-15
[ [ "Barr", "Brian", "" ], [ "Fatsi", "Noah", "" ], [ "Hancox-Li", "Leif", "" ], [ "Richter", "Peter", "" ], [ "Proano", "Daniel", "" ], [ "Mok", "Caleb", "" ] ]
The field of explainable artificial intelligence (XAI) aims to explain how black-box machine learning models work. Much of the work centers around the holy grail of providing post-hoc feature attributions to any model architecture. While the pace of innovation around novel methods has slowed down, the question remains ...
2301.11518
Geng Zhao
Geng Zhao, Banghua Zhu, Jiantao Jiao, Michael I. Jordan
Online Learning in Stackelberg Games with an Omniscient Follower
null
null
null
null
cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We study the problem of online learning in a two-player decentralized cooperative Stackelberg game. In each round, the leader first takes an action, followed by the follower who takes their action after observing the leader's move. The goal of the leader is to learn to minimize the cumulative regret based on the hist...
[ { "created": "Fri, 27 Jan 2023 03:35:10 GMT", "version": "v1" }, { "created": "Tue, 11 Apr 2023 20:27:37 GMT", "version": "v2" } ]
2023-04-13
[ [ "Zhao", "Geng", "" ], [ "Zhu", "Banghua", "" ], [ "Jiao", "Jiantao", "" ], [ "Jordan", "Michael I.", "" ] ]
We study the problem of online learning in a two-player decentralized cooperative Stackelberg game. In each round, the leader first takes an action, followed by the follower who takes their action after observing the leader's move. The goal of the leader is to learn to minimize the cumulative regret based on the histor...
2205.13206
Achille Felicetti
Franco Niccolucci, Achille Felicetti, Sorin Hermon
Populating the Digital Space for Cultural Heritage with Heritage Digital Twins
Submitted to Data - An Open Access Journal from MDPI. 29 pages, 9 figures
Data 2022, 7(8), 105
10.3390/data7080105
null
cs.DL cs.CY
http://creativecommons.org/licenses/by-nc-nd/4.0/
The present paper concerns the design of the semantic infrastructure of the digital space for cultural heritage as envisaged by the European Commission in its recent documents. Due to the complexity of the cultural heritage data and of their intrinsic interrelationships, it is necessary to introduce a novel ontology,...
[ { "created": "Thu, 26 May 2022 07:49:27 GMT", "version": "v1" } ]
2023-02-16
[ [ "Niccolucci", "Franco", "" ], [ "Felicetti", "Achille", "" ], [ "Hermon", "Sorin", "" ] ]
The present paper concerns the design of the semantic infrastructure of the digital space for cultural heritage as envisaged by the European Commission in its recent documents. Due to the complexity of the cultural heritage data and of their intrinsic interrelationships, it is necessary to introduce a novel ontology, y...
2405.18751
Jordi Armengol-Estap\'e
Jordi Armengol-Estap\'e, Vincent Michalski, Ramnath Kumar, Pierre-Luc St-Charles, Doina Precup and Samira Ebrahimi Kahou
On the Limits of Multi-modal Meta-Learning with Auxiliary Task Modulation Using Conditional Batch Normalization
null
null
null
null
cs.CV cs.AI
http://creativecommons.org/licenses/by/4.0/
Few-shot learning aims to learn representations that can tackle novel tasks given a small number of examples. Recent studies show that cross-modal learning can improve representations for few-shot classification. More specifically, language is a rich modality that can be used to guide visual learning. In this work, w...
[ { "created": "Wed, 29 May 2024 04:29:12 GMT", "version": "v1" }, { "created": "Thu, 30 May 2024 14:13:05 GMT", "version": "v2" } ]
2024-05-31
[ [ "Armengol-Estapé", "Jordi", "" ], [ "Michalski", "Vincent", "" ], [ "Kumar", "Ramnath", "" ], [ "St-Charles", "Pierre-Luc", "" ], [ "Precup", "Doina", "" ], [ "Kahou", "Samira Ebrahimi", "" ] ]
Few-shot learning aims to learn representations that can tackle novel tasks given a small number of examples. Recent studies show that cross-modal learning can improve representations for few-shot classification. More specifically, language is a rich modality that can be used to guide visual learning. In this work, we ...
1609.03545
Hayko Riemenschneider
Julien Weissenberg and Hayko Riemenschneider and Ralf Dragon and Luc Van Gool
Dilemma First Search for Effortless Optimization of NP-Hard Problems
To be published at ICPR 2016
null
null
null
cs.DS cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
To tackle the exponentiality associated with NP-hard problems, two paradigms have been proposed. First, Branch & Bound, like Dynamic Programming, achieve efficient exact inference but requires extensive information and analysis about the problem at hand. Second, meta-heuristics are easier to implement but comparative...
[ { "created": "Mon, 12 Sep 2016 19:36:02 GMT", "version": "v1" } ]
2016-09-13
[ [ "Weissenberg", "Julien", "" ], [ "Riemenschneider", "Hayko", "" ], [ "Dragon", "Ralf", "" ], [ "Van Gool", "Luc", "" ] ]
To tackle the exponentiality associated with NP-hard problems, two paradigms have been proposed. First, Branch & Bound, like Dynamic Programming, achieve efficient exact inference but requires extensive information and analysis about the problem at hand. Second, meta-heuristics are easier to implement but comparatively...
2110.08797
Gen Luo
Gen Luo, Yiyi Zhou, Xiaoshuai Sun, Yongjian Wu, Yue Gao, Rongrong Ji
Towards Language-guided Visual Recognition via Dynamic Convolutions
null
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we are committed to establishing an unified and end-to-end multi-modal network via exploring the language-guided visual recognition. To approach this target, we first propose a novel multi-modal convolution module called Language-dependent Convolution (LaConv). Its convolution kernels are dynamically g...
[ { "created": "Sun, 17 Oct 2021 11:29:13 GMT", "version": "v1" }, { "created": "Thu, 14 Sep 2023 13:37:38 GMT", "version": "v2" } ]
2023-09-15
[ [ "Luo", "Gen", "" ], [ "Zhou", "Yiyi", "" ], [ "Sun", "Xiaoshuai", "" ], [ "Wu", "Yongjian", "" ], [ "Gao", "Yue", "" ], [ "Ji", "Rongrong", "" ] ]
In this paper, we are committed to establishing an unified and end-to-end multi-modal network via exploring the language-guided visual recognition. To approach this target, we first propose a novel multi-modal convolution module called Language-dependent Convolution (LaConv). Its convolution kernels are dynamically gen...
1611.03971
Tayfun Tuna
Tayfun Tuna and Esra Akbas and Ahmet Aksoy and Muhammed Abdullah Canbaz and Umit Karabiyik and Bilal Gonen and Ramazan Aygun
User characterization for online social networks
null
Soc. Netw. Anal. Min. (2016) 6: 104. doi:10.1007/s13278-016-0412-3
10.1007/s13278-016-0412-3
null
cs.SI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Online social network analysis has attracted great attention with a vast number of users sharing information and availability of APIs that help to crawl online social network data. In this paper, we study the research studies that are helpful for user characterization as online users may not always reveal their true ...
[ { "created": "Sat, 12 Nov 2016 08:30:18 GMT", "version": "v1" }, { "created": "Tue, 27 Dec 2016 00:11:13 GMT", "version": "v2" } ]
2016-12-28
[ [ "Tuna", "Tayfun", "" ], [ "Akbas", "Esra", "" ], [ "Aksoy", "Ahmet", "" ], [ "Canbaz", "Muhammed Abdullah", "" ], [ "Karabiyik", "Umit", "" ], [ "Gonen", "Bilal", "" ], [ "Aygun", "Ramazan", "" ] ]
Online social network analysis has attracted great attention with a vast number of users sharing information and availability of APIs that help to crawl online social network data. In this paper, we study the research studies that are helpful for user characterization as online users may not always reveal their true id...
2307.14208
Tanapol Kosolwattana
Tanapol Kosolwattana, Huazheng Wang, Ying Lin
Online Modeling and Monitoring of Dependent Processes under Resource Constraints
null
null
null
null
cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Adaptive monitoring of a large population of dynamic processes is critical for the timely detection of abnormal events under limited resources in many healthcare and engineering systems. Examples include the risk-based disease screening and condition-based process monitoring. However, existing adaptive monitoring mod...
[ { "created": "Wed, 26 Jul 2023 14:14:38 GMT", "version": "v1" }, { "created": "Sat, 21 Oct 2023 23:14:34 GMT", "version": "v2" } ]
2023-10-24
[ [ "Kosolwattana", "Tanapol", "" ], [ "Wang", "Huazheng", "" ], [ "Lin", "Ying", "" ] ]
Adaptive monitoring of a large population of dynamic processes is critical for the timely detection of abnormal events under limited resources in many healthcare and engineering systems. Examples include the risk-based disease screening and condition-based process monitoring. However, existing adaptive monitoring model...
2303.05807
Ziteng Cui
Ziteng Cui, Lin Gu, Xiao Sun, Xianzheng Ma, Yu Qiao, Tatsuya Harada
Aleth-NeRF: Low-light Condition View Synthesis with Concealing Fields
website page: https://cuiziteng.github.io/Aleth_NeRF_web/, refer to new version: arXiv:2312.09093
null
null
null
cs.CV
http://creativecommons.org/licenses/by/4.0/
Common capture low-light scenes are challenging for most computer vision techniques, including Neural Radiance Fields (NeRF). Vanilla NeRF is viewer-centred simplifies the rendering process only as light emission from 3D locations in the viewing direction, thus failing to model the low-illumination induced darkness. ...
[ { "created": "Fri, 10 Mar 2023 09:28:09 GMT", "version": "v1" }, { "created": "Sat, 30 Dec 2023 02:42:12 GMT", "version": "v2" } ]
2024-01-02
[ [ "Cui", "Ziteng", "" ], [ "Gu", "Lin", "" ], [ "Sun", "Xiao", "" ], [ "Ma", "Xianzheng", "" ], [ "Qiao", "Yu", "" ], [ "Harada", "Tatsuya", "" ] ]
Common capture low-light scenes are challenging for most computer vision techniques, including Neural Radiance Fields (NeRF). Vanilla NeRF is viewer-centred simplifies the rendering process only as light emission from 3D locations in the viewing direction, thus failing to model the low-illumination induced darkness. In...
1910.08185
Wail Alkowaileet
Wail Y. Alkowaileet, Sattam Alsubaiee and Michael J. Carey
An LSM-based Tuple Compaction Framework for Apache AsterixDB (Extended Version)
18 pages, 28 figures, to appear in VLDB 2020
null
null
null
cs.DB
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Document database systems store self-describing semi-structured records, such as JSON, "as-is" without requiring the users to pre-define a schema. This provides users with the flexibility to change the structure of incoming records without worrying about taking the system offline or hindering the performance of curre...
[ { "created": "Thu, 17 Oct 2019 22:13:40 GMT", "version": "v1" }, { "created": "Mon, 11 May 2020 05:23:31 GMT", "version": "v2" } ]
2020-05-12
[ [ "Alkowaileet", "Wail Y.", "" ], [ "Alsubaiee", "Sattam", "" ], [ "Carey", "Michael J.", "" ] ]
Document database systems store self-describing semi-structured records, such as JSON, "as-is" without requiring the users to pre-define a schema. This provides users with the flexibility to change the structure of incoming records without worrying about taking the system offline or hindering the performance of current...
1302.4767
Nicola Laurenti
Francesco Renna, Nicola Laurenti, Stefano Tomasin, Marco Baldi, Nicola Maturo, Marco Bianchi, Franco Chiaraluce and Matthieu Bloch
Low-power Secret-key Agreement over OFDM
9 pages, 4 figures; this is the authors prepared version of the paper with the same name accepted for HotWiSec 2013, the Second ACM Workshop on Hot Topics on Wireless Network Security and Privacy, Budapest, Hungary 17-19 April 2013
null
null
null
cs.IT cs.CR math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) ...
[ { "created": "Tue, 19 Feb 2013 22:19:12 GMT", "version": "v1" } ]
2013-02-21
[ [ "Renna", "Francesco", "" ], [ "Laurenti", "Nicola", "" ], [ "Tomasin", "Stefano", "" ], [ "Baldi", "Marco", "" ], [ "Maturo", "Nicola", "" ], [ "Bianchi", "Marco", "" ], [ "Chiaraluce", "Franco", "" ], ...
Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) li...
2407.01976
Jinghui Lu
Jinghui Lu, Haiyang Yu, Yanjie Wang, Yongjie Ye, Jingqun Tang, Ziwei Yang, Binghong Wu, Qi Liu, Hao Feng, Han Wang, Hao Liu, Can Huang
A Bounding Box is Worth One Token: Interleaving Layout and Text in a Large Language Model for Document Understanding
null
null
null
null
cs.CL cs.AI cs.MM
http://creativecommons.org/publicdomain/zero/1.0/
Recently, many studies have demonstrated that exclusively incorporating OCR-derived text and spatial layouts with large language models (LLMs) can be highly effective for document understanding tasks. However, existing methods that integrate spatial layouts with text have limitations, such as producing overly long te...
[ { "created": "Tue, 2 Jul 2024 06:29:05 GMT", "version": "v1" }, { "created": "Wed, 24 Jul 2024 11:45:48 GMT", "version": "v2" } ]
2024-07-25
[ [ "Lu", "Jinghui", "" ], [ "Yu", "Haiyang", "" ], [ "Wang", "Yanjie", "" ], [ "Ye", "Yongjie", "" ], [ "Tang", "Jingqun", "" ], [ "Yang", "Ziwei", "" ], [ "Wu", "Binghong", "" ], [ "Liu", "Qi", ...
Recently, many studies have demonstrated that exclusively incorporating OCR-derived text and spatial layouts with large language models (LLMs) can be highly effective for document understanding tasks. However, existing methods that integrate spatial layouts with text have limitations, such as producing overly long text...
2007.05216
Sajan Kedia
Sajan Kedia, Samyak Jain, Abhishek Sharma
Price Optimization in Fashion E-commerce
8 pages, 6 figures, AI for fashion supply chain Conference
null
null
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
With the rapid growth in the fashion e-commerce industry, it is becoming extremely challenging for the E-tailers to set an optimal price point for all the products on the platform. By establishing an optimal price point, they can maximize overall revenue and profit for the platform. In this paper, we propose a novel ...
[ { "created": "Fri, 10 Jul 2020 07:40:28 GMT", "version": "v1" }, { "created": "Mon, 24 Aug 2020 10:18:53 GMT", "version": "v2" } ]
2020-08-25
[ [ "Kedia", "Sajan", "" ], [ "Jain", "Samyak", "" ], [ "Sharma", "Abhishek", "" ] ]
With the rapid growth in the fashion e-commerce industry, it is becoming extremely challenging for the E-tailers to set an optimal price point for all the products on the platform. By establishing an optimal price point, they can maximize overall revenue and profit for the platform. In this paper, we propose a novel ma...
1901.07634
Lam Nguyen
Lam M. Nguyen, Phuong Ha Nguyen, Dzung T. Phan, Jayant R. Kalagnanam, Marten van Dijk
DTN: A Learning Rate Scheme with Convergence Rate of $\mathcal{O}(1/t)$ for SGD
This paper has inconsistent results, i.e., we made some failed claims because we did some mistakes for using the test criterion for a series
null
null
null
cs.LG math.OC stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper has some inconsistent results, i.e., we made some failed claims because we did some mistakes for using the test criterion for a series. Precisely, our claims on the convergence rate of $\mathcal{O}(1/t)$ of SGD presented in Theorem 1, Corollary 1, Theorem 2 and Corollary 2 are wrongly derived because they ...
[ { "created": "Tue, 22 Jan 2019 22:40:31 GMT", "version": "v1" }, { "created": "Mon, 28 Jan 2019 21:55:19 GMT", "version": "v2" }, { "created": "Thu, 28 Feb 2019 02:01:20 GMT", "version": "v3" } ]
2019-03-01
[ [ "Nguyen", "Lam M.", "" ], [ "Nguyen", "Phuong Ha", "" ], [ "Phan", "Dzung T.", "" ], [ "Kalagnanam", "Jayant R.", "" ], [ "van Dijk", "Marten", "" ] ]
This paper has some inconsistent results, i.e., we made some failed claims because we did some mistakes for using the test criterion for a series. Precisely, our claims on the convergence rate of $\mathcal{O}(1/t)$ of SGD presented in Theorem 1, Corollary 1, Theorem 2 and Corollary 2 are wrongly derived because they ar...
2005.12712
Benedikt Kleinmeier
Benedikt Kleinmeier, Gerta K\"oster, John Drury
Agent-Based Simulation of Collective Cooperation: From Experiment to Model
16 pages, 19 figures, 5 tables, 4 listings, interdisciplinary work between computer science and psychology
Journal of the Royal Society Interface (October 2020, Volume 17, Issue 171)
10.1098/rsif.2020.0396
null
cs.MA cs.CY
http://creativecommons.org/licenses/by/4.0/
Simulation models of pedestrian dynamics have become an invaluable tool for evacuation planning. Typically crowds are assumed to stream unidirectionally towards a safe area. Simulated agents avoid collisions through mechanisms that belong to each individual, such as being repelled from each other by imaginary forces....
[ { "created": "Tue, 26 May 2020 13:29:08 GMT", "version": "v1" }, { "created": "Wed, 7 Oct 2020 09:40:47 GMT", "version": "v2" } ]
2020-10-08
[ [ "Kleinmeier", "Benedikt", "" ], [ "Köster", "Gerta", "" ], [ "Drury", "John", "" ] ]
Simulation models of pedestrian dynamics have become an invaluable tool for evacuation planning. Typically crowds are assumed to stream unidirectionally towards a safe area. Simulated agents avoid collisions through mechanisms that belong to each individual, such as being repelled from each other by imaginary forces. B...
2308.03019
Pratapa Redy Lankireddy
Naveenkumar Vodnala (VNR Vignana Jyothi Institute of Engineering and Technology), Pratap Reddy Lankireddy (Jawaharlal Nehru Technological University Hyderabad), Padmasai Yarlagadda (VNR Vignana Jyothi Institute of Engineering and Technology)
Characterization of cough sounds using statistical analysis
19 pages, 8 figures, paper submitted to journal Biomedical Signal Processing and Control which is under review
null
null
null
cs.SD eess.AS eess.SP
http://creativecommons.org/licenses/by-sa/4.0/
Cough is a primary symptom of most respiratory diseases, and changes in cough characteristics provide valuable information for diagnosing respiratory diseases. The characterization of cough sounds still lacks concrete evidence, which makes it difficult to accurately distinguish between different types of coughs and o...
[ { "created": "Sun, 6 Aug 2023 04:26:52 GMT", "version": "v1" } ]
2023-08-08
[ [ "Vodnala", "Naveenkumar", "", "VNR Vignana Jyothi Institute of Engineering and\n Technology" ], [ "Lankireddy", "Pratap Reddy", "", "Jawaharlal Nehru Technological\n University Hyderabad" ], [ "Yarlagadda", "Padmasai", "", "VNR Vignana Jyothi Institute of\...
Cough is a primary symptom of most respiratory diseases, and changes in cough characteristics provide valuable information for diagnosing respiratory diseases. The characterization of cough sounds still lacks concrete evidence, which makes it difficult to accurately distinguish between different types of coughs and oth...
1407.4668
Albrecht Zimmermann
Albrecht Zimmermann
A feature construction framework based on outlier detection and discriminative pattern mining
null
null
null
null
cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
No matter the expressive power and sophistication of supervised learning algorithms, their effectiveness is restricted by the features describing the data. This is not a new insight in ML and many methods for feature selection, transformation, and construction have been developed. But while this is on-going for gener...
[ { "created": "Thu, 17 Jul 2014 13:51:55 GMT", "version": "v1" } ]
2014-07-18
[ [ "Zimmermann", "Albrecht", "" ] ]
No matter the expressive power and sophistication of supervised learning algorithms, their effectiveness is restricted by the features describing the data. This is not a new insight in ML and many methods for feature selection, transformation, and construction have been developed. But while this is on-going for general...
1711.04022
Hamid Eghbal-zadeh
Hamid Eghbal-zadeh, Matthias Dorfer and Gerhard Widmer
Deep Within-Class Covariance Analysis for Robust Audio Representation Learning
11 pages, 3 tables, 4 figures
null
null
null
cs.LG cs.AI cs.SD eess.AS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Convolutional Neural Networks (CNNs) can learn effective features, though have been shown to suffer from a performance drop when the distribution of the data changes from training to test data. In this paper we analyze the internal representations of CNNs and observe that the representations of unseen data in each cl...
[ { "created": "Fri, 10 Nov 2017 21:39:12 GMT", "version": "v1" }, { "created": "Fri, 30 Nov 2018 09:48:48 GMT", "version": "v2" } ]
2018-12-03
[ [ "Eghbal-zadeh", "Hamid", "" ], [ "Dorfer", "Matthias", "" ], [ "Widmer", "Gerhard", "" ] ]
Convolutional Neural Networks (CNNs) can learn effective features, though have been shown to suffer from a performance drop when the distribution of the data changes from training to test data. In this paper we analyze the internal representations of CNNs and observe that the representations of unseen data in each clas...
2303.10567
Jinyeong Jeong
Jinyeong Jeong, Min Jun Kim
Passivity-based Decentralized Control for Collaborative Grasping of Under-Actuated Aerial Manipulators
IEEE International Conference on Robotics and Automation (ICRA) 2023
null
10.1109/ICRA48891.2023.10160334
null
cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper proposes a decentralized passive impedance control scheme for collaborative grasping using under-actuated aerial manipulators (AMs). The AM system is formulated, using a proper coordinate transformation, as an inertially decoupled dynamics with which a passivity-based control design is conducted. Since the...
[ { "created": "Sun, 19 Mar 2023 05:04:50 GMT", "version": "v1" } ]
2024-01-12
[ [ "Jeong", "Jinyeong", "" ], [ "Kim", "Min Jun", "" ] ]
This paper proposes a decentralized passive impedance control scheme for collaborative grasping using under-actuated aerial manipulators (AMs). The AM system is formulated, using a proper coordinate transformation, as an inertially decoupled dynamics with which a passivity-based control design is conducted. Since the i...
1904.02074
Qinbing Fu
Qinbing Fu, Nicola Bellotto, Huatian Wang, F. Claire Rind, Hongxin Wang, Shigang Yue
A Visual Neural Network for Robust Collision Perception in Vehicle Driving Scenarios
12 pages, 7 figures, conference, springer format
null
null
null
cs.CV cs.RO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This research addresses the challenging problem of visual collision detection in very complex and dynamic real physical scenes, specifically, the vehicle driving scenarios. This research takes inspiration from a large-field looming sensitive neuron, i.e., the lobula giant movement detector (LGMD) in the locust's visu...
[ { "created": "Wed, 3 Apr 2019 16:05:56 GMT", "version": "v1" } ]
2019-04-04
[ [ "Fu", "Qinbing", "" ], [ "Bellotto", "Nicola", "" ], [ "Wang", "Huatian", "" ], [ "Rind", "F. Claire", "" ], [ "Wang", "Hongxin", "" ], [ "Yue", "Shigang", "" ] ]
This research addresses the challenging problem of visual collision detection in very complex and dynamic real physical scenes, specifically, the vehicle driving scenarios. This research takes inspiration from a large-field looming sensitive neuron, i.e., the lobula giant movement detector (LGMD) in the locust's visual...
2012.07347
Maxim Vashkevich
Maxim Vashkevich and Yulia Rushkevich
Classification of ALS patients based on acoustic analysis of sustained vowel phonations
null
Biomedical Signal Processing and Control, Volume 65, March 2021, 102350
10.1016/j.bspc.2020.102350
null
cs.SD cs.CL cs.LG eess.AS
http://creativecommons.org/licenses/by/4.0/
Amyotrophic lateral sclerosis (ALS) is incurable neurological disorder with rapidly progressive course. Common early symptoms of ALS are difficulty in swallowing and speech. However, early acoustic manifestation of speech and voice symptoms is very variable, that making their detection very challenging, both by human...
[ { "created": "Mon, 14 Dec 2020 08:56:53 GMT", "version": "v1" }, { "created": "Mon, 11 Jan 2021 08:41:07 GMT", "version": "v2" } ]
2021-01-12
[ [ "Vashkevich", "Maxim", "" ], [ "Rushkevich", "Yulia", "" ] ]
Amyotrophic lateral sclerosis (ALS) is incurable neurological disorder with rapidly progressive course. Common early symptoms of ALS are difficulty in swallowing and speech. However, early acoustic manifestation of speech and voice symptoms is very variable, that making their detection very challenging, both by human s...
2406.07547
Xi Chen
Xi Chen, Yutong Feng, Mengting Chen, Yiyang Wang, Shilong Zhang, Yu Liu, Yujun Shen, Hengshuang Zhao
Zero-shot Image Editing with Reference Imitation
https://xavierchen34.github.io/MimicBrush-Page
null
null
null
cs.CV
http://creativecommons.org/licenses/by/4.0/
Image editing serves as a practical yet challenging task considering the diverse demands from users, where one of the hardest parts is to precisely describe how the edited image should look like. In this work, we present a new form of editing, termed imitative editing, to help users exercise their creativity more con...
[ { "created": "Tue, 11 Jun 2024 17:59:51 GMT", "version": "v1" } ]
2024-06-12
[ [ "Chen", "Xi", "" ], [ "Feng", "Yutong", "" ], [ "Chen", "Mengting", "" ], [ "Wang", "Yiyang", "" ], [ "Zhang", "Shilong", "" ], [ "Liu", "Yu", "" ], [ "Shen", "Yujun", "" ], [ "Zhao", "Hengshuan...
Image editing serves as a practical yet challenging task considering the diverse demands from users, where one of the hardest parts is to precisely describe how the edited image should look like. In this work, we present a new form of editing, termed imitative editing, to help users exercise their creativity more conve...
1904.03256
Mohammad Sadegh Rasooli
Maryam Aminian, Mohammad Sadegh Rasooli, Mona Diab
Cross-Lingual Transfer of Semantic Roles: From Raw Text to Semantic Roles
Accepted at the 13th International Conference on Computational Semantics (IWCS 2019)
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We describe a transfer method based on annotation projection to develop a dependency-based semantic role labeling system for languages for which no supervised linguistic information other than parallel data is available. Unlike previous work that presumes the availability of supervised features such as lemmas, part-o...
[ { "created": "Fri, 5 Apr 2019 20:04:04 GMT", "version": "v1" } ]
2019-04-09
[ [ "Aminian", "Maryam", "" ], [ "Rasooli", "Mohammad Sadegh", "" ], [ "Diab", "Mona", "" ] ]
We describe a transfer method based on annotation projection to develop a dependency-based semantic role labeling system for languages for which no supervised linguistic information other than parallel data is available. Unlike previous work that presumes the availability of supervised features such as lemmas, part-of-...
2109.02914
Junghyo Jo
Sungyeop Lee and Junghyo Jo
Scale-invariant representation of machine learning
null
null
10.1103/PhysRevE.105.044306
null
cs.LG cs.IT math.IT physics.data-an
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The success of machine learning has resulted from its structured representation of data. Similar data have close internal representations as compressed codes for classification or emerged labels for clustering. We observe that the frequency of internal codes or labels follows power laws in both supervised and unsuper...
[ { "created": "Tue, 7 Sep 2021 07:56:15 GMT", "version": "v1" }, { "created": "Wed, 23 Mar 2022 08:11:08 GMT", "version": "v2" } ]
2022-04-13
[ [ "Lee", "Sungyeop", "" ], [ "Jo", "Junghyo", "" ] ]
The success of machine learning has resulted from its structured representation of data. Similar data have close internal representations as compressed codes for classification or emerged labels for clustering. We observe that the frequency of internal codes or labels follows power laws in both supervised and unsupervi...
1404.0977
Oren Weimann
Shay Mozes, Yahav Nussbaum, Oren Weimann
Faster Shortest Paths in Dense Distance Graphs, with Applications
null
null
null
null
cs.DS
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We show how to combine two techniques for efficiently computing shortest paths in directed planar graphs. The first is the linear-time shortest-path algorithm of Henzinger, Klein, Subramanian, and Rao [STOC'94]. The second is Fakcharoenphol and Rao's algorithm [FOCS'01] for emulating Dijkstra's algorithm on the dense...
[ { "created": "Thu, 3 Apr 2014 15:44:54 GMT", "version": "v1" } ]
2014-04-04
[ [ "Mozes", "Shay", "" ], [ "Nussbaum", "Yahav", "" ], [ "Weimann", "Oren", "" ] ]
We show how to combine two techniques for efficiently computing shortest paths in directed planar graphs. The first is the linear-time shortest-path algorithm of Henzinger, Klein, Subramanian, and Rao [STOC'94]. The second is Fakcharoenphol and Rao's algorithm [FOCS'01] for emulating Dijkstra's algorithm on the dense d...
1909.02564
Jarom\'ir Janisch
Jarom\'ir Janisch, Tom\'a\v{s} Pevn\'y and Viliam Lis\'y
Classification with Costly Features as a Sequential Decision-Making Problem
null
Machine Learning (2020): 1-29
10.1007/s10994-020-05874-8
null
cs.LG cs.AI stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This work focuses on a specific classification problem, where the information about a sample is not readily available, but has to be acquired for a cost, and there is a per-sample budget. Inspired by real-world use-cases, we analyze average and hard variations of a directly specified budget. We postulate the problem ...
[ { "created": "Thu, 5 Sep 2019 14:46:40 GMT", "version": "v1" } ]
2020-03-05
[ [ "Janisch", "Jaromír", "" ], [ "Pevný", "Tomáš", "" ], [ "Lisý", "Viliam", "" ] ]
This work focuses on a specific classification problem, where the information about a sample is not readily available, but has to be acquired for a cost, and there is a per-sample budget. Inspired by real-world use-cases, we analyze average and hard variations of a directly specified budget. We postulate the problem in...
1204.1420
Abdullah Alshehab M.
Abdullah Alshehab, Chiu Tung Wu, Nao Kobayashi, Sikieng Sok, Shigeru Shimamoto
Intra-bodyhybrid communication scheme for healthcare systems
International Journal on Bioinformatics & Biosciences (IJBB) Vol.2, No.1, March 2012
null
10.5121/ijbb.2012.21011
null
cs.ET
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Intra-body communication (IBC) is a type of Body Area Network (BAN)that utilizes human body as the medium for data transmission. Thelow power requirements of intra-body communication (IBC) as compared to near field electromagnetic waves showed that it can be a suitable solution for Medical Body Area Networks (MBANs) ...
[ { "created": "Fri, 6 Apr 2012 07:06:43 GMT", "version": "v1" } ]
2012-04-09
[ [ "Alshehab", "Abdullah", "" ], [ "Wu", "Chiu Tung", "" ], [ "Kobayashi", "Nao", "" ], [ "Sok", "Sikieng", "" ], [ "Shimamoto", "Shigeru", "" ] ]
Intra-body communication (IBC) is a type of Body Area Network (BAN)that utilizes human body as the medium for data transmission. Thelow power requirements of intra-body communication (IBC) as compared to near field electromagnetic waves showed that it can be a suitable solution for Medical Body Area Networks (MBANs) in...
2111.04264
Chenglong Li
Chenglong Li, Tianhao Zhu, Lei Liu, Xiaonan Si, Zilin Fan, Sulan Zhai
Cross-Modal Object Tracking: Modality-Aware Representations and A Unified Benchmark
In Submission
null
null
null
cs.CV
http://creativecommons.org/licenses/by/4.0/
In many visual systems, visual tracking often bases on RGB image sequences, in which some targets are invalid in low-light conditions, and tracking performance is thus affected significantly. Introducing other modalities such as depth and infrared data is an effective way to handle imaging limitations of individual s...
[ { "created": "Mon, 8 Nov 2021 03:58:55 GMT", "version": "v1" }, { "created": "Thu, 11 Nov 2021 08:30:58 GMT", "version": "v2" } ]
2021-11-12
[ [ "Li", "Chenglong", "" ], [ "Zhu", "Tianhao", "" ], [ "Liu", "Lei", "" ], [ "Si", "Xiaonan", "" ], [ "Fan", "Zilin", "" ], [ "Zhai", "Sulan", "" ] ]
In many visual systems, visual tracking often bases on RGB image sequences, in which some targets are invalid in low-light conditions, and tracking performance is thus affected significantly. Introducing other modalities such as depth and infrared data is an effective way to handle imaging limitations of individual sou...
1907.10322
Simon Tamayo Giraldo
Sarah Manard (CAOR), Nicolas Vergos (CAOR), Simon Tamayo (CAOR), Fr\'ed\'eric Fontane (CAOR)
Electronic health record in the era of industry 4.0: the French example
null
International Conference e-Health 2019, Jul 2019, Porto, Portugal
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The recent implementation of the Electronic Health Record (EHR) in France is part of a more general process of digitizing information flows, as the world enters the fourth industrial revolution in a phenomenon known as Industry 4.0. Behind this concept lies the concern to allow Man to remain permanently in control of...
[ { "created": "Wed, 24 Jul 2019 09:24:24 GMT", "version": "v1" }, { "created": "Thu, 25 Jul 2019 09:00:12 GMT", "version": "v2" } ]
2019-07-26
[ [ "Manard", "Sarah", "", "CAOR" ], [ "Vergos", "Nicolas", "", "CAOR" ], [ "Tamayo", "Simon", "", "CAOR" ], [ "Fontane", "Frédéric", "", "CAOR" ] ]
The recent implementation of the Electronic Health Record (EHR) in France is part of a more general process of digitizing information flows, as the world enters the fourth industrial revolution in a phenomenon known as Industry 4.0. Behind this concept lies the concern to allow Man to remain permanently in control of h...
2109.01879
Anindya Mondal
Anindya Mondal, Mayukhmali Das
Moving Object Detection for Event-based Vision using k-means Clustering
Nine pages, five figures, Published in 2021 IEEE 8th Uttar Pradesh Section International Conference on Electrical, Electronics and Computer Engineering (UPCON)
null
10.1109/UPCON52273.2021.9667636
null
cs.CV cs.AI eess.IV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Moving object detection is important in computer vision. Event-based cameras are bio-inspired cameras that work by mimicking the working of the human eye. These cameras have multiple advantages over conventional frame-based cameras, like reduced latency, HDR, reduced motion blur during high motion, low power consumpt...
[ { "created": "Sat, 4 Sep 2021 14:43:14 GMT", "version": "v1" }, { "created": "Fri, 1 Oct 2021 16:06:17 GMT", "version": "v2" }, { "created": "Mon, 8 Nov 2021 08:24:19 GMT", "version": "v3" }, { "created": "Tue, 11 Jan 2022 21:03:51 GMT", "version": "v4" } ]
2022-01-13
[ [ "Mondal", "Anindya", "" ], [ "Das", "Mayukhmali", "" ] ]
Moving object detection is important in computer vision. Event-based cameras are bio-inspired cameras that work by mimicking the working of the human eye. These cameras have multiple advantages over conventional frame-based cameras, like reduced latency, HDR, reduced motion blur during high motion, low power consumptio...
0806.4553
Viorica Sofronie-Stokkermans
Viorica Sofronie-Stokkermans
Interpolation in local theory extensions
31 pages, 1 figure
Logical Methods in Computer Science, Volume 4, Issue 4 (October 17, 2008) lmcs:1143
10.2168/LMCS-4(4:1)2008
null
cs.LO cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we study interpolation in local extensions of a base theory. We identify situations in which it is possible to obtain interpolants in a hierarchical manner, by using a prover and a procedure for generating interpolants in the base theory as black-boxes. We present several examples of theory extensions i...
[ { "created": "Fri, 27 Jun 2008 15:51:02 GMT", "version": "v1" }, { "created": "Thu, 16 Oct 2008 22:01:02 GMT", "version": "v2" } ]
2015-07-01
[ [ "Sofronie-Stokkermans", "Viorica", "" ] ]
In this paper we study interpolation in local extensions of a base theory. We identify situations in which it is possible to obtain interpolants in a hierarchical manner, by using a prover and a procedure for generating interpolants in the base theory as black-boxes. We present several examples of theory extensions in ...
2303.07740
Yang Bai
Min Cao, Yang Bai, Jingyao Wang, Ziqiang Cao, Liqiang Nie, Min Zhang
Efficient Image-Text Retrieval via Keyword-Guided Pre-Screening
11 pages, 7 figures, 6 tables
null
null
null
cs.CV cs.CL
http://creativecommons.org/licenses/by/4.0/
Under the flourishing development in performance, current image-text retrieval methods suffer from $N$-related time complexity, which hinders their application in practice. Targeting at efficiency improvement, this paper presents a simple and effective keyword-guided pre-screening framework for the image-text retriev...
[ { "created": "Tue, 14 Mar 2023 09:36:42 GMT", "version": "v1" } ]
2023-03-15
[ [ "Cao", "Min", "" ], [ "Bai", "Yang", "" ], [ "Wang", "Jingyao", "" ], [ "Cao", "Ziqiang", "" ], [ "Nie", "Liqiang", "" ], [ "Zhang", "Min", "" ] ]
Under the flourishing development in performance, current image-text retrieval methods suffer from $N$-related time complexity, which hinders their application in practice. Targeting at efficiency improvement, this paper presents a simple and effective keyword-guided pre-screening framework for the image-text retrieval...
0911.3343
Nicolai Kuntze
Nicolai Kuntze, Juergen Repp, Hervais Simo Fhom, Andreas Fuchs, Ine-Saf Benaissa
Final Architecture Specification of security, privacy, and incentive mechanisms
Delieverable of the EU FP7 project Nanodatacenters
null
null
null
cs.CR
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this document, we define the NADA security architecture based on refined use case scenarios, a derived high level model and security analysis. For the architecure design and verification we are applying the well known STRIDE model.
[ { "created": "Tue, 17 Nov 2009 15:58:10 GMT", "version": "v1" } ]
2009-11-18
[ [ "Kuntze", "Nicolai", "" ], [ "Repp", "Juergen", "" ], [ "Fhom", "Hervais Simo", "" ], [ "Fuchs", "Andreas", "" ], [ "Benaissa", "Ine-Saf", "" ] ]
In this document, we define the NADA security architecture based on refined use case scenarios, a derived high level model and security analysis. For the architecure design and verification we are applying the well known STRIDE model.
1807.01545
Christian H\"ager
Christian H\"ager, Henry D. Pfister
Wideband Time-Domain Digital Backpropagation via Subband Processing and Deep Learning
3 pages, 3 figurs
null
null
null
cs.IT math.IT stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We propose a low-complexity sub-banded DSP architecture for digital backpropagation where the walk-off effect is compensated using simple delay elements. For a simulated 96-Gbaud signal and 2500 km optical link, our method achieves a 2.8 dB SNR improvement over linear equalization.
[ { "created": "Wed, 4 Jul 2018 12:39:25 GMT", "version": "v1" } ]
2018-07-05
[ [ "Häger", "Christian", "" ], [ "Pfister", "Henry D.", "" ] ]
We propose a low-complexity sub-banded DSP architecture for digital backpropagation where the walk-off effect is compensated using simple delay elements. For a simulated 96-Gbaud signal and 2500 km optical link, our method achieves a 2.8 dB SNR improvement over linear equalization.
2202.05347
T\'ulio Marcondes Moreira
T\'ulio Marcondes Moreira, Jackson Geraldo de Faria Jr, Pedro O.S. Vaz-de-Melo and Gilberto Medeiros-Ribeiro
Development and Validation of an AI-Driven Model for the La Rance Tidal Barrage: A Generalisable Case Study
30 pages, 22 figures and 6 tables
null
null
null
cs.LG
http://creativecommons.org/licenses/by-nc-nd/4.0/
In this work, an AI-Driven (autonomous) model representation of the La Rance tidal barrage was developed using novel parametrisation and Deep Reinforcement Learning (DRL) techniques. Our model results were validated with experimental measurements, yielding the first Tidal Range Structure (TRS) model validated against...
[ { "created": "Thu, 10 Feb 2022 22:02:52 GMT", "version": "v1" } ]
2022-02-14
[ [ "Moreira", "Túlio Marcondes", "" ], [ "Faria", "Jackson Geraldo de", "Jr" ], [ "Vaz-de-Melo", "Pedro O. S.", "" ], [ "Medeiros-Ribeiro", "Gilberto", "" ] ]
In this work, an AI-Driven (autonomous) model representation of the La Rance tidal barrage was developed using novel parametrisation and Deep Reinforcement Learning (DRL) techniques. Our model results were validated with experimental measurements, yielding the first Tidal Range Structure (TRS) model validated against a...
2207.05267
Bo Wang
Haiqing Hao (1), Zhongwang Pang (1 and 2), Guan Wang (1 and 2) and Bo Wang (1 and 2) ((1) State Key Laboratory of Precision Measurement Technology and Instruments, Department of Precision Instrument, Tsinghua University, Beijing, China, (2) Key Laboratory of Photonic Control Technology (Tsinghua University), Mi...
Indoor optical fiber eavesdropping approach and its avoidance
8 pages, 4 figures, submitted to Optics Express
null
10.1364/OE.470529
null
cs.SD eess.AS physics.ins-det physics.optics
http://creativecommons.org/licenses/by-nc-nd/4.0/
The optical fiber network has become a worldwide infrastructure. In addition to the basic functions in telecommunication, its sensing ability has attracted more and more attention. In this paper, we discuss the risk of household fiber being used for eavesdropping and demonstrate its performance in the lab. Using a 3-...
[ { "created": "Tue, 12 Jul 2022 02:31:34 GMT", "version": "v1" }, { "created": "Wed, 3 Aug 2022 13:58:31 GMT", "version": "v2" } ]
2022-10-05
[ [ "Hao", "Haiqing", "", "1 and 2" ], [ "Pang", "Zhongwang", "", "1 and 2" ], [ "Wang", "Guan", "", "1 and 2" ], [ "Wang", "Bo", "", "1 and 2" ] ]
The optical fiber network has become a worldwide infrastructure. In addition to the basic functions in telecommunication, its sensing ability has attracted more and more attention. In this paper, we discuss the risk of household fiber being used for eavesdropping and demonstrate its performance in the lab. Using a 3-me...
2007.11849
Chen-Yu Wei
Chen-Yu Wei, Mehdi Jafarnia-Jahromi, Haipeng Luo, Rahul Jain
Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation
null
null
null
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We develop several new algorithms for learning Markov Decision Processes in an infinite-horizon average-reward setting with linear function approximation. Using the optimism principle and assuming that the MDP has a linear structure, we first propose a computationally inefficient algorithm with optimal $\widetilde{O}...
[ { "created": "Thu, 23 Jul 2020 08:23:44 GMT", "version": "v1" }, { "created": "Mon, 26 Apr 2021 09:12:03 GMT", "version": "v2" } ]
2021-04-27
[ [ "Wei", "Chen-Yu", "" ], [ "Jafarnia-Jahromi", "Mehdi", "" ], [ "Luo", "Haipeng", "" ], [ "Jain", "Rahul", "" ] ]
We develop several new algorithms for learning Markov Decision Processes in an infinite-horizon average-reward setting with linear function approximation. Using the optimism principle and assuming that the MDP has a linear structure, we first propose a computationally inefficient algorithm with optimal $\widetilde{O}(\...
2010.09409
Juan Jos\'e G\'omez Rodr\'iguez
Juan J. G\'omez Rodr\'iguez, Jos\'e Lamarca, Javier Morlana, Juan D. Tard\'os, Jos\'e M. M. Montiel
SD-DefSLAM: Semi-Direct Monocular SLAM for Deformable and Intracorporeal Scenes
10 pages, 8 figures. Submitted to RA-L with option to ICRA 2021. Associated video: https://youtu.be/gkcC0IR3X6A
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Conventional SLAM techniques strongly rely on scene rigidity to solve data association, ignoring dynamic parts of the scene. In this work we present Semi-Direct DefSLAM (SD-DefSLAM), a novel monocular deformable SLAM method able to map highly deforming environments, built on top of DefSLAM. To robustly solve data ass...
[ { "created": "Mon, 19 Oct 2020 12:07:07 GMT", "version": "v1" } ]
2020-10-20
[ [ "Rodríguez", "Juan J. Gómez", "" ], [ "Lamarca", "José", "" ], [ "Morlana", "Javier", "" ], [ "Tardós", "Juan D.", "" ], [ "Montiel", "José M. M.", "" ] ]
Conventional SLAM techniques strongly rely on scene rigidity to solve data association, ignoring dynamic parts of the scene. In this work we present Semi-Direct DefSLAM (SD-DefSLAM), a novel monocular deformable SLAM method able to map highly deforming environments, built on top of DefSLAM. To robustly solve data assoc...
2403.06189
Dai Yuqin
Yuqin Dai, Wanlu Zhu, Ronghui Li, Zeping Ren, Xiangzheng Zhou, Xiu Li, Jun Li, Jian Yang
Harmonious Group Choreography with Trajectory-Controllable Diffusion
null
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Creating group choreography from music has gained attention in cultural entertainment and virtual reality, aiming to coordinate visually cohesive and diverse group movements. Despite increasing interest, recent works face challenges in achieving aesthetically appealing choreography, primarily for two key issues: mult...
[ { "created": "Sun, 10 Mar 2024 12:11:34 GMT", "version": "v1" }, { "created": "Thu, 6 Jun 2024 08:19:12 GMT", "version": "v2" }, { "created": "Wed, 14 Aug 2024 02:38:55 GMT", "version": "v3" } ]
2024-08-15
[ [ "Dai", "Yuqin", "" ], [ "Zhu", "Wanlu", "" ], [ "Li", "Ronghui", "" ], [ "Ren", "Zeping", "" ], [ "Zhou", "Xiangzheng", "" ], [ "Li", "Xiu", "" ], [ "Li", "Jun", "" ], [ "Yang", "Jian", "" ...
Creating group choreography from music has gained attention in cultural entertainment and virtual reality, aiming to coordinate visually cohesive and diverse group movements. Despite increasing interest, recent works face challenges in achieving aesthetically appealing choreography, primarily for two key issues: multi-...
2304.02572
Zheqing Zhu
Hongbo Guo, Ruben Naeff, Alex Nikulkov, Zheqing Zhu
Evaluating Online Bandit Exploration In Large-Scale Recommender System
null
null
null
null
cs.IR cs.AI cs.LG cs.SI
http://creativecommons.org/licenses/by/4.0/
Bandit learning has been an increasingly popular design choice for recommender system. Despite the strong interest in bandit learning from the community, there remains multiple bottlenecks that prevent many bandit learning approaches from productionalization. One major bottleneck is how to test the effectiveness of b...
[ { "created": "Wed, 5 Apr 2023 16:44:36 GMT", "version": "v1" }, { "created": "Thu, 22 Jun 2023 03:41:43 GMT", "version": "v2" }, { "created": "Sun, 30 Jul 2023 08:29:55 GMT", "version": "v3" } ]
2023-08-01
[ [ "Guo", "Hongbo", "" ], [ "Naeff", "Ruben", "" ], [ "Nikulkov", "Alex", "" ], [ "Zhu", "Zheqing", "" ] ]
Bandit learning has been an increasingly popular design choice for recommender system. Despite the strong interest in bandit learning from the community, there remains multiple bottlenecks that prevent many bandit learning approaches from productionalization. One major bottleneck is how to test the effectiveness of ban...
1308.0037
Ryan Williams
Ryan K. Williams, Andrea Gasparri, and Bhaskar Krishnamachari
Route Swarm: Wireless Network Optimization through Mobility
9 pages, 4 figures, submitted to the IEEE International Conference on Intelligent Robots and Systems (IROS) 2014
null
10.1109/IROS.2014.6943092
null
cs.SY cs.MA cs.NI cs.RO math.OC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we demonstrate a novel hybrid architecture for coordinating networked robots in sensing and information routing applications. The proposed INformation and Sensing driven PhysIcally REconfigurable robotic network (INSPIRE), consists of a Physical Control Plane (PCP) which commands agent position, and an...
[ { "created": "Wed, 31 Jul 2013 20:47:14 GMT", "version": "v1" }, { "created": "Tue, 3 Sep 2013 21:16:47 GMT", "version": "v2" }, { "created": "Fri, 7 Feb 2014 02:24:13 GMT", "version": "v3" } ]
2016-11-18
[ [ "Williams", "Ryan K.", "" ], [ "Gasparri", "Andrea", "" ], [ "Krishnamachari", "Bhaskar", "" ] ]
In this paper, we demonstrate a novel hybrid architecture for coordinating networked robots in sensing and information routing applications. The proposed INformation and Sensing driven PhysIcally REconfigurable robotic network (INSPIRE), consists of a Physical Control Plane (PCP) which commands agent position, and an I...
1705.08362
Thorsten Wi{\ss}mann
Ulrich Dorsch, Stefan Milius, Lutz Schr\"oder, Thorsten Wi{\ss}mann
Efficient Coalgebraic Partition Refinement
null
null
null
null
cs.DS cs.LO
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in reactive verification; coalgebraic generality implies in particular that we cover not only classical relational systems but also various forms of weighted systems. Under assumptions ...
[ { "created": "Tue, 23 May 2017 15:31:59 GMT", "version": "v1" }, { "created": "Sat, 8 Jul 2017 09:53:47 GMT", "version": "v2" }, { "created": "Thu, 13 Jul 2017 10:49:21 GMT", "version": "v3" }, { "created": "Mon, 9 Oct 2017 10:19:12 GMT", "version": "v4" } ]
2017-10-10
[ [ "Dorsch", "Ulrich", "" ], [ "Milius", "Stefan", "" ], [ "Schröder", "Lutz", "" ], [ "Wißmann", "Thorsten", "" ] ]
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in reactive verification; coalgebraic generality implies in particular that we cover not only classical relational systems but also various forms of weighted systems. Under assumptions on...
1204.4909
M. Rizwan Jameel Qureshi Dr.
M. Rizwan Jameel Qureshi and Waseem Qureshi
Evaluation of the Design Metric to Reduce the Number of Defects in Software Development
9 Pages
International Journal of Information Technology and Computer Science (IJITCS), Vol. 4/4, pp. 9-17, April 2012
10.5815/ijitcs.2012.04.02
null
cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Software design is one of the most important and key activities in the system development life cycle (SDLC) phase that ensures the quality of software. Different key areas of design are very vital to be taken into consideration while designing software. Software design describes how the software system is decomposed ...
[ { "created": "Sun, 22 Apr 2012 16:35:41 GMT", "version": "v1" } ]
2012-04-24
[ [ "Qureshi", "M. Rizwan Jameel", "" ], [ "Qureshi", "Waseem", "" ] ]
Software design is one of the most important and key activities in the system development life cycle (SDLC) phase that ensures the quality of software. Different key areas of design are very vital to be taken into consideration while designing software. Software design describes how the software system is decomposed an...
2004.02002
Tiancheng Zhao
Tianchang Zhao and Kyusong Lee
Talk to Papers: Bringing Neural Question Answering to Academic Search
demo paper accepted at ACL 2020
null
null
null
cs.CL cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce Talk to Papers, which exploits the recent open-domain question answering (QA) techniques to improve the current experience of academic search. It's designed to enable researchers to use natural language queries to find precise answers and extract insights from a massive amount of academic papers. We pres...
[ { "created": "Sat, 4 Apr 2020 19:19:55 GMT", "version": "v1" }, { "created": "Mon, 13 Apr 2020 14:38:11 GMT", "version": "v2" }, { "created": "Thu, 21 May 2020 20:26:28 GMT", "version": "v3" } ]
2020-05-25
[ [ "Zhao", "Tianchang", "" ], [ "Lee", "Kyusong", "" ] ]
We introduce Talk to Papers, which exploits the recent open-domain question answering (QA) techniques to improve the current experience of academic search. It's designed to enable researchers to use natural language queries to find precise answers and extract insights from a massive amount of academic papers. We presen...
2312.03322
Zhimiao Yu
Zhimiao Yu, Tiancheng Lin, Yi Xu
Background Clustering Pre-training for Few-shot Segmentation
6 pages, 2 figures, ICIP 2023
null
null
null
cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recent few-shot segmentation (FSS) methods introduce an extra pre-training stage before meta-training to obtain a stronger backbone, which has become a standard step in few-shot learning. Despite the effectiveness, current pre-training scheme suffers from the merged background problem: only base classes are labelled ...
[ { "created": "Wed, 6 Dec 2023 07:16:32 GMT", "version": "v1" } ]
2023-12-07
[ [ "Yu", "Zhimiao", "" ], [ "Lin", "Tiancheng", "" ], [ "Xu", "Yi", "" ] ]
Recent few-shot segmentation (FSS) methods introduce an extra pre-training stage before meta-training to obtain a stronger backbone, which has become a standard step in few-shot learning. Despite the effectiveness, current pre-training scheme suffers from the merged background problem: only base classes are labelled as...
1609.03355
Zhou Zhou
Zhou Zhou, Jun Fang, Linxiao Yang, Hongbin Li, Zhi Chen and Rick S. Blum
Low-Rank Tensor Decomposition-Aided Channel Estimation for Millimeter Wave MIMO-OFDM Systems
arXiv admin note: text overlap with arXiv:1602.07955
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We consider the problem of downlink channel estimation for millimeter wave (mmWave) MIMO-OFDM systems, where both the base station (BS) and the mobile station (MS) employ large antenna arrays for directional precoding/beamforming. Hybrid analog and digital beamforming structures are employed in order to offer a compr...
[ { "created": "Mon, 12 Sep 2016 11:52:48 GMT", "version": "v1" }, { "created": "Tue, 1 Nov 2016 08:45:05 GMT", "version": "v2" } ]
2016-11-02
[ [ "Zhou", "Zhou", "" ], [ "Fang", "Jun", "" ], [ "Yang", "Linxiao", "" ], [ "Li", "Hongbin", "" ], [ "Chen", "Zhi", "" ], [ "Blum", "Rick S.", "" ] ]
We consider the problem of downlink channel estimation for millimeter wave (mmWave) MIMO-OFDM systems, where both the base station (BS) and the mobile station (MS) employ large antenna arrays for directional precoding/beamforming. Hybrid analog and digital beamforming structures are employed in order to offer a comprom...
2304.07825
Samuel Epstein
Samuel Epstein
Regression and Algorithmic Information Theory
null
null
null
null
cs.CC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper we prove a theorem about regression, in that the shortest description of a function consistent with a finite sample of data is less than the combined conditional Kolmogorov complexities over the data in the sample.
[ { "created": "Sun, 16 Apr 2023 16:30:38 GMT", "version": "v1" } ]
2023-04-18
[ [ "Epstein", "Samuel", "" ] ]
In this paper we prove a theorem about regression, in that the shortest description of a function consistent with a finite sample of data is less than the combined conditional Kolmogorov complexities over the data in the sample.
2209.01641
Souvik Datta
Souvik Datta, Mangolik Kundu, Ratnadeep Das Choudhury, Sriramalakshmi P, Sreedevi VT
IoT Book Bot
2022 IEEE India Council International Subsections Conference (INDISCON)
null
10.1109/INDISCON54605.2022.9862937
null
cs.HC cs.RO
http://creativecommons.org/licenses/by/4.0/
In order to ease the process of library management many technologies have been adopted but most of them focus on inventory management. There has hardly been any progress of automation in the field of issuing and returning books to the library on time. In colleges and schools, hostellers often forget to timely return ...
[ { "created": "Sun, 4 Sep 2022 15:30:17 GMT", "version": "v1" } ]
2022-09-07
[ [ "Datta", "Souvik", "" ], [ "Kundu", "Mangolik", "" ], [ "Choudhury", "Ratnadeep Das", "" ], [ "P", "Sriramalakshmi", "" ], [ "VT", "Sreedevi", "" ] ]
In order to ease the process of library management many technologies have been adopted but most of them focus on inventory management. There has hardly been any progress of automation in the field of issuing and returning books to the library on time. In colleges and schools, hostellers often forget to timely return th...
2407.19199
Ryosuke Motegi
Ryosuke Motegi and Yoichi Seki
A simulation study of cluster search algorithms in data set generated by Gaussian mixture models
null
null
null
null
cs.LG stat.ML
http://creativecommons.org/licenses/by/4.0/
Determining the number of clusters is a fundamental issue in data clustering. Several algorithms have been proposed, including centroid-based algorithms using the Euclidean distance and model-based algorithms using a mixture of probability distributions. Among these, greedy algorithms for searching the number of clus...
[ { "created": "Sat, 27 Jul 2024 07:47:25 GMT", "version": "v1" } ]
2024-07-30
[ [ "Motegi", "Ryosuke", "" ], [ "Seki", "Yoichi", "" ] ]
Determining the number of clusters is a fundamental issue in data clustering. Several algorithms have been proposed, including centroid-based algorithms using the Euclidean distance and model-based algorithms using a mixture of probability distributions. Among these, greedy algorithms for searching the number of cluste...
2302.12987
Yi Gao
Yi Gao, Miao Xu, Min-Ling Zhang
Complementary to Multiple Labels: A Correlation-Aware Correction Approach
null
null
10.1109/TPAMI.2024.3416384
null
cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
\textit{Complementary label learning} (CLL) requires annotators to give \emph{irrelevant} labels instead of relevant labels for instances. Currently, CLL has shown its promising performance on multi-class data by estimating a transition matrix. However, current multi-class CLL techniques cannot work well on multi-lab...
[ { "created": "Sat, 25 Feb 2023 04:48:48 GMT", "version": "v1" } ]
2024-06-25
[ [ "Gao", "Yi", "" ], [ "Xu", "Miao", "" ], [ "Zhang", "Min-Ling", "" ] ]
\textit{Complementary label learning} (CLL) requires annotators to give \emph{irrelevant} labels instead of relevant labels for instances. Currently, CLL has shown its promising performance on multi-class data by estimating a transition matrix. However, current multi-class CLL techniques cannot work well on multi-label...
2306.03894
Todd Schmid
Todd Schmid and Victoria Noquez and Lawrence S. Moss
Fractals from Regular Behaviours
Expanded and edited into a journal version. Submitted to the CALCO 2023 special issue of LMCS. (31 pages, 5 figures.)
null
null
null
cs.LO cs.FL
http://creativecommons.org/licenses/by/4.0/
We are interested in connections between the theory of fractal sets obtained as attractors of iterated function systems and process calculi. To this end, we reinterpret Milner's expressions for processes as contraction operators on a complete metric space. When the space is, for example, the plane, the denotations of...
[ { "created": "Tue, 6 Jun 2023 17:55:12 GMT", "version": "v1" }, { "created": "Thu, 1 Feb 2024 16:18:26 GMT", "version": "v2" } ]
2024-02-02
[ [ "Schmid", "Todd", "" ], [ "Noquez", "Victoria", "" ], [ "Moss", "Lawrence S.", "" ] ]
We are interested in connections between the theory of fractal sets obtained as attractors of iterated function systems and process calculi. To this end, we reinterpret Milner's expressions for processes as contraction operators on a complete metric space. When the space is, for example, the plane, the denotations of f...
2208.04347
Jason Phang
Jason Phang, Yao Zhao, Peter J. Liu
Investigating Efficiently Extending Transformers for Long Input Summarization
null
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
While large pretrained Transformer models have proven highly capable at tackling natural language tasks, handling long sequence inputs continues to be a significant challenge. One such task is long input summarization, where inputs are longer than the maximum input context of most pretrained models. Through an extens...
[ { "created": "Mon, 8 Aug 2022 18:10:58 GMT", "version": "v1" } ]
2022-08-10
[ [ "Phang", "Jason", "" ], [ "Zhao", "Yao", "" ], [ "Liu", "Peter J.", "" ] ]
While large pretrained Transformer models have proven highly capable at tackling natural language tasks, handling long sequence inputs continues to be a significant challenge. One such task is long input summarization, where inputs are longer than the maximum input context of most pretrained models. Through an extensiv...
1404.5144
Sacha Gomez
M. Konomi and G. M. Sacha
Influence of the learning method in the performance of feedforward neural networks when the activity of neurons is modified
null
null
null
null
cs.NE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
A method that allows us to give a different treatment to any neuron inside feedforward neural networks is presented. The algorithm has been implemented with two very different learning methods: a standard Back-propagation (BP) procedure and an evolutionary algorithm. First, we have demonstrated that the EA training m...
[ { "created": "Mon, 21 Apr 2014 09:00:19 GMT", "version": "v1" } ]
2014-04-22
[ [ "Konomi", "M.", "" ], [ "Sacha", "G. M.", "" ] ]
A method that allows us to give a different treatment to any neuron inside feedforward neural networks is presented. The algorithm has been implemented with two very different learning methods: a standard Back-propagation (BP) procedure and an evolutionary algorithm. First, we have demonstrated that the EA training met...
2407.00142
Christopher Irwin
Christopher Irwin, Flavio Mignone, Stefania Montani, Luigi Portinale
Graph Neural Networks for Gut Microbiome Metaomic data: A preliminary work
null
null
null
null
cs.LG cs.AI
http://creativecommons.org/licenses/by/4.0/
The gut microbiome, crucial for human health, presents challenges in analyzing its complex metaomic data due to high dimensionality and sparsity. Traditional methods struggle to capture its intricate relationships. We investigate graph neural networks (GNNs) for this task, aiming to derive meaningful representations ...
[ { "created": "Fri, 28 Jun 2024 15:53:36 GMT", "version": "v1" } ]
2024-07-02
[ [ "Irwin", "Christopher", "" ], [ "Mignone", "Flavio", "" ], [ "Montani", "Stefania", "" ], [ "Portinale", "Luigi", "" ] ]
The gut microbiome, crucial for human health, presents challenges in analyzing its complex metaomic data due to high dimensionality and sparsity. Traditional methods struggle to capture its intricate relationships. We investigate graph neural networks (GNNs) for this task, aiming to derive meaningful representations of...
2402.11835
Hugh Zhang
Luca D'Amico-Wong, Hugh Zhang, Marc Lanctot, David C. Parkes
Easy as ABCs: Unifying Boltzmann Q-Learning and Counterfactual Regret Minimization
null
null
null
null
cs.LG cs.GT cs.MA
http://creativecommons.org/licenses/by/4.0/
We propose ABCs (Adaptive Branching through Child stationarity), a best-of-both-worlds algorithm combining Boltzmann Q-learning (BQL), a classic reinforcement learning algorithm for single-agent domains, and counterfactual regret minimization (CFR), a central algorithm for learning in multi-agent domains. ABCs adapti...
[ { "created": "Mon, 19 Feb 2024 04:58:39 GMT", "version": "v1" } ]
2024-02-20
[ [ "D'Amico-Wong", "Luca", "" ], [ "Zhang", "Hugh", "" ], [ "Lanctot", "Marc", "" ], [ "Parkes", "David C.", "" ] ]
We propose ABCs (Adaptive Branching through Child stationarity), a best-of-both-worlds algorithm combining Boltzmann Q-learning (BQL), a classic reinforcement learning algorithm for single-agent domains, and counterfactual regret minimization (CFR), a central algorithm for learning in multi-agent domains. ABCs adaptive...
2307.01646
Qi Yan
Qi Yan, Zhengyang Liang, Yang Song, Renjie Liao, Lele Wang
SwinGNN: Rethinking Permutation Invariance in Diffusion Models for Graph Generation
TMLR 2024
null
null
null
cs.LG cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Diffusion models based on permutation-equivariant networks can learn permutation-invariant distributions for graph data. However, in comparison to their non-invariant counterparts, we have found that these invariant models encounter greater learning challenges since 1) their effective target distributions exhibit mor...
[ { "created": "Tue, 4 Jul 2023 10:58:42 GMT", "version": "v1" }, { "created": "Wed, 19 Jul 2023 04:59:35 GMT", "version": "v2" }, { "created": "Tue, 18 Jun 2024 05:55:32 GMT", "version": "v3" }, { "created": "Wed, 19 Jun 2024 04:48:13 GMT", "version": "v4" } ]
2024-06-21
[ [ "Yan", "Qi", "" ], [ "Liang", "Zhengyang", "" ], [ "Song", "Yang", "" ], [ "Liao", "Renjie", "" ], [ "Wang", "Lele", "" ] ]
Diffusion models based on permutation-equivariant networks can learn permutation-invariant distributions for graph data. However, in comparison to their non-invariant counterparts, we have found that these invariant models encounter greater learning challenges since 1) their effective target distributions exhibit more ...
1706.07535
Hemanth Venkateswara
Hemanth Venkateswara, Prasanth Lade, Binbin Lin, Jieping Ye, Sethuraman Panchanathan
Efficient Approximate Solutions to Mutual Information Based Global Feature Selection
ICDM 2015 Conference
null
null
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Mutual Information (MI) is often used for feature selection when developing classifier models. Estimating the MI for a subset of features is often intractable. We demonstrate, that under the assumptions of conditional independence, MI between a subset of features can be expressed as the Conditional Mutual Information...
[ { "created": "Fri, 23 Jun 2017 01:08:59 GMT", "version": "v1" } ]
2017-06-26
[ [ "Venkateswara", "Hemanth", "" ], [ "Lade", "Prasanth", "" ], [ "Lin", "Binbin", "" ], [ "Ye", "Jieping", "" ], [ "Panchanathan", "Sethuraman", "" ] ]
Mutual Information (MI) is often used for feature selection when developing classifier models. Estimating the MI for a subset of features is often intractable. We demonstrate, that under the assumptions of conditional independence, MI between a subset of features can be expressed as the Conditional Mutual Information (...
2109.05234
Zezhong Wang Mr.
Zezhong Wang, Hongru Wang, Kwan Wai Chung, Jia Zhu, Gabriel Pui Cheong Fung, Kam-Fai Wong
Prior Omission of Dissimilar Source Domain(s) for Cost-Effective Few-Shot Learning
null
null
null
null
cs.CL cs.AI
http://creativecommons.org/licenses/by-nc-nd/4.0/
Few-shot slot tagging is an emerging research topic in the field of Natural Language Understanding (NLU). With sufficient annotated data from source domains, the key challenge is how to train and adapt the model to another target domain which only has few labels. Conventional few-shot approaches use all the data from...
[ { "created": "Sat, 11 Sep 2021 09:30:59 GMT", "version": "v1" } ]
2021-09-14
[ [ "Wang", "Zezhong", "" ], [ "Wang", "Hongru", "" ], [ "Chung", "Kwan Wai", "" ], [ "Zhu", "Jia", "" ], [ "Fung", "Gabriel Pui Cheong", "" ], [ "Wong", "Kam-Fai", "" ] ]
Few-shot slot tagging is an emerging research topic in the field of Natural Language Understanding (NLU). With sufficient annotated data from source domains, the key challenge is how to train and adapt the model to another target domain which only has few labels. Conventional few-shot approaches use all the data from t...
2104.01040
Igor Halperin
Igor Halperin
Distributional Offline Continuous-Time Reinforcement Learning with Neural Physics-Informed PDEs (SciPhy RL for DOCTR-L)
24 pages, 5 figures
null
null
null
cs.LG cs.AI physics.comp-ph q-fin.CP
http://creativecommons.org/licenses/by-nc-sa/4.0/
This paper addresses distributional offline continuous-time reinforcement learning (DOCTR-L) with stochastic policies for high-dimensional optimal control. A soft distributional version of the classical Hamilton-Jacobi-Bellman (HJB) equation is given by a semilinear partial differential equation (PDE). This `soft HJB...
[ { "created": "Fri, 2 Apr 2021 13:22:14 GMT", "version": "v1" } ]
2021-04-05
[ [ "Halperin", "Igor", "" ] ]
This paper addresses distributional offline continuous-time reinforcement learning (DOCTR-L) with stochastic policies for high-dimensional optimal control. A soft distributional version of the classical Hamilton-Jacobi-Bellman (HJB) equation is given by a semilinear partial differential equation (PDE). This `soft HJB e...
1006.2022
Haim Permuter Henry
Haim Permuter, Shlomo (Shitz) Shamai, and Anelia Somekh-Baruch
Message and state cooperation in multiple access channels
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We investigate the capacity of a multiple access channel with cooperating encoders where partial state information is known to each encoder and full state information is known to the decoder. The cooperation between the encoders has a two-fold purpose: to generate empirical state coordination between the encoders, an...
[ { "created": "Thu, 10 Jun 2010 13:15:44 GMT", "version": "v1" } ]
2010-06-11
[ [ "Permuter", "Haim", "", "Shitz" ], [ "Shlomo", "", "", "Shitz" ], [ "Shamai", "", "" ], [ "Somekh-Baruch", "Anelia", "" ] ]
We investigate the capacity of a multiple access channel with cooperating encoders where partial state information is known to each encoder and full state information is known to the decoder. The cooperation between the encoders has a two-fold purpose: to generate empirical state coordination between the encoders, and ...
2303.11899
Hankang Gu
Hankang Gu, Shangbo Wang, Xiaoguang Ma, Dongyao Jia, Guoqiang Mao, Eng Gee Lim, Cheuk Pong Ryan Wong
Large-Scale Traffic Signal Control Using Constrained Network Partition and Adaptive Deep Reinforcement Learning
null
null
null
null
cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Multi-agent Deep Reinforcement Learning (MADRL) based traffic signal control becomes a popular research topic in recent years. To alleviate the scalability issue of completely centralized RL techniques and the non-stationarity issue of completely decentralized RL techniques on large-scale traffic networks, some liter...
[ { "created": "Tue, 21 Mar 2023 14:42:58 GMT", "version": "v1" }, { "created": "Wed, 22 Mar 2023 07:34:22 GMT", "version": "v2" }, { "created": "Fri, 7 Apr 2023 06:38:44 GMT", "version": "v3" }, { "created": "Mon, 26 Jun 2023 04:08:48 GMT", "version": "v4" }, { "cr...
2023-09-08
[ [ "Gu", "Hankang", "" ], [ "Wang", "Shangbo", "" ], [ "Ma", "Xiaoguang", "" ], [ "Jia", "Dongyao", "" ], [ "Mao", "Guoqiang", "" ], [ "Lim", "Eng Gee", "" ], [ "Wong", "Cheuk Pong Ryan", "" ] ]
Multi-agent Deep Reinforcement Learning (MADRL) based traffic signal control becomes a popular research topic in recent years. To alleviate the scalability issue of completely centralized RL techniques and the non-stationarity issue of completely decentralized RL techniques on large-scale traffic networks, some literat...
2210.07806
Luca Canalini
Luca Canalini, Jan Klein, Nuno Pedrosa de Barros, Diana Maria Sima, Dorothea Miller, Horst Hahn
Comparison of different automatic solutions for resection cavity segmentation in postoperative MRI volumes including longitudinal acquisitions
null
SPIE Proceedings Vol. 11598 - Medical Imaging 2021: Image-Guided Procedures, Robotic Interventions, and Modeling
10.1117/12.2580889
null
cs.CV cs.AI
http://creativecommons.org/licenses/by/4.0/
In this work, we compare five deep learning solutions to automatically segment the resection cavity in postoperative MRI. The proposed methods are based on the same 3D U-Net architecture. We use a dataset of postoperative MRI volumes, each including four MRI sequences and the ground truth of the corresponding resecti...
[ { "created": "Fri, 14 Oct 2022 13:37:35 GMT", "version": "v1" } ]
2022-10-17
[ [ "Canalini", "Luca", "" ], [ "Klein", "Jan", "" ], [ "de Barros", "Nuno Pedrosa", "" ], [ "Sima", "Diana Maria", "" ], [ "Miller", "Dorothea", "" ], [ "Hahn", "Horst", "" ] ]
In this work, we compare five deep learning solutions to automatically segment the resection cavity in postoperative MRI. The proposed methods are based on the same 3D U-Net architecture. We use a dataset of postoperative MRI volumes, each including four MRI sequences and the ground truth of the corresponding resection...
2405.03287
Mehedi Hasan Raju
Mehedi Hasan Raju, Dillon J Lohr, Oleg V Komogortsev
Evaluating Eye Movement Biometrics in Virtual Reality: A Comparative Analysis of VR Headset and High-End Eye-Tracker Collected Dataset
9 pages, 6 figures
null
null
null
cs.HC
http://creativecommons.org/licenses/by-nc-sa/4.0/
Previous studies have shown that eye movement data recorded at 1000 Hz can be used to authenticate individuals. This study explores the effectiveness of eye movement-based biometrics (EMB) by utilizing data from an eye-tracking (ET)-enabled virtual reality (VR) headset (GazeBaseVR) and compares it to the performance ...
[ { "created": "Mon, 6 May 2024 09:05:06 GMT", "version": "v1" } ]
2024-05-07
[ [ "Raju", "Mehedi Hasan", "" ], [ "Lohr", "Dillon J", "" ], [ "Komogortsev", "Oleg V", "" ] ]
Previous studies have shown that eye movement data recorded at 1000 Hz can be used to authenticate individuals. This study explores the effectiveness of eye movement-based biometrics (EMB) by utilizing data from an eye-tracking (ET)-enabled virtual reality (VR) headset (GazeBaseVR) and compares it to the performance us...
2211.14923
Jiayu Song
Jiayu Song, Iman Munire Bilal, Adam Tsakalidis, Rob Procter, Maria Liakata
Unsupervised Opinion Summarisation in the Wasserstein Space
null
null
null
null
cs.CL cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Opinion summarisation synthesises opinions expressed in a group of documents discussing the same topic to produce a single summary. Recent work has looked at opinion summarisation of clusters of social media posts. Such posts are noisy and have unpredictable structure, posing additional challenges for the constructio...
[ { "created": "Sun, 27 Nov 2022 19:45:38 GMT", "version": "v1" } ]
2022-11-29
[ [ "Song", "Jiayu", "" ], [ "Bilal", "Iman Munire", "" ], [ "Tsakalidis", "Adam", "" ], [ "Procter", "Rob", "" ], [ "Liakata", "Maria", "" ] ]
Opinion summarisation synthesises opinions expressed in a group of documents discussing the same topic to produce a single summary. Recent work has looked at opinion summarisation of clusters of social media posts. Such posts are noisy and have unpredictable structure, posing additional challenges for the construction ...
2012.08489
Valerio Perrone
Valerio Perrone, Huibin Shen, Aida Zolic, Iaroslav Shcherbatyi, Amr Ahmed, Tanya Bansal, Michele Donini, Fela Winkelmolen, Rodolphe Jenatton, Jean Baptiste Faddoul, Barbara Pogorzelska, Miroslav Miladinovic, Krishnaram Kenthapadi, Matthias Seeger, C\'edric Archambeau
Amazon SageMaker Automatic Model Tuning: Scalable Gradient-Free Optimization
null
null
null
null
cs.LG cs.AI stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Tuning complex machine learning systems is challenging. Machine learning typically requires to set hyperparameters, be it regularization, architecture, or optimization parameters, whose tuning is critical to achieve good predictive performance. To democratize access to machine learning systems, it is essential to aut...
[ { "created": "Tue, 15 Dec 2020 18:34:34 GMT", "version": "v1" }, { "created": "Fri, 18 Jun 2021 19:41:09 GMT", "version": "v2" } ]
2021-06-22
[ [ "Perrone", "Valerio", "" ], [ "Shen", "Huibin", "" ], [ "Zolic", "Aida", "" ], [ "Shcherbatyi", "Iaroslav", "" ], [ "Ahmed", "Amr", "" ], [ "Bansal", "Tanya", "" ], [ "Donini", "Michele", "" ], [ "W...
Tuning complex machine learning systems is challenging. Machine learning typically requires to set hyperparameters, be it regularization, architecture, or optimization parameters, whose tuning is critical to achieve good predictive performance. To democratize access to machine learning systems, it is essential to autom...
1906.10724
Rahul Aralikatte
Rahul Aralikatte and Anders S{\o}gaard
Model-based annotation of coreference
To appear in LREC 2020
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Humans do not make inferences over texts, but over models of what texts are about. When annotators are asked to annotate coreferent spans of text, it is therefore a somewhat unnatural task. This paper presents an alternative in which we preprocess documents, linking entities to a knowledge base, and turn the corefere...
[ { "created": "Tue, 25 Jun 2019 18:56:36 GMT", "version": "v1" }, { "created": "Fri, 30 Aug 2019 08:25:13 GMT", "version": "v2" }, { "created": "Sun, 1 Mar 2020 23:17:56 GMT", "version": "v3" } ]
2020-03-03
[ [ "Aralikatte", "Rahul", "" ], [ "Søgaard", "Anders", "" ] ]
Humans do not make inferences over texts, but over models of what texts are about. When annotators are asked to annotate coreferent spans of text, it is therefore a somewhat unnatural task. This paper presents an alternative in which we preprocess documents, linking entities to a knowledge base, and turn the coreferenc...
1609.07190
Rishab Nithyanand
Narseo Vallina-Rodriguez, Srikanth Sundaresan, Abbas Razaghpanah, Rishab Nithyanand, Mark Allman, Christian Kreibich, Phillipa Gill
Tracking the Trackers: Towards Understanding the Mobile Advertising and Tracking Ecosystem
null
null
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Third-party services form an integral part of the mobile ecosystem: they allow app developers to add features such as performance analytics and social network integration, and to monetize their apps by enabling user tracking and targeted ad delivery. At present users, researchers, and regulators all have at best limi...
[ { "created": "Thu, 22 Sep 2016 23:45:20 GMT", "version": "v1" }, { "created": "Wed, 26 Oct 2016 15:50:14 GMT", "version": "v2" } ]
2016-10-27
[ [ "Vallina-Rodriguez", "Narseo", "" ], [ "Sundaresan", "Srikanth", "" ], [ "Razaghpanah", "Abbas", "" ], [ "Nithyanand", "Rishab", "" ], [ "Allman", "Mark", "" ], [ "Kreibich", "Christian", "" ], [ "Gill", "Phill...
Third-party services form an integral part of the mobile ecosystem: they allow app developers to add features such as performance analytics and social network integration, and to monetize their apps by enabling user tracking and targeted ad delivery. At present users, researchers, and regulators all have at best limite...
2201.03472
Peter Nightingale
Peter Nightingale
Savile Row Manual
arXiv admin note: substantial text overlap with arXiv:1601.02865
null
null
null
cs.AI
http://creativecommons.org/licenses/by-sa/4.0/
We describe the constraint modelling tool Savile Row, its input language and its main features. Savile Row translates a solver-independent constraint modelling language to the input languages for various solvers including constraint, SAT, and SMT solvers. After a brief introduction, the manual describes the Essence P...
[ { "created": "Fri, 12 Nov 2021 09:47:55 GMT", "version": "v1" }, { "created": "Tue, 30 Jul 2024 13:31:56 GMT", "version": "v2" } ]
2024-07-31
[ [ "Nightingale", "Peter", "" ] ]
We describe the constraint modelling tool Savile Row, its input language and its main features. Savile Row translates a solver-independent constraint modelling language to the input languages for various solvers including constraint, SAT, and SMT solvers. After a brief introduction, the manual describes the Essence Pri...
1802.00507
Manuel Ortega-Rodr\'iguez
Diana Valverde-M\'endez, Manuel Ortega-Rodr\'iguez, Hugo Sol\'is-S\'anchez, Ariadna Venegas-Li
The effects of anger on automated long-term-spectra based speaker-identification
11 pages
null
null
null
cs.HC
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Forensic speaker identification has traditionally considered approaches based on long term spectra analysis as especially robust, given that they work well for short recordings, are not sensitive to changes in the intensity of the sample, and continue to function in the presence of noise and limited passband. We find...
[ { "created": "Sat, 20 Jan 2018 03:51:30 GMT", "version": "v1" } ]
2018-02-05
[ [ "Valverde-Méndez", "Diana", "" ], [ "Ortega-Rodríguez", "Manuel", "" ], [ "Solís-Sánchez", "Hugo", "" ], [ "Venegas-Li", "Ariadna", "" ] ]
Forensic speaker identification has traditionally considered approaches based on long term spectra analysis as especially robust, given that they work well for short recordings, are not sensitive to changes in the intensity of the sample, and continue to function in the presence of noise and limited passband. We find, ...
2310.14129
Pan Xu
Tianyuan Jin, Yu Yang, Jing Tang, Xiaokui Xiao, Pan Xu
Optimal Batched Best Arm Identification
32 pages, 1 figure, 3 tables
null
null
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We study the batched best arm identification (BBAI) problem, where the learner's goal is to identify the best arm while switching the policy as less as possible. In particular, we aim to find the best arm with probability $1-\delta$ for some small constant $\delta>0$ while minimizing both the sample complexity (total...
[ { "created": "Sat, 21 Oct 2023 22:55:50 GMT", "version": "v1" } ]
2023-10-24
[ [ "Jin", "Tianyuan", "" ], [ "Yang", "Yu", "" ], [ "Tang", "Jing", "" ], [ "Xiao", "Xiaokui", "" ], [ "Xu", "Pan", "" ] ]
We study the batched best arm identification (BBAI) problem, where the learner's goal is to identify the best arm while switching the policy as less as possible. In particular, we aim to find the best arm with probability $1-\delta$ for some small constant $\delta>0$ while minimizing both the sample complexity (total n...
2407.12170
Sean MacAvaney
Xuejun Chang, Debabrata Mishra, Craig Macdonald, Sean MacAvaney
Neural Passage Quality Estimation for Static Pruning
SIGIR 2024
null
10.1145/3626772.3657765
null
cs.IR
http://creativecommons.org/licenses/by/4.0/
Neural networks -- especially those that use large, pre-trained language models -- have improved search engines in various ways. Most prominently, they can estimate the relevance of a passage or document to a user's query. In this work, we depart from this direction by exploring whether neural networks can effectivel...
[ { "created": "Tue, 16 Jul 2024 20:47:54 GMT", "version": "v1" } ]
2024-07-18
[ [ "Chang", "Xuejun", "" ], [ "Mishra", "Debabrata", "" ], [ "Macdonald", "Craig", "" ], [ "MacAvaney", "Sean", "" ] ]
Neural networks -- especially those that use large, pre-trained language models -- have improved search engines in various ways. Most prominently, they can estimate the relevance of a passage or document to a user's query. In this work, we depart from this direction by exploring whether neural networks can effectively ...
2205.15906
Malsha V Perera
Malsha V. Perera, Wele Gedara Chaminda Bandara, Jeya Maria Jose Valanarasu, and Vishal M. Patel
SAR Despeckling Using Overcomplete Convolutional Networks
Accepted to International Geoscience and Remote Sensing Symposium (IGARSS), 2022. Our code is available at https://github.com/malshaV/sar_overcomplete
null
null
null
cs.CV eess.IV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Synthetic Aperture Radar (SAR) despeckling is an important problem in remote sensing as speckle degrades SAR images, affecting downstream tasks like detection and segmentation. Recent studies show that convolutional neural networks(CNNs) outperform classical despeckling methods. Traditional CNNs try to increase the r...
[ { "created": "Tue, 31 May 2022 15:55:37 GMT", "version": "v1" } ]
2022-06-01
[ [ "Perera", "Malsha V.", "" ], [ "Bandara", "Wele Gedara Chaminda", "" ], [ "Valanarasu", "Jeya Maria Jose", "" ], [ "Patel", "Vishal M.", "" ] ]
Synthetic Aperture Radar (SAR) despeckling is an important problem in remote sensing as speckle degrades SAR images, affecting downstream tasks like detection and segmentation. Recent studies show that convolutional neural networks(CNNs) outperform classical despeckling methods. Traditional CNNs try to increase the rec...
1805.00443
Lucie Jacquin
Pierre-Michel Riccio (LGI2P)
Une approche pour mieux appr{\'e}hender l'alt{\'e}rit{\'e} en SIC
in French
Colloque Communication, Organisation, Soci{\'e}t{\'e} du Savoir et Information (COSSI) 15-17 juin 2016 , Jun 2016, Montpellier, France
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this paper, we propose a novel approach that aims: to facilitate the building of teams relying on notions of skills, of motivation or of potential; identify the requested upgrade effort to improve his own knowledge and join a team; or create more suitable devices for a target population. The whole forms a toolbox ...
[ { "created": "Fri, 20 Apr 2018 11:20:51 GMT", "version": "v1" } ]
2018-05-02
[ [ "Riccio", "Pierre-Michel", "", "LGI2P" ] ]
In this paper, we propose a novel approach that aims: to facilitate the building of teams relying on notions of skills, of motivation or of potential; identify the requested upgrade effort to improve his own knowledge and join a team; or create more suitable devices for a target population. The whole forms a toolbox th...
2401.14079
Tobias Eisenreich
Tobias Eisenreich, Sandro Speth, Stefan Wagner
From Requirements to Architecture: An AI-Based Journey to Semi-Automatically Generate Software Architectures
4 pages, vision paper, submitted to the ICSE workshop Designing2024
null
10.1145/3643660.3643942
null
cs.SE cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Designing domain models and software architectures represents a significant challenge in software development, as the resulting architectures play a vital role in fulfilling the system's quality of service. Due to time pressure, architects often model only one architecture based on their known limited domain understa...
[ { "created": "Thu, 25 Jan 2024 10:56:58 GMT", "version": "v1" } ]
2024-02-02
[ [ "Eisenreich", "Tobias", "" ], [ "Speth", "Sandro", "" ], [ "Wagner", "Stefan", "" ] ]
Designing domain models and software architectures represents a significant challenge in software development, as the resulting architectures play a vital role in fulfilling the system's quality of service. Due to time pressure, architects often model only one architecture based on their known limited domain understand...
1406.6114
Sakthithasan Sripirakas
Sakthithasan Sripirakas and Russel Pears
Mining Recurrent Concepts in Data Streams using the Discrete Fourier Transform
null
null
null
null
cs.LG
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In this research we address the problem of capturing recurring concepts in a data stream environment. Recurrence capture enables the re-use of previously learned classifiers without the need for re-learning while providing for better accuracy during the concept recurrence interval. We capture concepts by applying the...
[ { "created": "Tue, 24 Jun 2014 00:48:23 GMT", "version": "v1" } ]
2014-06-25
[ [ "Sripirakas", "Sakthithasan", "" ], [ "Pears", "Russel", "" ] ]
In this research we address the problem of capturing recurring concepts in a data stream environment. Recurrence capture enables the re-use of previously learned classifiers without the need for re-learning while providing for better accuracy during the concept recurrence interval. We capture concepts by applying the D...
2402.03396
Yifeng He
Yifeng He, Jiabo Huang, Yuyang Rong, Yiwen Guo, Ethan Wang, Hao Chen
UniTSyn: A Large-Scale Dataset Capable of Enhancing the Prowess of Large Language Models for Program Testing
8 pages, 5 figures
null
null
null
cs.SE cs.AI cs.CL cs.CR cs.LG
http://creativecommons.org/licenses/by/4.0/
The remarkable capability of large language models (LLMs) in generating high-quality code has drawn increasing attention in the software testing community. However, existing code LLMs often demonstrate unsatisfactory capabilities in generating accurate and complete tests since they were trained on code snippets colle...
[ { "created": "Sun, 4 Feb 2024 22:48:05 GMT", "version": "v1" } ]
2024-02-07
[ [ "He", "Yifeng", "" ], [ "Huang", "Jiabo", "" ], [ "Rong", "Yuyang", "" ], [ "Guo", "Yiwen", "" ], [ "Wang", "Ethan", "" ], [ "Chen", "Hao", "" ] ]
The remarkable capability of large language models (LLMs) in generating high-quality code has drawn increasing attention in the software testing community. However, existing code LLMs often demonstrate unsatisfactory capabilities in generating accurate and complete tests since they were trained on code snippets collect...
2008.04701
Matthijs Maas
John-Clark Levin and Matthijs M. Maas
Roadmap to a Roadmap: How Could We Tell When AGI is a 'Manhattan Project' Away?
null
null
null
null
cs.CY
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper argues that at a certain point in research toward AGI, the problem may become well-enough theorized that a clear roadmap exists for achieving it, such that a Manhattan Project-like effort could greatly shorten the time to completion. If state actors perceive that this threshold has been crossed, their ince...
[ { "created": "Thu, 6 Aug 2020 06:07:47 GMT", "version": "v1" } ]
2020-08-12
[ [ "Levin", "John-Clark", "" ], [ "Maas", "Matthijs M.", "" ] ]
This paper argues that at a certain point in research toward AGI, the problem may become well-enough theorized that a clear roadmap exists for achieving it, such that a Manhattan Project-like effort could greatly shorten the time to completion. If state actors perceive that this threshold has been crossed, their incent...
cs/0701134
Wenbing Zhao
Wenbing Zhao
Byzantine Fault Tolerance for Nondeterministic Applications
To appear in the proceedings of the 3rd IEEE International Symposium on Dependable, Autonomic and Secure Computing, 2007
null
10.1109/DASC.2007.11
null
cs.DC
null
All practical applications contain some degree of nondeterminism. When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be controlled to ensure replica consistency. To the best of our knowledge, only the most simplistic types of replica nondeterminism...
[ { "created": "Sun, 21 Jan 2007 20:44:52 GMT", "version": "v1" }, { "created": "Wed, 1 Aug 2007 04:51:53 GMT", "version": "v2" } ]
2016-11-15
[ [ "Zhao", "Wenbing", "" ] ]
All practical applications contain some degree of nondeterminism. When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be controlled to ensure replica consistency. To the best of our knowledge, only the most simplistic types of replica nondeterminism h...
1801.03911
Sahil Garg
Sahil Garg and Greg Ver Steeg and Aram Galstyan
Stochastic Learning of Nonstationary Kernels for Natural Language Modeling
null
null
null
null
cs.CL cs.IR cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Natural language processing often involves computations with semantic or syntactic graphs to facilitate sophisticated reasoning based on structural relationships. While convolution kernels provide a powerful tool for comparing graph structure based on node (word) level relationships, they are difficult to customize a...
[ { "created": "Thu, 11 Jan 2018 18:24:02 GMT", "version": "v1" }, { "created": "Thu, 1 Feb 2018 21:41:27 GMT", "version": "v2" } ]
2018-02-13
[ [ "Garg", "Sahil", "" ], [ "Steeg", "Greg Ver", "" ], [ "Galstyan", "Aram", "" ] ]
Natural language processing often involves computations with semantic or syntactic graphs to facilitate sophisticated reasoning based on structural relationships. While convolution kernels provide a powerful tool for comparing graph structure based on node (word) level relationships, they are difficult to customize and...
1912.12430
Theofilos Triommatis
Theofilos Triommatis and Aris Pagourtzis
Approximate #Knapsack Computations to Count Semi-Fair Allocations
null
null
null
null
cs.CC
http://creativecommons.org/licenses/by-nc-sa/4.0/
In this paper, we study the problem of counting the number of different knapsack solutions with a prescribed cardinality. We present an FPTAS for this problem, based on dynamic programming. We also introduce two different types of semi-fair allocations of indivisible goods between two players. By semi-fair allocation...
[ { "created": "Sat, 28 Dec 2019 09:48:32 GMT", "version": "v1" } ]
2020-01-01
[ [ "Triommatis", "Theofilos", "" ], [ "Pagourtzis", "Aris", "" ] ]
In this paper, we study the problem of counting the number of different knapsack solutions with a prescribed cardinality. We present an FPTAS for this problem, based on dynamic programming. We also introduce two different types of semi-fair allocations of indivisible goods between two players. By semi-fair allocations,...
2406.04823
David Samuel
David Samuel
BERTs are Generative In-Context Learners
21 pages, preprint
null
null
null
cs.CL cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
This paper explores the in-context learning capabilities of masked language models, challenging the common view that this ability does not 'emerge' in them. We present an embarrassingly simple inference technique that enables DeBERTa to operate as a generative model without any additional training. Our findings demon...
[ { "created": "Fri, 7 Jun 2024 10:48:45 GMT", "version": "v1" } ]
2024-06-10
[ [ "Samuel", "David", "" ] ]
This paper explores the in-context learning capabilities of masked language models, challenging the common view that this ability does not 'emerge' in them. We present an embarrassingly simple inference technique that enables DeBERTa to operate as a generative model without any additional training. Our findings demonst...
cs/0511063
Michele Finelli
Michele Finelli
Pathwords: a user-friendly schema for common passwords management
null
null
null
null
cs.CR
null
Many computer-based authentication schemata are based on pass- words. Logging on a computer, reading email, accessing content on a web server are all examples of applications where the identification of the user is usually accomplished matching the data provided by the user with data known by the application. Such ...
[ { "created": "Wed, 16 Nov 2005 17:46:48 GMT", "version": "v1" } ]
2007-05-23
[ [ "Finelli", "Michele", "" ] ]
Many computer-based authentication schemata are based on pass- words. Logging on a computer, reading email, accessing content on a web server are all examples of applications where the identification of the user is usually accomplished matching the data provided by the user with data known by the application. Such a wi...
2402.01386
Zeeshan Rasheed Mr
Zeeshan Rasheed, Muhammad Waseem, Aakash Ahmad, Kai-Kristian Kemell, Wang Xiaofeng, Anh Nguyen Duc, Pekka Abrahamsson
Can Large Language Models Serve as Data Analysts? A Multi-Agent Assisted Approach for Qualitative Data Analysis
9 pages and 2 figures
null
null
null
cs.SE
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Recent advancements in Large Language Models (LLMs) have enabled collaborative human-bot interactions in Software Engineering (SE), similar to many other professions. However, the potential benefits and implications of incorporating LLMs into qualitative data analysis in SE have not been completely explored. For inst...
[ { "created": "Fri, 2 Feb 2024 13:10:46 GMT", "version": "v1" } ]
2024-02-05
[ [ "Rasheed", "Zeeshan", "" ], [ "Waseem", "Muhammad", "" ], [ "Ahmad", "Aakash", "" ], [ "Kemell", "Kai-Kristian", "" ], [ "Xiaofeng", "Wang", "" ], [ "Duc", "Anh Nguyen", "" ], [ "Abrahamsson", "Pekka", "" ...
Recent advancements in Large Language Models (LLMs) have enabled collaborative human-bot interactions in Software Engineering (SE), similar to many other professions. However, the potential benefits and implications of incorporating LLMs into qualitative data analysis in SE have not been completely explored. For instan...
1703.08206
Manuel Peuster
Manuel Peuster and Holger Karl
Understand Your Chains: Towards Performance Profile-based Network Service Management
Submitted to and accepted by the European Workshop on Software Defined Networks (EWSDN) 2016
null
null
null
cs.NI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Allocating resources to virtualized network functions and services to meet service level agreements is a challenging task for NFV management and orchestration systems. This becomes even more challenging when agile development methodologies, like DevOps, are applied. In such scenarios, management and orchestration sys...
[ { "created": "Thu, 23 Mar 2017 19:12:09 GMT", "version": "v1" } ]
2017-03-27
[ [ "Peuster", "Manuel", "" ], [ "Karl", "Holger", "" ] ]
Allocating resources to virtualized network functions and services to meet service level agreements is a challenging task for NFV management and orchestration systems. This becomes even more challenging when agile development methodologies, like DevOps, are applied. In such scenarios, management and orchestration syste...
2403.19449
Marcin Hoffmann
Marcin Hoffmann, Pawe{\l} Kryszkiewicz
O-RAN for Energy-Efficient Serving Cluster Formulation in User-Centric Cell-Free MMIMO
Accepted for presentation during The 2nd Workshop on Next-generation Open and Programmable Radio Access Networks (NG-OPERA), organized in conjunction with IEEE International Conference on Computer Communications, May 20, 2024
null
null
null
cs.IT cs.NI math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
The 6G Massive Multiple-Input Multiple-Output (MMIMO) networks can follow the so-called User-Centric Cell-Free (UCCF) architecture, where a single user is served by multiple Access Points (APs) coordinated by the Central Processing Unit (CPU). In this paper, we propose how O-RAN functionalities, i.e., rApp-xApp pair,...
[ { "created": "Thu, 28 Mar 2024 14:17:19 GMT", "version": "v1" } ]
2024-03-29
[ [ "Hoffmann", "Marcin", "" ], [ "Kryszkiewicz", "Paweł", "" ] ]
The 6G Massive Multiple-Input Multiple-Output (MMIMO) networks can follow the so-called User-Centric Cell-Free (UCCF) architecture, where a single user is served by multiple Access Points (APs) coordinated by the Central Processing Unit (CPU). In this paper, we propose how O-RAN functionalities, i.e., rApp-xApp pair, c...
2301.06923
Zhibo Zhang
Zhibo Zhang, Sani Umar, Ahmed Y. Al Hammadi, Sangyoung Yoon, Ernesto Damiani, Claudio Agostino Ardagna, Nicola Bena, and Chan Yeob Yeun
Explainable Data Poison Attacks on Human Emotion Evaluation Systems based on EEG Signals
null
IEEE Access 2023
10.1109/ACCESS.2023.3245813
null
cs.LG eess.SP
http://creativecommons.org/licenses/by/4.0/
The major aim of this paper is to explain the data poisoning attacks using label-flipping during the training stage of the electroencephalogram (EEG) signal-based human emotion evaluation systems deploying Machine Learning models from the attackers' perspective. Human emotion evaluation using EEG signals has consiste...
[ { "created": "Tue, 17 Jan 2023 14:44:46 GMT", "version": "v1" } ]
2023-03-15
[ [ "Zhang", "Zhibo", "" ], [ "Umar", "Sani", "" ], [ "Hammadi", "Ahmed Y. Al", "" ], [ "Yoon", "Sangyoung", "" ], [ "Damiani", "Ernesto", "" ], [ "Ardagna", "Claudio Agostino", "" ], [ "Bena", "Nicola", "" ]...
The major aim of this paper is to explain the data poisoning attacks using label-flipping during the training stage of the electroencephalogram (EEG) signal-based human emotion evaluation systems deploying Machine Learning models from the attackers' perspective. Human emotion evaluation using EEG signals has consistent...
2005.08625
Na Li
Na Li, Xinbo Zhao, Chong Ma
JointsGait:A model-based Gait Recognition Method based on Gait Graph Convolutional Networks and Joints Relationship Pyramid Mapping
The paper format was changed and experiments on other databases were added. The format and page layout were changed greatly
null
null
null
cs.CV eess.IV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Gait, as one of unique biometric features, has the advantage of being recognized from a long distance away, can be widely used in public security. Considering 3D pose estimation is more challenging than 2D pose estimation in practice , we research on using 2D joints to recognize gait in this paper, and a new model-ba...
[ { "created": "Mon, 27 Apr 2020 08:30:37 GMT", "version": "v1" }, { "created": "Wed, 9 Dec 2020 09:12:03 GMT", "version": "v2" } ]
2020-12-10
[ [ "Li", "Na", "" ], [ "Zhao", "Xinbo", "" ], [ "Ma", "Chong", "" ] ]
Gait, as one of unique biometric features, has the advantage of being recognized from a long distance away, can be widely used in public security. Considering 3D pose estimation is more challenging than 2D pose estimation in practice , we research on using 2D joints to recognize gait in this paper, and a new model-base...
2403.14679
Lorenzo Pellegrini
Davide Maltoni, Lorenzo Pellegrini
Continual Learning by Three-Phase Consolidation
13 pages, 2 figures, 8 tables. Preprint under review
null
null
null
cs.LG cs.CV
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
TPC (Three-Phase Consolidation) is here introduced as a simple but effective approach to continually learn new classes (and/or instances of known classes) while controlling forgetting of previous knowledge. Each experience (a.k.a. task) is learned in three phases characterized by different rules and learning dynamics...
[ { "created": "Tue, 12 Mar 2024 15:31:14 GMT", "version": "v1" } ]
2024-03-25
[ [ "Maltoni", "Davide", "" ], [ "Pellegrini", "Lorenzo", "" ] ]
TPC (Three-Phase Consolidation) is here introduced as a simple but effective approach to continually learn new classes (and/or instances of known classes) while controlling forgetting of previous knowledge. Each experience (a.k.a. task) is learned in three phases characterized by different rules and learning dynamics, ...
1210.1357
Bojin Zheng
Jun Qin, Hongrun Wu, Xiaonian Tong, Bojin Zheng
A quantitative method for determining the robustness of complex networks
null
Physica D 2013 253 85--90
10.1016/j.physd.2013.03.002
null
cs.SI nlin.AO physics.soc-ph
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Most current studies estimate the invulnerability of complex networks using a qualitative method that analyzes the inaccurate decay rate of network efficiency. This method results in confusion over the invulnerability of various types of complex networks. By normalizing network efficiency and defining a baseline, thi...
[ { "created": "Thu, 4 Oct 2012 09:46:26 GMT", "version": "v1" }, { "created": "Sat, 23 Mar 2013 09:33:00 GMT", "version": "v2" } ]
2014-02-18
[ [ "Qin", "Jun", "" ], [ "Wu", "Hongrun", "" ], [ "Tong", "Xiaonian", "" ], [ "Zheng", "Bojin", "" ] ]
Most current studies estimate the invulnerability of complex networks using a qualitative method that analyzes the inaccurate decay rate of network efficiency. This method results in confusion over the invulnerability of various types of complex networks. By normalizing network efficiency and defining a baseline, this ...
2107.13180
Javier Naranjo-Alcazar
Javier Naranjo-Alcazar, Sergi Perez-Castanos, Aaron Lopez-Garcia, Pedro Zuccarello, Maximo Cobos, Francesc J. Ferri
Squeeze-Excitation Convolutional Recurrent Neural Networks for Audio-Visual Scene Classification
null
null
null
null
cs.MM cs.CV cs.SD eess.AS eess.IV
http://creativecommons.org/publicdomain/zero/1.0/
The use of multiple and semantically correlated sources can provide complementary information to each other that may not be evident when working with individual modalities on their own. In this context, multi-modal models can help producing more accurate and robust predictions in machine learning tasks where audio-vi...
[ { "created": "Wed, 28 Jul 2021 06:10:10 GMT", "version": "v1" } ]
2021-07-29
[ [ "Naranjo-Alcazar", "Javier", "" ], [ "Perez-Castanos", "Sergi", "" ], [ "Lopez-Garcia", "Aaron", "" ], [ "Zuccarello", "Pedro", "" ], [ "Cobos", "Maximo", "" ], [ "Ferri", "Francesc J.", "" ] ]
The use of multiple and semantically correlated sources can provide complementary information to each other that may not be evident when working with individual modalities on their own. In this context, multi-modal models can help producing more accurate and robust predictions in machine learning tasks where audio-visu...
2009.04416
Karl Cobbe
Karl Cobbe, Jacob Hilton, Oleg Klimov, John Schulman
Phasic Policy Gradient
null
null
null
null
cs.LG stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We introduce Phasic Policy Gradient (PPG), a reinforcement learning framework which modifies traditional on-policy actor-critic methods by separating policy and value function training into distinct phases. In prior methods, one must choose between using a shared network or separate networks to represent the policy a...
[ { "created": "Wed, 9 Sep 2020 16:52:53 GMT", "version": "v1" } ]
2020-09-10
[ [ "Cobbe", "Karl", "" ], [ "Hilton", "Jacob", "" ], [ "Klimov", "Oleg", "" ], [ "Schulman", "John", "" ] ]
We introduce Phasic Policy Gradient (PPG), a reinforcement learning framework which modifies traditional on-policy actor-critic methods by separating policy and value function training into distinct phases. In prior methods, one must choose between using a shared network or separate networks to represent the policy and...
1303.5855
Zhong-Yuan Zhang
Zhong-Yuan Zhang and Yong Wang and Yong-Yeol Ahn
Overlapping Community Detection in Complex Networks using Symmetric Binary Matrix Factorization
null
null
10.1103/PhysRevE.87.062803
null
cs.SI physics.soc-ph
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Discovering overlapping community structures is a crucial step to understanding the structure and dynamics of many networks. In this paper we develop a symmetric binary matrix factorization model (SBMF) to identify overlapping communities. Our model allows us not only to assign community memberships explicitly to nod...
[ { "created": "Sat, 23 Mar 2013 15:16:44 GMT", "version": "v1" } ]
2015-06-15
[ [ "Zhang", "Zhong-Yuan", "" ], [ "Wang", "Yong", "" ], [ "Ahn", "Yong-Yeol", "" ] ]
Discovering overlapping community structures is a crucial step to understanding the structure and dynamics of many networks. In this paper we develop a symmetric binary matrix factorization model (SBMF) to identify overlapping communities. Our model allows us not only to assign community memberships explicitly to nodes...
0909.4767
Christine Bachoc
Christine Bachoc (IMB)
Semidefinite programming, harmonic analysis and coding theory
null
null
null
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics. This version is an update June 2010.
[ { "created": "Fri, 25 Sep 2009 19:04:18 GMT", "version": "v1" }, { "created": "Wed, 8 Sep 2010 11:37:01 GMT", "version": "v2" } ]
2010-09-09
[ [ "Bachoc", "Christine", "", "IMB" ] ]
These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics. This version is an update June 2010.
1401.3075
Qifu Sun
Qifu (Tyler) Sun, Xunrui Yin, Zongpeng Li, and Keping Long
Multicast Network Coding and Field Sizes
null
null
10.1109/TIT.2015.2473863
null
cs.IT math.IT
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
In an acyclic multicast network, it is well known that a linear network coding solution over GF($q$) exists when $q$ is sufficiently large. In particular, for each prime power $q$ no smaller than the number of receivers, a linear solution over GF($q$) can be efficiently constructed. In this work, we reveal that a lin...
[ { "created": "Tue, 14 Jan 2014 06:03:54 GMT", "version": "v1" }, { "created": "Fri, 13 Feb 2015 06:34:47 GMT", "version": "v2" } ]
2016-09-26
[ [ "Qifu", "", "", "Tyler" ], [ "Sun", "", "" ], [ "Yin", "Xunrui", "" ], [ "Li", "Zongpeng", "" ], [ "Long", "Keping", "" ] ]
In an acyclic multicast network, it is well known that a linear network coding solution over GF($q$) exists when $q$ is sufficiently large. In particular, for each prime power $q$ no smaller than the number of receivers, a linear solution over GF($q$) can be efficiently constructed. In this work, we reveal that a linea...
2112.09631
Archan Ray
Archan Ray, Nicholas Monath, Andrew McCallum, Cameron Musco
Sublinear Time Approximation of Text Similarity Matrices
25 pages, 10 figures
null
null
null
cs.LG cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
We study algorithms for approximating pairwise similarity matrices that arise in natural language processing. Generally, computing a similarity matrix for $n$ data points requires $\Omega(n^2)$ similarity computations. This quadratic scaling is a significant bottleneck, especially when similarities are computed via e...
[ { "created": "Fri, 17 Dec 2021 17:04:34 GMT", "version": "v1" }, { "created": "Wed, 16 Feb 2022 19:18:56 GMT", "version": "v2" }, { "created": "Wed, 27 Apr 2022 13:56:51 GMT", "version": "v3" } ]
2022-04-28
[ [ "Ray", "Archan", "" ], [ "Monath", "Nicholas", "" ], [ "McCallum", "Andrew", "" ], [ "Musco", "Cameron", "" ] ]
We study algorithms for approximating pairwise similarity matrices that arise in natural language processing. Generally, computing a similarity matrix for $n$ data points requires $\Omega(n^2)$ similarity computations. This quadratic scaling is a significant bottleneck, especially when similarities are computed via exp...
2406.17826
Krzysztof Kotowski PhD
Krzysztof Kotowski, Christoph Haskamp, Jacek Andrzejewski, Bogdan Ruszczak, Jakub Nalepa, Daniel Lakey, Peter Collins, Aybike Kolmas, Mauro Bartesaghi, Jose Martinez-Heras, Gabriele De Canio
European Space Agency Benchmark for Anomaly Detection in Satellite Telemetry
87 pages, 24 figures, 19 tables
null
null
null
cs.LG cs.AI
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Machine learning has vast potential to improve anomaly detection in satellite telemetry which is a crucial task for spacecraft operations. This potential is currently hampered by a lack of comprehensible benchmarks for multivariate time series anomaly detection, especially for the challenging case of satellite teleme...
[ { "created": "Tue, 25 Jun 2024 13:23:37 GMT", "version": "v1" } ]
2024-06-27
[ [ "Kotowski", "Krzysztof", "" ], [ "Haskamp", "Christoph", "" ], [ "Andrzejewski", "Jacek", "" ], [ "Ruszczak", "Bogdan", "" ], [ "Nalepa", "Jakub", "" ], [ "Lakey", "Daniel", "" ], [ "Collins", "Peter", "" ...
Machine learning has vast potential to improve anomaly detection in satellite telemetry which is a crucial task for spacecraft operations. This potential is currently hampered by a lack of comprehensible benchmarks for multivariate time series anomaly detection, especially for the challenging case of satellite telemetr...
2207.01234
Vishnu Raj
Vishnu Raj, Tianyu Cui, Markus Heinonen and Pekka Marttinen
Incorporating functional summary information in Bayesian neural networks using a Dirichlet process likelihood approach
Accepted in AISTATS 2023
null
null
null
cs.LG cs.AI stat.ML
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Bayesian neural networks (BNNs) can account for both aleatoric and epistemic uncertainty. However, in BNNs the priors are often specified over the weights which rarely reflects true prior knowledge in large and complex neural network architectures. We present a simple approach to incorporate prior knowledge in BNNs b...
[ { "created": "Mon, 4 Jul 2022 07:06:45 GMT", "version": "v1" }, { "created": "Tue, 24 Jan 2023 08:08:11 GMT", "version": "v2" } ]
2023-01-25
[ [ "Raj", "Vishnu", "" ], [ "Cui", "Tianyu", "" ], [ "Heinonen", "Markus", "" ], [ "Marttinen", "Pekka", "" ] ]
Bayesian neural networks (BNNs) can account for both aleatoric and epistemic uncertainty. However, in BNNs the priors are often specified over the weights which rarely reflects true prior knowledge in large and complex neural network architectures. We present a simple approach to incorporate prior knowledge in BNNs bas...
2210.07564
Xin Tian
Xin Tian, Yingzhan Lin, Mengfei Song, Siqi Bao, Fan Wang, Huang He, Shuqi Sun, Hua Wu
Q-TOD: A Query-driven Task-oriented Dialogue System
Accepted to EMNLP 2022
null
null
null
cs.CL
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Existing pipelined task-oriented dialogue systems usually have difficulties adapting to unseen domains, whereas end-to-end systems are plagued by large-scale knowledge bases in practice. In this paper, we introduce a novel query-driven task-oriented dialogue system, namely Q-TOD. The essential information from the di...
[ { "created": "Fri, 14 Oct 2022 06:38:19 GMT", "version": "v1" } ]
2022-10-17
[ [ "Tian", "Xin", "" ], [ "Lin", "Yingzhan", "" ], [ "Song", "Mengfei", "" ], [ "Bao", "Siqi", "" ], [ "Wang", "Fan", "" ], [ "He", "Huang", "" ], [ "Sun", "Shuqi", "" ], [ "Wu", "Hua", "" ] ...
Existing pipelined task-oriented dialogue systems usually have difficulties adapting to unseen domains, whereas end-to-end systems are plagued by large-scale knowledge bases in practice. In this paper, we introduce a novel query-driven task-oriented dialogue system, namely Q-TOD. The essential information from the dial...