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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1901.06110 | Unni V. S. | Unni V. S., Sanjay Ghosh and Kunal N. Chaudhury | Linearized ADMM and Fast Nonlocal Denoising for Efficient Plug-and-Play
Restoration | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In plug-and-play image restoration, the regularization is performed using
powerful denoisers such as nonlocal means (NLM) or BM3D. This is done within
the framework of alternating direction method of multipliers (ADMM), where the
regularization step is formally replaced by an off-the-shelf denoiser. Each
plug-and-pla... | [
{
"created": "Fri, 18 Jan 2019 07:20:32 GMT",
"version": "v1"
}
] | 2019-01-21 | [
[
"S.",
"Unni V.",
""
],
[
"Ghosh",
"Sanjay",
""
],
[
"Chaudhury",
"Kunal N.",
""
]
] | In plug-and-play image restoration, the regularization is performed using powerful denoisers such as nonlocal means (NLM) or BM3D. This is done within the framework of alternating direction method of multipliers (ADMM), where the regularization step is formally replaced by an off-the-shelf denoiser. Each plug-and-play ... |
1402.1607 | Kangqi Liu | Kangqi Liu, Meixia Tao, Zhengzheng Xiang and Xin Long | Generalized Signal Alignment For MIMO Two-Way X Relay Channels | 6 pages, 6 figures, to appear in IEEE ICC 2014 | null | 10.1109/ICC.2014.6884019 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the degrees of freedom (DoF) of MIMO two-way X relay channels.
Previous work studied the case $N < 2M$, where $N$ and $M$ denote the number of
antennas at the relay and each source, respectively, and showed that the
maximum DoF of $2N$ is achievable when $N \leq \lfloor\frac{8M}{5}\rfloor$ by
applying signal... | [
{
"created": "Fri, 7 Feb 2014 11:32:22 GMT",
"version": "v1"
}
] | 2018-02-21 | [
[
"Liu",
"Kangqi",
""
],
[
"Tao",
"Meixia",
""
],
[
"Xiang",
"Zhengzheng",
""
],
[
"Long",
"Xin",
""
]
] | We study the degrees of freedom (DoF) of MIMO two-way X relay channels. Previous work studied the case $N < 2M$, where $N$ and $M$ denote the number of antennas at the relay and each source, respectively, and showed that the maximum DoF of $2N$ is achievable when $N \leq \lfloor\frac{8M}{5}\rfloor$ by applying signal a... |
2205.04800 | Mikhail Panine | Mikhail Panine, Maxime Kirgo and Maks Ovsjanikov | Non-Isometric Shape Matching via Functional Maps on Landmark-Adapted
Bases | To appear in: Computer Graphics Forum // Main Manuscript: 15 pages
(without references), 19 figures, 4 tables // Appendix: 8 pages, 12 figures,
3 tables // Second version fixes typos, font inconsistencies and a minor sign
error | null | null | null | cs.CV cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a principled approach for non-isometric landmark-preserving
non-rigid shape matching. Our method is based on the functional maps framework,
but rather than promoting isometries we focus instead on near-conformal maps
that preserve landmarks exactly. We achieve this, first, by introducing a novel
landmark-a... | [
{
"created": "Tue, 10 May 2022 11:02:14 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Jun 2022 11:56:48 GMT",
"version": "v2"
}
] | 2022-06-23 | [
[
"Panine",
"Mikhail",
""
],
[
"Kirgo",
"Maxime",
""
],
[
"Ovsjanikov",
"Maks",
""
]
] | We propose a principled approach for non-isometric landmark-preserving non-rigid shape matching. Our method is based on the functional maps framework, but rather than promoting isometries we focus instead on near-conformal maps that preserve landmarks exactly. We achieve this, first, by introducing a novel landmark-ada... |
2012.13114 | Daniela Vianna | Daniela Vianna, Am\'elie Marian | A Frequency-Based Learning-To-Rank Approach for Personal Digital Traces | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Personal digital traces are constantly produced by connected devices,
internet services and interactions. These digital traces are typically small,
heterogeneous and stored in various locations in the cloud or on local devices,
making it a challenge for users to interact with and search their own data. By
adopting a ... | [
{
"created": "Thu, 24 Dec 2020 05:24:10 GMT",
"version": "v1"
}
] | 2020-12-25 | [
[
"Vianna",
"Daniela",
""
],
[
"Marian",
"Amélie",
""
]
] | Personal digital traces are constantly produced by connected devices, internet services and interactions. These digital traces are typically small, heterogeneous and stored in various locations in the cloud or on local devices, making it a challenge for users to interact with and search their own data. By adopting a mu... |
2104.00798 | Jiahao Pang | Haiyan Wang, Jiahao Pang, Muhammad A. Lodhi, Yingli Tian, Dong Tian | FESTA: Flow Estimation via Spatial-Temporal Attention for Scene Point
Clouds | Accepted at CVPR 2021 (Oral Presentation) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scene flow depicts the dynamics of a 3D scene, which is critical for various
applications such as autonomous driving, robot navigation, AR/VR, etc.
Conventionally, scene flow is estimated from dense/regular RGB video frames.
With the development of depth-sensing technologies, precise 3D measurements are
available via... | [
{
"created": "Thu, 1 Apr 2021 23:04:04 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Dec 2021 17:04:51 GMT",
"version": "v2"
}
] | 2021-12-07 | [
[
"Wang",
"Haiyan",
""
],
[
"Pang",
"Jiahao",
""
],
[
"Lodhi",
"Muhammad A.",
""
],
[
"Tian",
"Yingli",
""
],
[
"Tian",
"Dong",
""
]
] | Scene flow depicts the dynamics of a 3D scene, which is critical for various applications such as autonomous driving, robot navigation, AR/VR, etc. Conventionally, scene flow is estimated from dense/regular RGB video frames. With the development of depth-sensing technologies, precise 3D measurements are available via p... |
0907.4488 | Gregory Gutin | Gregory Gutin, Eun Jung Kim, Michael Lampis, and Valia Mitsou | Vertex Cover Problem Parameterized Above and Below Tight Bounds | null | null | null | null | cs.CC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the well-known Vertex Cover problem parameterized above and below
tight bounds. We show that two of the parameterizations (both were suggested by
Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137--153,
2009) are fixed-parameter tractable and two other parameterizations are
W[1]-hard (one ... | [
{
"created": "Sun, 26 Jul 2009 15:02:39 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Aug 2009 10:25:36 GMT",
"version": "v2"
}
] | 2009-08-28 | [
[
"Gutin",
"Gregory",
""
],
[
"Kim",
"Eun Jung",
""
],
[
"Lampis",
"Michael",
""
],
[
"Mitsou",
"Valia",
""
]
] | We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137--153, 2009) are fixed-parameter tractable and two other parameterizations are W[1]-hard (one of... |
1804.05901 | Zulqarnain Khattak | Zulqarnain H. Khattak, Hyungjun Park, Seongah Hong, Richard Atta
Boateng, and Brian L. Smith | Investigating Cybersecurity Issues In Active Traffic Management Systems | 25 pages,7 figures, Accepted for Publication in Transportation
Research Record, Journal of Transportation Research Board 2018 | null | null | TRR Paper Number: 18-03501 | cs.CR | http://creativecommons.org/licenses/by/4.0/ | Active Traffic Management (ATM) systems have been introduced by
transportation agencies to manage recurrent and non-recurrent congestion. ATM
systems rely on the interconnectivity of components made possible by wired
and/or wireless networks. Unfortunately, this connectivity that supports ATM
systems also provides po... | [
{
"created": "Mon, 16 Apr 2018 19:23:19 GMT",
"version": "v1"
}
] | 2018-04-18 | [
[
"Khattak",
"Zulqarnain H.",
""
],
[
"Park",
"Hyungjun",
""
],
[
"Hong",
"Seongah",
""
],
[
"Boateng",
"Richard Atta",
""
],
[
"Smith",
"Brian L.",
""
]
] | Active Traffic Management (ATM) systems have been introduced by transportation agencies to manage recurrent and non-recurrent congestion. ATM systems rely on the interconnectivity of components made possible by wired and/or wireless networks. Unfortunately, this connectivity that supports ATM systems also provides pote... |
1702.06610 | Markus Luczak-Roesch | Markus Luczak-Roesch | Towards an Understanding of the Effects of Augmented Reality Games on
Disaster Management | null | null | null | null | cs.CY cs.HC | http://creativecommons.org/licenses/by/4.0/ | Location-based augmented reality games have entered the mainstream with the
nearly overnight success of Niantic's Pok\'emon Go. Unlike traditional video
games, the fact that players of such games carry out actions in the external,
physical world to accomplish in-game objectives means that the large-scale
adoption of ... | [
{
"created": "Tue, 21 Feb 2017 22:52:43 GMT",
"version": "v1"
}
] | 2017-02-23 | [
[
"Luczak-Roesch",
"Markus",
""
]
] | Location-based augmented reality games have entered the mainstream with the nearly overnight success of Niantic's Pok\'emon Go. Unlike traditional video games, the fact that players of such games carry out actions in the external, physical world to accomplish in-game objectives means that the large-scale adoption of su... |
1409.2792 | Xingqin Lin | Xingqin Lin and Robert W. Heath Jr. and Jeffrey G. Andrews | The Interplay between Massive MIMO and Underlaid D2D Networking | 35 pages; 7 figures; submitted to IEEE Transactions on Wireless
Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a device-to-device (D2D) underlaid cellular network, the uplink spectrum
is reused by the D2D transmissions, causing mutual interference with the
ongoing cellular transmissions. Massive MIMO is appealing in such a context as
the base station's (BS's) large antenna array can nearly null the D2D-to-BS
interference. ... | [
{
"created": "Tue, 9 Sep 2014 16:05:27 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Nov 2014 05:51:18 GMT",
"version": "v2"
},
{
"created": "Wed, 28 Jan 2015 07:42:44 GMT",
"version": "v3"
}
] | 2015-01-29 | [
[
"Lin",
"Xingqin",
""
],
[
"Heath",
"Robert W.",
"Jr."
],
[
"Andrews",
"Jeffrey G.",
""
]
] | In a device-to-device (D2D) underlaid cellular network, the uplink spectrum is reused by the D2D transmissions, causing mutual interference with the ongoing cellular transmissions. Massive MIMO is appealing in such a context as the base station's (BS's) large antenna array can nearly null the D2D-to-BS interference. Th... |
2210.06696 | Huize Li | Huize Li, Hai Jin, Long Zheng, Yu Huang, Xiaofei Liao, Dan Chen,
Zhuohui Duan, Cong Liu, Jiahong Xu, Chuanyi Gui | CPSAA: Accelerating Sparse Attention using Crossbar-based
Processing-In-Memory Architecture | 14 pages, 19 figures | null | null | null | cs.AR cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The attention mechanism requires huge computational efforts to process
unnecessary calculations, significantly limiting the system's performance.
Researchers propose sparse attention to convert some DDMM operations to SDDMM
and SpMM operations. However, current sparse attention solutions introduce
massive off-chip ra... | [
{
"created": "Thu, 13 Oct 2022 03:20:11 GMT",
"version": "v1"
},
{
"created": "Sat, 7 Oct 2023 10:27:43 GMT",
"version": "v2"
}
] | 2023-10-10 | [
[
"Li",
"Huize",
""
],
[
"Jin",
"Hai",
""
],
[
"Zheng",
"Long",
""
],
[
"Huang",
"Yu",
""
],
[
"Liao",
"Xiaofei",
""
],
[
"Chen",
"Dan",
""
],
[
"Duan",
"Zhuohui",
""
],
[
"Liu",
"Cong",
""
... | The attention mechanism requires huge computational efforts to process unnecessary calculations, significantly limiting the system's performance. Researchers propose sparse attention to convert some DDMM operations to SDDMM and SpMM operations. However, current sparse attention solutions introduce massive off-chip rand... |
1604.07090 | Dingwen Zhang | Dingwen Zhang, Huazhu Fu, Junwei Han, Ali Borji, Xuelong Li | A Review of Co-saliency Detection Technique: Fundamentals, Applications,
and Challenges | 28 pages, 12 figures, 3 tables | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Co-saliency detection is a newly emerging and rapidly growing research area
in computer vision community. As a novel branch of visual saliency, co-saliency
detection refers to the discovery of common and salient foregrounds from two or
more relevant images, and can be widely used in many computer vision tasks. The
ex... | [
{
"created": "Sun, 24 Apr 2016 22:36:38 GMT",
"version": "v1"
},
{
"created": "Mon, 16 May 2016 14:09:33 GMT",
"version": "v2"
},
{
"created": "Mon, 30 Jan 2017 20:55:33 GMT",
"version": "v3"
},
{
"created": "Mon, 22 May 2017 13:36:24 GMT",
"version": "v4"
},
{
"c... | 2017-07-11 | [
[
"Zhang",
"Dingwen",
""
],
[
"Fu",
"Huazhu",
""
],
[
"Han",
"Junwei",
""
],
[
"Borji",
"Ali",
""
],
[
"Li",
"Xuelong",
""
]
] | Co-saliency detection is a newly emerging and rapidly growing research area in computer vision community. As a novel branch of visual saliency, co-saliency detection refers to the discovery of common and salient foregrounds from two or more relevant images, and can be widely used in many computer vision tasks. The exis... |
1111.0862 | Emmanuel Filiot | Emmanuel Filiot (Universit\'e Libre de Bruxelles), Raffaella Gentilini
(Universit\`a degli Studi di Perugia), Jean-Fran\~A{\S}ois Raskin
(Universit\'e Libre de Bruxelles) | Quantitative Languages Defined by Functional Automata | 32 pages, extended version of CONCUR'12 | Logical Methods in Computer Science, Volume 11, Issue 3 (September
17, 2015) lmcs:1590 | 10.2168/LMCS-11(3:14)2015 | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A weighted automaton is functional if any two accepting runs on the same
finite word have the same value. In this paper, we investigate functional
weighted automata for four different measures: the sum, the mean, the
discounted sum of weights along edges and the ratio between rewards and costs.
On the positive side, ... | [
{
"created": "Sat, 24 Sep 2011 06:29:29 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Nov 2011 16:15:01 GMT",
"version": "v2"
},
{
"created": "Tue, 7 Jul 2015 14:19:16 GMT",
"version": "v3"
},
{
"created": "Wed, 16 Sep 2015 19:39:29 GMT",
"version": "v4"
}
] | 2017-01-11 | [
[
"Filiot",
"Emmanuel",
"",
"Université Libre de Bruxelles"
],
[
"Gentilini",
"Raffaella",
"",
"Università degli Studi di Perugia"
],
[
"Raskin",
"Jean-François",
"",
"Université Libre de Bruxelles"
]
] | A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges and the ratio between rewards and costs. On the positive side, we... |
1802.02254 | Ping Zhang | Ping Zhang, Zhifeng Bao, Yuchen Li, Guoliang Li, Yipeng Zhang, Zhiyong
Peng | Trajectory-driven Influential Billboard Placement | null | null | 10.1145/3219819.3219946 | null | cs.SI cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose and study the problem of trajectory-driven
influential billboard placement: given a set of billboards $U$ (each with a
location and a cost), a database of trajectories $\mathcal{T}$ and a budget
$L$, find a set of billboards within the budget to influence the largest number
of trajectories. O... | [
{
"created": "Tue, 6 Feb 2018 23:05:02 GMT",
"version": "v1"
},
{
"created": "Wed, 30 May 2018 11:13:46 GMT",
"version": "v2"
},
{
"created": "Sun, 9 Sep 2018 14:43:37 GMT",
"version": "v3"
},
{
"created": "Sat, 15 Sep 2018 07:43:40 GMT",
"version": "v4"
}
] | 2018-09-18 | [
[
"Zhang",
"Ping",
""
],
[
"Bao",
"Zhifeng",
""
],
[
"Li",
"Yuchen",
""
],
[
"Li",
"Guoliang",
""
],
[
"Zhang",
"Yipeng",
""
],
[
"Peng",
"Zhiyong",
""
]
] | In this paper we propose and study the problem of trajectory-driven influential billboard placement: given a set of billboards $U$ (each with a location and a cost), a database of trajectories $\mathcal{T}$ and a budget $L$, find a set of billboards within the budget to influence the largest number of trajectories. One... |
2211.00301 | Enwei Zhu | Enwei Zhu, Yiyang Liu, Ming Jin, Jinpeng Li | Recognizing Nested Entities from Flat Supervision: A New NER Subtask,
Feasibility and Challenges | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many recent named entity recognition (NER) studies criticize flat NER for its
non-overlapping assumption, and switch to investigating nested NER. However,
existing nested NER models heavily rely on training data annotated with nested
entities, while labeling such data is costly. This study proposes a new
subtask, nes... | [
{
"created": "Tue, 1 Nov 2022 06:41:42 GMT",
"version": "v1"
}
] | 2022-11-02 | [
[
"Zhu",
"Enwei",
""
],
[
"Liu",
"Yiyang",
""
],
[
"Jin",
"Ming",
""
],
[
"Li",
"Jinpeng",
""
]
] | Many recent named entity recognition (NER) studies criticize flat NER for its non-overlapping assumption, and switch to investigating nested NER. However, existing nested NER models heavily rely on training data annotated with nested entities, while labeling such data is costly. This study proposes a new subtask, neste... |
1910.00868 | Joan Boyar | Joan Boyar, Kim S. Larsen, Denis Pankratov | Advice Complexity of Adaptive Priority Algorithms | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The priority model was introduced to capture "greedy-like" algorithms.
Motivated by the success of advice complexity in the area of online algorithms,
the fixed priority model was extended to include advice, and a reduction-based
framework was developed for proving lower bounds on the amount of advice
required to ach... | [
{
"created": "Wed, 2 Oct 2019 10:37:28 GMT",
"version": "v1"
},
{
"created": "Mon, 9 Nov 2020 07:34:12 GMT",
"version": "v2"
},
{
"created": "Mon, 12 Jul 2021 10:43:06 GMT",
"version": "v3"
},
{
"created": "Wed, 26 Jan 2022 09:03:43 GMT",
"version": "v4"
}
] | 2022-01-27 | [
[
"Boyar",
"Joan",
""
],
[
"Larsen",
"Kim S.",
""
],
[
"Pankratov",
"Denis",
""
]
] | The priority model was introduced to capture "greedy-like" algorithms. Motivated by the success of advice complexity in the area of online algorithms, the fixed priority model was extended to include advice, and a reduction-based framework was developed for proving lower bounds on the amount of advice required to achie... |
2202.03393 | Francisco Valente | Francisco Valente | Link Prediction of Artificial Intelligence Concepts using Low
Computational Power | Solution awarded a special prize in the Science4cast 2021
competition. Presented and published in the IEEE Big Data 2021 conference.
Minor text improvements and typos corrected from the published version | 2021 IEEE International Conference on Big Data (Big Data),
5828-5832, 2021 | 10.1109/BigData52589.2021.9671719 | null | cs.SI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an approach proposed for the Science4cast 2021
competition, organized by the Institute of Advanced Research in Artificial
Intelligence, whose main goal was to predict the likelihood of future
associations between machine learning concepts in a semantic network. The
developed methodology correspond... | [
{
"created": "Mon, 7 Feb 2022 18:32:02 GMT",
"version": "v1"
}
] | 2022-02-08 | [
[
"Valente",
"Francisco",
""
]
] | This paper presents an approach proposed for the Science4cast 2021 competition, organized by the Institute of Advanced Research in Artificial Intelligence, whose main goal was to predict the likelihood of future associations between machine learning concepts in a semantic network. The developed methodology corresponds ... |
1709.05254 | Marco Schreyer | Marco Schreyer, Timur Sattarov, Damian Borth, Andreas Dengel and Bernd
Reimer | Detection of Anomalies in Large Scale Accounting Data using Deep
Autoencoder Networks | 19 pages, 6 figures, 3 tables | null | null | null | cs.LG cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning to detect fraud in large-scale accounting data is one of the
long-standing challenges in financial statement audits or fraud investigations.
Nowadays, the majority of applied techniques refer to handcrafted rules derived
from known fraud scenarios. While fairly successful, these rules exhibit the
drawback th... | [
{
"created": "Fri, 15 Sep 2017 15:07:29 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Aug 2018 15:47:52 GMT",
"version": "v2"
}
] | 2018-08-02 | [
[
"Schreyer",
"Marco",
""
],
[
"Sattarov",
"Timur",
""
],
[
"Borth",
"Damian",
""
],
[
"Dengel",
"Andreas",
""
],
[
"Reimer",
"Bernd",
""
]
] | Learning to detect fraud in large-scale accounting data is one of the long-standing challenges in financial statement audits or fraud investigations. Nowadays, the majority of applied techniques refer to handcrafted rules derived from known fraud scenarios. While fairly successful, these rules exhibit the drawback that... |
2011.02172 | Naoki Kato | Naoki Kato, Hiroto Honda, Yusuke Uchida | Leveraging Temporal Joint Depths for Improving 3D Human Pose Estimation
in Video | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The effectiveness of the approaches to predict 3D poses from 2D poses
estimated in each frame of a video has been demonstrated for 3D human pose
estimation. However, 2D poses without appearance information of persons have
much ambiguity with respect to the joint depths. In this paper, we propose to
estimate a 3D pose... | [
{
"created": "Wed, 4 Nov 2020 08:23:41 GMT",
"version": "v1"
}
] | 2020-11-05 | [
[
"Kato",
"Naoki",
""
],
[
"Honda",
"Hiroto",
""
],
[
"Uchida",
"Yusuke",
""
]
] | The effectiveness of the approaches to predict 3D poses from 2D poses estimated in each frame of a video has been demonstrated for 3D human pose estimation. However, 2D poses without appearance information of persons have much ambiguity with respect to the joint depths. In this paper, we propose to estimate a 3D pose i... |
2312.10669 | Kevin Putra Santoso | K. P. Santoso, F. A. Madany, H. Suryotrisongko | Analisis Eksploratif Dan Augmentasi Data NSL-KDD Menggunakan Deep
Generative Adversarial Networks Untuk Meningkatkan Performa Algoritma Extreme
Gradient Boosting Dalam Klasifikasi Jenis Serangan Siber | in Indonesian language | null | null | null | cs.CR cs.AI | http://creativecommons.org/licenses/by/4.0/ | This study proposes the implementation of Deep Generative Adversarial
Networks (GANs) for augmenting the NSL-KDD dataset. The primary objective is to
enhance the efficacy of eXtreme Gradient Boosting (XGBoost) in the
classification of cyber-attacks on the NSL-KDD dataset. As a result, the method
proposed in this rese... | [
{
"created": "Sun, 17 Dec 2023 09:54:07 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Santoso",
"K. P.",
""
],
[
"Madany",
"F. A.",
""
],
[
"Suryotrisongko",
"H.",
""
]
] | This study proposes the implementation of Deep Generative Adversarial Networks (GANs) for augmenting the NSL-KDD dataset. The primary objective is to enhance the efficacy of eXtreme Gradient Boosting (XGBoost) in the classification of cyber-attacks on the NSL-KDD dataset. As a result, the method proposed in this resear... |
2405.20083 | Philipp G. Haselwarter | Philipp G. Haselwarter, Kwing Hei Li, Markus de Medeiros, Simon
Oddershede Gregersen, Alejandro Aguirre, Joseph Tassarotti, Lars Birkedal | Tachis: Higher-Order Separation Logic with Credits for Expected Costs | null | null | null | null | cs.LO cs.PL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We present Tachis, a higher-order separation logic to reason about the
expected cost of probabilistic programs. Inspired by the uses of time credits
for reasoning about the running time of deterministic programs, we introduce a
novel notion of probabilistic cost credit. Probabilistic cost credits are a
separation log... | [
{
"created": "Thu, 30 May 2024 14:12:00 GMT",
"version": "v1"
}
] | 2024-05-31 | [
[
"Haselwarter",
"Philipp G.",
""
],
[
"Li",
"Kwing Hei",
""
],
[
"de Medeiros",
"Markus",
""
],
[
"Gregersen",
"Simon Oddershede",
""
],
[
"Aguirre",
"Alejandro",
""
],
[
"Tassarotti",
"Joseph",
""
],
[
"Birkedal",
... | We present Tachis, a higher-order separation logic to reason about the expected cost of probabilistic programs. Inspired by the uses of time credits for reasoning about the running time of deterministic programs, we introduce a novel notion of probabilistic cost credit. Probabilistic cost credits are a separation logic... |
1911.07793 | Oliver Korten | Oliver Korten | On the Complexity of 2-Player Packing Games | null | null | null | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We analyze the computational complexity of two 2-player games involving
packing objects into a box. In the first game, players alternate drawing
polycubes from a shared pile and placing them into an initially empty box in
any available location; the first player who can't place another piece loses.
In the second game... | [
{
"created": "Mon, 18 Nov 2019 17:48:47 GMT",
"version": "v1"
}
] | 2019-11-19 | [
[
"Korten",
"Oliver",
""
]
] | We analyze the computational complexity of two 2-player games involving packing objects into a box. In the first game, players alternate drawing polycubes from a shared pile and placing them into an initially empty box in any available location; the first player who can't place another piece loses. In the second game, ... |
2301.01283 | Junjie Yan | Junjie Yan, Yingfei Liu, Jianjian Sun, Fan Jia, Shuailin Li, Tiancai
Wang, Xiangyu Zhang | Cross Modal Transformer: Towards Fast and Robust 3D Object Detection | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a robust 3D detector, named Cross Modal Transformer
(CMT), for end-to-end 3D multi-modal detection. Without explicit view
transformation, CMT takes the image and point clouds tokens as inputs and
directly outputs accurate 3D bounding boxes. The spatial alignment of
multi-modal tokens is perf... | [
{
"created": "Tue, 3 Jan 2023 18:36:52 GMT",
"version": "v1"
},
{
"created": "Sun, 12 Mar 2023 07:56:36 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Sep 2023 09:53:25 GMT",
"version": "v3"
}
] | 2023-09-19 | [
[
"Yan",
"Junjie",
""
],
[
"Liu",
"Yingfei",
""
],
[
"Sun",
"Jianjian",
""
],
[
"Jia",
"Fan",
""
],
[
"Li",
"Shuailin",
""
],
[
"Wang",
"Tiancai",
""
],
[
"Zhang",
"Xiangyu",
""
]
] | In this paper, we propose a robust 3D detector, named Cross Modal Transformer (CMT), for end-to-end 3D multi-modal detection. Without explicit view transformation, CMT takes the image and point clouds tokens as inputs and directly outputs accurate 3D bounding boxes. The spatial alignment of multi-modal tokens is perfor... |
2203.15086 | Satya Krishna Gorti | Satya Krishna Gorti, Noel Vouitsis, Junwei Ma, Keyvan Golestan,
Maksims Volkovs, Animesh Garg, Guangwei Yu | X-Pool: Cross-Modal Language-Video Attention for Text-Video Retrieval | CVPR 2022 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In text-video retrieval, the objective is to learn a cross-modal similarity
function between a text and a video that ranks relevant text-video pairs higher
than irrelevant pairs. However, videos inherently express a much wider gamut of
information than texts. Instead, texts often capture sub-regions of entire
videos ... | [
{
"created": "Mon, 28 Mar 2022 20:47:37 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Gorti",
"Satya Krishna",
""
],
[
"Vouitsis",
"Noel",
""
],
[
"Ma",
"Junwei",
""
],
[
"Golestan",
"Keyvan",
""
],
[
"Volkovs",
"Maksims",
""
],
[
"Garg",
"Animesh",
""
],
[
"Yu",
"Guangwei",
""
]
] | In text-video retrieval, the objective is to learn a cross-modal similarity function between a text and a video that ranks relevant text-video pairs higher than irrelevant pairs. However, videos inherently express a much wider gamut of information than texts. Instead, texts often capture sub-regions of entire videos an... |
2307.11628 | Xingyu Zhu | Xingyu Zhu, Guanhui Ye, Xiapu Luo, Xuetao Wei | Rethinking Mesh Watermark: Towards Highly Robust and Adaptable Deep 3D
Mesh Watermarking | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | The goal of 3D mesh watermarking is to embed the message in 3D meshes that
can withstand various attacks imperceptibly and reconstruct the message
accurately from watermarked meshes. The watermarking algorithm is supposed to
withstand multiple attacks, and the complexity should not grow significantly
with the mesh si... | [
{
"created": "Fri, 21 Jul 2023 14:49:30 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Dec 2023 03:08:43 GMT",
"version": "v2"
}
] | 2023-12-19 | [
[
"Zhu",
"Xingyu",
""
],
[
"Ye",
"Guanhui",
""
],
[
"Luo",
"Xiapu",
""
],
[
"Wei",
"Xuetao",
""
]
] | The goal of 3D mesh watermarking is to embed the message in 3D meshes that can withstand various attacks imperceptibly and reconstruct the message accurately from watermarked meshes. The watermarking algorithm is supposed to withstand multiple attacks, and the complexity should not grow significantly with the mesh size... |
2407.06767 | Ziwei Liu | Ziwei Liu, Wen Chen, Qingqing Wu, Zhendong Li, Xusheng Zhu, Qiong Wu,
and Nan Cheng | Enhancing Robustness and Security in ISAC Network Design: Leveraging
Transmissive Reconfigurable Intelligent Surface with RSMA | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel transmissive reconfigurable intelligent
surface transceiver-enhanced robust and secure integrated sensing and
communication network. A time-division sensing communication mechanism is
designed for the scenario, which enables communication and sensing to share
wireless resources. To a... | [
{
"created": "Tue, 9 Jul 2024 11:35:02 GMT",
"version": "v1"
}
] | 2024-07-10 | [
[
"Liu",
"Ziwei",
""
],
[
"Chen",
"Wen",
""
],
[
"Wu",
"Qingqing",
""
],
[
"Li",
"Zhendong",
""
],
[
"Zhu",
"Xusheng",
""
],
[
"Wu",
"Qiong",
""
],
[
"Cheng",
"Nan",
""
]
] | In this paper, we propose a novel transmissive reconfigurable intelligent surface transceiver-enhanced robust and secure integrated sensing and communication network. A time-division sensing communication mechanism is designed for the scenario, which enables communication and sensing to share wireless resources. To add... |
1805.09235 | PrzemysÅaw Spurek | Szymon Knop, Jacek Tabor, Przemys{\l}aw Spurek, Igor Podolak, Marcin
Mazur, Stanis{\l}aw Jastrz\k{e}bski | Cramer-Wold AutoEncoder | null | Journal of Machine Learning Research, 21, 164, 1-28 2020 | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new generative model, Cramer-Wold Autoencoder (CWAE). Following
WAE, we directly encourage normality of the latent space. Our paper uses also
the recent idea from Sliced WAE (SWAE) model, which uses one-dimensional
projections as a method of verifying closeness of two distributions. The
crucial new ingre... | [
{
"created": "Wed, 23 May 2018 15:48:31 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Oct 2018 17:31:37 GMT",
"version": "v2"
},
{
"created": "Tue, 2 Jul 2019 09:00:24 GMT",
"version": "v3"
}
] | 2020-09-21 | [
[
"Knop",
"Szymon",
""
],
[
"Tabor",
"Jacek",
""
],
[
"Spurek",
"Przemysław",
""
],
[
"Podolak",
"Igor",
""
],
[
"Mazur",
"Marcin",
""
],
[
"Jastrzębski",
"Stanisław",
""
]
] | We propose a new generative model, Cramer-Wold Autoencoder (CWAE). Following WAE, we directly encourage normality of the latent space. Our paper uses also the recent idea from Sliced WAE (SWAE) model, which uses one-dimensional projections as a method of verifying closeness of two distributions. The crucial new ingredi... |
2010.13304 | Madhavan Rajagopal Padmanabhan | Xiaoyun Fu, Madhavan Rajagopal Padmanabhan, Raj Gaurav Kumar, Samik
Basu, Shawn Dorius, Pavan Aduri | Measuring the Impact of Influence on Individuals: Roadmap to Quantifying
Attitude | 13 pages, To appear in the proceedings of the 2020 IEEE/ACM
International Conference on Advances in Social Networks Analysis and Mining
(ASONAM) | null | null | null | cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Influence diffusion has been central to the study of propagation of
information in social networks, where influence is typically modeled as a
binary property of entities: influenced or not influenced. We introduce the
notion of attitude, which, as described in social psychology, is the degree by
which an entity is in... | [
{
"created": "Mon, 26 Oct 2020 03:21:29 GMT",
"version": "v1"
}
] | 2020-10-27 | [
[
"Fu",
"Xiaoyun",
""
],
[
"Padmanabhan",
"Madhavan Rajagopal",
""
],
[
"Kumar",
"Raj Gaurav",
""
],
[
"Basu",
"Samik",
""
],
[
"Dorius",
"Shawn",
""
],
[
"Aduri",
"Pavan",
""
]
] | Influence diffusion has been central to the study of propagation of information in social networks, where influence is typically modeled as a binary property of entities: influenced or not influenced. We introduce the notion of attitude, which, as described in social psychology, is the degree by which an entity is infl... |
2212.02626 | Linard Arquint | Linard Arquint and Malte Schwerhoff and Vaibhav Mehta and Peter
M\"uller | A Generic Methodology for the Modular Verification of Security Protocol
Implementations (extended version) | null | null | 10.1145/3576915.3623105 | null | cs.CR cs.PL | http://creativecommons.org/licenses/by/4.0/ | Security protocols are essential building blocks of modern IT systems. Subtle
flaws in their design or implementation may compromise the security of entire
systems. It is, thus, important to prove the absence of such flaws through
formal verification. Much existing work focuses on the verification of protocol
*models... | [
{
"created": "Mon, 5 Dec 2022 22:18:46 GMT",
"version": "v1"
},
{
"created": "Sun, 10 Sep 2023 15:49:26 GMT",
"version": "v2"
}
] | 2023-09-12 | [
[
"Arquint",
"Linard",
""
],
[
"Schwerhoff",
"Malte",
""
],
[
"Mehta",
"Vaibhav",
""
],
[
"Müller",
"Peter",
""
]
] | Security protocols are essential building blocks of modern IT systems. Subtle flaws in their design or implementation may compromise the security of entire systems. It is, thus, important to prove the absence of such flaws through formal verification. Much existing work focuses on the verification of protocol *models*,... |
1112.6320 | Seyed Hamed Hassani | S. Hamed Hassani, Nicolas Macris, Rudiger Urbanke | Threshold Saturation in Spatially Coupled Constraint Satisfaction
Problems | null | null | 10.1007/s10955-012-0664-x | null | cs.CC cond-mat.stat-mech cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider chains of random constraint satisfaction models that are
spatially coupled across a finite window along the chain direction. We
investigate their phase diagram at zero temperature using the survey
propagation formalism and the interpolation method. We prove that the SAT-UNSAT
phase transition threshold of... | [
{
"created": "Fri, 23 Dec 2011 10:42:51 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Jun 2012 07:32:02 GMT",
"version": "v2"
}
] | 2015-06-03 | [
[
"Hassani",
"S. Hamed",
""
],
[
"Macris",
"Nicolas",
""
],
[
"Urbanke",
"Rudiger",
""
]
] | We consider chains of random constraint satisfaction models that are spatially coupled across a finite window along the chain direction. We investigate their phase diagram at zero temperature using the survey propagation formalism and the interpolation method. We prove that the SAT-UNSAT phase transition threshold of a... |
2004.08738 | Shun Zhang | Yindi Yang, Shun Zhang, Feifei Gao, Jianpeng Ma, Octavia A. Dobre | Graph Neural Network based Channel Tracking for Massive MIMO Networks | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we resort to the graph neural network (GNN) and propose the
new channel tracking method for the massive multiple-input multiple-output
networks under the high mobility scenario. We first utilize a small number of
pilots to achieve the initial channel estimation. Then, we represent the
obtained channel ... | [
{
"created": "Sun, 19 Apr 2020 01:29:01 GMT",
"version": "v1"
}
] | 2020-04-21 | [
[
"Yang",
"Yindi",
""
],
[
"Zhang",
"Shun",
""
],
[
"Gao",
"Feifei",
""
],
[
"Ma",
"Jianpeng",
""
],
[
"Dobre",
"Octavia A.",
""
]
] | In this paper, we resort to the graph neural network (GNN) and propose the new channel tracking method for the massive multiple-input multiple-output networks under the high mobility scenario. We first utilize a small number of pilots to achieve the initial channel estimation. Then, we represent the obtained channel da... |
2102.11360 | Greg Bodwin | Greg Bodwin, Michael Dinitz, Caleb Robelle | Partially Optimal Edge Fault-Tolerant Spanners | null | null | null | null | cs.DS cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work has established that, for every positive integer $k$, every
$n$-node graph has a $(2k-1)$-spanner on $O(f^{1-1/k} n^{1+1/k})$ edges that is
resilient to $f$ edge or vertex faults. For vertex faults, this bound is tight.
However, the case of edge faults is not as well understood: the best known
lower bound... | [
{
"created": "Mon, 22 Feb 2021 21:04:57 GMT",
"version": "v1"
}
] | 2021-02-24 | [
[
"Bodwin",
"Greg",
""
],
[
"Dinitz",
"Michael",
""
],
[
"Robelle",
"Caleb",
""
]
] | Recent work has established that, for every positive integer $k$, every $n$-node graph has a $(2k-1)$-spanner on $O(f^{1-1/k} n^{1+1/k})$ edges that is resilient to $f$ edge or vertex faults. For vertex faults, this bound is tight. However, the case of edge faults is not as well understood: the best known lower bound f... |
1912.05861 | Ephraim Zimmer | Ephraim Zimmer, Christian Burkert, Tom Petersen, Hannes Federrath | PEEPLL: Privacy-Enhanced Event Pseudonymisation with Limited Linkability | 10 pages. Extended version, Dec. 2019. A shortened version has been
accepted for publication in the proceedings of the 35th ACM/SIGAPP Symposium
On Applied Computing 2020 | null | 10.1145/3341105.3375781 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pseudonymisation provides the means to reduce the privacy impact of
monitoring, auditing, intrusion detection, and data collection in general on
individual subjects. Its application on data records, especially in an
environment with additional constraints, like re-identification in the course
of incident response, im... | [
{
"created": "Thu, 12 Dec 2019 10:11:18 GMT",
"version": "v1"
}
] | 2020-04-22 | [
[
"Zimmer",
"Ephraim",
""
],
[
"Burkert",
"Christian",
""
],
[
"Petersen",
"Tom",
""
],
[
"Federrath",
"Hannes",
""
]
] | Pseudonymisation provides the means to reduce the privacy impact of monitoring, auditing, intrusion detection, and data collection in general on individual subjects. Its application on data records, especially in an environment with additional constraints, like re-identification in the course of incident response, impl... |
1901.02161 | Daniel Brown | Daniel S. Brown, Yuchen Cui, Scott Niekum | Risk-Aware Active Inverse Reinforcement Learning | In proceedings of the 2nd Conference on Robot Learning (CoRL) 2018 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Active learning from demonstration allows a robot to query a human for
specific types of input to achieve efficient learning. Existing work has
explored a variety of active query strategies; however, to our knowledge, none
of these strategies directly minimize the performance risk of the policy the
robot is learning.... | [
{
"created": "Tue, 8 Jan 2019 05:23:03 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jun 2019 20:46:56 GMT",
"version": "v2"
}
] | 2019-06-05 | [
[
"Brown",
"Daniel S.",
""
],
[
"Cui",
"Yuchen",
""
],
[
"Niekum",
"Scott",
""
]
] | Active learning from demonstration allows a robot to query a human for specific types of input to achieve efficient learning. Existing work has explored a variety of active query strategies; however, to our knowledge, none of these strategies directly minimize the performance risk of the policy the robot is learning. U... |
1811.09543 | Ji Zhang | Ji Zhang, Kevin Shih, Andrew Tao, Bryan Catanzaro, Ahmed Elgammal | An Interpretable Model for Scene Graph Generation | arXiv admin note: substantial text overlap with arXiv:1811.00662 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an efficient and interpretable scene graph generator. We consider
three types of features: visual, spatial and semantic, and we use a late fusion
strategy such that each feature's contribution can be explicitly investigated.
We study the key factors about these features that have the most impact on the
per... | [
{
"created": "Wed, 21 Nov 2018 17:51:01 GMT",
"version": "v1"
}
] | 2018-11-26 | [
[
"Zhang",
"Ji",
""
],
[
"Shih",
"Kevin",
""
],
[
"Tao",
"Andrew",
""
],
[
"Catanzaro",
"Bryan",
""
],
[
"Elgammal",
"Ahmed",
""
]
] | We propose an efficient and interpretable scene graph generator. We consider three types of features: visual, spatial and semantic, and we use a late fusion strategy such that each feature's contribution can be explicitly investigated. We study the key factors about these features that have the most impact on the perfo... |
2405.15690 | Ummay Kulsum | Ummay Kulsum, Haotian Zhu, Bowen Xu, Marcelo d'Amorim | A Case Study of LLM for Automated Vulnerability Repair: Assessing Impact
of Reasoning and Patch Validation Feedback | Code, data and artifacts are available:
http://tinyurl.com/vrpilot-artifacts | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Recent work in automated program repair (APR) proposes the use of reasoning
and patch validation feedback to reduce the semantic gap between the LLMs and
the code under analysis. The idea has been shown to perform well for general
APR, but its effectiveness in other particular contexts remains underexplored.
In this ... | [
{
"created": "Fri, 24 May 2024 16:29:48 GMT",
"version": "v1"
}
] | 2024-05-27 | [
[
"Kulsum",
"Ummay",
""
],
[
"Zhu",
"Haotian",
""
],
[
"Xu",
"Bowen",
""
],
[
"d'Amorim",
"Marcelo",
""
]
] | Recent work in automated program repair (APR) proposes the use of reasoning and patch validation feedback to reduce the semantic gap between the LLMs and the code under analysis. The idea has been shown to perform well for general APR, but its effectiveness in other particular contexts remains underexplored. In this wo... |
2305.02192 | Saeed Hadadan | Saeed Hadadan, Geng Lin, Jan Nov\'ak, Fabrice Rousselle, Matthias
Zwicker | Inverse Global Illumination using a Neural Radiometric Prior | Homepage: https://inverse-neural-radiosity.github.io | null | 10.1145/3588432.3591553 | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inverse rendering methods that account for global illumination are becoming
more popular, but current methods require evaluating and automatically
differentiating millions of path integrals by tracing multiple light bounces,
which remains expensive and prone to noise. Instead, this paper proposes a
radiometric prior ... | [
{
"created": "Wed, 3 May 2023 15:36:39 GMT",
"version": "v1"
},
{
"created": "Thu, 18 May 2023 02:13:18 GMT",
"version": "v2"
}
] | 2023-08-01 | [
[
"Hadadan",
"Saeed",
""
],
[
"Lin",
"Geng",
""
],
[
"Novák",
"Jan",
""
],
[
"Rousselle",
"Fabrice",
""
],
[
"Zwicker",
"Matthias",
""
]
] | Inverse rendering methods that account for global illumination are becoming more popular, but current methods require evaluating and automatically differentiating millions of path integrals by tracing multiple light bounces, which remains expensive and prone to noise. Instead, this paper proposes a radiometric prior as... |
1612.03663 | Maksim Lapin | Maksim Lapin, Matthias Hein, and Bernt Schiele | Analysis and Optimization of Loss Functions for Multiclass, Top-k, and
Multilabel Classification | null | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Top-k error is currently a popular performance measure on large scale image
classification benchmarks such as ImageNet and Places. Despite its wide
acceptance, our understanding of this metric is limited as most of the previous
research is focused on its special case, the top-1 error. In this work, we
explore two dir... | [
{
"created": "Mon, 12 Dec 2016 13:20:09 GMT",
"version": "v1"
}
] | 2016-12-19 | [
[
"Lapin",
"Maksim",
""
],
[
"Hein",
"Matthias",
""
],
[
"Schiele",
"Bernt",
""
]
] | Top-k error is currently a popular performance measure on large scale image classification benchmarks such as ImageNet and Places. Despite its wide acceptance, our understanding of this metric is limited as most of the previous research is focused on its special case, the top-1 error. In this work, we explore two direc... |
2406.04625 | Sangwon Ryu | Sangwon Ryu, Heejin Do, Yunsu Kim, Gary Geunbae Lee, Jungseul Ok | Key-Element-Informed sLLM Tuning for Document Summarization | Interspeech 2024 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Remarkable advances in large language models (LLMs) have enabled high-quality
text summarization. However, this capability is currently accessible only
through LLMs of substantial size or proprietary LLMs with usage fees. In
response, smaller-scale LLMs (sLLMs) of easy accessibility and low costs have
been extensivel... | [
{
"created": "Fri, 7 Jun 2024 04:19:01 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jun 2024 02:22:11 GMT",
"version": "v2"
}
] | 2024-06-27 | [
[
"Ryu",
"Sangwon",
""
],
[
"Do",
"Heejin",
""
],
[
"Kim",
"Yunsu",
""
],
[
"Lee",
"Gary Geunbae",
""
],
[
"Ok",
"Jungseul",
""
]
] | Remarkable advances in large language models (LLMs) have enabled high-quality text summarization. However, this capability is currently accessible only through LLMs of substantial size or proprietary LLMs with usage fees. In response, smaller-scale LLMs (sLLMs) of easy accessibility and low costs have been extensively ... |
2406.09638 | Shyam Venkatasubramanian | Shyam Venkatasubramanian, Bosung Kang, Ali Pezeshki, Muralidhar
Rangaswamy, Vahid Tarokh | RASPNet: A Benchmark Dataset for Radar Adaptive Signal Processing
Applications | null | null | null | null | cs.LG eess.SP | http://creativecommons.org/licenses/by/4.0/ | This work presents a large-scale dataset for radar adaptive signal processing
(RASP) applications, aimed at supporting the development of data-driven models
within the radar community. The dataset, called RASPNet, consists of 100
realistic scenarios compiled over a variety of topographies and land types from
across t... | [
{
"created": "Fri, 14 Jun 2024 00:07:52 GMT",
"version": "v1"
}
] | 2024-06-17 | [
[
"Venkatasubramanian",
"Shyam",
""
],
[
"Kang",
"Bosung",
""
],
[
"Pezeshki",
"Ali",
""
],
[
"Rangaswamy",
"Muralidhar",
""
],
[
"Tarokh",
"Vahid",
""
]
] | This work presents a large-scale dataset for radar adaptive signal processing (RASP) applications, aimed at supporting the development of data-driven models within the radar community. The dataset, called RASPNet, consists of 100 realistic scenarios compiled over a variety of topographies and land types from across the... |
2406.00938 | Chung-En Yu | Alice Bizzarri, Chung-En Yu, Brian Jalaian, Fabrizio Riguzzi,
Nathaniel D. Bastian | A Synergistic Approach In Network Intrusion Detection By Neurosymbolic
AI | null | null | null | null | cs.CR cs.AI cs.SC | http://creativecommons.org/licenses/by/4.0/ | The prevailing approaches in Network Intrusion Detection Systems (NIDS) are
often hampered by issues such as high resource consumption, significant
computational demands, and poor interpretability. Furthermore, these systems
generally struggle to identify novel, rapidly changing cyber threats. This
paper delves into ... | [
{
"created": "Mon, 3 Jun 2024 02:24:01 GMT",
"version": "v1"
}
] | 2024-06-04 | [
[
"Bizzarri",
"Alice",
""
],
[
"Yu",
"Chung-En",
""
],
[
"Jalaian",
"Brian",
""
],
[
"Riguzzi",
"Fabrizio",
""
],
[
"Bastian",
"Nathaniel D.",
""
]
] | The prevailing approaches in Network Intrusion Detection Systems (NIDS) are often hampered by issues such as high resource consumption, significant computational demands, and poor interpretability. Furthermore, these systems generally struggle to identify novel, rapidly changing cyber threats. This paper delves into th... |
1602.00351 | Yi Ding | Yi Ding, Peilin Zhao, Steven C.H. Hoi, Yew-Soon Ong | Adaptive Subgradient Methods for Online AUC Maximization | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning for maximizing AUC performance is an important research problem in
Machine Learning and Artificial Intelligence. Unlike traditional batch learning
methods for maximizing AUC which often suffer from poor scalability, recent
years have witnessed some emerging studies that attempt to maximize AUC by
single-pass... | [
{
"created": "Mon, 1 Feb 2016 00:25:18 GMT",
"version": "v1"
}
] | 2016-02-02 | [
[
"Ding",
"Yi",
""
],
[
"Zhao",
"Peilin",
""
],
[
"Hoi",
"Steven C. H.",
""
],
[
"Ong",
"Yew-Soon",
""
]
] | Learning for maximizing AUC performance is an important research problem in Machine Learning and Artificial Intelligence. Unlike traditional batch learning methods for maximizing AUC which often suffer from poor scalability, recent years have witnessed some emerging studies that attempt to maximize AUC by single-pass o... |
2408.03583 | Moran Feldman | Niv Buchbinder and Moran Feldman | Deterministic Algorithm and Faster Algorithm for Submodular Maximization
subject to a Matroid Constraint | 22 pages, to appear in FOCS 2024 | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of maximizing a monotone submodular function subject to
a matroid constraint, and present for it a deterministic non-oblivious local
search algorithm that has an approximation guarantee of $1 - 1/e - \varepsilon$
(for any $\varepsilon> 0$) and query complexity of $\tilde{O}_\varepsilon(nr)$,
wher... | [
{
"created": "Wed, 7 Aug 2024 06:39:45 GMT",
"version": "v1"
}
] | 2024-08-08 | [
[
"Buchbinder",
"Niv",
""
],
[
"Feldman",
"Moran",
""
]
] | We study the problem of maximizing a monotone submodular function subject to a matroid constraint, and present for it a deterministic non-oblivious local search algorithm that has an approximation guarantee of $1 - 1/e - \varepsilon$ (for any $\varepsilon> 0$) and query complexity of $\tilde{O}_\varepsilon(nr)$, where ... |
1906.12029 | Cheng Fu | Cheng Fu, Huili Chen, Haolan Liu, Xinyun Chen, Yuandong Tian, Farinaz
Koushanfar, Jishen Zhao | A Neural-based Program Decompiler | null | null | null | null | cs.PL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reverse engineering of binary executables is a critical problem in the
computer security domain. On the one hand, malicious parties may recover
interpretable source codes from the software products to gain commercial
advantages. On the other hand, binary decompilation can be leveraged for code
vulnerability analysis ... | [
{
"created": "Fri, 28 Jun 2019 03:29:38 GMT",
"version": "v1"
}
] | 2019-07-01 | [
[
"Fu",
"Cheng",
""
],
[
"Chen",
"Huili",
""
],
[
"Liu",
"Haolan",
""
],
[
"Chen",
"Xinyun",
""
],
[
"Tian",
"Yuandong",
""
],
[
"Koushanfar",
"Farinaz",
""
],
[
"Zhao",
"Jishen",
""
]
] | Reverse engineering of binary executables is a critical problem in the computer security domain. On the one hand, malicious parties may recover interpretable source codes from the software products to gain commercial advantages. On the other hand, binary decompilation can be leveraged for code vulnerability analysis an... |
2402.11588 | Shu Yang | Shu Yang, Hanzhi Ma, Chengting Yu, Aili Wang, Er-Ping Li | SDiT: Spiking Diffusion Model with Transformer | null | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spiking neural networks (SNNs) have low power consumption and
bio-interpretable characteristics, and are considered to have tremendous
potential for energy-efficient computing. However, the exploration of SNNs on
image generation tasks remains very limited, and a unified and effective
structure for SNN-based generati... | [
{
"created": "Sun, 18 Feb 2024 13:42:11 GMT",
"version": "v1"
},
{
"created": "Sat, 24 Feb 2024 07:24:09 GMT",
"version": "v2"
}
] | 2024-02-27 | [
[
"Yang",
"Shu",
""
],
[
"Ma",
"Hanzhi",
""
],
[
"Yu",
"Chengting",
""
],
[
"Wang",
"Aili",
""
],
[
"Li",
"Er-Ping",
""
]
] | Spiking neural networks (SNNs) have low power consumption and bio-interpretable characteristics, and are considered to have tremendous potential for energy-efficient computing. However, the exploration of SNNs on image generation tasks remains very limited, and a unified and effective structure for SNN-based generative... |
2202.11341 | Marco Spanghero | M. Lenhart, M. Spanghero, P. Papadimitratos | Distributed and Mobile Message Level Relaying/Replaying of GNSS Signals | null | null | 10.33012/2022.18227 | null | cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | With the introduction of Navigation Message Authentication (NMA), future
Global Navigation Satellite Systems (GNSSs) prevent spoofing by simulation,
i.e., the generation of forged satellite signals based on public information.
However, authentication does not prevent record-and-replay attacks, commonly
termed as meac... | [
{
"created": "Wed, 23 Feb 2022 07:54:46 GMT",
"version": "v1"
}
] | 2022-02-24 | [
[
"Lenhart",
"M.",
""
],
[
"Spanghero",
"M.",
""
],
[
"Papadimitratos",
"P.",
""
]
] | With the introduction of Navigation Message Authentication (NMA), future Global Navigation Satellite Systems (GNSSs) prevent spoofing by simulation, i.e., the generation of forged satellite signals based on public information. However, authentication does not prevent record-and-replay attacks, commonly termed as meacon... |
2406.06589 | You Zuo | You Zuo (ALMAnaCH), Kim Gerdes (LISN), Eric Villemonte de La Clergerie
(ALMAnaCH), Beno\^it Sagot (ALMAnaCH) | PatentEval: Understanding Errors in Patent Generation | null | NAACL2024 - 2024 Annual Conference of the North American Chapter
of the Association for Computational Linguistics, Jun 2024, Mexico City,
Mexico | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we introduce a comprehensive error typology specifically
designed for evaluating two distinct tasks in machine-generated patent texts:
claims-to-abstract generation, and the generation of the next claim given
previous ones. We have also developed a benchmark, PatentEval, for
systematically assessing lan... | [
{
"created": "Wed, 5 Jun 2024 13:55:27 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Jun 2024 08:23:03 GMT",
"version": "v2"
}
] | 2024-06-26 | [
[
"Zuo",
"You",
"",
"ALMAnaCH"
],
[
"Gerdes",
"Kim",
"",
"LISN"
],
[
"de La Clergerie",
"Eric Villemonte",
"",
"ALMAnaCH"
],
[
"Sagot",
"Benoît",
"",
"ALMAnaCH"
]
] | In this work, we introduce a comprehensive error typology specifically designed for evaluating two distinct tasks in machine-generated patent texts: claims-to-abstract generation, and the generation of the next claim given previous ones. We have also developed a benchmark, PatentEval, for systematically assessing langu... |
2311.01073 | Ljubisa Stankovic | Ljubisa Stankovic, Milos Dakovic, Ali Bagheri Bardi, Milos Brajovic,
Isidora Stankovic | Fourier Analysis of Signals on Directed Acyclic Graphs (DAG) Using Graph
Zero-Padding | 10 pages, 12 figures | null | null | null | cs.IT eess.SP math.IT | http://creativecommons.org/licenses/by/4.0/ | Directed acyclic graphs (DAGs) are used for modeling causal relationships,
dependencies, and flows in various systems. However, spectral analysis becomes
impractical in this setting because the eigen-decomposition of the adjacency
matrix yields all eigenvalues equal to zero. This inherent property of DAGs
results in ... | [
{
"created": "Thu, 2 Nov 2023 08:40:21 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Nov 2023 09:33:24 GMT",
"version": "v2"
}
] | 2023-11-14 | [
[
"Stankovic",
"Ljubisa",
""
],
[
"Dakovic",
"Milos",
""
],
[
"Bardi",
"Ali Bagheri",
""
],
[
"Brajovic",
"Milos",
""
],
[
"Stankovic",
"Isidora",
""
]
] | Directed acyclic graphs (DAGs) are used for modeling causal relationships, dependencies, and flows in various systems. However, spectral analysis becomes impractical in this setting because the eigen-decomposition of the adjacency matrix yields all eigenvalues equal to zero. This inherent property of DAGs results in an... |
1006.5090 | Vladimir Pestov | Vladimir Pestov | PAC learnability of a concept class under non-atomic measures: a problem
by Vidyasagar | 14 pages, 1 figure, latex 2e with Springer macros | Lect. Notes in Artificial Intelligence 6331, Springer, 2010, pp.
134-147 | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In response to a 1997 problem of M. Vidyasagar, we state a necessary and
sufficient condition for distribution-free PAC learnability of a concept class
$\mathscr C$ under the family of all non-atomic (diffuse) measures on the
domain $\Omega$. Clearly, finiteness of the classical Vapnik-Chervonenkis
dimension of $\mat... | [
{
"created": "Sat, 26 Jun 2010 01:44:57 GMT",
"version": "v1"
}
] | 2010-11-08 | [
[
"Pestov",
"Vladimir",
""
]
] | In response to a 1997 problem of M. Vidyasagar, we state a necessary and sufficient condition for distribution-free PAC learnability of a concept class $\mathscr C$ under the family of all non-atomic (diffuse) measures on the domain $\Omega$. Clearly, finiteness of the classical Vapnik-Chervonenkis dimension of $\maths... |
2305.14625 | Shufan Wang | Shufan Wang, Yixiao Song, Andrew Drozdov, Aparna Garimella, Varun
Manjunatha, Mohit Iyyer | KNN-LM Does Not Improve Open-ended Text Generation | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | In this paper, we study the generation quality of interpolation-based
retrieval-augmented language models (LMs). These methods, best exemplified by
the KNN-LM, interpolate the LM's predicted distribution of the next word with a
distribution formed from the most relevant retrievals for a given prefix. While
the KNN-LM... | [
{
"created": "Wed, 24 May 2023 01:48:33 GMT",
"version": "v1"
}
] | 2023-05-25 | [
[
"Wang",
"Shufan",
""
],
[
"Song",
"Yixiao",
""
],
[
"Drozdov",
"Andrew",
""
],
[
"Garimella",
"Aparna",
""
],
[
"Manjunatha",
"Varun",
""
],
[
"Iyyer",
"Mohit",
""
]
] | In this paper, we study the generation quality of interpolation-based retrieval-augmented language models (LMs). These methods, best exemplified by the KNN-LM, interpolate the LM's predicted distribution of the next word with a distribution formed from the most relevant retrievals for a given prefix. While the KNN-LM a... |
2403.12627 | Andreas Florath | Andreas Florath | Enhancing Formal Theorem Proving: A Comprehensive Dataset for Training
AI Models on Coq Code | 11 pages | null | null | null | cs.AI cs.LO | http://creativecommons.org/licenses/by/4.0/ | In the realm of formal theorem proving, the Coq proof assistant stands out
for its rigorous approach to verifying mathematical assertions and software
correctness. Despite the advances in artificial intelligence and machine
learning, the specialized nature of Coq syntax and semantics poses unique
challenges for Large... | [
{
"created": "Tue, 19 Mar 2024 10:53:40 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Apr 2024 13:54:47 GMT",
"version": "v2"
}
] | 2024-04-03 | [
[
"Florath",
"Andreas",
""
]
] | In the realm of formal theorem proving, the Coq proof assistant stands out for its rigorous approach to verifying mathematical assertions and software correctness. Despite the advances in artificial intelligence and machine learning, the specialized nature of Coq syntax and semantics poses unique challenges for Large L... |
1806.02689 | Lorenzo Sabattini | Lorenzo Sabattini, Valeria Villani, Julia N. Czerniak, Frieder Loch,
Alexander Mertens, Birgit Vogel-Heuser, Cesare Fantuzzi | Methodological Approach for the Evaluation of an Adaptive and Assistive
Human-Machine System | null | Proceedings of the 14th IEEE International Conference on
Automation Science and Engineering (CASE 2018) | 10.1109/COASE.2018.8560574 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increasing complexity of modern industrial automatic and robotic
systems, an increasing burden is put on the operators, who are requested to
supervise and interact with such complex systems, typically under challenging
and stressful conditions. To overcome this issue, it is necessary to adopt a
responsible a... | [
{
"created": "Thu, 7 Jun 2018 14:03:32 GMT",
"version": "v1"
}
] | 2020-03-06 | [
[
"Sabattini",
"Lorenzo",
""
],
[
"Villani",
"Valeria",
""
],
[
"Czerniak",
"Julia N.",
""
],
[
"Loch",
"Frieder",
""
],
[
"Mertens",
"Alexander",
""
],
[
"Vogel-Heuser",
"Birgit",
""
],
[
"Fantuzzi",
"Cesare",
... | With the increasing complexity of modern industrial automatic and robotic systems, an increasing burden is put on the operators, who are requested to supervise and interact with such complex systems, typically under challenging and stressful conditions. To overcome this issue, it is necessary to adopt a responsible app... |
2102.07868 | Idan Achituve | Idan Achituve, Aviv Navon, Yochai Yemini, Gal Chechik, Ethan Fetaya | GP-Tree: A Gaussian Process Classifier for Few-Shot Incremental Learning | null | null | null | null | cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | Gaussian processes (GPs) are non-parametric, flexible, models that work well
in many tasks. Combining GPs with deep learning methods via deep kernel
learning (DKL) is especially compelling due to the strong representational
power induced by the network. However, inference in GPs, whether with or
without DKL, can be c... | [
{
"created": "Mon, 15 Feb 2021 22:16:27 GMT",
"version": "v1"
},
{
"created": "Sun, 6 Jun 2021 20:54:13 GMT",
"version": "v2"
},
{
"created": "Tue, 29 Jun 2021 13:56:45 GMT",
"version": "v3"
},
{
"created": "Tue, 13 Jul 2021 07:27:26 GMT",
"version": "v4"
}
] | 2021-07-14 | [
[
"Achituve",
"Idan",
""
],
[
"Navon",
"Aviv",
""
],
[
"Yemini",
"Yochai",
""
],
[
"Chechik",
"Gal",
""
],
[
"Fetaya",
"Ethan",
""
]
] | Gaussian processes (GPs) are non-parametric, flexible, models that work well in many tasks. Combining GPs with deep learning methods via deep kernel learning (DKL) is especially compelling due to the strong representational power induced by the network. However, inference in GPs, whether with or without DKL, can be com... |
0801.0133 | Alexandr Savinov | Alexandr Savinov | An Approach to Programming Based on Concepts | 49 pages. Related papers: http://conceptoriented.com | Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report RT0005, 2007 | null | Technical Report RT0005 | cs.PL | null | In this paper we describe a new approach to programming which generalizes
object-oriented programming. It is based on using a new programming construct,
called concept, which generalizes classes. Concept is defined as a pair of two
classes: one reference class and one object class. Each concept has a parent
concept w... | [
{
"created": "Sun, 30 Dec 2007 14:43:27 GMT",
"version": "v1"
}
] | 2008-01-03 | [
[
"Savinov",
"Alexandr",
""
]
] | In this paper we describe a new approach to programming which generalizes object-oriented programming. It is based on using a new programming construct, called concept, which generalizes classes. Concept is defined as a pair of two classes: one reference class and one object class. Each concept has a parent concept whi... |
2105.02197 | Olivier Vincent | Olivier Vincent, Charley Gros, Julien Cohen-Adad | Impact of individual rater style on deep learning uncertainty in medical
imaging segmentation | 17 pages, 8 figures, in submission at MELBA journal | null | null | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While multiple studies have explored the relation between inter-rater
variability and deep learning model uncertainty in medical segmentation tasks,
little is known about the impact of individual rater style. This study
quantifies rater style in the form of bias and consistency and explores their
impacts when used to... | [
{
"created": "Wed, 5 May 2021 17:11:18 GMT",
"version": "v1"
}
] | 2021-05-06 | [
[
"Vincent",
"Olivier",
""
],
[
"Gros",
"Charley",
""
],
[
"Cohen-Adad",
"Julien",
""
]
] | While multiple studies have explored the relation between inter-rater variability and deep learning model uncertainty in medical segmentation tasks, little is known about the impact of individual rater style. This study quantifies rater style in the form of bias and consistency and explores their impacts when used to t... |
2404.03121 | Chuang Li | Chuang Li, Shuai Shao, Willian Mikason, Rubing Lin, Yantong Liu | Utilizing Computer Vision for Continuous Monitoring of Vaccine Side
Effects in Experimental Mice | 1 figure | null | null | null | cs.CV q-bio.NC | http://creativecommons.org/licenses/by-sa/4.0/ | The demand for improved efficiency and accuracy in vaccine safety assessments
is increasing. Here, we explore the application of computer vision technologies
to automate the monitoring of experimental mice for potential side effects
after vaccine administration. Traditional observation methods are
labor-intensive and... | [
{
"created": "Wed, 3 Apr 2024 23:59:59 GMT",
"version": "v1"
}
] | 2024-04-05 | [
[
"Li",
"Chuang",
""
],
[
"Shao",
"Shuai",
""
],
[
"Mikason",
"Willian",
""
],
[
"Lin",
"Rubing",
""
],
[
"Liu",
"Yantong",
""
]
] | The demand for improved efficiency and accuracy in vaccine safety assessments is increasing. Here, we explore the application of computer vision technologies to automate the monitoring of experimental mice for potential side effects after vaccine administration. Traditional observation methods are labor-intensive and l... |
1312.2701 | EPTCS | Laura Bocchi (Imperial College, London), Romain Demangeon (Imperial
College, London) | Embedding Session Types in HML | In Proceedings PLACES 2013, arXiv:1312.2218 | EPTCS 137, 2013, pp. 53-62 | 10.4204/EPTCS.137.5 | null | cs.DC cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work on the enhancement of multiparty session types with logical
annotations enable the effective verification of properties on (1) the
structure of the conversations, (2) the sorts of the messages, and (3) the
actual values exchanged. In [3] we extend this work to enable the specification
and verification of ... | [
{
"created": "Tue, 10 Dec 2013 08:03:49 GMT",
"version": "v1"
}
] | 2013-12-11 | [
[
"Bocchi",
"Laura",
"",
"Imperial College, London"
],
[
"Demangeon",
"Romain",
"",
"Imperial\n College, London"
]
] | Recent work on the enhancement of multiparty session types with logical annotations enable the effective verification of properties on (1) the structure of the conversations, (2) the sorts of the messages, and (3) the actual values exchanged. In [3] we extend this work to enable the specification and verification of mu... |
1706.02021 | Anbang Yao | Yiwen Guo, Anbang Yao, Hao Zhao, Yurong Chen | Network Sketching: Exploiting Binary Structure in Deep CNNs | To appear in CVPR2017 | null | null | null | cs.NE cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Convolutional neural networks (CNNs) with deep architectures have
substantially advanced the state-of-the-art in computer vision tasks. However,
deep networks are typically resource-intensive and thus difficult to be
deployed on mobile devices. Recently, CNNs with binary weights have shown
compelling efficiency to th... | [
{
"created": "Wed, 7 Jun 2017 01:53:44 GMT",
"version": "v1"
}
] | 2017-06-08 | [
[
"Guo",
"Yiwen",
""
],
[
"Yao",
"Anbang",
""
],
[
"Zhao",
"Hao",
""
],
[
"Chen",
"Yurong",
""
]
] | Convolutional neural networks (CNNs) with deep architectures have substantially advanced the state-of-the-art in computer vision tasks. However, deep networks are typically resource-intensive and thus difficult to be deployed on mobile devices. Recently, CNNs with binary weights have shown compelling efficiency to the ... |
2210.08465 | Hong Chen | Hong Chen, Rujun Han, Te-Lin Wu, Hideki Nakayama and Nanyun Peng | Character-Centric Story Visualization via Visual Planning and Token
Alignment | accepted by EMNLP2022 | null | null | null | cs.CV cs.CL | http://creativecommons.org/licenses/by/4.0/ | Story visualization advances the traditional text-to-image generation by
enabling multiple image generation based on a complete story. This task
requires machines to 1) understand long text inputs and 2) produce a globally
consistent image sequence that illustrates the contents of the story. A key
challenge of consis... | [
{
"created": "Sun, 16 Oct 2022 06:50:39 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Oct 2022 02:16:34 GMT",
"version": "v2"
},
{
"created": "Thu, 20 Oct 2022 15:53:40 GMT",
"version": "v3"
},
{
"created": "Sat, 22 Oct 2022 07:07:05 GMT",
"version": "v4"
}
] | 2022-10-25 | [
[
"Chen",
"Hong",
""
],
[
"Han",
"Rujun",
""
],
[
"Wu",
"Te-Lin",
""
],
[
"Nakayama",
"Hideki",
""
],
[
"Peng",
"Nanyun",
""
]
] | Story visualization advances the traditional text-to-image generation by enabling multiple image generation based on a complete story. This task requires machines to 1) understand long text inputs and 2) produce a globally consistent image sequence that illustrates the contents of the story. A key challenge of consiste... |
1908.04511 | Ruslan Nikolaev | Ruslan Nikolaev | A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue | null | 33rd International Symposium on Distributed Computing (DISC 2019) | 10.4230/LIPIcs.DISC.2019.28 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new lock-free multiple-producer and multiple-consumer (MPMC)
FIFO queue design which is scalable and, unlike existing high-performant
queues, very memory efficient. Moreover, the design is ABA safe and does not
require any external memory allocators or safe memory reclamation techniques,
typically needed... | [
{
"created": "Tue, 13 Aug 2019 06:34:10 GMT",
"version": "v1"
}
] | 2019-08-14 | [
[
"Nikolaev",
"Ruslan",
""
]
] | We present a new lock-free multiple-producer and multiple-consumer (MPMC) FIFO queue design which is scalable and, unlike existing high-performant queues, very memory efficient. Moreover, the design is ABA safe and does not require any external memory allocators or safe memory reclamation techniques, typically needed b... |
0803.2495 | Gabriel Istrate | Gabriel Istrate, Madhav V. Marathe and S.S.Ravi | Adversarial Scheduling Analysis of Game Theoretic Models of Norm
Diffusion | null | null | null | null | cs.GT cs.DM math.CO math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In (Istrate, Marathe, Ravi SODA 2001) we advocated the investigation of
robustness of results in the theory of learning in games under adversarial
scheduling models. We provide evidence that such an analysis is feasible and
can lead to nontrivial results by investigating, in an adversarial scheduling
setting, Peyton ... | [
{
"created": "Mon, 17 Mar 2008 17:42:28 GMT",
"version": "v1"
}
] | 2008-11-04 | [
[
"Istrate",
"Gabriel",
""
],
[
"Marathe",
"Madhav V.",
""
],
[
"Ravi",
"S. S.",
""
]
] | In (Istrate, Marathe, Ravi SODA 2001) we advocated the investigation of robustness of results in the theory of learning in games under adversarial scheduling models. We provide evidence that such an analysis is feasible and can lead to nontrivial results by investigating, in an adversarial scheduling setting, Peyton Yo... |
1403.2808 | Hafez Fouad Dr | Hafez Fouad | Web-based Database Management to support Telemedicine System | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The transfer of the medical care services to the patient, rather than the
transport of the patient to the medical services providers is aim of the
project. This is achieved by using web-based applications including Modern
Medical Informatics Services which is easier, faster and less expensive. The
required system imp... | [
{
"created": "Wed, 12 Mar 2014 04:43:59 GMT",
"version": "v1"
}
] | 2014-03-13 | [
[
"Fouad",
"Hafez",
""
]
] | The transfer of the medical care services to the patient, rather than the transport of the patient to the medical services providers is aim of the project. This is achieved by using web-based applications including Modern Medical Informatics Services which is easier, faster and less expensive. The required system imple... |
2103.13818 | Ciriaco Andrea D'Angelo | Giovanni Abramo, Ciriaco Andrea D'Angelo, Giovanni Felici | Informed peer review for publication assessments: Are improved impact
measures worth the hassle? | null | Quantitative Science Studies, 1(3), 1321-1333 (2020) | 10.1162/qss_a_00051 | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we ask whether and to what extent applying a predictor of
publications' impact better than early citations, has an effect on the
assessment of research performance of individual scientists. Specifically, we
measure the total impact of Italian professors in the sciences and economics in
a period of time, ... | [
{
"created": "Thu, 25 Mar 2021 13:13:38 GMT",
"version": "v1"
}
] | 2021-03-26 | [
[
"Abramo",
"Giovanni",
""
],
[
"D'Angelo",
"Ciriaco Andrea",
""
],
[
"Felici",
"Giovanni",
""
]
] | In this work we ask whether and to what extent applying a predictor of publications' impact better than early citations, has an effect on the assessment of research performance of individual scientists. Specifically, we measure the total impact of Italian professors in the sciences and economics in a period of time, va... |
1812.03286 | Marco Baldi | Paolo Santini, Marco Baldi, Franco Chiaraluce | Cryptanalysis of a One-Time Code-Based Digital Signature Scheme | 5 pages, 1 figure | null | null | null | cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a one-time digital signature scheme recently proposed by
Persichetti and show that a successful key recovery attack can be mounted with
limited complexity. The attack we propose exploits a single signature
intercepted by the attacker, and relies on a statistical analysis performed
over such a signature, f... | [
{
"created": "Sat, 8 Dec 2018 08:34:31 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Jan 2019 22:10:32 GMT",
"version": "v2"
}
] | 2019-01-25 | [
[
"Santini",
"Paolo",
""
],
[
"Baldi",
"Marco",
""
],
[
"Chiaraluce",
"Franco",
""
]
] | We consider a one-time digital signature scheme recently proposed by Persichetti and show that a successful key recovery attack can be mounted with limited complexity. The attack we propose exploits a single signature intercepted by the attacker, and relies on a statistical analysis performed over such a signature, fol... |
2406.03726 | Xihan Qin | Xihan Qin and Cencheng Shen | Efficient Graph Encoder Embedding for Large Sparse Graphs in Python | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph is a ubiquitous representation of data in various research fields, and
graph embedding is a prevalent machine learning technique for capturing key
features and generating fixed-sized attributes. However, most state-of-the-art
graph embedding methods are computationally and spatially expensive. Recently,
the Gra... | [
{
"created": "Thu, 6 Jun 2024 03:49:34 GMT",
"version": "v1"
}
] | 2024-06-07 | [
[
"Qin",
"Xihan",
""
],
[
"Shen",
"Cencheng",
""
]
] | Graph is a ubiquitous representation of data in various research fields, and graph embedding is a prevalent machine learning technique for capturing key features and generating fixed-sized attributes. However, most state-of-the-art graph embedding methods are computationally and spatially expensive. Recently, the Graph... |
2111.10281 | Canze Zhu | Canze Zhu and Qunying Liao | A new class of MDS symbol-pair codes | There are some mistakes in the Manuscript | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-sa/4.0/ | The symbol-pair code is a new coding framework proposed to guard against
pair-errors in symbol-pair read channels. Especially, a symbol-pair code with
the parameters achieving the Singleton-type bound is called an MDS symbol-pair
code. In this paper, inspiring by the classical construction for Reed-Solomon
codes, for... | [
{
"created": "Fri, 19 Nov 2021 15:43:27 GMT",
"version": "v1"
},
{
"created": "Fri, 27 May 2022 16:59:47 GMT",
"version": "v2"
},
{
"created": "Thu, 25 Aug 2022 01:41:57 GMT",
"version": "v3"
}
] | 2022-08-26 | [
[
"Zhu",
"Canze",
""
],
[
"Liao",
"Qunying",
""
]
] | The symbol-pair code is a new coding framework proposed to guard against pair-errors in symbol-pair read channels. Especially, a symbol-pair code with the parameters achieving the Singleton-type bound is called an MDS symbol-pair code. In this paper, inspiring by the classical construction for Reed-Solomon codes, for a... |
1804.08111 | Andreas Galanis | Antonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel
Stefankovic, Eric Vigoda, Kuan Yang | Sampling in Uniqueness from the Potts and Random-Cluster Models on
Random Regular Graphs | null | null | null | null | cs.DM cs.DS math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of sampling from the Potts model on random regular
graphs. It is conjectured that sampling is possible when the temperature of the
model is in the uniqueness regime of the regular tree, but positive algorithmic
results have been for the most part elusive. In this paper, for all integers
$q\geq... | [
{
"created": "Sun, 22 Apr 2018 13:11:24 GMT",
"version": "v1"
},
{
"created": "Sun, 1 Dec 2019 12:21:58 GMT",
"version": "v2"
}
] | 2019-12-03 | [
[
"Blanca",
"Antonio",
""
],
[
"Galanis",
"Andreas",
""
],
[
"Goldberg",
"Leslie Ann",
""
],
[
"Stefankovic",
"Daniel",
""
],
[
"Vigoda",
"Eric",
""
],
[
"Yang",
"Kuan",
""
]
] | We consider the problem of sampling from the Potts model on random regular graphs. It is conjectured that sampling is possible when the temperature of the model is in the uniqueness regime of the regular tree, but positive algorithmic results have been for the most part elusive. In this paper, for all integers $q\geq 3... |
2405.06460 | Chris Samarinas | Chris Samarinas, Hamed Zamani | ProCIS: A Benchmark for Proactive Retrieval in Conversations | null | null | 10.1145/3626772.3657869 | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | The field of conversational information seeking, which is rapidly gaining
interest in both academia and industry, is changing how we interact with search
engines through natural language interactions. Existing datasets and methods
are mostly evaluating reactive conversational information seeking systems that
solely p... | [
{
"created": "Fri, 10 May 2024 13:11:07 GMT",
"version": "v1"
}
] | 2024-05-13 | [
[
"Samarinas",
"Chris",
""
],
[
"Zamani",
"Hamed",
""
]
] | The field of conversational information seeking, which is rapidly gaining interest in both academia and industry, is changing how we interact with search engines through natural language interactions. Existing datasets and methods are mostly evaluating reactive conversational information seeking systems that solely pro... |
2310.18600 | Debtanu Datta | Debtanu Datta, Shubham Soni, Rajdeep Mukherjee, Saptarshi Ghosh | MILDSum: A Novel Benchmark Dataset for Multilingual Summarization of
Indian Legal Case Judgments | Accepted at EMNLP 2023 (Main Conference) | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic summarization of legal case judgments is a practically important
problem that has attracted substantial research efforts in many countries. In
the context of the Indian judiciary, there is an additional complexity --
Indian legal case judgments are mostly written in complex English, but a
significant portio... | [
{
"created": "Sat, 28 Oct 2023 05:51:57 GMT",
"version": "v1"
}
] | 2023-10-31 | [
[
"Datta",
"Debtanu",
""
],
[
"Soni",
"Shubham",
""
],
[
"Mukherjee",
"Rajdeep",
""
],
[
"Ghosh",
"Saptarshi",
""
]
] | Automatic summarization of legal case judgments is a practically important problem that has attracted substantial research efforts in many countries. In the context of the Indian judiciary, there is an additional complexity -- Indian legal case judgments are mostly written in complex English, but a significant portion ... |
2403.07432 | Hanyu Zhou | Hanyu Zhou, Yi Chang, Zhiwei Shi, Luxin Yan | Bring Event into RGB and LiDAR: Hierarchical Visual-Motion Fusion for
Scene Flow | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Single RGB or LiDAR is the mainstream sensor for the challenging scene flow,
which relies heavily on visual features to match motion features. Compared with
single modality, existing methods adopt a fusion strategy to directly fuse the
cross-modal complementary knowledge in motion space. However, these direct
fusion ... | [
{
"created": "Tue, 12 Mar 2024 09:15:19 GMT",
"version": "v1"
}
] | 2024-03-13 | [
[
"Zhou",
"Hanyu",
""
],
[
"Chang",
"Yi",
""
],
[
"Shi",
"Zhiwei",
""
],
[
"Yan",
"Luxin",
""
]
] | Single RGB or LiDAR is the mainstream sensor for the challenging scene flow, which relies heavily on visual features to match motion features. Compared with single modality, existing methods adopt a fusion strategy to directly fuse the cross-modal complementary knowledge in motion space. However, these direct fusion me... |
1902.07111 | Xiaoixa Wu | Xiaoxia Wu, Simon S. Du and Rachel Ward | Global Convergence of Adaptive Gradient Methods for An
Over-parameterized Neural Network | null | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adaptive gradient methods like AdaGrad are widely used in optimizing neural
networks. Yet, existing convergence guarantees for adaptive gradient methods
require either convexity or smoothness, and, in the smooth setting, only
guarantee convergence to a stationary point. We propose an adaptive gradient
method and show... | [
{
"created": "Tue, 19 Feb 2019 16:08:55 GMT",
"version": "v1"
},
{
"created": "Sat, 19 Oct 2019 19:07:24 GMT",
"version": "v2"
}
] | 2019-10-22 | [
[
"Wu",
"Xiaoxia",
""
],
[
"Du",
"Simon S.",
""
],
[
"Ward",
"Rachel",
""
]
] | Adaptive gradient methods like AdaGrad are widely used in optimizing neural networks. Yet, existing convergence guarantees for adaptive gradient methods require either convexity or smoothness, and, in the smooth setting, only guarantee convergence to a stationary point. We propose an adaptive gradient method and show t... |
2002.04778 | Binhai Zhu | Manuel Lafond and Binhai Zhu and Peng Zou | Genomic Problems Involving Copy Number Profiles: Complexity and
Algorithms | 16 pages, 3 figures | null | null | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, due to the genomic sequence analysis in several types of cancer,
the genomic data based on {\em copy number profiles} ({\em CNP} for short) are
getting more and more popular. A CNP is a vector where each component is a
non-negative integer representing the number of copies of a specific gene or
segment of i... | [
{
"created": "Wed, 12 Feb 2020 03:31:42 GMT",
"version": "v1"
}
] | 2020-02-13 | [
[
"Lafond",
"Manuel",
""
],
[
"Zhu",
"Binhai",
""
],
[
"Zou",
"Peng",
""
]
] | Recently, due to the genomic sequence analysis in several types of cancer, the genomic data based on {\em copy number profiles} ({\em CNP} for short) are getting more and more popular. A CNP is a vector where each component is a non-negative integer representing the number of copies of a specific gene or segment of int... |
2201.07927 | Jiawei Qin | Jiawei Qin, Takuru Shimoyama, Yusuke Sugano | Learning-by-Novel-View-Synthesis for Full-Face Appearance-Based 3D Gaze
Estimation | Camera-ready version for CVPR 2022 Workshop (GAZE 2022) | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Despite recent advances in appearance-based gaze estimation techniques, the
need for training data that covers the target head pose and gaze distribution
remains a crucial challenge for practical deployment. This work examines a
novel approach for synthesizing gaze estimation training data based on
monocular 3D face ... | [
{
"created": "Thu, 20 Jan 2022 00:29:45 GMT",
"version": "v1"
},
{
"created": "Sun, 23 Jan 2022 06:54:22 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Apr 2022 08:11:57 GMT",
"version": "v3"
}
] | 2022-04-28 | [
[
"Qin",
"Jiawei",
""
],
[
"Shimoyama",
"Takuru",
""
],
[
"Sugano",
"Yusuke",
""
]
] | Despite recent advances in appearance-based gaze estimation techniques, the need for training data that covers the target head pose and gaze distribution remains a crucial challenge for practical deployment. This work examines a novel approach for synthesizing gaze estimation training data based on monocular 3D face re... |
1104.4518 | Aydin Buluc | Aydin Buluc, Kamesh Madduri | Parallel Breadth-First Search on Distributed Memory Systems | null | Proceedings of The International Conference for High Performance
Computing, Networking, Storage, and Analysis (SC 2011) | null | null | cs.DC cs.MS cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data-intensive, graph-based computations are pervasive in several scientific
applications, and are known to to be quite challenging to implement on
distributed memory systems. In this work, we explore the design space of
parallel algorithms for Breadth-First Search (BFS), a key subroutine in several
graph algorithms.... | [
{
"created": "Fri, 22 Apr 2011 23:42:40 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Oct 2011 03:36:03 GMT",
"version": "v2"
}
] | 2011-10-17 | [
[
"Buluc",
"Aydin",
""
],
[
"Madduri",
"Kamesh",
""
]
] | Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. W... |
2309.17361 | Edouard Yvinec | Edouard Yvinec, Arnaud Dapogny, Kevin Bailly | Network Memory Footprint Compression Through Jointly Learnable Codebooks
and Mappings | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The massive interest in deep neural networks (DNNs) for both computer vision
and natural language processing has been sparked by the growth in computational
power. However, this led to an increase in the memory footprint, to a point
where it can be challenging to simply load a model on commodity devices such as
mobil... | [
{
"created": "Fri, 29 Sep 2023 16:04:55 GMT",
"version": "v1"
}
] | 2023-10-02 | [
[
"Yvinec",
"Edouard",
""
],
[
"Dapogny",
"Arnaud",
""
],
[
"Bailly",
"Kevin",
""
]
] | The massive interest in deep neural networks (DNNs) for both computer vision and natural language processing has been sparked by the growth in computational power. However, this led to an increase in the memory footprint, to a point where it can be challenging to simply load a model on commodity devices such as mobile ... |
2008.01188 | Quentin Cohen-Solal | Quentin Cohen-Solal | Learning to Play Two-Player Perfect-Information Games without Knowledge | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, several techniques for learning game state evaluation
functions by reinforcement are proposed. The first is a generalization of tree
bootstrapping (tree learning): it is adapted to the context of reinforcement
learning without knowledge based on non-linear functions. With this technique,
no information... | [
{
"created": "Mon, 3 Aug 2020 21:01:22 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Dec 2020 17:50:39 GMT",
"version": "v2"
},
{
"created": "Tue, 12 Oct 2021 17:37:35 GMT",
"version": "v3"
}
] | 2021-10-13 | [
[
"Cohen-Solal",
"Quentin",
""
]
] | In this paper, several techniques for learning game state evaluation functions by reinforcement are proposed. The first is a generalization of tree bootstrapping (tree learning): it is adapted to the context of reinforcement learning without knowledge based on non-linear functions. With this technique, no information i... |
2005.12142 | Kuan-Yu Chen | Chia-Chih Kuo, Shang-Bao Luo, Kuan-Yu Chen | An Audio-enriched BERT-based Framework for Spoken Multiple-choice
Question Answering | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a spoken multiple-choice question answering (SMCQA) task, given a passage,
a question, and multiple choices all in the form of speech, the machine needs
to pick the correct choice to answer the question. While the audio could
contain useful cues for SMCQA, usually only the auto-transcribed text is
utilized in syst... | [
{
"created": "Mon, 25 May 2020 14:41:28 GMT",
"version": "v1"
}
] | 2020-05-26 | [
[
"Kuo",
"Chia-Chih",
""
],
[
"Luo",
"Shang-Bao",
""
],
[
"Chen",
"Kuan-Yu",
""
]
] | In a spoken multiple-choice question answering (SMCQA) task, given a passage, a question, and multiple choices all in the form of speech, the machine needs to pick the correct choice to answer the question. While the audio could contain useful cues for SMCQA, usually only the auto-transcribed text is utilized in system... |
2307.13908 | Chaohui Yu | Chaohui Yu, Qiang Zhou, Jingliang Li, Zhe Zhang, Zhibin Wang, Fan Wang | Points-to-3D: Bridging the Gap between Sparse Points and
Shape-Controllable Text-to-3D Generation | Accepted by ACMMM 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Text-to-3D generation has recently garnered significant attention, fueled by
2D diffusion models trained on billions of image-text pairs. Existing methods
primarily rely on score distillation to leverage the 2D diffusion priors to
supervise the generation of 3D models, e.g., NeRF. However, score distillation
is prone... | [
{
"created": "Wed, 26 Jul 2023 02:16:55 GMT",
"version": "v1"
}
] | 2023-07-27 | [
[
"Yu",
"Chaohui",
""
],
[
"Zhou",
"Qiang",
""
],
[
"Li",
"Jingliang",
""
],
[
"Zhang",
"Zhe",
""
],
[
"Wang",
"Zhibin",
""
],
[
"Wang",
"Fan",
""
]
] | Text-to-3D generation has recently garnered significant attention, fueled by 2D diffusion models trained on billions of image-text pairs. Existing methods primarily rely on score distillation to leverage the 2D diffusion priors to supervise the generation of 3D models, e.g., NeRF. However, score distillation is prone t... |
1412.6621 | Arnab Paul | Arnab Paul, Suresh Venkatasubramanian | Why does Deep Learning work? - A perspective from Group Theory | 13 pages, 5 figures | null | null | null | cs.LG cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Why does Deep Learning work? What representations does it capture? How do
higher-order representations emerge? We study these questions from the
perspective of group theory, thereby opening a new approach towards a theory of
Deep learning.
One factor behind the recent resurgence of the subject is a key algorithmic
... | [
{
"created": "Sat, 20 Dec 2014 07:28:46 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Dec 2014 02:22:01 GMT",
"version": "v2"
},
{
"created": "Sat, 28 Feb 2015 07:19:35 GMT",
"version": "v3"
}
] | 2015-03-03 | [
[
"Paul",
"Arnab",
""
],
[
"Venkatasubramanian",
"Suresh",
""
]
] | Why does Deep Learning work? What representations does it capture? How do higher-order representations emerge? We study these questions from the perspective of group theory, thereby opening a new approach towards a theory of Deep learning. One factor behind the recent resurgence of the subject is a key algorithmic step... |
2304.05860 | Wei Peng | Weixuan Wang, Wei Peng and Qun Liu | Learning Homographic Disambiguation Representation for Neural Machine
Translation | null | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Homographs, words with the same spelling but different meanings, remain
challenging in Neural Machine Translation (NMT). While recent works leverage
various word embedding approaches to differentiate word sense in NMT, they do
not focus on the pivotal components in resolving ambiguities of homographs in
NMT: the hidd... | [
{
"created": "Wed, 12 Apr 2023 13:42:59 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Apr 2023 00:31:20 GMT",
"version": "v2"
}
] | 2023-04-14 | [
[
"Wang",
"Weixuan",
""
],
[
"Peng",
"Wei",
""
],
[
"Liu",
"Qun",
""
]
] | Homographs, words with the same spelling but different meanings, remain challenging in Neural Machine Translation (NMT). While recent works leverage various word embedding approaches to differentiate word sense in NMT, they do not focus on the pivotal components in resolving ambiguities of homographs in NMT: the hidden... |
2311.12947 | Ren Wang | Ren Wang, Ming Zhong, Kaidi Xu, Lola Gir\'aldez S\'anchez-Cort\'es,
Ignacio de Cominges Guerra | PINNs-Based Uncertainty Quantification for Transient Stability Analysis | null | null | null | null | cs.AI cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the challenge of transient stability in power systems
with missing parameters and uncertainty propagation in swing equations. We
introduce a novel application of Physics-Informed Neural Networks (PINNs),
specifically an Ensemble of PINNs (E-PINNs), to estimate critical parameters
like rotor angle... | [
{
"created": "Tue, 21 Nov 2023 19:21:49 GMT",
"version": "v1"
}
] | 2023-11-23 | [
[
"Wang",
"Ren",
""
],
[
"Zhong",
"Ming",
""
],
[
"Xu",
"Kaidi",
""
],
[
"Sánchez-Cortés",
"Lola Giráldez",
""
],
[
"Guerra",
"Ignacio de Cominges",
""
]
] | This paper addresses the challenge of transient stability in power systems with missing parameters and uncertainty propagation in swing equations. We introduce a novel application of Physics-Informed Neural Networks (PINNs), specifically an Ensemble of PINNs (E-PINNs), to estimate critical parameters like rotor angle a... |
1702.07178 | Zhenyu Li | Zhenyu Li and Adrian G. Bors | Steganalysis of 3D Objects Using Statistics of Local Feature Sets | null | null | 10.1016/j.ins.2017.06.011 | null | cs.CR cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 3D steganalysis aims to identify subtle invisible changes produced in
graphical objects through digital watermarking or steganography. Sets of
statistical representations of 3D features, extracted from both cover and stego
3D mesh objects, are used as inputs into machine learning classifiers in order
to decide whethe... | [
{
"created": "Thu, 23 Feb 2017 11:24:03 GMT",
"version": "v1"
}
] | 2017-06-21 | [
[
"Li",
"Zhenyu",
""
],
[
"Bors",
"Adrian G.",
""
]
] | 3D steganalysis aims to identify subtle invisible changes produced in graphical objects through digital watermarking or steganography. Sets of statistical representations of 3D features, extracted from both cover and stego 3D mesh objects, are used as inputs into machine learning classifiers in order to decide whether ... |
2005.06046 | Neeldhara Misra | Neeldhara Misra, Harshil Mittal, Aditi Sethia | Red-Blue Point Separation for Points on a Circle | null | null | null | null | cs.DS cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a set R of red points and a set B of blue points in the plane, the
Red-Blue point separation problem asks if there are at most k lines that
separate R from B, that is, each cell induced by the lines of the solution is
either empty or monochromatic (containing points of only one color). A common
variant of the p... | [
{
"created": "Tue, 12 May 2020 20:54:54 GMT",
"version": "v1"
}
] | 2020-05-14 | [
[
"Misra",
"Neeldhara",
""
],
[
"Mittal",
"Harshil",
""
],
[
"Sethia",
"Aditi",
""
]
] | Given a set R of red points and a set B of blue points in the plane, the Red-Blue point separation problem asks if there are at most k lines that separate R from B, that is, each cell induced by the lines of the solution is either empty or monochromatic (containing points of only one color). A common variant of the pro... |
2406.17961 | Md Mahadi Hasan Nahid | Md Mahadi Hasan Nahid, Davood Rafiei | NormTab: Improving Symbolic Reasoning in LLMs Through Tabular Data
Normalization | Work in Progress | null | null | null | cs.CL cs.AI cs.DB cs.IR | http://creativecommons.org/licenses/by/4.0/ | In recent years, Large Language Models (LLMs) have demonstrated remarkable
capabilities in parsing textual data and generating code. However, their
performance in tasks involving tabular data, especially those requiring
symbolic reasoning, faces challenges due to the structural variance and
inconsistency in table cel... | [
{
"created": "Tue, 25 Jun 2024 22:40:03 GMT",
"version": "v1"
}
] | 2024-06-27 | [
[
"Nahid",
"Md Mahadi Hasan",
""
],
[
"Rafiei",
"Davood",
""
]
] | In recent years, Large Language Models (LLMs) have demonstrated remarkable capabilities in parsing textual data and generating code. However, their performance in tasks involving tabular data, especially those requiring symbolic reasoning, faces challenges due to the structural variance and inconsistency in table cell ... |
1806.02081 | Rita Ibrahim | Rita Ibrahim, Mohamad Assaad, Berna Sayrac, Azeddine Gati | Distributed vs. Centralized Scheduling in D2D-enabled Cellular Networks | Submitted to IEEE Transactions on Mobile Computing | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Employing channel adaptive resource allocation can yield to a large
enhancement in almost any performance metric of Device-to-Device (D2D)
communications. We observe that D2D users are able to estimate their local
Channel State Information (CSI), however the base station needs some signaling
exchange to acquire this ... | [
{
"created": "Wed, 6 Jun 2018 09:26:22 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Jun 2018 09:42:59 GMT",
"version": "v2"
},
{
"created": "Fri, 15 Jun 2018 09:06:08 GMT",
"version": "v3"
},
{
"created": "Wed, 20 Feb 2019 13:56:57 GMT",
"version": "v4"
},
{
"cr... | 2019-02-26 | [
[
"Ibrahim",
"Rita",
""
],
[
"Assaad",
"Mohamad",
""
],
[
"Sayrac",
"Berna",
""
],
[
"Gati",
"Azeddine",
""
]
] | Employing channel adaptive resource allocation can yield to a large enhancement in almost any performance metric of Device-to-Device (D2D) communications. We observe that D2D users are able to estimate their local Channel State Information (CSI), however the base station needs some signaling exchange to acquire this in... |
2309.08988 | Diego Navarro-Cabrera | Diego Navarro-Cabrera, Niceto R. Luque and Eduardo Ros | Multi-objective tuning for torque PD controllers of cobots | Accepted for presentation at the CPS workshop 2023 | null | null | null | cs.RO | http://creativecommons.org/licenses/by-sa/4.0/ | Collaborative robotics is a new and challenging field in the realm of motion
control and human-robot interaction. The safety measures needed for a reliable
interaction between the robot and its environment hinder the use of classical
control methods, pushing researchers to try new techniques such as machine
learning ... | [
{
"created": "Sat, 16 Sep 2023 13:06:36 GMT",
"version": "v1"
}
] | 2023-09-19 | [
[
"Navarro-Cabrera",
"Diego",
""
],
[
"Luque",
"Niceto R.",
""
],
[
"Ros",
"Eduardo",
""
]
] | Collaborative robotics is a new and challenging field in the realm of motion control and human-robot interaction. The safety measures needed for a reliable interaction between the robot and its environment hinder the use of classical control methods, pushing researchers to try new techniques such as machine learning (M... |
2206.05840 | Sairamvinay Vijayaraghavan | Sairamvinay Vijayaraghavan, Terry Guan, Jason (Jinxiao) Song | GAN based Data Augmentation to Resolve Class Imbalance | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | The number of credit card fraud has been growing as technology grows and
people can take advantage of it. Therefore, it is very important to implement a
robust and effective method to detect such frauds. The machine learning
algorithms are appropriate for these tasks since they try to maximize the
accuracy of predict... | [
{
"created": "Sun, 12 Jun 2022 21:21:55 GMT",
"version": "v1"
}
] | 2022-06-14 | [
[
"Vijayaraghavan",
"Sairamvinay",
"",
"Jinxiao"
],
[
"Guan",
"Terry",
"",
"Jinxiao"
],
[
"Jason",
"",
"",
"Jinxiao"
],
[
"Song",
"",
""
]
] | The number of credit card fraud has been growing as technology grows and people can take advantage of it. Therefore, it is very important to implement a robust and effective method to detect such frauds. The machine learning algorithms are appropriate for these tasks since they try to maximize the accuracy of predictio... |
1507.02890 | Bedon Nicolas | Bedon Nicolas (University of Rouen) | Logic and Branching Automata | null | Logical Methods in Computer Science, Volume 11, Issue 4 (October
15, 2015) lmcs:1603 | 10.2168/LMCS-11(4:2)2015 | null | cs.FL cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we study the logical aspects of branching automata, as defined
by Lodaya and Weil. We first prove that the class of languages of finite N-free
posets recognized by branching automata is closed under complementation. Then
we define a logic, named P-MSO as it is a extension of monadic second-order
logic w... | [
{
"created": "Fri, 10 Jul 2015 13:25:10 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Oct 2015 10:48:03 GMT",
"version": "v2"
}
] | 2017-01-11 | [
[
"Nicolas",
"Bedon",
"",
"University of Rouen"
]
] | In this paper we study the logical aspects of branching automata, as defined by Lodaya and Weil. We first prove that the class of languages of finite N-free posets recognized by branching automata is closed under complementation. Then we define a logic, named P-MSO as it is a extension of monadic second-order logic wit... |
2101.02029 | Mohammad Tabrez Quasim | Mohammad Meraj, Surendra Pal Singh, Prashant Johri, Mohammad Tabrez
Quasim | Detection and Prediction of Infectious Diseases Using IoT Sensors: A
Review | 7 pages, 2figures | null | null | null | cs.CY cs.NI | http://creativecommons.org/licenses/by/4.0/ | An infectious kind of disease affects a huge number of human beings. A lot of
investigation being conducted throughout the world. There are many interactive
hardware platform packages like IoT in healthcare including smart tracking,
smart sensors, and clinical device integration available in the market.
Emerging tech... | [
{
"created": "Sat, 2 Jan 2021 15:59:00 GMT",
"version": "v1"
}
] | 2021-01-07 | [
[
"Meraj",
"Mohammad",
""
],
[
"Singh",
"Surendra Pal",
""
],
[
"Johri",
"Prashant",
""
],
[
"Quasim",
"Mohammad Tabrez",
""
]
] | An infectious kind of disease affects a huge number of human beings. A lot of investigation being conducted throughout the world. There are many interactive hardware platform packages like IoT in healthcare including smart tracking, smart sensors, and clinical device integration available in the market. Emerging techno... |
1905.11326 | Alessandro Neri | Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann | Invariants and Inequivalence of Linear Rank-Metric Codes | 5 pages; accepted at IEEE International Symposium on Information
Theory 2019 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the sequence of dimensions of the linear spaces, generated by a
given rank-metric code together with itself under several applications of a
field automorphism, is an invariant for the whole equivalence class of the
code. These invariants give rise to an easily computable criterion to check if
two codes a... | [
{
"created": "Mon, 27 May 2019 16:24:16 GMT",
"version": "v1"
}
] | 2019-05-28 | [
[
"Neri",
"Alessandro",
""
],
[
"Puchinger",
"Sven",
""
],
[
"Horlemann-Trautmann",
"Anna-Lena",
""
]
] | We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These invariants give rise to an easily computable criterion to check if two codes are... |
1611.10024 | Daniel M\'endez Fern\'andez | D. M\'endez Fern\'andez, B. Penzenstadler | Artefact-based Requirements Engineering: The AMDiRE Approach | null | Requirements Engineering Journal, 2014 | 10.1007/s00766-014-0206-y | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The various influences in the processes and application domains make
Requirements Engineering (RE) inherently complex and difficult to implement. In
general, we have two options for establishing an RE approach: we can either
establish an activity-based RE approach or we can establish an artefact-based
one where proje... | [
{
"created": "Wed, 30 Nov 2016 07:03:37 GMT",
"version": "v1"
}
] | 2016-12-01 | [
[
"Fernández",
"D. Méndez",
""
],
[
"Penzenstadler",
"B.",
""
]
] | The various influences in the processes and application domains make Requirements Engineering (RE) inherently complex and difficult to implement. In general, we have two options for establishing an RE approach: we can either establish an activity-based RE approach or we can establish an artefact-based one where project... |
1612.03339 | Juli\'an Mestre | Maurice Cheung and Juli\'an Mestre and David B. Shmoys and Jos\'e
Verschae | A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine
Scheduling Problems | 26 pages. A preliminary version appeared in APPROX 2011. arXiv admin
note: text overlap with arXiv:1403.0298 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the following single-machine scheduling problem, which is often
denoted $1||\sum f_{j}$: we are given $n$ jobs to be scheduled on a single
machine, where each job $j$ has an integral processing time $p_j$, and there is
a nondecreasing, nonnegative cost function $f_j(C_{j})$ that specifies the cost
of fini... | [
{
"created": "Sat, 10 Dec 2016 20:36:09 GMT",
"version": "v1"
}
] | 2016-12-13 | [
[
"Cheung",
"Maurice",
""
],
[
"Mestre",
"Julián",
""
],
[
"Shmoys",
"David B.",
""
],
[
"Verschae",
"José",
""
]
] | We consider the following single-machine scheduling problem, which is often denoted $1||\sum f_{j}$: we are given $n$ jobs to be scheduled on a single machine, where each job $j$ has an integral processing time $p_j$, and there is a nondecreasing, nonnegative cost function $f_j(C_{j})$ that specifies the cost of finish... |
2208.01014 | Jiahui Fu | Jiahui Fu, Yilun Du, Kurran Singh, Joshua B. Tenenbaum, and John J.
Leonard | Robust Change Detection Based on Neural Descriptor Fields | 8 pages, 8 figures, and 2 tables. Accepted to IROS 2022. Project
webpage: https://yilundu.github.io/ndf_change | null | null | null | cs.RO cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | The ability to reason about changes in the environment is crucial for robots
operating over extended periods of time. Agents are expected to capture changes
during operation so that actions can be followed to ensure a smooth progression
of the working session. However, varying viewing angles and accumulated
localizat... | [
{
"created": "Mon, 1 Aug 2022 17:45:36 GMT",
"version": "v1"
}
] | 2022-08-02 | [
[
"Fu",
"Jiahui",
""
],
[
"Du",
"Yilun",
""
],
[
"Singh",
"Kurran",
""
],
[
"Tenenbaum",
"Joshua B.",
""
],
[
"Leonard",
"John J.",
""
]
] | The ability to reason about changes in the environment is crucial for robots operating over extended periods of time. Agents are expected to capture changes during operation so that actions can be followed to ensure a smooth progression of the working session. However, varying viewing angles and accumulated localizatio... |
2005.08926 | Patrick Kidger | Patrick Kidger, James Morrill, James Foster, Terry Lyons | Neural Controlled Differential Equations for Irregular Time Series | Accepted at NeurIPS 2020 (Spotlight) | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural ordinary differential equations are an attractive option for modelling
temporal dynamics. However, a fundamental issue is that the solution to an
ordinary differential equation is determined by its initial condition, and
there is no mechanism for adjusting the trajectory based on subsequent
observations. Here,... | [
{
"created": "Mon, 18 May 2020 17:52:21 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Nov 2020 17:45:39 GMT",
"version": "v2"
}
] | 2020-11-06 | [
[
"Kidger",
"Patrick",
""
],
[
"Morrill",
"James",
""
],
[
"Foster",
"James",
""
],
[
"Lyons",
"Terry",
""
]
] | Neural ordinary differential equations are an attractive option for modelling temporal dynamics. However, a fundamental issue is that the solution to an ordinary differential equation is determined by its initial condition, and there is no mechanism for adjusting the trajectory based on subsequent observations. Here, w... |
1805.09785 | Marylou Gabri\'e | Marylou Gabri\'e, Andre Manoel, Cl\'ement Luneau, Jean Barbier,
Nicolas Macris, Florent Krzakala, Lenka Zdeborov\'a | Entropy and mutual information in models of deep neural networks | null | J. Stat. Mech. (2019) 124014. & NeurIPS 2018 | 10.1088/1742-5468/ab3430 | null | cs.LG cond-mat.dis-nn cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We examine a class of deep learning models with a tractable method to compute
information-theoretic quantities. Our contributions are three-fold: (i) We show
how entropies and mutual informations can be derived from heuristic statistical
physics methods, under the assumption that weight matrices are independent and
o... | [
{
"created": "Thu, 24 May 2018 17:07:45 GMT",
"version": "v1"
},
{
"created": "Mon, 29 Oct 2018 19:42:49 GMT",
"version": "v2"
}
] | 2020-01-22 | [
[
"Gabrié",
"Marylou",
""
],
[
"Manoel",
"Andre",
""
],
[
"Luneau",
"Clément",
""
],
[
"Barbier",
"Jean",
""
],
[
"Macris",
"Nicolas",
""
],
[
"Krzakala",
"Florent",
""
],
[
"Zdeborová",
"Lenka",
""
]
] | We examine a class of deep learning models with a tractable method to compute information-theoretic quantities. Our contributions are three-fold: (i) We show how entropies and mutual informations can be derived from heuristic statistical physics methods, under the assumption that weight matrices are independent and ort... |
1308.2260 | Peter Gloor | Petteri Raety, Benjamin Behm, Kim-Karol Dikert, Maria Paasivaara,
Casper Lassenius, Daniela Damian | Communication Practices in a Distributed Scrum Project | Presented at COINs13 Conference, Chile, 2013 (arxiv:1308.1028) | null | null | coins13/2013/13 | cs.SE cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While global software development (GSD) projects face cultural and time
differences, the biggest challenge is communication. We studied a distributed
student project with an industrial customer. The project lasted 3 months,
involved 25 participants, and was distributed between the University of
Victoria, Canada and A... | [
{
"created": "Fri, 9 Aug 2013 23:24:47 GMT",
"version": "v1"
}
] | 2013-08-13 | [
[
"Raety",
"Petteri",
""
],
[
"Behm",
"Benjamin",
""
],
[
"Dikert",
"Kim-Karol",
""
],
[
"Paasivaara",
"Maria",
""
],
[
"Lassenius",
"Casper",
""
],
[
"Damian",
"Daniela",
""
]
] | While global software development (GSD) projects face cultural and time differences, the biggest challenge is communication. We studied a distributed student project with an industrial customer. The project lasted 3 months, involved 25 participants, and was distributed between the University of Victoria, Canada and Aal... |
1108.4705 | Michael Bannister | Michael J. Bannister, David Eppstein, Joseph A. Simons | Inapproximability of Orthogonal Compaction | Updated to the final version to appear in the Journal of Graph
Algorithms and Applications | J. Graph Algorithms & Applications 16(3): 651-673, 2012 | 10.7155/jgaa.00263 | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that several problems of compacting orthogonal graph drawings to use
the minimum number of rows, area, length of longest edge or total edge length
cannot be approximated better than within a polynomial factor of optimal in
polynomial time unless P = NP. We also provide a fixed-parameter-tractable
algorithm fo... | [
{
"created": "Tue, 23 Aug 2011 21:37:28 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Nov 2011 02:36:32 GMT",
"version": "v2"
},
{
"created": "Mon, 27 Feb 2012 03:47:56 GMT",
"version": "v3"
}
] | 2015-07-16 | [
[
"Bannister",
"Michael J.",
""
],
[
"Eppstein",
"David",
""
],
[
"Simons",
"Joseph A.",
""
]
] | We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in polynomial time unless P = NP. We also provide a fixed-parameter-tractable algorithm for ... |
2305.18486 | Md Tahmid Rahman Laskar | Md Tahmid Rahman Laskar, M Saiful Bari, Mizanur Rahman, Md Amran
Hossen Bhuiyan, Shafiq Joty, Jimmy Xiangji Huang | A Systematic Study and Comprehensive Evaluation of ChatGPT on Benchmark
Datasets | Accepted by ACL 2023 Findings. The first three authors contributed
equally | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | The development of large language models (LLMs) such as ChatGPT has brought a
lot of attention recently. However, their evaluation in the benchmark academic
datasets remains under-explored due to the difficulty of evaluating the
generative outputs produced by this model against the ground truth. In this
paper, we aim... | [
{
"created": "Mon, 29 May 2023 12:37:21 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Jun 2023 16:21:40 GMT",
"version": "v2"
},
{
"created": "Thu, 8 Jun 2023 03:27:16 GMT",
"version": "v3"
},
{
"created": "Wed, 5 Jul 2023 16:19:38 GMT",
"version": "v4"
}
] | 2023-07-07 | [
[
"Laskar",
"Md Tahmid Rahman",
""
],
[
"Bari",
"M Saiful",
""
],
[
"Rahman",
"Mizanur",
""
],
[
"Bhuiyan",
"Md Amran Hossen",
""
],
[
"Joty",
"Shafiq",
""
],
[
"Huang",
"Jimmy Xiangji",
""
]
] | The development of large language models (LLMs) such as ChatGPT has brought a lot of attention recently. However, their evaluation in the benchmark academic datasets remains under-explored due to the difficulty of evaluating the generative outputs produced by this model against the ground truth. In this paper, we aim t... |
2211.02139 | Faisal Hamman | Faisal Hamman, Jiahao Chen, Sanghamitra Dutta | Can Querying for Bias Leak Protected Attributes? Achieving Privacy With
Smooth Sensitivity | Published in 2023 ACM Conference on Fairness, Accountability, and
Transparency (FAccT2023) | null | 10.1145/3593013.3594086 | null | cs.LG cs.AI cs.CR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing regulations prohibit model developers from accessing protected
attributes (gender, race, etc.), often resulting in fairness assessments on
populations without knowing their protected groups. In such scenarios,
institutions often adopt a separation between the model developers (who train
models with no access... | [
{
"created": "Thu, 3 Nov 2022 20:44:48 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Jun 2023 20:55:12 GMT",
"version": "v2"
}
] | 2023-06-07 | [
[
"Hamman",
"Faisal",
""
],
[
"Chen",
"Jiahao",
""
],
[
"Dutta",
"Sanghamitra",
""
]
] | Existing regulations prohibit model developers from accessing protected attributes (gender, race, etc.), often resulting in fairness assessments on populations without knowing their protected groups. In such scenarios, institutions often adopt a separation between the model developers (who train models with no access t... |
2203.10652 | Yanzhe Zhang | Yanzhe Zhang, Xuezhi Wang and Diyi Yang | Continual Sequence Generation with Adaptive Compositional Modules | 15 pages, ACL 2022 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Continual learning is essential for real-world deployment when there is a
need to quickly adapt the model to new tasks without forgetting knowledge of
old tasks. Existing work on continual sequence generation either always reuses
existing parameters to learn new tasks, which is vulnerable to catastrophic
forgetting o... | [
{
"created": "Sun, 20 Mar 2022 21:22:48 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Apr 2022 00:54:35 GMT",
"version": "v2"
}
] | 2022-04-06 | [
[
"Zhang",
"Yanzhe",
""
],
[
"Wang",
"Xuezhi",
""
],
[
"Yang",
"Diyi",
""
]
] | Continual learning is essential for real-world deployment when there is a need to quickly adapt the model to new tasks without forgetting knowledge of old tasks. Existing work on continual sequence generation either always reuses existing parameters to learn new tasks, which is vulnerable to catastrophic forgetting on ... |
2407.17816 | Junran Wu | Yue Hou, Xueyuan Chen, He Zhu, Romei Liu, Bowen Shi, Jiaheng Liu,
Junran Wu, Ke Xu | NC-NCD: Novel Class Discovery for Node Classification | Accepted by CIKM'24 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Novel Class Discovery (NCD) involves identifying new categories within
unlabeled data by utilizing knowledge acquired from previously established
categories. However, existing NCD methods often struggle to maintain a balance
between the performance of old and new categories. Discovering unlabeled new
categories in a ... | [
{
"created": "Thu, 25 Jul 2024 07:10:08 GMT",
"version": "v1"
}
] | 2024-07-26 | [
[
"Hou",
"Yue",
""
],
[
"Chen",
"Xueyuan",
""
],
[
"Zhu",
"He",
""
],
[
"Liu",
"Romei",
""
],
[
"Shi",
"Bowen",
""
],
[
"Liu",
"Jiaheng",
""
],
[
"Wu",
"Junran",
""
],
[
"Xu",
"Ke",
""
]
] | Novel Class Discovery (NCD) involves identifying new categories within unlabeled data by utilizing knowledge acquired from previously established categories. However, existing NCD methods often struggle to maintain a balance between the performance of old and new categories. Discovering unlabeled new categories in a cl... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.