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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2305.16867 | Elif Akata | Elif Akata, Lion Schulz, Julian Coda-Forno, Seong Joon Oh, Matthias
Bethge, Eric Schulz | Playing repeated games with Large Language Models | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large Language Models (LLMs) are transforming society and permeating into
diverse applications. As a result, LLMs will frequently interact with us and
other agents. It is, therefore, of great societal value to understand how LLMs
behave in interactive social settings. Here, we propose to use behavioral game
theory to... | [
{
"created": "Fri, 26 May 2023 12:17:59 GMT",
"version": "v1"
}
] | 2023-05-29 | [
[
"Akata",
"Elif",
""
],
[
"Schulz",
"Lion",
""
],
[
"Coda-Forno",
"Julian",
""
],
[
"Oh",
"Seong Joon",
""
],
[
"Bethge",
"Matthias",
""
],
[
"Schulz",
"Eric",
""
]
] | Large Language Models (LLMs) are transforming society and permeating into diverse applications. As a result, LLMs will frequently interact with us and other agents. It is, therefore, of great societal value to understand how LLMs behave in interactive social settings. Here, we propose to use behavioral game theory to s... |
2009.02775 | Suvam Mukherjee | Suvam Mukherjee, Oded Padon, Sharon Shoham, Deepak D'Souza, Noam
Rinetzky | A Thread-Local Semantics and Efficient Static Analyses for Race Free
Programs | null | null | null | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data race free (DRF) programs constitute an important class of concurrent
programs. In this paper we provide a framework for designing and proving the
correctness of data flow analyses that target this class of programs. These
analyses are in the same spirit as the "sync-CFG" analysis proposed in earlier
literature. ... | [
{
"created": "Sun, 6 Sep 2020 17:01:51 GMT",
"version": "v1"
}
] | 2020-09-08 | [
[
"Mukherjee",
"Suvam",
""
],
[
"Padon",
"Oded",
""
],
[
"Shoham",
"Sharon",
""
],
[
"D'Souza",
"Deepak",
""
],
[
"Rinetzky",
"Noam",
""
]
] | Data race free (DRF) programs constitute an important class of concurrent programs. In this paper we provide a framework for designing and proving the correctness of data flow analyses that target this class of programs. These analyses are in the same spirit as the "sync-CFG" analysis proposed in earlier literature. To... |
2203.00733 | Kazuhiro Sasabuchi | Daichi Saito, Kazuhiro Sasabuchi, Naoki Wake, Jun Takamatsu, Hideki
Koike, Katsushi Ikeuchi | Task-grasping from human demonstration | 7 pages, 8 figures | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | A challenge in robot grasping is to achieve task-grasping which is to select
a grasp that is advantageous to the success of tasks before and after grasps.
One of the frameworks to address this difficulty is Learning-from-Observation
(LfO), which obtains various hints from human demonstrations. This paper solves
three... | [
{
"created": "Tue, 1 Mar 2022 20:38:41 GMT",
"version": "v1"
}
] | 2022-03-03 | [
[
"Saito",
"Daichi",
""
],
[
"Sasabuchi",
"Kazuhiro",
""
],
[
"Wake",
"Naoki",
""
],
[
"Takamatsu",
"Jun",
""
],
[
"Koike",
"Hideki",
""
],
[
"Ikeuchi",
"Katsushi",
""
]
] | A challenge in robot grasping is to achieve task-grasping which is to select a grasp that is advantageous to the success of tasks before and after grasps. One of the frameworks to address this difficulty is Learning-from-Observation (LfO), which obtains various hints from human demonstrations. This paper solves three i... |
1704.06420 | Xiaofang Sun | Xiaofang Sun and Shihao Yan and Nan Yang and Zhiguo Ding and Chao Shen
and Zhangdui Zhong | Short-Packet Communications in Non-Orthogonal Multiple Access Systems | 6 pages, 4 figures. This paper has already been submitted to IEEE ICC
2017 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work introduces, for the first time, non-orthogonal multiple access
(NOMA) into short-packet communications to achieve low latency in wireless
networks. Specifically, we address the optimization of transmission rates and
power allocation to maximize the effective throughput of the user with a higher
channel gain... | [
{
"created": "Fri, 21 Apr 2017 07:21:15 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Sep 2017 04:36:47 GMT",
"version": "v2"
}
] | 2017-09-20 | [
[
"Sun",
"Xiaofang",
""
],
[
"Yan",
"Shihao",
""
],
[
"Yang",
"Nan",
""
],
[
"Ding",
"Zhiguo",
""
],
[
"Shen",
"Chao",
""
],
[
"Zhong",
"Zhangdui",
""
]
] | This work introduces, for the first time, non-orthogonal multiple access (NOMA) into short-packet communications to achieve low latency in wireless networks. Specifically, we address the optimization of transmission rates and power allocation to maximize the effective throughput of the user with a higher channel gain w... |
2404.19379 | Zhigang Sun | Zhigang Sun, Zixu Wang, Lavdim Halilaj, Juergen Luettin | SemanticFormer: Holistic and Semantic Traffic Scene Representation for
Trajectory Prediction using Knowledge Graphs | 8 pages, 7 figures, has been accepted for publication in the IEEE
Robotics and Automation Letters (RA-L) | null | null | null | cs.CV cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Trajectory prediction in autonomous driving relies on accurate representation
of all relevant contexts of the driving scene, including traffic participants,
road topology, traffic signs, as well as their semantic relations to each
other. Despite increased attention to this issue, most approaches in trajectory
predict... | [
{
"created": "Tue, 30 Apr 2024 09:11:04 GMT",
"version": "v1"
},
{
"created": "Mon, 27 May 2024 14:56:12 GMT",
"version": "v2"
},
{
"created": "Mon, 1 Jul 2024 04:51:21 GMT",
"version": "v3"
}
] | 2024-07-02 | [
[
"Sun",
"Zhigang",
""
],
[
"Wang",
"Zixu",
""
],
[
"Halilaj",
"Lavdim",
""
],
[
"Luettin",
"Juergen",
""
]
] | Trajectory prediction in autonomous driving relies on accurate representation of all relevant contexts of the driving scene, including traffic participants, road topology, traffic signs, as well as their semantic relations to each other. Despite increased attention to this issue, most approaches in trajectory predictio... |
1804.05290 | Tengchan Zeng | Tengchan Zeng, Omid Semiari, Walid Saad, and Mehdi Bennis | Joint Communication and Control for Wireless Autonomous Vehicular
Platoon Systems | Accepted in IEEE Transactions on Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Autonomous vehicular platoons will play an important role in improving
on-road safety in tomorrow's smart cities. Vehicles in an autonomous platoon
can exploit vehicle-to-vehicle (V2V) communications to collect information,
such as velocity and acceleration, from surrounding vehicles so as to maintain
the target velo... | [
{
"created": "Sun, 15 Apr 2018 00:25:13 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Jul 2019 01:29:49 GMT",
"version": "v2"
}
] | 2019-07-22 | [
[
"Zeng",
"Tengchan",
""
],
[
"Semiari",
"Omid",
""
],
[
"Saad",
"Walid",
""
],
[
"Bennis",
"Mehdi",
""
]
] | Autonomous vehicular platoons will play an important role in improving on-road safety in tomorrow's smart cities. Vehicles in an autonomous platoon can exploit vehicle-to-vehicle (V2V) communications to collect information, such as velocity and acceleration, from surrounding vehicles so as to maintain the target veloci... |
2110.02121 | Adejuyigbe Fajemisin | Adejuyigbe Fajemisin, Donato Maragno, Dick den Hertog | Optimization with Constraint Learning: A Framework and Survey | null | null | null | null | cs.LG math.OC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Many real-life optimization problems frequently contain one or more
constraints or objectives for which there are no explicit formulas. If data is
however available, these data can be used to learn the constraints. The
benefits of this approach are clearly seen, however there is a need for this
process to be carried ... | [
{
"created": "Tue, 5 Oct 2021 15:42:06 GMT",
"version": "v1"
},
{
"created": "Thu, 22 Sep 2022 15:00:48 GMT",
"version": "v2"
}
] | 2022-09-23 | [
[
"Fajemisin",
"Adejuyigbe",
""
],
[
"Maragno",
"Donato",
""
],
[
"Hertog",
"Dick den",
""
]
] | Many real-life optimization problems frequently contain one or more constraints or objectives for which there are no explicit formulas. If data is however available, these data can be used to learn the constraints. The benefits of this approach are clearly seen, however there is a need for this process to be carried ou... |
1907.10936 | Zhijie Zhang | Zhijie Zhang and Huazhu Fu and Hang Dai and Jianbing Shen and Yanwei
Pang and Ling Shao | ET-Net: A Generic Edge-aTtention Guidance Network for Medical Image
Segmentation | MICCAI 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Segmentation is a fundamental task in medical image analysis. However, most
existing methods focus on primary region extraction and ignore edge
information, which is useful for obtaining accurate segmentation. In this
paper, we propose a generic medical segmentation method, called Edge-aTtention
guidance Network (ET-... | [
{
"created": "Thu, 25 Jul 2019 10:00:08 GMT",
"version": "v1"
}
] | 2019-07-26 | [
[
"Zhang",
"Zhijie",
""
],
[
"Fu",
"Huazhu",
""
],
[
"Dai",
"Hang",
""
],
[
"Shen",
"Jianbing",
""
],
[
"Pang",
"Yanwei",
""
],
[
"Shao",
"Ling",
""
]
] | Segmentation is a fundamental task in medical image analysis. However, most existing methods focus on primary region extraction and ignore edge information, which is useful for obtaining accurate segmentation. In this paper, we propose a generic medical segmentation method, called Edge-aTtention guidance Network (ET-Ne... |
2011.11317 | Jochen Meyer | Jochen Meyer, Thomas Fr\"ohlich, Kai von Holdt | Corona-Warn-App: Erste Ergebnisse einer Onlineumfrage zur
(Nicht-)Nutzung und Gebrauch | in German. In the original version, there was a minor bug in
calculating percentages for reasons of non-use (page 6), resulting in wrong
figures. These have been corrected. Now the figures are correct | null | null | null | cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this study, the German "Corona-Warn-App" of the German Federal Government
and the Robert-Koch-Institute is examined by means of a non-representative
online survey with 1482 participants for reasons of use and non-use. The study
provides insights into user behavior with the app during the Corona pandemic,
highlight... | [
{
"created": "Mon, 23 Nov 2020 10:38:28 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Nov 2020 16:15:04 GMT",
"version": "v2"
}
] | 2020-11-25 | [
[
"Meyer",
"Jochen",
""
],
[
"Fröhlich",
"Thomas",
""
],
[
"von Holdt",
"Kai",
""
]
] | In this study, the German "Corona-Warn-App" of the German Federal Government and the Robert-Koch-Institute is examined by means of a non-representative online survey with 1482 participants for reasons of use and non-use. The study provides insights into user behavior with the app during the Corona pandemic, highlights ... |
2402.07114 | Rudrajit Das | Rudrajit Das, Naman Agarwal, Sujay Sanghavi, Inderjit S. Dhillon | Towards Quantifying the Preconditioning Effect of Adam | null | null | null | null | cs.LG cs.NA math.NA math.OC stat.ML | http://creativecommons.org/licenses/by/4.0/ | There is a notable dearth of results characterizing the preconditioning
effect of Adam and showing how it may alleviate the curse of ill-conditioning
-- an issue plaguing gradient descent (GD). In this work, we perform a detailed
analysis of Adam's preconditioning effect for quadratic functions and quantify
to what e... | [
{
"created": "Sun, 11 Feb 2024 06:21:18 GMT",
"version": "v1"
}
] | 2024-02-14 | [
[
"Das",
"Rudrajit",
""
],
[
"Agarwal",
"Naman",
""
],
[
"Sanghavi",
"Sujay",
""
],
[
"Dhillon",
"Inderjit S.",
""
]
] | There is a notable dearth of results characterizing the preconditioning effect of Adam and showing how it may alleviate the curse of ill-conditioning -- an issue plaguing gradient descent (GD). In this work, we perform a detailed analysis of Adam's preconditioning effect for quadratic functions and quantify to what ext... |
1204.1718 | Nathan Collier Nathan Collier | Nathan Collier, David Pardo, Maciej Paszynski, Victor M. Calo | Computational complexity and memory usage for multi-frontal direct
solvers in structured mesh finite elements | 8 pages, 2 figures | null | null | null | cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The multi-frontal direct solver is the state-of-the-art algorithm for the
direct solution of sparse linear systems. This paper provides computational
complexity and memory usage estimates for the application of the multi-frontal
direct solver algorithm on linear systems resulting from B-spline-based
isogeometric fini... | [
{
"created": "Sun, 8 Apr 2012 08:07:47 GMT",
"version": "v1"
}
] | 2012-04-10 | [
[
"Collier",
"Nathan",
""
],
[
"Pardo",
"David",
""
],
[
"Paszynski",
"Maciej",
""
],
[
"Calo",
"Victor M.",
""
]
] | The multi-frontal direct solver is the state-of-the-art algorithm for the direct solution of sparse linear systems. This paper provides computational complexity and memory usage estimates for the application of the multi-frontal direct solver algorithm on linear systems resulting from B-spline-based isogeometric finite... |
1907.11893 | Sabah Al-Fedaghi Dr. | Sabah Al-Fedaghi | Five Generic Processes for Behavior Description in Software Engineering | 12 pages, 35 figures | International Journal of Computer Science and Information
Security, Vol. 17, No. 7, July 2019 International Journal of Computer Science
and Information Security, Vol. 17, No. 7, July 2019 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Behavior modeling and software architecture specification are attracting more
attention in software engineering. Describing both of them in integrated models
yields numerous advantages for coping with complexity since the models are
platform independent. They can be decomposed to be developed independently by
experts... | [
{
"created": "Sat, 27 Jul 2019 11:02:50 GMT",
"version": "v1"
}
] | 2019-07-30 | [
[
"Al-Fedaghi",
"Sabah",
""
]
] | Behavior modeling and software architecture specification are attracting more attention in software engineering. Describing both of them in integrated models yields numerous advantages for coping with complexity since the models are platform independent. They can be decomposed to be developed independently by experts o... |
2009.13454 | Mubariz Zaffar | Mihnea-Alexandru Tomit\u{a}, Mubariz Zaffar, Michael Milford, Klaus
McDonald-Maier and Shoaib Ehsan | ConvSequential-SLAM: A Sequence-based, Training-less Visual Place
Recognition Technique for Changing Environments | 10 pages, currently under-review | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual Place Recognition (VPR) is the ability to correctly recall a
previously visited place under changing viewpoints and appearances. A large
number of handcrafted and deep-learning-based VPR techniques exist, where the
former suffer from appearance changes and the latter have significant
computational needs. In th... | [
{
"created": "Mon, 28 Sep 2020 16:31:29 GMT",
"version": "v1"
}
] | 2020-09-29 | [
[
"Tomită",
"Mihnea-Alexandru",
""
],
[
"Zaffar",
"Mubariz",
""
],
[
"Milford",
"Michael",
""
],
[
"McDonald-Maier",
"Klaus",
""
],
[
"Ehsan",
"Shoaib",
""
]
] | Visual Place Recognition (VPR) is the ability to correctly recall a previously visited place under changing viewpoints and appearances. A large number of handcrafted and deep-learning-based VPR techniques exist, where the former suffer from appearance changes and the latter have significant computational needs. In this... |
2404.15588 | Xiangci Li | Xiangci Li, Sihao Chen, Rajvi Kapadia, Jessica Ouyang, Fan Zhang | Minimal Evidence Group Identification for Claim Verification | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Claim verification in real-world settings (e.g. against a large collection of
candidate evidences retrieved from the web) typically requires identifying and
aggregating a complete set of evidence pieces that collectively provide full
support to the claim. The problem becomes particularly challenging when there
exists... | [
{
"created": "Wed, 24 Apr 2024 01:44:09 GMT",
"version": "v1"
}
] | 2024-04-25 | [
[
"Li",
"Xiangci",
""
],
[
"Chen",
"Sihao",
""
],
[
"Kapadia",
"Rajvi",
""
],
[
"Ouyang",
"Jessica",
""
],
[
"Zhang",
"Fan",
""
]
] | Claim verification in real-world settings (e.g. against a large collection of candidate evidences retrieved from the web) typically requires identifying and aggregating a complete set of evidence pieces that collectively provide full support to the claim. The problem becomes particularly challenging when there exists d... |
2407.20798 | Norman Di Palo | Norman Di Palo, Leonard Hasenclever, Jan Humplik, Arunkumar Byravan | Diffusion Augmented Agents: A Framework for Efficient Exploration and
Transfer Learning | Published at 3rd Conference on Lifelong Learning Agents (CoLLAs),
2024 | null | null | null | cs.LG cs.AI cs.RO | http://creativecommons.org/licenses/by/4.0/ | We introduce Diffusion Augmented Agents (DAAG), a novel framework that
leverages large language models, vision language models, and diffusion models
to improve sample efficiency and transfer learning in reinforcement learning
for embodied agents. DAAG hindsight relabels the agent's past experience by
using diffusion ... | [
{
"created": "Tue, 30 Jul 2024 13:01:31 GMT",
"version": "v1"
}
] | 2024-07-31 | [
[
"Di Palo",
"Norman",
""
],
[
"Hasenclever",
"Leonard",
""
],
[
"Humplik",
"Jan",
""
],
[
"Byravan",
"Arunkumar",
""
]
] | We introduce Diffusion Augmented Agents (DAAG), a novel framework that leverages large language models, vision language models, and diffusion models to improve sample efficiency and transfer learning in reinforcement learning for embodied agents. DAAG hindsight relabels the agent's past experience by using diffusion mo... |
2406.00359 | Hannaneh Barahouei Pasandi | Hannah B. Pasandi, Faith Parastar | Location Privacy in B5G/6G: Systematization of Knowledge | 13 pages; 7 Figures | null | null | null | cs.NI | http://creativecommons.org/publicdomain/zero/1.0/ | As we transition into the era of B5G/6G networks, the promise of seamless,
high-speed connectivity brings unprecedented opportunities and challenges.
Among the most critical concerns is the preservation of location privacy, given
the enhanced precision and pervasive connectivity of these advanced networks.
This paper... | [
{
"created": "Sat, 1 Jun 2024 08:25:07 GMT",
"version": "v1"
}
] | 2024-06-04 | [
[
"Pasandi",
"Hannah B.",
""
],
[
"Parastar",
"Faith",
""
]
] | As we transition into the era of B5G/6G networks, the promise of seamless, high-speed connectivity brings unprecedented opportunities and challenges. Among the most critical concerns is the preservation of location privacy, given the enhanced precision and pervasive connectivity of these advanced networks. This paper s... |
2404.06201 | Wei Ma | Zhihao Lin and Wei Ma and Tao Lin and Yaowen Zheng and Jingquan Ge and
Jun Wang and Jacques Klein and Tegawende Bissyande and Yang Liu and Li Li | Open-Source AI-based SE Tools: Opportunities and Challenges of
Collaborative Software Learning | null | null | null | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large Language Models (LLMs) have become instrumental in advancing software
engineering (SE) tasks, showcasing their efficacy in code understanding and
beyond. Like traditional SE tools, open-source collaboration is key in
realising the excellent products. However, with AI models, the essential need
is in data. The c... | [
{
"created": "Tue, 9 Apr 2024 10:47:02 GMT",
"version": "v1"
}
] | 2024-04-10 | [
[
"Lin",
"Zhihao",
""
],
[
"Ma",
"Wei",
""
],
[
"Lin",
"Tao",
""
],
[
"Zheng",
"Yaowen",
""
],
[
"Ge",
"Jingquan",
""
],
[
"Wang",
"Jun",
""
],
[
"Klein",
"Jacques",
""
],
[
"Bissyande",
"Tegawend... | Large Language Models (LLMs) have become instrumental in advancing software engineering (SE) tasks, showcasing their efficacy in code understanding and beyond. Like traditional SE tools, open-source collaboration is key in realising the excellent products. However, with AI models, the essential need is in data. The col... |
2005.13303 | Junqi Zhang | Junqi Zhang, Bing Bai, Ye Lin, Jian Liang, Kun Bai, Fei Wang | General-Purpose User Embeddings based on Mobile App Usage | To be published in the KDD2020 proceedings as a full paper | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we report our recent practice at Tencent for user modeling
based on mobile app usage. User behaviors on mobile app usage, including
retention, installation, and uninstallation, can be a good indicator for both
long-term and short-term interests of users. For example, if a user installs
Snapseed recentl... | [
{
"created": "Wed, 27 May 2020 12:01:50 GMT",
"version": "v1"
}
] | 2020-05-28 | [
[
"Zhang",
"Junqi",
""
],
[
"Bai",
"Bing",
""
],
[
"Lin",
"Ye",
""
],
[
"Liang",
"Jian",
""
],
[
"Bai",
"Kun",
""
],
[
"Wang",
"Fei",
""
]
] | In this paper, we report our recent practice at Tencent for user modeling based on mobile app usage. User behaviors on mobile app usage, including retention, installation, and uninstallation, can be a good indicator for both long-term and short-term interests of users. For example, if a user installs Snapseed recently,... |
1705.04828 | Yiluan Guo | Yiluan Guo, Hossein Nejati, Ngai-Man Cheung | Deep neural networks on graph signals for brain imaging analysis | Accepted by ICIP 2017 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Brain imaging data such as EEG or MEG are high-dimensional spatiotemporal
data often degraded by complex, non-Gaussian noise. For reliable analysis of
brain imaging data, it is important to extract discriminative, low-dimensional
intrinsic representation of the recorded data. This work proposes a new method
to learn ... | [
{
"created": "Sat, 13 May 2017 13:50:47 GMT",
"version": "v1"
}
] | 2017-05-16 | [
[
"Guo",
"Yiluan",
""
],
[
"Nejati",
"Hossein",
""
],
[
"Cheung",
"Ngai-Man",
""
]
] | Brain imaging data such as EEG or MEG are high-dimensional spatiotemporal data often degraded by complex, non-Gaussian noise. For reliable analysis of brain imaging data, it is important to extract discriminative, low-dimensional intrinsic representation of the recorded data. This work proposes a new method to learn th... |
1806.01175 | Artemij Amiranashvili | Artemij Amiranashvili, Alexey Dosovitskiy, Vladlen Koltun, Thomas Brox | TD or not TD: Analyzing the Role of Temporal Differencing in Deep
Reinforcement Learning | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Our understanding of reinforcement learning (RL) has been shaped by
theoretical and empirical results that were obtained decades ago using tabular
representations and linear function approximators. These results suggest that
RL methods that use temporal differencing (TD) are superior to direct Monte
Carlo estimation ... | [
{
"created": "Mon, 4 Jun 2018 16:16:51 GMT",
"version": "v1"
}
] | 2018-06-05 | [
[
"Amiranashvili",
"Artemij",
""
],
[
"Dosovitskiy",
"Alexey",
""
],
[
"Koltun",
"Vladlen",
""
],
[
"Brox",
"Thomas",
""
]
] | Our understanding of reinforcement learning (RL) has been shaped by theoretical and empirical results that were obtained decades ago using tabular representations and linear function approximators. These results suggest that RL methods that use temporal differencing (TD) are superior to direct Monte Carlo estimation (M... |
2207.03047 | Qian Ye | Qian Ye, Masanori Suganuma, Takayuki Okatani | Single-image Defocus Deblurring by Integration of Defocus Map Prediction
Tracing the Inverse Problem Computation | null | null | null | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | In this paper, we consider the problem in defocus image deblurring. Previous
classical methods follow two-steps approaches, i.e., first defocus map
estimation and then the non-blind deblurring. In the era of deep learning, some
researchers have tried to address these two problems by CNN. However, the
simple concatena... | [
{
"created": "Thu, 7 Jul 2022 02:15:33 GMT",
"version": "v1"
}
] | 2022-07-08 | [
[
"Ye",
"Qian",
""
],
[
"Suganuma",
"Masanori",
""
],
[
"Okatani",
"Takayuki",
""
]
] | In this paper, we consider the problem in defocus image deblurring. Previous classical methods follow two-steps approaches, i.e., first defocus map estimation and then the non-blind deblurring. In the era of deep learning, some researchers have tried to address these two problems by CNN. However, the simple concatenati... |
2205.02468 | Jiongyu Guo | Jiongyu Guo, Defang Chen, Can Wang | Alignahead: Online Cross-Layer Knowledge Extraction on Graph Neural
Networks | Accepted to IJCNN-2022 | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Existing knowledge distillation methods on graph neural networks (GNNs) are
almost offline, where the student model extracts knowledge from a powerful
teacher model to improve its performance. However, a pre-trained teacher model
is not always accessible due to training cost, privacy, etc. In this paper, we
propose a... | [
{
"created": "Thu, 5 May 2022 06:48:13 GMT",
"version": "v1"
}
] | 2022-05-06 | [
[
"Guo",
"Jiongyu",
""
],
[
"Chen",
"Defang",
""
],
[
"Wang",
"Can",
""
]
] | Existing knowledge distillation methods on graph neural networks (GNNs) are almost offline, where the student model extracts knowledge from a powerful teacher model to improve its performance. However, a pre-trained teacher model is not always accessible due to training cost, privacy, etc. In this paper, we propose a n... |
0807.3582 | Shashi Kiran Chilappagari | Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane Vasic and Michael W.
Marcellin | Error Correction Capability of Column-Weight-Three LDPC Codes: Part II | 7 pages, 7 figures, submitted to IEEE Transactions on Information
Theory (July 2008) | null | 10.1109/TIT.2009.2015990 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The relation between the girth and the error correction capability of
column-weight-three LDPC codes is investigated. Specifically, it is shown that
the Gallager A algorithm can correct $g/2-1$ errors in $g/2$ iterations on a
Tanner graph of girth $g \geq 10$.
| [
{
"created": "Wed, 23 Jul 2008 01:04:27 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Chilappagari",
"Shashi Kiran",
""
],
[
"Nguyen",
"Dung Viet",
""
],
[
"Vasic",
"Bane",
""
],
[
"Marcellin",
"Michael W.",
""
]
] | The relation between the girth and the error correction capability of column-weight-three LDPC codes is investigated. Specifically, it is shown that the Gallager A algorithm can correct $g/2-1$ errors in $g/2$ iterations on a Tanner graph of girth $g \geq 10$. |
1401.2503 | Tao Xiong | Tao Xiong, Yukun Bao, Zhongyi Hu | Does Restraining End Effect Matter in EMD-Based Modeling Framework for
Time Series Prediction? Some Experimental Evidences | 28 pages | Neurocomputing. 123, 2013: 174-184 | 10.1016/j.neucom.2013.07.004 | null | cs.AI stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Following the "decomposition-and-ensemble" principle, the empirical mode
decomposition (EMD)-based modeling framework has been widely used as a
promising alternative for nonlinear and nonstationary time series modeling and
prediction. The end effect, which occurs during the sifting process of EMD and
is apt to distor... | [
{
"created": "Sat, 11 Jan 2014 06:08:04 GMT",
"version": "v1"
}
] | 2014-01-14 | [
[
"Xiong",
"Tao",
""
],
[
"Bao",
"Yukun",
""
],
[
"Hu",
"Zhongyi",
""
]
] | Following the "decomposition-and-ensemble" principle, the empirical mode decomposition (EMD)-based modeling framework has been widely used as a promising alternative for nonlinear and nonstationary time series modeling and prediction. The end effect, which occurs during the sifting process of EMD and is apt to distort ... |
1905.03410 | Jonathan Scarlett | Zihan Li, Matthias Fresacher, Jonathan Scarlett | Learning Erd\H{o}s-R\'enyi Random Graphs via Edge Detecting Queries | NeurIPS 2019 | null | null | null | cs.IT cs.DM cs.LG math.IT math.PR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the problem of learning an unknown graph via
queries on groups of nodes, with the result indicating whether or not at least
one edge is present among those nodes. While learning arbitrary graphs with $n$
nodes and $k$ edges is known to be hard in the sense of requiring $\Omega(
\min\{ k^2 \... | [
{
"created": "Thu, 9 May 2019 02:10:17 GMT",
"version": "v1"
},
{
"created": "Sat, 11 May 2019 01:13:51 GMT",
"version": "v2"
},
{
"created": "Sun, 6 Oct 2019 11:02:45 GMT",
"version": "v3"
},
{
"created": "Fri, 3 Jan 2020 22:47:29 GMT",
"version": "v4"
}
] | 2020-01-07 | [
[
"Li",
"Zihan",
""
],
[
"Fresacher",
"Matthias",
""
],
[
"Scarlett",
"Jonathan",
""
]
] | In this paper, we consider the problem of learning an unknown graph via queries on groups of nodes, with the result indicating whether or not at least one edge is present among those nodes. While learning arbitrary graphs with $n$ nodes and $k$ edges is known to be hard in the sense of requiring $\Omega( \min\{ k^2 \lo... |
1712.00433 | Zhishuai Zhang | Zhishuai Zhang, Siyuan Qiao, Cihang Xie, Wei Shen, Bo Wang, Alan L.
Yuille | Single-Shot Object Detection with Enriched Semantics | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel single shot object detection network named Detection with
Enriched Semantics (DES). Our motivation is to enrich the semantics of object
detection features within a typical deep detector, by a semantic segmentation
branch and a global activation module. The segmentation branch is supervised by
weak ... | [
{
"created": "Fri, 1 Dec 2017 18:18:42 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Apr 2018 01:01:25 GMT",
"version": "v2"
}
] | 2018-04-10 | [
[
"Zhang",
"Zhishuai",
""
],
[
"Qiao",
"Siyuan",
""
],
[
"Xie",
"Cihang",
""
],
[
"Shen",
"Wei",
""
],
[
"Wang",
"Bo",
""
],
[
"Yuille",
"Alan L.",
""
]
] | We propose a novel single shot object detection network named Detection with Enriched Semantics (DES). Our motivation is to enrich the semantics of object detection features within a typical deep detector, by a semantic segmentation branch and a global activation module. The segmentation branch is supervised by weak se... |
2309.16729 | Frederic Jurie | Sidney Besnard, Fr\'ed\'eric Jurie (UNICAEN), Jalal M. Fadili (NU,
ENSICAEN, GREYC) | SimPINNs: Simulation-Driven Physics-Informed Neural Networks for
Enhanced Performance in Nonlinear Inverse Problems | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces a novel approach to solve inverse problems by
leveraging deep learning techniques. The objective is to infer unknown
parameters that govern a physical system based on observed data. We focus on
scenarios where the underlying forward model demonstrates pronounced nonlinear
behaviour, and where th... | [
{
"created": "Wed, 27 Sep 2023 06:34:55 GMT",
"version": "v1"
}
] | 2023-10-02 | [
[
"Besnard",
"Sidney",
"",
"UNICAEN"
],
[
"Jurie",
"Frédéric",
"",
"UNICAEN"
],
[
"Fadili",
"Jalal M.",
"",
"NU,\n ENSICAEN, GREYC"
]
] | This paper introduces a novel approach to solve inverse problems by leveraging deep learning techniques. The objective is to infer unknown parameters that govern a physical system based on observed data. We focus on scenarios where the underlying forward model demonstrates pronounced nonlinear behaviour, and where the ... |
2002.02831 | Dongwei Chen | Dongwei Chen, Daliang Xu, Dong Tong, Kang Sun, Xuetao Guan, Chun Yang,
Xu Cheng | Saturation Memory Access: Mitigating Memory Spatial Errors without
Terminating Programs | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Memory spatial errors, i.e., buffer overflow vulnerabilities, have been a
well-known issue in computer security for a long time and remain one of the
root causes of exploitable vulnerabilities. Most of the existing mitigation
tools adopt a fail-stop strategy to protect programs from intrusions, which
means the victim... | [
{
"created": "Fri, 7 Feb 2020 15:07:00 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Apr 2020 07:43:00 GMT",
"version": "v2"
}
] | 2020-04-07 | [
[
"Chen",
"Dongwei",
""
],
[
"Xu",
"Daliang",
""
],
[
"Tong",
"Dong",
""
],
[
"Sun",
"Kang",
""
],
[
"Guan",
"Xuetao",
""
],
[
"Yang",
"Chun",
""
],
[
"Cheng",
"Xu",
""
]
] | Memory spatial errors, i.e., buffer overflow vulnerabilities, have been a well-known issue in computer security for a long time and remain one of the root causes of exploitable vulnerabilities. Most of the existing mitigation tools adopt a fail-stop strategy to protect programs from intrusions, which means the victim p... |
2302.01820 | Thomas Nindel | Thomas K. Nindel, Mohcen Hafidi, Tom\'a\v{s} Iser and Alexander Wilkie | Automatic inference of a anatomically meaningful solid wood texture from
a single photograph | null | null | null | null | cs.GR | http://creativecommons.org/licenses/by/4.0/ | Wood is a volumetric material with a very large appearance gamut that is
further enlarged by numerous finishing techniques. Computer graphics has made
considerable progress in creating sophisticated and flexible appearance models
that allow convincing renderings of wooden materials.
However, these do not yet allow ... | [
{
"created": "Fri, 3 Feb 2023 15:54:24 GMT",
"version": "v1"
}
] | 2023-02-06 | [
[
"Nindel",
"Thomas K.",
""
],
[
"Hafidi",
"Mohcen",
""
],
[
"Iser",
"Tomáš",
""
],
[
"Wilkie",
"Alexander",
""
]
] | Wood is a volumetric material with a very large appearance gamut that is further enlarged by numerous finishing techniques. Computer graphics has made considerable progress in creating sophisticated and flexible appearance models that allow convincing renderings of wooden materials. However, these do not yet allow full... |
1007.3835 | Nuno P. Lopes | Nuno P. Lopes, Juan A. Navarro, Andrey Rybalchenko, Atul Singh | Applying Prolog to Develop Distributed Systems | null | Theory and Practice of Logic Programming, 26th Int'l. Conference
on Logic Programming (ICLP'10) Special Issue, 10(4-6):691-707, July 2010 | 10.1017/S1471068410000360 | null | cs.PL cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Development of distributed systems is a difficult task. Declarative
programming techniques hold a promising potential for effectively supporting
programmer in this challenge. While Datalog-based languages have been actively
explored for programming distributed systems, Prolog received relatively little
attention in t... | [
{
"created": "Thu, 22 Jul 2010 09:28:10 GMT",
"version": "v1"
}
] | 2010-07-23 | [
[
"Lopes",
"Nuno P.",
""
],
[
"Navarro",
"Juan A.",
""
],
[
"Rybalchenko",
"Andrey",
""
],
[
"Singh",
"Atul",
""
]
] | Development of distributed systems is a difficult task. Declarative programming techniques hold a promising potential for effectively supporting programmer in this challenge. While Datalog-based languages have been actively explored for programming distributed systems, Prolog received relatively little attention in thi... |
1001.4119 | Stephane Gaubert | Xavier Allamigeon, Stephane Gaubert, Eric Goubault | The tropical double description method | 12 pages, prepared for the Proceedings of the Symposium on
Theoretical Aspects of Computer Science, 2010, Nancy, France | null | 10.4230/LIPIcs.STACS.2010.2443 | null | cs.CG cs.DM | http://creativecommons.org/licenses/by/3.0/ | We develop a tropical analogue of the classical double description method
allowing one to compute an internal representation (in terms of vertices) of a
polyhedron defined externally (by inequalities). The heart of the tropical
algorithm is a characterization of the extreme points of a polyhedron in terms
of a system... | [
{
"created": "Sat, 23 Jan 2010 02:01:06 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Feb 2010 14:55:37 GMT",
"version": "v2"
}
] | 2011-12-30 | [
[
"Allamigeon",
"Xavier",
""
],
[
"Gaubert",
"Stephane",
""
],
[
"Goubault",
"Eric",
""
]
] | We develop a tropical analogue of the classical double description method allowing one to compute an internal representation (in terms of vertices) of a polyhedron defined externally (by inequalities). The heart of the tropical algorithm is a characterization of the extreme points of a polyhedron in terms of a system o... |
2301.01104 | Yang Tian | Wei Xiong, Muyuan Ma, Xiaomeng Huang, Ziyang Zhang, Pei Sun, Yang Tian | KoopmanLab: machine learning for solving complex physics equations | null | null | null | null | cs.LG cs.NA math.NA physics.comp-ph physics.flu-dyn | http://creativecommons.org/licenses/by/4.0/ | Numerous physics theories are rooted in partial differential equations
(PDEs). However, the increasingly intricate physics equations, especially those
that lack analytic solutions or closed forms, have impeded the further
development of physics. Computationally solving PDEs by classic numerical
approaches suffers fro... | [
{
"created": "Tue, 3 Jan 2023 13:58:39 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Jan 2023 05:04:24 GMT",
"version": "v2"
},
{
"created": "Sun, 19 Mar 2023 13:44:49 GMT",
"version": "v3"
}
] | 2023-03-21 | [
[
"Xiong",
"Wei",
""
],
[
"Ma",
"Muyuan",
""
],
[
"Huang",
"Xiaomeng",
""
],
[
"Zhang",
"Ziyang",
""
],
[
"Sun",
"Pei",
""
],
[
"Tian",
"Yang",
""
]
] | Numerous physics theories are rooted in partial differential equations (PDEs). However, the increasingly intricate physics equations, especially those that lack analytic solutions or closed forms, have impeded the further development of physics. Computationally solving PDEs by classic numerical approaches suffers from ... |
2112.06571 | Takeyoshi Nagasato | Takeyoshi Nagasato, Kei Ishida, Ali Ercan, Tongbi Tu, Masato Kiyama,
Motoki Amagasaki, Kazuki Yokoo | Extension of Convolutional Neural Network along Temporal and Vertical
Directions for Precipitation Downscaling | null | null | null | null | cs.LG physics.ao-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning has been utilized for the statistical downscaling of climate
data. Specifically, a two-dimensional (2D) convolutional neural network (CNN)
has been successfully applied to precipitation estimation. This study
implements a three-dimensional (3D) CNN to estimate watershed-scale daily
precipitation from 3D... | [
{
"created": "Mon, 13 Dec 2021 11:26:12 GMT",
"version": "v1"
}
] | 2021-12-14 | [
[
"Nagasato",
"Takeyoshi",
""
],
[
"Ishida",
"Kei",
""
],
[
"Ercan",
"Ali",
""
],
[
"Tu",
"Tongbi",
""
],
[
"Kiyama",
"Masato",
""
],
[
"Amagasaki",
"Motoki",
""
],
[
"Yokoo",
"Kazuki",
""
]
] | Deep learning has been utilized for the statistical downscaling of climate data. Specifically, a two-dimensional (2D) convolutional neural network (CNN) has been successfully applied to precipitation estimation. This study implements a three-dimensional (3D) CNN to estimate watershed-scale daily precipitation from 3D a... |
2205.05304 | Xinyu Bian | Xinyu Bian, Yuyi Mao, Jun Zhang | Error Rate Analysis for Grant-free Massive Random Access with
Short-Packet Transmission | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Grant-free massive random access (RA) is a promising protocol to support the
massive machine-type communications (mMTC) scenario in 5G and beyond networks.
In this paper, we focus on the error rate analysis in grant-free massive RA,
which is critical for practical deployment but has not been well studied. We
consider... | [
{
"created": "Wed, 11 May 2022 07:13:48 GMT",
"version": "v1"
}
] | 2022-05-12 | [
[
"Bian",
"Xinyu",
""
],
[
"Mao",
"Yuyi",
""
],
[
"Zhang",
"Jun",
""
]
] | Grant-free massive random access (RA) is a promising protocol to support the massive machine-type communications (mMTC) scenario in 5G and beyond networks. In this paper, we focus on the error rate analysis in grant-free massive RA, which is critical for practical deployment but has not been well studied. We consider a... |
2207.12271 | Gopiram Roshan Lal | G Roshan Lal and Varun Mithal | NN2Rules: Extracting Rule List from Neural Networks | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | We present an algorithm, NN2Rules, to convert a trained neural network into a
rule list. Rule lists are more interpretable since they align better with the
way humans make decisions. NN2Rules is a decompositional approach to rule
extraction, i.e., it extracts a set of decision rules from the parameters of
the trained... | [
{
"created": "Mon, 4 Jul 2022 09:19:47 GMT",
"version": "v1"
}
] | 2022-07-26 | [
[
"Lal",
"G Roshan",
""
],
[
"Mithal",
"Varun",
""
]
] | We present an algorithm, NN2Rules, to convert a trained neural network into a rule list. Rule lists are more interpretable since they align better with the way humans make decisions. NN2Rules is a decompositional approach to rule extraction, i.e., it extracts a set of decision rules from the parameters of the trained n... |
2309.16520 | Wenqi Jiang | Wenqi Jiang, Martin Parvanov, Gustavo Alonso | SwiftSpatial: Spatial Joins on Modern Hardware | null | null | null | null | cs.DB cs.AR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Spatial joins are among the most time-consuming queries in spatial data
management systems. In this paper, we propose SwiftSpatial, a specialized
accelerator architecture tailored for spatial joins. SwiftSpatial contains
multiple high-performance join units with innovative hybrid parallelism,
several efficient memory... | [
{
"created": "Thu, 28 Sep 2023 15:26:36 GMT",
"version": "v1"
}
] | 2023-09-29 | [
[
"Jiang",
"Wenqi",
""
],
[
"Parvanov",
"Martin",
""
],
[
"Alonso",
"Gustavo",
""
]
] | Spatial joins are among the most time-consuming queries in spatial data management systems. In this paper, we propose SwiftSpatial, a specialized accelerator architecture tailored for spatial joins. SwiftSpatial contains multiple high-performance join units with innovative hybrid parallelism, several efficient memory m... |
2403.10833 | Guillaume Sartoretti | Yuhong Cao and Rui Zhao and Yizhuo Wang and Bairan Xiang and Guillaume
Sartoretti | Deep Reinforcement Learning-based Large-scale Robot Exploration | \c{opyright} 20XX IEEE. Personal use of this material is permitted.
Permission from IEEE must be obtained for all other uses, in any current or
future media, including reprinting/republishing this material for advertising
or promotional purposes, creating new collective works, for resale or
redistribution to se... | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we propose a deep reinforcement learning (DRL) based reactive
planner to solve large-scale Lidar-based autonomous robot exploration problems
in 2D action space. Our DRL-based planner allows the agent to reactively plan
its exploration path by making implicit predictions about unknown areas, based
on a l... | [
{
"created": "Sat, 16 Mar 2024 06:56:32 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Cao",
"Yuhong",
""
],
[
"Zhao",
"Rui",
""
],
[
"Wang",
"Yizhuo",
""
],
[
"Xiang",
"Bairan",
""
],
[
"Sartoretti",
"Guillaume",
""
]
] | In this work, we propose a deep reinforcement learning (DRL) based reactive planner to solve large-scale Lidar-based autonomous robot exploration problems in 2D action space. Our DRL-based planner allows the agent to reactively plan its exploration path by making implicit predictions about unknown areas, based on a lea... |
1510.07273 | Hampei Sasahara | Hampei Sasahara and Kazunori Hayashi and Masaaki Nagahara | Multiuser Detection by MAP Estimation with Sum-of-Absolute-Values
Relaxation | submitted; 6 pages, 7 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article, we consider multiuser detection that copes with multiple
access interference caused in star-topology machine-to-machine (M2M)
communications. We assume that the transmitted signals are discrete-valued
(e.g. binary signals taking values of $\pm 1$), which is taken into account as
prior information in ... | [
{
"created": "Sun, 25 Oct 2015 17:29:13 GMT",
"version": "v1"
}
] | 2015-10-27 | [
[
"Sasahara",
"Hampei",
""
],
[
"Hayashi",
"Kazunori",
""
],
[
"Nagahara",
"Masaaki",
""
]
] | In this article, we consider multiuser detection that copes with multiple access interference caused in star-topology machine-to-machine (M2M) communications. We assume that the transmitted signals are discrete-valued (e.g. binary signals taking values of $\pm 1$), which is taken into account as prior information in de... |
1808.10062 | Andrew Lohn | Andrew J. Lohn | Timelines for In-Code Discovery of Zero-Day Vulnerabilities and
Supply-Chain Attacks | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Zero-day vulnerabilities can be accidentally or maliciously placed in code
and can remain in place for years. In this study, we address an aspect of their
longevity by considering the likelihood that they will be discovered in the
code across versions. We approximate well-disguised vulnerabilities as only
being disco... | [
{
"created": "Wed, 29 Aug 2018 23:05:08 GMT",
"version": "v1"
},
{
"created": "Fri, 31 Aug 2018 16:57:46 GMT",
"version": "v2"
}
] | 2018-09-03 | [
[
"Lohn",
"Andrew J.",
""
]
] | Zero-day vulnerabilities can be accidentally or maliciously placed in code and can remain in place for years. In this study, we address an aspect of their longevity by considering the likelihood that they will be discovered in the code across versions. We approximate well-disguised vulnerabilities as only being discove... |
0904.3648 | Florentina Pintea | Tiberiu Marius Karnyanszky, Mihai Titu | Computer Aided Optimization of the Unconventional Processing | 6 pages,exposed on 1st "European Conference on Computer Sciences &
Applications" - XA2006, Timisoara, Romania | Ann. Univ. Tibiscus Comp. Sci. Series IV (2006), 85-90 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The unconventional technologies, currently applied at a certain category of
materials, difficult to be processed through usual techniques, have undergone
during the last 60 years all the stages, since their discovery to their use on
a large scale. They are based on elementary mechanisms which run the processing
throu... | [
{
"created": "Thu, 23 Apr 2009 10:38:24 GMT",
"version": "v1"
}
] | 2009-04-24 | [
[
"Karnyanszky",
"Tiberiu Marius",
""
],
[
"Titu",
"Mihai",
""
]
] | The unconventional technologies, currently applied at a certain category of materials, difficult to be processed through usual techniques, have undergone during the last 60 years all the stages, since their discovery to their use on a large scale. They are based on elementary mechanisms which run the processing through... |
1705.07687 | Aitor Garcia Pablos | Aitor Garc\'ia-Pablos, Montse Cuadros, German Rigau | W2VLDA: Almost Unsupervised System for Aspect Based Sentiment Analysis | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the increase of online customer opinions in specialised websites and
social networks, the necessity of automatic systems to help to organise and
classify customer reviews by domain-specific aspect/categories and sentiment
polarity is more important than ever. Supervised approaches to Aspect Based
Sentiment Analy... | [
{
"created": "Mon, 22 May 2017 12:01:10 GMT",
"version": "v1"
},
{
"created": "Tue, 18 Jul 2017 07:36:48 GMT",
"version": "v2"
}
] | 2017-07-19 | [
[
"García-Pablos",
"Aitor",
""
],
[
"Cuadros",
"Montse",
""
],
[
"Rigau",
"German",
""
]
] | With the increase of online customer opinions in specialised websites and social networks, the necessity of automatic systems to help to organise and classify customer reviews by domain-specific aspect/categories and sentiment polarity is more important than ever. Supervised approaches to Aspect Based Sentiment Analysi... |
1908.11248 | Josef Mal\'ik | Josef Mal\'ik, Ond\v{r}ej Such\'y, Tom\'a\v{s} Valla | Efficient Implementation of Color Coding Algorithm for Subgraph
Isomorphism Problem | Extended abstract of this paper will appear in the proceedings of the
Special Event on Analysis of Experimental Algorithms, SEA2 2019, Lecture
Notes in Computer Science, Springer | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the subgraph isomorphism problem where, given two graphs G
(source graph) and F (pattern graph), one is to decide whether there is a (not
necessarily induced) subgraph of G isomorphic to F. While many practical
heuristic algorithms have been developed for the problem, as pointed out by
McCreesh et al. [JA... | [
{
"created": "Thu, 29 Aug 2019 14:15:11 GMT",
"version": "v1"
}
] | 2019-08-30 | [
[
"Malík",
"Josef",
""
],
[
"Suchý",
"Ondřej",
""
],
[
"Valla",
"Tomáš",
""
]
] | We consider the subgraph isomorphism problem where, given two graphs G (source graph) and F (pattern graph), one is to decide whether there is a (not necessarily induced) subgraph of G isomorphic to F. While many practical heuristic algorithms have been developed for the problem, as pointed out by McCreesh et al. [JAIR... |
0908.0570 | Piyush Rai | Piyush Rai and Hal Daum\'e III | The Infinite Hierarchical Factor Regression Model | null | NIPS 2008 | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a nonparametric Bayesian factor regression model that accounts for
uncertainty in the number of factors, and the relationship between factors. To
accomplish this, we propose a sparse variant of the Indian Buffet Process and
couple this with a hierarchical model over factors, based on Kingman's
coalescent. ... | [
{
"created": "Wed, 5 Aug 2009 01:10:09 GMT",
"version": "v1"
}
] | 2009-08-06 | [
[
"Rai",
"Piyush",
""
],
[
"Daumé",
"Hal",
"III"
]
] | We propose a nonparametric Bayesian factor regression model that accounts for uncertainty in the number of factors, and the relationship between factors. To accomplish this, we propose a sparse variant of the Indian Buffet Process and couple this with a hierarchical model over factors, based on Kingman's coalescent. We... |
2110.14844 | Haonan Wang | Yao Zhou, Haonan Wang, Jingrui He, Haixun Wang | From Intrinsic to Counterfactual: On the Explainability of
Contextualized Recommender Systems | null | null | null | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the prevalence of deep learning based embedding approaches, recommender
systems have become a proven and indispensable tool in various information
filtering applications. However, many of them remain difficult to diagnose what
aspects of the deep models' input drive the final ranking decision, thus, they
cannot ... | [
{
"created": "Thu, 28 Oct 2021 01:54:04 GMT",
"version": "v1"
}
] | 2021-10-29 | [
[
"Zhou",
"Yao",
""
],
[
"Wang",
"Haonan",
""
],
[
"He",
"Jingrui",
""
],
[
"Wang",
"Haixun",
""
]
] | With the prevalence of deep learning based embedding approaches, recommender systems have become a proven and indispensable tool in various information filtering applications. However, many of them remain difficult to diagnose what aspects of the deep models' input drive the final ranking decision, thus, they cannot of... |
2207.00308 | Fabrizio d'Amore | Fabrizio d'Amore | Quality increases as the error rate decreases | 6 pages + 1 page author info | null | null | null | cs.SE | http://creativecommons.org/licenses/by-sa/4.0/ | In this paper we propose an approach to the design of processes and software
that aims at decreasing human and software errors, that so frequently happen,
making affected people using and wasting a lot of time for the need of fixing
the errors. We base our statements on the natural relationship between quality
and er... | [
{
"created": "Fri, 1 Jul 2022 09:55:46 GMT",
"version": "v1"
}
] | 2022-07-04 | [
[
"d'Amore",
"Fabrizio",
""
]
] | In this paper we propose an approach to the design of processes and software that aims at decreasing human and software errors, that so frequently happen, making affected people using and wasting a lot of time for the need of fixing the errors. We base our statements on the natural relationship between quality and erro... |
1708.04202 | Marwin Segler | Marwin H.S. Segler, Mike Preuss, Mark P. Waller | Learning to Plan Chemical Syntheses | null | Nature 555 (2018), 604-610 | 10.1038/nature25978 | null | cs.AI cs.LG physics.chem-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | From medicines to materials, small organic molecules are indispensable for
human well-being. To plan their syntheses, chemists employ a problem solving
technique called retrosynthesis. In retrosynthesis, target molecules are
recursively transformed into increasingly simpler precursor compounds until a
set of readily ... | [
{
"created": "Mon, 14 Aug 2017 16:46:08 GMT",
"version": "v1"
}
] | 2018-04-17 | [
[
"Segler",
"Marwin H. S.",
""
],
[
"Preuss",
"Mike",
""
],
[
"Waller",
"Mark P.",
""
]
] | From medicines to materials, small organic molecules are indispensable for human well-being. To plan their syntheses, chemists employ a problem solving technique called retrosynthesis. In retrosynthesis, target molecules are recursively transformed into increasingly simpler precursor compounds until a set of readily av... |
2009.08270 | Saloni Dash | Saloni Dash, Vineeth N Balasubramanian, Amit Sharma | Evaluating and Mitigating Bias in Image Classifiers: A Causal
Perspective Using Counterfactuals | Accepted for Publication at WACV 2022 | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Counterfactual examples for an input -- perturbations that change specific
features but not others -- have been shown to be useful for evaluating bias of
machine learning models, e.g., against specific demographic groups. However,
generating counterfactual examples for images is non-trivial due to the
underlying caus... | [
{
"created": "Thu, 17 Sep 2020 13:19:31 GMT",
"version": "v1"
},
{
"created": "Fri, 18 Dec 2020 07:52:28 GMT",
"version": "v2"
},
{
"created": "Wed, 3 Feb 2021 09:12:31 GMT",
"version": "v3"
},
{
"created": "Thu, 6 Jan 2022 12:40:39 GMT",
"version": "v4"
}
] | 2022-01-07 | [
[
"Dash",
"Saloni",
""
],
[
"Balasubramanian",
"Vineeth N",
""
],
[
"Sharma",
"Amit",
""
]
] | Counterfactual examples for an input -- perturbations that change specific features but not others -- have been shown to be useful for evaluating bias of machine learning models, e.g., against specific demographic groups. However, generating counterfactual examples for images is non-trivial due to the underlying causal... |
2406.09553 | Umur Aybars Ciftci | Umur Aybars Ciftci, Ali Kemal Tanriverdi, Ilke Demir | My Body My Choice: Human-Centric Full-Body Anonymization | AI for Content Creation Workshop @ CVPR 2024 | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In an era of increasing privacy concerns for our online presence, we propose
that the decision to appear in a piece of content should only belong to the
owner of the body. Although some automatic approaches for full-body
anonymization have been proposed, human-guided anonymization can adapt to
various contexts, such ... | [
{
"created": "Thu, 13 Jun 2024 19:40:30 GMT",
"version": "v1"
}
] | 2024-06-17 | [
[
"Ciftci",
"Umur Aybars",
""
],
[
"Tanriverdi",
"Ali Kemal",
""
],
[
"Demir",
"Ilke",
""
]
] | In an era of increasing privacy concerns for our online presence, we propose that the decision to appear in a piece of content should only belong to the owner of the body. Although some automatic approaches for full-body anonymization have been proposed, human-guided anonymization can adapt to various contexts, such as... |
2407.07742 | Ekram Hossain | Atefeh Termehchi, Ekram Hossain, and Isaac Woungang | Science-Informed Deep Learning (ScIDL) With Applications to Wireless
Communications | null | null | null | null | cs.IT cs.LG cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given the extensive and growing capabilities offered by deep learning (DL),
more researchers are turning to DL to address complex challenges in
next-generation (xG) communications. However, despite its progress, DL also
reveals several limitations that are becoming increasingly evident. One
significant issue is its l... | [
{
"created": "Sat, 29 Jun 2024 02:35:39 GMT",
"version": "v1"
}
] | 2024-07-11 | [
[
"Termehchi",
"Atefeh",
""
],
[
"Hossain",
"Ekram",
""
],
[
"Woungang",
"Isaac",
""
]
] | Given the extensive and growing capabilities offered by deep learning (DL), more researchers are turning to DL to address complex challenges in next-generation (xG) communications. However, despite its progress, DL also reveals several limitations that are becoming increasingly evident. One significant issue is its lac... |
2204.08883 | Liwei Yuan | Liwei Yuan and Hideaki Ishii | Event-triggered Approximate Byzantine Consensus with Multi-hop
Communication | arXiv admin note: text overlap with arXiv:2201.03214 | null | 10.1109/TSP.2023.3266975 | null | cs.MA cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider a resilient consensus problem for the multi-agent
network where some of the agents are subject to Byzantine attacks and may
transmit erroneous state values to their neighbors. In particular, we develop
an event-triggered update rule to tackle this problem as well as reduce the
communication... | [
{
"created": "Tue, 19 Apr 2022 13:29:02 GMT",
"version": "v1"
}
] | 2023-06-07 | [
[
"Yuan",
"Liwei",
""
],
[
"Ishii",
"Hideaki",
""
]
] | In this paper, we consider a resilient consensus problem for the multi-agent network where some of the agents are subject to Byzantine attacks and may transmit erroneous state values to their neighbors. In particular, we develop an event-triggered update rule to tackle this problem as well as reduce the communication f... |
1505.00908 | Ludovic Denoyer | Aur\'elia L\'eon and Ludovic Denoyer | Reinforced Decision Trees | null | null | null | Accepted as a poster at EWRL 2015 | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to speed-up classification models when facing a large number of
categories, one usual approach consists in organizing the categories in a
particular structure, this structure being then used as a way to speed-up the
prediction computation. This is for example the case when using
error-correcting codes or eve... | [
{
"created": "Tue, 5 May 2015 07:58:40 GMT",
"version": "v1"
}
] | 2015-11-26 | [
[
"Léon",
"Aurélia",
""
],
[
"Denoyer",
"Ludovic",
""
]
] | In order to speed-up classification models when facing a large number of categories, one usual approach consists in organizing the categories in a particular structure, this structure being then used as a way to speed-up the prediction computation. This is for example the case when using error-correcting codes or even ... |
0802.2869 | Pascal Weil | Wouter Gelade, Frank Neven | Succinctness of the Complement and Intersection of Regular Expressions | null | Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008) | null | null | cs.CC | null | We study the succinctness of the complement and intersection of regular
expressions. In particular, we show that when constructing a regular expression
defining the complement of a given regular expression, a double exponential
size increase cannot be avoided. Similarly, when constructing a regular
expression definin... | [
{
"created": "Wed, 20 Feb 2008 14:40:53 GMT",
"version": "v1"
}
] | 2008-02-21 | [
[
"Gelade",
"Wouter",
""
],
[
"Neven",
"Frank",
""
]
] | We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the complement of a given regular expression, a double exponential size increase cannot be avoided. Similarly, when constructing a regular expression defining ... |
2104.03634 | Pablo Pueyo | Pablo Pueyo, Eduardo Montijano, Ana C. Murillo and Mac Schwager | CineMPC: Controlling Camera Intrinsics and Extrinsics for Autonomous
Cinematography | null | null | null | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present CineMPC, an algorithm to autonomously control a UAV-borne video
camera in a nonlinear Model Predicted Control (MPC) loop. CineMPC controls both
the position and orientation of the camera -- the camera extrinsics -- as well
as the lens focal length, focal distance, and aperture -- the camera
intrinsics. Whi... | [
{
"created": "Thu, 8 Apr 2021 09:36:24 GMT",
"version": "v1"
},
{
"created": "Thu, 3 Feb 2022 10:32:46 GMT",
"version": "v2"
},
{
"created": "Tue, 22 Feb 2022 12:09:11 GMT",
"version": "v3"
}
] | 2022-02-23 | [
[
"Pueyo",
"Pablo",
""
],
[
"Montijano",
"Eduardo",
""
],
[
"Murillo",
"Ana C.",
""
],
[
"Schwager",
"Mac",
""
]
] | We present CineMPC, an algorithm to autonomously control a UAV-borne video camera in a nonlinear Model Predicted Control (MPC) loop. CineMPC controls both the position and orientation of the camera -- the camera extrinsics -- as well as the lens focal length, focal distance, and aperture -- the camera intrinsics. While... |
2404.04344 | Tom Hanika | Tom Hanika and Robert J\"aschke | A Repository for Formal Contexts | 16 pages | null | null | null | cs.AI cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data is always at the center of the theoretical development and investigation
of the applicability of formal concept analysis. It is therefore not surprising
that a large number of data sets are repeatedly used in scholarly articles and
software tools, acting as de facto standard data sets. However, the
distribution ... | [
{
"created": "Fri, 5 Apr 2024 18:27:04 GMT",
"version": "v1"
}
] | 2024-04-09 | [
[
"Hanika",
"Tom",
""
],
[
"Jäschke",
"Robert",
""
]
] | Data is always at the center of the theoretical development and investigation of the applicability of formal concept analysis. It is therefore not surprising that a large number of data sets are repeatedly used in scholarly articles and software tools, acting as de facto standard data sets. However, the distribution of... |
2312.09501 | Longzhong Lin | Longzhong Lin, Xuewu Lin, Tianwei Lin, Lichao Huang, Rong Xiong, Yue
Wang | EDA: Evolving and Distinct Anchors for Multimodal Motion Prediction | Thirty-Eighth AAAI Conference on Artificial Intelligence (AAAI2024) | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motion prediction is a crucial task in autonomous driving, and one of its
major challenges lands in the multimodality of future behaviors. Many
successful works have utilized mixture models which require identification of
positive mixture components, and correspondingly fall into two main lines:
prediction-based and ... | [
{
"created": "Fri, 15 Dec 2023 02:55:24 GMT",
"version": "v1"
}
] | 2023-12-18 | [
[
"Lin",
"Longzhong",
""
],
[
"Lin",
"Xuewu",
""
],
[
"Lin",
"Tianwei",
""
],
[
"Huang",
"Lichao",
""
],
[
"Xiong",
"Rong",
""
],
[
"Wang",
"Yue",
""
]
] | Motion prediction is a crucial task in autonomous driving, and one of its major challenges lands in the multimodality of future behaviors. Many successful works have utilized mixture models which require identification of positive mixture components, and correspondingly fall into two main lines: prediction-based and an... |
1804.10331 | Ankur Mallick | Ankur Mallick, Malhar Chaudhari, Utsav Sheth, Ganesh Palanikumar,
Gauri Joshi | Rateless Codes for Near-Perfect Load Balancing in Distributed
Matrix-Vector Multiplication | null | null | null | null | cs.DC cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large-scale machine learning and data mining applications require computer
systems to perform massive matrix-vector and matrix-matrix multiplication
operations that need to be parallelized across multiple nodes. The presence of
straggling nodes -- computing nodes that unpredictably slowdown or fail -- is a
major bott... | [
{
"created": "Fri, 27 Apr 2018 03:41:04 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Apr 2018 15:06:01 GMT",
"version": "v2"
},
{
"created": "Tue, 30 Oct 2018 02:15:33 GMT",
"version": "v3"
},
{
"created": "Wed, 31 Oct 2018 23:45:53 GMT",
"version": "v4"
},
{
"c... | 2019-11-01 | [
[
"Mallick",
"Ankur",
""
],
[
"Chaudhari",
"Malhar",
""
],
[
"Sheth",
"Utsav",
""
],
[
"Palanikumar",
"Ganesh",
""
],
[
"Joshi",
"Gauri",
""
]
] | Large-scale machine learning and data mining applications require computer systems to perform massive matrix-vector and matrix-matrix multiplication operations that need to be parallelized across multiple nodes. The presence of straggling nodes -- computing nodes that unpredictably slowdown or fail -- is a major bottle... |
1809.08004 | Francesco Tudisco | Francesca Arrigo and Francesco Tudisco | Multi-Dimensional, Multilayer, Nonlinear and Dynamic HITS | null | null | null | null | cs.SI cs.LG math.NA physics.data-an | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a ranking model for temporal multi-dimensional weighted and
directed networks based on the Perron eigenvector of a multi-homogeneous
order-preserving map. The model extends to the temporal multilayer setting the
HITS algorithm and defines five centrality vectors: two for the nodes, two for
the layers, an... | [
{
"created": "Fri, 21 Sep 2018 09:27:59 GMT",
"version": "v1"
}
] | 2018-09-24 | [
[
"Arrigo",
"Francesca",
""
],
[
"Tudisco",
"Francesco",
""
]
] | We introduce a ranking model for temporal multi-dimensional weighted and directed networks based on the Perron eigenvector of a multi-homogeneous order-preserving map. The model extends to the temporal multilayer setting the HITS algorithm and defines five centrality vectors: two for the nodes, two for the layers, and ... |
2105.03074 | Ivan Tjuawinata | Ivan Tjuawinata and Chaoping Xing | Leakage-Resilient Secret Sharing with Constant Share Size | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the leakage resilience of AG code-based ramp secret sharing
schemes extending the leakage resilience of linear threshold secret sharing
schemes over prime fields done by Benhamouda et al. Since there is not any
explicit efficient construction of AG codes over prime fields, we consider
constructions over p... | [
{
"created": "Fri, 7 May 2021 05:59:22 GMT",
"version": "v1"
},
{
"created": "Sun, 30 May 2021 02:03:26 GMT",
"version": "v2"
}
] | 2021-06-01 | [
[
"Tjuawinata",
"Ivan",
""
],
[
"Xing",
"Chaoping",
""
]
] | We consider the leakage resilience of AG code-based ramp secret sharing schemes extending the leakage resilience of linear threshold secret sharing schemes over prime fields done by Benhamouda et al. Since there is not any explicit efficient construction of AG codes over prime fields, we consider constructions over pri... |
2307.05916 | Peter Kim | Peter Yongho Kim, Junbeom Kwon, Sunghwan Joo, Sangyoon Bae, Donggyu
Lee, Yoonho Jung, Shinjae Yoo, Jiook Cha, Taesup Moon | SwiFT: Swin 4D fMRI Transformer | NeurIPS 2023 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Modeling spatiotemporal brain dynamics from high-dimensional data, such as
functional Magnetic Resonance Imaging (fMRI), is a formidable task in
neuroscience. Existing approaches for fMRI analysis utilize hand-crafted
features, but the process of feature extraction risks losing essential
information in fMRI scans. To... | [
{
"created": "Wed, 12 Jul 2023 04:53:36 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Oct 2023 04:54:00 GMT",
"version": "v2"
}
] | 2023-11-01 | [
[
"Kim",
"Peter Yongho",
""
],
[
"Kwon",
"Junbeom",
""
],
[
"Joo",
"Sunghwan",
""
],
[
"Bae",
"Sangyoon",
""
],
[
"Lee",
"Donggyu",
""
],
[
"Jung",
"Yoonho",
""
],
[
"Yoo",
"Shinjae",
""
],
[
"Cha",
... | Modeling spatiotemporal brain dynamics from high-dimensional data, such as functional Magnetic Resonance Imaging (fMRI), is a formidable task in neuroscience. Existing approaches for fMRI analysis utilize hand-crafted features, but the process of feature extraction risks losing essential information in fMRI scans. To a... |
2310.13307 | Soyeong Jeong | Soyeong Jeong, Jinheon Baek, Sukmin Cho, Sung Ju Hwang, Jong C. Park | Test-Time Self-Adaptive Small Language Models for Question Answering | EMNLP Findings 2023 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent instruction-finetuned large language models (LMs) have achieved
notable performances in various tasks, such as question-answering (QA).
However, despite their ability to memorize a vast amount of general knowledge
across diverse tasks, they might be suboptimal on specific tasks due to their
limited capacity to... | [
{
"created": "Fri, 20 Oct 2023 06:49:32 GMT",
"version": "v1"
}
] | 2023-10-23 | [
[
"Jeong",
"Soyeong",
""
],
[
"Baek",
"Jinheon",
""
],
[
"Cho",
"Sukmin",
""
],
[
"Hwang",
"Sung Ju",
""
],
[
"Park",
"Jong C.",
""
]
] | Recent instruction-finetuned large language models (LMs) have achieved notable performances in various tasks, such as question-answering (QA). However, despite their ability to memorize a vast amount of general knowledge across diverse tasks, they might be suboptimal on specific tasks due to their limited capacity to t... |
2102.00785 | Akrati Saxena | Akrati Saxena, George Fletcher, Mykola Pechenizkiy | NodeSim: Node Similarity based Network Embedding for Diverse Link
Prediction | null | null | null | null | cs.SI | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In real-world complex networks, understanding the dynamics of their evolution
has been of great interest to the scientific community. Predicting future links
is an essential task of social network analysis as the addition or removal of
the links over time leads to the network evolution. In a network, links can be
cat... | [
{
"created": "Mon, 1 Feb 2021 11:50:29 GMT",
"version": "v1"
}
] | 2021-02-02 | [
[
"Saxena",
"Akrati",
""
],
[
"Fletcher",
"George",
""
],
[
"Pechenizkiy",
"Mykola",
""
]
] | In real-world complex networks, understanding the dynamics of their evolution has been of great interest to the scientific community. Predicting future links is an essential task of social network analysis as the addition or removal of the links over time leads to the network evolution. In a network, links can be categ... |
2312.01468 | Bo Yang | Bo Yang, Xiaoyu Ji, Zizhi Jin, Yushi Cheng, Wenyuan Xu | Exploring Adversarial Robustness of LiDAR-Camera Fusion Model in
Autonomous Driving | null | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Our study assesses the adversarial robustness of LiDAR-camera fusion models
in 3D object detection. We introduce an attack technique that, by simply adding
a limited number of physically constrained adversarial points above a car, can
make the car undetectable by the fusion model. Experimental results reveal that
eve... | [
{
"created": "Sun, 3 Dec 2023 17:48:40 GMT",
"version": "v1"
},
{
"created": "Tue, 9 Jan 2024 06:36:23 GMT",
"version": "v2"
}
] | 2024-01-10 | [
[
"Yang",
"Bo",
""
],
[
"Ji",
"Xiaoyu",
""
],
[
"Jin",
"Zizhi",
""
],
[
"Cheng",
"Yushi",
""
],
[
"Xu",
"Wenyuan",
""
]
] | Our study assesses the adversarial robustness of LiDAR-camera fusion models in 3D object detection. We introduce an attack technique that, by simply adding a limited number of physically constrained adversarial points above a car, can make the car undetectable by the fusion model. Experimental results reveal that even ... |
2304.08981 | Zheng Lian | Zheng Lian, Haiyang Sun, Licai Sun, Kang Chen, Mingyu Xu, Kexin Wang,
Ke Xu, Yu He, Ying Li, Jinming Zhao, Ye Liu, Bin Liu, Jiangyan Yi, Meng Wang,
Erik Cambria, Guoying Zhao, Bj\"orn W. Schuller, Jianhua Tao | MER 2023: Multi-label Learning, Modality Robustness, and Semi-Supervised
Learning | null | null | null | null | cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The first Multimodal Emotion Recognition Challenge (MER 2023) was
successfully held at ACM Multimedia. The challenge focuses on system robustness
and consists of three distinct tracks: (1) MER-MULTI, where participants are
required to recognize both discrete and dimensional emotions; (2) MER-NOISE, in
which noise is ... | [
{
"created": "Tue, 18 Apr 2023 13:23:42 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Sep 2023 04:03:28 GMT",
"version": "v2"
}
] | 2023-09-15 | [
[
"Lian",
"Zheng",
""
],
[
"Sun",
"Haiyang",
""
],
[
"Sun",
"Licai",
""
],
[
"Chen",
"Kang",
""
],
[
"Xu",
"Mingyu",
""
],
[
"Wang",
"Kexin",
""
],
[
"Xu",
"Ke",
""
],
[
"He",
"Yu",
""
],
... | The first Multimodal Emotion Recognition Challenge (MER 2023) was successfully held at ACM Multimedia. The challenge focuses on system robustness and consists of three distinct tracks: (1) MER-MULTI, where participants are required to recognize both discrete and dimensional emotions; (2) MER-NOISE, in which noise is ad... |
2403.17752 | Wangyue Li | Wangyue Li, Liangzhi Li, Tong Xiang, Xiao Liu, Wei Deng, Noa Garcia | Can multiple-choice questions really be useful in detecting the
abilities of LLMs? | LREC-COLING 2024 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Multiple-choice questions (MCQs) are widely used in the evaluation of large
language models (LLMs) due to their simplicity and efficiency. However, there
are concerns about whether MCQs can truly measure LLM's capabilities,
particularly in knowledge-intensive scenarios where long-form generation (LFG)
answers are req... | [
{
"created": "Tue, 26 Mar 2024 14:43:48 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Mar 2024 09:57:05 GMT",
"version": "v2"
},
{
"created": "Thu, 23 May 2024 13:32:25 GMT",
"version": "v3"
}
] | 2024-05-24 | [
[
"Li",
"Wangyue",
""
],
[
"Li",
"Liangzhi",
""
],
[
"Xiang",
"Tong",
""
],
[
"Liu",
"Xiao",
""
],
[
"Deng",
"Wei",
""
],
[
"Garcia",
"Noa",
""
]
] | Multiple-choice questions (MCQs) are widely used in the evaluation of large language models (LLMs) due to their simplicity and efficiency. However, there are concerns about whether MCQs can truly measure LLM's capabilities, particularly in knowledge-intensive scenarios where long-form generation (LFG) answers are requi... |
1511.02325 | Zhenyu Xiao | Zhenyu Xiao, Lin Bai, Jinho Choi | Iterative Joint Beamforming Training with Constant-Amplitude Phased
Arrays in Millimeter-Wave Communication | 4 pages | IEEE Communications Letters, vol. 18, no. 5, pp. 829-832, May 2014 | 10.1109/LCOMM.2014.040214.140351 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In millimeter-wave communications (MMWC), in order to compensate for high
propagation attenuation, phased arrays are favored to achieve array gain by
beamforming, where transmitting and receiving antenna arrays need to be jointly
trained to obtain appropriate antenna weight vectors (AWVs). Since the
amplitude of each... | [
{
"created": "Sat, 7 Nov 2015 08:59:39 GMT",
"version": "v1"
}
] | 2016-11-15 | [
[
"Xiao",
"Zhenyu",
""
],
[
"Bai",
"Lin",
""
],
[
"Choi",
"Jinho",
""
]
] | In millimeter-wave communications (MMWC), in order to compensate for high propagation attenuation, phased arrays are favored to achieve array gain by beamforming, where transmitting and receiving antenna arrays need to be jointly trained to obtain appropriate antenna weight vectors (AWVs). Since the amplitude of each e... |
2110.12243 | Michael Kranzlein | Michael Kranzlein, Emma Manning, Siyao Peng, Shira Wein, Aryaman
Arora, Bradford Salen, Nathan Schneider | PASTRIE: A Corpus of Prepositions Annotated with Supersense Tags in
Reddit International English | Expanded from the version published at the Linguistic Annotation
Workshop 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the Prepositions Annotated with Supersense Tags in Reddit
International English ("PASTRIE") corpus, a new dataset containing manually
annotated preposition supersenses of English data from presumed speakers of
four L1s: English, French, German, and Spanish. The annotations are
comprehensive, covering all p... | [
{
"created": "Sat, 23 Oct 2021 15:22:45 GMT",
"version": "v1"
}
] | 2021-10-26 | [
[
"Kranzlein",
"Michael",
""
],
[
"Manning",
"Emma",
""
],
[
"Peng",
"Siyao",
""
],
[
"Wein",
"Shira",
""
],
[
"Arora",
"Aryaman",
""
],
[
"Salen",
"Bradford",
""
],
[
"Schneider",
"Nathan",
""
]
] | We present the Prepositions Annotated with Supersense Tags in Reddit International English ("PASTRIE") corpus, a new dataset containing manually annotated preposition supersenses of English data from presumed speakers of four L1s: English, French, German, and Spanish. The annotations are comprehensive, covering all pre... |
1902.05795 | Yuhui Wang | Yuhui Wang, Hao He, Xiaoyang Tan | Robust Reinforcement Learning in POMDPs with Incomplete and Noisy
Observations | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In real-world scenarios, the observation data for reinforcement learning with
continuous control is commonly noisy and part of it may be dynamically missing
over time, which violates the assumption of many current methods developed for
this. We addressed the issue within the framework of partially observable
Markov D... | [
{
"created": "Fri, 15 Feb 2019 12:47:50 GMT",
"version": "v1"
}
] | 2019-02-18 | [
[
"Wang",
"Yuhui",
""
],
[
"He",
"Hao",
""
],
[
"Tan",
"Xiaoyang",
""
]
] | In real-world scenarios, the observation data for reinforcement learning with continuous control is commonly noisy and part of it may be dynamically missing over time, which violates the assumption of many current methods developed for this. We addressed the issue within the framework of partially observable Markov Dec... |
2307.05260 | Ashutosh Modi | Abhinav Joshi and Akshat Sharma and Sai Kiran Tanikella and Ashutosh
Modi | U-CREAT: Unsupervised Case Retrieval using Events extrAcTion | Accepted at ACL 2023, 15 pages (12 main + 3 Appendix) | null | null | null | cs.IR cs.AI cs.CL cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The task of Prior Case Retrieval (PCR) in the legal domain is about
automatically citing relevant (based on facts and precedence) prior legal cases
in a given query case. To further promote research in PCR, in this paper, we
propose a new large benchmark (in English) for the PCR task: IL-PCR (Indian
Legal Prior Case ... | [
{
"created": "Tue, 11 Jul 2023 13:51:12 GMT",
"version": "v1"
}
] | 2023-07-12 | [
[
"Joshi",
"Abhinav",
""
],
[
"Sharma",
"Akshat",
""
],
[
"Tanikella",
"Sai Kiran",
""
],
[
"Modi",
"Ashutosh",
""
]
] | The task of Prior Case Retrieval (PCR) in the legal domain is about automatically citing relevant (based on facts and precedence) prior legal cases in a given query case. To further promote research in PCR, in this paper, we propose a new large benchmark (in English) for the PCR task: IL-PCR (Indian Legal Prior Case Re... |
1205.2350 | Samir Medjiah | Samir Medjiah (LaBRI), Toufik Ahmed (LaBRI), Francine Krief (LaBRI) | AGEM: Adaptive Greedy-Compass Energy-aware Multipath Routing Protocol
for WMSNs | null | 7th IEEE Consumer Communications and Networking Conference (CCNC),
2010, Las Vegas : United States (2010) | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an Adaptive Greedy-compass Energy-aware Multipath
protocol (AGEM), a novel routing protocol for wireless multimedia sensors
networks (WMSNs). AGEM uses sensors node positions to make packet forwarding
decisions. These decisions are made online, at each forwarding node, in such a
way that there is ... | [
{
"created": "Thu, 10 May 2012 19:15:46 GMT",
"version": "v1"
}
] | 2012-05-11 | [
[
"Medjiah",
"Samir",
"",
"LaBRI"
],
[
"Ahmed",
"Toufik",
"",
"LaBRI"
],
[
"Krief",
"Francine",
"",
"LaBRI"
]
] | This paper presents an Adaptive Greedy-compass Energy-aware Multipath protocol (AGEM), a novel routing protocol for wireless multimedia sensors networks (WMSNs). AGEM uses sensors node positions to make packet forwarding decisions. These decisions are made online, at each forwarding node, in such a way that there is no... |
1409.4977 | Meghana Nasre Ms. | Pratik Ghoshal, Meghana Nasre, Prajakta Nimbhorkar | Rank Maximal Matchings -- Structure and Algorithms | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P
denotes a set of posts and ranks on the edges denote preferences of the agents
over posts. A matching M in G is rank-maximal if it matches the maximum number
of applicants to their top-rank post, subject to this, the maximum number of
applican... | [
{
"created": "Wed, 17 Sep 2014 12:57:52 GMT",
"version": "v1"
}
] | 2014-09-18 | [
[
"Ghoshal",
"Pratik",
""
],
[
"Nasre",
"Meghana",
""
],
[
"Nimbhorkar",
"Prajakta",
""
]
] | Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M in G is rank-maximal if it matches the maximum number of applicants to their top-rank post, subject to this, the maximum number of applicants... |
2403.05063 | Jianxun Lian | Wensheng Lu, Jianxun Lian, Wei Zhang, Guanghua Li, Mingyang Zhou, Hao
Liao, Xing Xie | Aligning Large Language Models for Controllable Recommendations | 14 pages; Accepted by ACL 2024 main conference | null | null | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Inspired by the exceptional general intelligence of Large Language Models
(LLMs), researchers have begun to explore their application in pioneering the
next generation of recommender systems - systems that are conversational,
explainable, and controllable. However, existing literature primarily
concentrates on integr... | [
{
"created": "Fri, 8 Mar 2024 05:23:27 GMT",
"version": "v1"
},
{
"created": "Sun, 4 Aug 2024 11:49:48 GMT",
"version": "v2"
}
] | 2024-08-06 | [
[
"Lu",
"Wensheng",
""
],
[
"Lian",
"Jianxun",
""
],
[
"Zhang",
"Wei",
""
],
[
"Li",
"Guanghua",
""
],
[
"Zhou",
"Mingyang",
""
],
[
"Liao",
"Hao",
""
],
[
"Xie",
"Xing",
""
]
] | Inspired by the exceptional general intelligence of Large Language Models (LLMs), researchers have begun to explore their application in pioneering the next generation of recommender systems - systems that are conversational, explainable, and controllable. However, existing literature primarily concentrates on integrat... |
2406.14162 | Jingwei Ni | Jingwei Ni, Tobias Schimanski, Meihong Lin, Mrinmaya Sachan, Elliott
Ash, Markus Leippold | DIRAS: Efficient LLM-Assisted Annotation of Document Relevance in
Retrieval Augmented Generation | null | null | null | null | cs.IR cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | Retrieval Augmented Generation (RAG) is widely employed to ground responses
to queries on domain-specific documents. But do RAG implementations leave out
important information or excessively include irrelevant information? To allay
these concerns, it is necessary to annotate domain-specific benchmarks to
evaluate inf... | [
{
"created": "Thu, 20 Jun 2024 10:04:09 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Ni",
"Jingwei",
""
],
[
"Schimanski",
"Tobias",
""
],
[
"Lin",
"Meihong",
""
],
[
"Sachan",
"Mrinmaya",
""
],
[
"Ash",
"Elliott",
""
],
[
"Leippold",
"Markus",
""
]
] | Retrieval Augmented Generation (RAG) is widely employed to ground responses to queries on domain-specific documents. But do RAG implementations leave out important information or excessively include irrelevant information? To allay these concerns, it is necessary to annotate domain-specific benchmarks to evaluate infor... |
1606.05210 | Lene M. Favrholdt | Joan Boyar, Lene M. Favrholdt, Christian Kudahl and Jesper W.
Mikkelsen | Weighted Online Problems with Advice | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, the first online complexity class, AOC, was introduced. The class
consists of many online problems where each request must be either accepted or
rejected, and the aim is to either minimize or maximize the number of accepted
requests, while maintaining a feasible solution. All AOC-complete problems
(includin... | [
{
"created": "Thu, 16 Jun 2016 14:47:04 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Aug 2017 11:43:21 GMT",
"version": "v2"
}
] | 2017-08-15 | [
[
"Boyar",
"Joan",
""
],
[
"Favrholdt",
"Lene M.",
""
],
[
"Kudahl",
"Christian",
""
],
[
"Mikkelsen",
"Jesper W.",
""
]
] | Recently, the first online complexity class, AOC, was introduced. The class consists of many online problems where each request must be either accepted or rejected, and the aim is to either minimize or maximize the number of accepted requests, while maintaining a feasible solution. All AOC-complete problems (including ... |
2112.01315 | Christoph Derks | Christoph Derks, Daniel Str\"uber, Thorsten Berger | A Generator Framework For Evolving Variant-Rich Software | 9 pages, 5 figures | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Evolving software is challenging, even more when it exists in many different
variants. Such software evolves not only in time, but also in space--another
dimension of complexity. While evolution in space is supported by a variety of
product-line and variability management tools, many of which originating from
researc... | [
{
"created": "Thu, 2 Dec 2021 15:19:25 GMT",
"version": "v1"
}
] | 2021-12-03 | [
[
"Derks",
"Christoph",
""
],
[
"Strüber",
"Daniel",
""
],
[
"Berger",
"Thorsten",
""
]
] | Evolving software is challenging, even more when it exists in many different variants. Such software evolves not only in time, but also in space--another dimension of complexity. While evolution in space is supported by a variety of product-line and variability management tools, many of which originating from research,... |
2201.02626 | Zhiming Lin | Zhiming Lin | Neighbor2vec: an efficient and effective method for Graph Embedding | null | null | null | null | cs.SI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph embedding techniques have led to significant progress in recent years.
However, present techniques are not effective enough to capture the patterns of
networks. This paper propose neighbor2vec, a neighbor-based sampling strategy
used algorithm to learn the neighborhood representations of node, a framework
to ga... | [
{
"created": "Fri, 7 Jan 2022 16:08:26 GMT",
"version": "v1"
}
] | 2022-01-11 | [
[
"Lin",
"Zhiming",
""
]
] | Graph embedding techniques have led to significant progress in recent years. However, present techniques are not effective enough to capture the patterns of networks. This paper propose neighbor2vec, a neighbor-based sampling strategy used algorithm to learn the neighborhood representations of node, a framework to gath... |
2111.05196 | David Alfonso-Hermelo | David Alfonso-Hermelo, Ahmad Rashid, Abbas Ghaddar, Philippe Langlais,
Mehdi Rezagholizadeh | NATURE: Natural Auxiliary Text Utterances for Realistic Spoken Language
Evaluation | 20 pages, 4 figures, accepted to NeurIPS 2021 Track Datasets and
Benchmarks | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Slot-filling and intent detection are the backbone of conversational agents
such as voice assistants, and are active areas of research. Even though
state-of-the-art techniques on publicly available benchmarks show impressive
performance, their ability to generalize to realistic scenarios is yet to be
demonstrated. In... | [
{
"created": "Tue, 9 Nov 2021 15:09:06 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Jan 2022 17:40:16 GMT",
"version": "v2"
}
] | 2022-01-31 | [
[
"Alfonso-Hermelo",
"David",
""
],
[
"Rashid",
"Ahmad",
""
],
[
"Ghaddar",
"Abbas",
""
],
[
"Langlais",
"Philippe",
""
],
[
"Rezagholizadeh",
"Mehdi",
""
]
] | Slot-filling and intent detection are the backbone of conversational agents such as voice assistants, and are active areas of research. Even though state-of-the-art techniques on publicly available benchmarks show impressive performance, their ability to generalize to realistic scenarios is yet to be demonstrated. In t... |
2204.04372 | Edward Raff | Edward Raff, Andrew L. Farris | A Siren Song of Open Source Reproducibility | To be presented at the ML Evaluation Standards Workshop at ICLR 2022 | null | null | null | cs.LG cs.AI cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As reproducibility becomes a greater concern, conferences have largely
converged to a strategy of asking reviewers to indicate whether code was
attached to a submission. This is part of a larger trend of taking action based
on assumed ideals, without studying if those actions will yield the desired
outcome. Our argum... | [
{
"created": "Sat, 9 Apr 2022 03:06:40 GMT",
"version": "v1"
}
] | 2022-04-12 | [
[
"Raff",
"Edward",
""
],
[
"Farris",
"Andrew L.",
""
]
] | As reproducibility becomes a greater concern, conferences have largely converged to a strategy of asking reviewers to indicate whether code was attached to a submission. This is part of a larger trend of taking action based on assumed ideals, without studying if those actions will yield the desired outcome. Our argumen... |
1911.08743 | Preslav Nakov | Todor Mihaylov, Preslav Nakov | SemanticZ at SemEval-2016 Task 3: Ranking Relevant Answers in Community
Question Answering Using Semantic Similarity Based on Fine-tuned Word
Embeddings | community question answering, semantic similarity | SemEval-2016 | null | null | cs.CL cs.AI cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe our system for finding good answers in a community forum, as
defined in SemEval-2016, Task 3 on Community Question Answering. Our approach
relies on several semantic similarity features based on fine-tuned word
embeddings and topics similarities. In the main Subtask C, our primary
submission was ranked th... | [
{
"created": "Wed, 20 Nov 2019 07:16:16 GMT",
"version": "v1"
}
] | 2019-11-21 | [
[
"Mihaylov",
"Todor",
""
],
[
"Nakov",
"Preslav",
""
]
] | We describe our system for finding good answers in a community forum, as defined in SemEval-2016, Task 3 on Community Question Answering. Our approach relies on several semantic similarity features based on fine-tuned word embeddings and topics similarities. In the main Subtask C, our primary submission was ranked thir... |
1712.05247 | Matthew Piekenbrock | Matthew Piekenbrock, Derek Doran | Intrinsic Point of Interest Discovery from Trajectory Data | 10 pages, 9 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a framework for intrinsic point of interest discovery
from trajectory databases. Intrinsic points of interest are regions of a
geospatial area innately defined by the spatial and temporal aspects of
trajectory data, and can be of varying size, shape, and resolution. Any
trajectory database exhibit... | [
{
"created": "Thu, 14 Dec 2017 14:26:39 GMT",
"version": "v1"
}
] | 2017-12-15 | [
[
"Piekenbrock",
"Matthew",
""
],
[
"Doran",
"Derek",
""
]
] | This paper presents a framework for intrinsic point of interest discovery from trajectory databases. Intrinsic points of interest are regions of a geospatial area innately defined by the spatial and temporal aspects of trajectory data, and can be of varying size, shape, and resolution. Any trajectory database exhibits ... |
1603.02532 | Antti Honkela | Otte Hein\"avaara, Janne Lepp\"a-aho, Jukka Corander and Antti Honkela | On the inconsistency of $\ell_1$-penalised sparse precision matrix
estimation | 9 pages, 10 figures | null | null | null | cs.LG stat.CO stat.ML | http://creativecommons.org/licenses/by/4.0/ | Various $\ell_1$-penalised estimation methods such as graphical lasso and
CLIME are widely used for sparse precision matrix estimation. Many of these
methods have been shown to be consistent under various quantitative assumptions
about the underlying true covariance matrix. Intuitively, these conditions are
related t... | [
{
"created": "Tue, 8 Mar 2016 14:24:11 GMT",
"version": "v1"
}
] | 2016-03-09 | [
[
"Heinävaara",
"Otte",
""
],
[
"Leppä-aho",
"Janne",
""
],
[
"Corander",
"Jukka",
""
],
[
"Honkela",
"Antti",
""
]
] | Various $\ell_1$-penalised estimation methods such as graphical lasso and CLIME are widely used for sparse precision matrix estimation. Many of these methods have been shown to be consistent under various quantitative assumptions about the underlying true covariance matrix. Intuitively, these conditions are related to ... |
1303.5841 | Laghrouche Salah | Jianxing Liu, Salah Laghrouche, M.Harmouche and Maxime Wack | Adaptive-Gain Second Order Sliding Mode Observer Design for Switching
Power Converters | null | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a novel adaptive-gain Second Order Sliding Mode (SOSM)
observer is proposed for multicell converters by considering it as a class of
hybrid systems. The aim is to reduce the number of voltage sensors by
estimating the capacitor voltages only from the measurement of load current.
The proposed observer i... | [
{
"created": "Sat, 23 Mar 2013 12:46:03 GMT",
"version": "v1"
},
{
"created": "Thu, 30 May 2013 16:50:47 GMT",
"version": "v2"
}
] | 2013-05-31 | [
[
"Liu",
"Jianxing",
""
],
[
"Laghrouche",
"Salah",
""
],
[
"Harmouche",
"M.",
""
],
[
"Wack",
"Maxime",
""
]
] | In this paper, a novel adaptive-gain Second Order Sliding Mode (SOSM) observer is proposed for multicell converters by considering it as a class of hybrid systems. The aim is to reduce the number of voltage sensors by estimating the capacitor voltages only from the measurement of load current. The proposed observer is ... |
2407.00031 | Holger R. Roth | Holger R. Roth, Daniel J. Beutel, Yan Cheng, Javier Fernandez Marques,
Heng Pan, Chester Chen, Zhihong Zhang, Yuhong Wen, Sean Yang, Isaac
(Te-Chung) Yang, Yuan-Ting Hsieh, Ziyue Xu, Daguang Xu, Nicholas D. Lane,
Andrew Feng | Supercharging Federated Learning with Flower and NVIDIA FLARE | Added a figure comparing running a Flower application natively or
within FLARE | null | null | null | cs.DC cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Several open-source systems, such as Flower and NVIDIA FLARE, have been
developed in recent years while focusing on different aspects of federated
learning (FL). Flower is dedicated to implementing a cohesive approach to FL,
analytics, and evaluation. Over time, Flower has cultivated extensive
strategies and algorith... | [
{
"created": "Tue, 21 May 2024 21:22:16 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Jul 2024 07:01:48 GMT",
"version": "v2"
}
] | 2024-07-23 | [
[
"Roth",
"Holger R.",
"",
"Te-Chung"
],
[
"Beutel",
"Daniel J.",
"",
"Te-Chung"
],
[
"Cheng",
"Yan",
"",
"Te-Chung"
],
[
"Marques",
"Javier Fernandez",
"",
"Te-Chung"
],
[
"Pan",
"Heng",
"",
"Te-Chung"
],
[
"Che... | Several open-source systems, such as Flower and NVIDIA FLARE, have been developed in recent years while focusing on different aspects of federated learning (FL). Flower is dedicated to implementing a cohesive approach to FL, analytics, and evaluation. Over time, Flower has cultivated extensive strategies and algorithms... |
2306.17140 | Weihao Cheng | Weihao Cheng, Yan-Pei Cao, Ying Shan | ID-Pose: Sparse-view Camera Pose Estimation by Inverting Diffusion
Models | Github: https://xt4d.github.io/id-pose-web/ | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Given sparse views of a 3D object, estimating their camera poses is a
long-standing and intractable problem. Toward this goal, we consider harnessing
the pre-trained diffusion model of novel views conditioned on viewpoints
(Zero-1-to-3). We present ID-Pose which inverses the denoising diffusion
process to estimate th... | [
{
"created": "Thu, 29 Jun 2023 17:41:41 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Nov 2023 18:33:12 GMT",
"version": "v2"
}
] | 2023-12-01 | [
[
"Cheng",
"Weihao",
""
],
[
"Cao",
"Yan-Pei",
""
],
[
"Shan",
"Ying",
""
]
] | Given sparse views of a 3D object, estimating their camera poses is a long-standing and intractable problem. Toward this goal, we consider harnessing the pre-trained diffusion model of novel views conditioned on viewpoints (Zero-1-to-3). We present ID-Pose which inverses the denoising diffusion process to estimate the ... |
2108.10265 | Xuyang Shen | Xuyang Shen, Jo Plested, Sabrina Caldwell, Tom Gedeon | Exploring Biases and Prejudice of Facial Synthesis via Semantic Latent
Space | 8 pages, 11 figures; accepted by IJCNN2021 | null | null | null | cs.CV cs.CY cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | Deep learning (DL) models are widely used to provide a more convenient and
smarter life. However, biased algorithms will negatively influence us. For
instance, groups targeted by biased algorithms will feel unfairly treated and
even fearful of negative consequences of these biases. This work targets biased
generative... | [
{
"created": "Mon, 23 Aug 2021 16:09:18 GMT",
"version": "v1"
}
] | 2021-08-24 | [
[
"Shen",
"Xuyang",
""
],
[
"Plested",
"Jo",
""
],
[
"Caldwell",
"Sabrina",
""
],
[
"Gedeon",
"Tom",
""
]
] | Deep learning (DL) models are widely used to provide a more convenient and smarter life. However, biased algorithms will negatively influence us. For instance, groups targeted by biased algorithms will feel unfairly treated and even fearful of negative consequences of these biases. This work targets biased generative m... |
1303.2140 | Jeroen Ooms | Jeroen Ooms | Possible Directions for Improving Dependency Versioning in R | null | The R Journal Vol. 5/1, June 2013 | null | null | cs.SE cs.MS stat.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most powerful features of R is its infrastructure for contributed
code. The built-in package manager and complementary repositories provide a
great system for development and exchange of code, and have played an important
role in the growth of the platform towards the de-facto standard in statistical
compu... | [
{
"created": "Fri, 8 Mar 2013 22:32:22 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Nov 2013 18:47:18 GMT",
"version": "v2"
}
] | 2013-11-04 | [
[
"Ooms",
"Jeroen",
""
]
] | One of the most powerful features of R is its infrastructure for contributed code. The built-in package manager and complementary repositories provide a great system for development and exchange of code, and have played an important role in the growth of the platform towards the de-facto standard in statistical computi... |
2209.09188 | Conor Corbin | Conor K. Corbin, Michael Baiocchi, Jonathan H. Chen | Avoiding Biased Clinical Machine Learning Model Performance Estimates in
the Presence of Label Selection | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | When evaluating the performance of clinical machine learning models, one must
consider the deployment population. When the population of patients with
observed labels is only a subset of the deployment population (label
selection), standard model performance estimates on the observed population may
be misleading. In ... | [
{
"created": "Thu, 15 Sep 2022 22:30:14 GMT",
"version": "v1"
}
] | 2022-09-20 | [
[
"Corbin",
"Conor K.",
""
],
[
"Baiocchi",
"Michael",
""
],
[
"Chen",
"Jonathan H.",
""
]
] | When evaluating the performance of clinical machine learning models, one must consider the deployment population. When the population of patients with observed labels is only a subset of the deployment population (label selection), standard model performance estimates on the observed population may be misleading. In th... |
2404.07503 | Ruibo Liu | Ruibo Liu, Jerry Wei, Fangyu Liu, Chenglei Si, Yanzhe Zhang, Jinmeng
Rao, Steven Zheng, Daiyi Peng, Diyi Yang, Denny Zhou, Andrew M. Dai | Best Practices and Lessons Learned on Synthetic Data | In COLM 2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of AI models relies on the availability of large, diverse, and
high-quality datasets, which can be challenging to obtain due to data scarcity,
privacy concerns, and high costs. Synthetic data has emerged as a promising
solution by generating artificial data that mimics real-world patterns. This
paper prov... | [
{
"created": "Thu, 11 Apr 2024 06:34:17 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Aug 2024 20:46:47 GMT",
"version": "v2"
}
] | 2024-08-13 | [
[
"Liu",
"Ruibo",
""
],
[
"Wei",
"Jerry",
""
],
[
"Liu",
"Fangyu",
""
],
[
"Si",
"Chenglei",
""
],
[
"Zhang",
"Yanzhe",
""
],
[
"Rao",
"Jinmeng",
""
],
[
"Zheng",
"Steven",
""
],
[
"Peng",
"Daiyi"... | The success of AI models relies on the availability of large, diverse, and high-quality datasets, which can be challenging to obtain due to data scarcity, privacy concerns, and high costs. Synthetic data has emerged as a promising solution by generating artificial data that mimics real-world patterns. This paper provid... |
2102.03861 | Fares Abu-Dakka Dr. | Matteo Saveriano, Fares J. Abu-Dakka, Aljaz Kramberger, and Luka
Peternel | Dynamic Movement Primitives in Robotics: A Tutorial Survey | 43 pages, 21 figures, 5 tables | null | 10.1177/02783649231201196 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Biological systems, including human beings, have the innate ability to
perform complex tasks in versatile and agile manner. Researchers in
sensorimotor control have tried to understand and formally define this innate
property. The idea, supported by several experimental findings, that biological
systems are able to c... | [
{
"created": "Sun, 7 Feb 2021 17:43:51 GMT",
"version": "v1"
}
] | 2023-09-27 | [
[
"Saveriano",
"Matteo",
""
],
[
"Abu-Dakka",
"Fares J.",
""
],
[
"Kramberger",
"Aljaz",
""
],
[
"Peternel",
"Luka",
""
]
] | Biological systems, including human beings, have the innate ability to perform complex tasks in versatile and agile manner. Researchers in sensorimotor control have tried to understand and formally define this innate property. The idea, supported by several experimental findings, that biological systems are able to com... |
2110.07719 | Eric Wong | Hadi Salman, Saachi Jain, Eric Wong, Aleksander M\k{a}dry | Certified Patch Robustness via Smoothed Vision Transformers | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Certified patch defenses can guarantee robustness of an image classifier to
arbitrary changes within a bounded contiguous region. But, currently, this
robustness comes at a cost of degraded standard accuracies and slower inference
times. We demonstrate how using vision transformers enables significantly
better certif... | [
{
"created": "Mon, 11 Oct 2021 17:44:05 GMT",
"version": "v1"
}
] | 2021-10-18 | [
[
"Salman",
"Hadi",
""
],
[
"Jain",
"Saachi",
""
],
[
"Wong",
"Eric",
""
],
[
"Mądry",
"Aleksander",
""
]
] | Certified patch defenses can guarantee robustness of an image classifier to arbitrary changes within a bounded contiguous region. But, currently, this robustness comes at a cost of degraded standard accuracies and slower inference times. We demonstrate how using vision transformers enables significantly better certifie... |
2312.13240 | Amit Rozner | Amit Rozner, Barak Battash, Ofir Lindenbaum, Lior Wolf | Efficient Verification-Based Face Identification | 10 pages, 5 figures | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | We study the problem of performing face verification with an efficient neural
model $f$. The efficiency of $f$ stems from simplifying the face verification
problem from an embedding nearest neighbor search into a binary problem; each
user has its own neural network $f$. To allow information sharing between
different ... | [
{
"created": "Wed, 20 Dec 2023 18:08:02 GMT",
"version": "v1"
},
{
"created": "Sat, 25 May 2024 17:57:41 GMT",
"version": "v2"
}
] | 2024-05-28 | [
[
"Rozner",
"Amit",
""
],
[
"Battash",
"Barak",
""
],
[
"Lindenbaum",
"Ofir",
""
],
[
"Wolf",
"Lior",
""
]
] | We study the problem of performing face verification with an efficient neural model $f$. The efficiency of $f$ stems from simplifying the face verification problem from an embedding nearest neighbor search into a binary problem; each user has its own neural network $f$. To allow information sharing between different in... |
1409.4097 | Tryphon Georgiou | Lipeng Ning and Tryphon T. Georgiou | Metrics for matrix-valued measures via test functions | null | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is perhaps not widely recognized that certain common notions of distance
between probability measures have an alternative dual interpretation which
compares corresponding functionals against suitable families of test functions.
This dual viewpoint extends in a straightforward manner to suggest metrics
between matr... | [
{
"created": "Sun, 14 Sep 2014 20:19:41 GMT",
"version": "v1"
}
] | 2014-09-16 | [
[
"Ning",
"Lipeng",
""
],
[
"Georgiou",
"Tryphon T.",
""
]
] | It is perhaps not widely recognized that certain common notions of distance between probability measures have an alternative dual interpretation which compares corresponding functionals against suitable families of test functions. This dual viewpoint extends in a straightforward manner to suggest metrics between matrix... |
2102.10287 | Siwen Luo | Siwen Luo, Mengting Wu, Yiwen Gong, Wanying Zhou, Josiah Poon | Deep Structured Feature Networks for Table Detection and Tabular Data
Extraction from Scanned Financial Document Images | Works need further review | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatic table detection in PDF documents has achieved a great success but
tabular data extraction are still challenging due to the integrity and noise
issues in detected table areas. The accurate data extraction is extremely
crucial in finance area. Inspired by this, the aim of this research is
proposing an automat... | [
{
"created": "Sat, 20 Feb 2021 08:21:17 GMT",
"version": "v1"
},
{
"created": "Mon, 23 May 2022 02:37:47 GMT",
"version": "v2"
}
] | 2022-05-24 | [
[
"Luo",
"Siwen",
""
],
[
"Wu",
"Mengting",
""
],
[
"Gong",
"Yiwen",
""
],
[
"Zhou",
"Wanying",
""
],
[
"Poon",
"Josiah",
""
]
] | Automatic table detection in PDF documents has achieved a great success but tabular data extraction are still challenging due to the integrity and noise issues in detected table areas. The accurate data extraction is extremely crucial in finance area. Inspired by this, the aim of this research is proposing an automated... |
1802.09653 | Lujo Bauer | Mahmood Sharif, Lujo Bauer, and Michael K. Reiter | On the Suitability of $L_p$-norms for Creating and Preventing
Adversarial Examples | Appeared in CV-COPS/CVPRW 2018 | null | null | null | cs.CR cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Much research effort has been devoted to better understanding adversarial
examples, which are specially crafted inputs to machine-learning models that
are perceptually similar to benign inputs, but are classified differently
(i.e., misclassified). Both algorithms that create adversarial examples and
strategies for de... | [
{
"created": "Tue, 27 Feb 2018 00:04:12 GMT",
"version": "v1"
},
{
"created": "Sat, 14 Jul 2018 03:54:59 GMT",
"version": "v2"
},
{
"created": "Fri, 27 Jul 2018 13:48:36 GMT",
"version": "v3"
}
] | 2018-07-30 | [
[
"Sharif",
"Mahmood",
""
],
[
"Bauer",
"Lujo",
""
],
[
"Reiter",
"Michael K.",
""
]
] | Much research effort has been devoted to better understanding adversarial examples, which are specially crafted inputs to machine-learning models that are perceptually similar to benign inputs, but are classified differently (i.e., misclassified). Both algorithms that create adversarial examples and strategies for defe... |
2109.12045 | Dimitris Panagopoulos | Dimitris Panagopoulos, Giannis Petousakis, Rustam Stolkin, Grigoris
Nikolaou, Manolis Chiou | A Bayesian-Based Approach to Human Operator Intent Recognition in Remote
Mobile Robot Navigation | 7 pages, 3 figures, 2 Tables, IEEE International Conference SMC 2021 | null | null | null | cs.RO math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the problem of human operator intent recognition during
teleoperated robot navigation. In this context, recognition of the operator's
intended navigational goal, could enable an artificial intelligence (AI) agent
to assist the operator in an advanced human-robot interaction framework. We
propose ... | [
{
"created": "Fri, 24 Sep 2021 16:12:13 GMT",
"version": "v1"
}
] | 2021-09-27 | [
[
"Panagopoulos",
"Dimitris",
""
],
[
"Petousakis",
"Giannis",
""
],
[
"Stolkin",
"Rustam",
""
],
[
"Nikolaou",
"Grigoris",
""
],
[
"Chiou",
"Manolis",
""
]
] | This paper addresses the problem of human operator intent recognition during teleoperated robot navigation. In this context, recognition of the operator's intended navigational goal, could enable an artificial intelligence (AI) agent to assist the operator in an advanced human-robot interaction framework. We propose a ... |
2209.08874 | Kengo Hashimoto | Kengo Hashimoto and Ken-ichi Iwata | Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For a given independent and identically distributed (i.i.d.) source, Huffman
code achieves the optimal average codeword length in the class of instantaneous
code with a single code table. However, it is known that there exist
time-variant encoders, which achieve a shorter average codeword length than the
Huffman code... | [
{
"created": "Mon, 19 Sep 2022 09:29:03 GMT",
"version": "v1"
}
] | 2022-09-20 | [
[
"Hashimoto",
"Kengo",
""
],
[
"Iwata",
"Ken-ichi",
""
]
] | For a given independent and identically distributed (i.i.d.) source, Huffman code achieves the optimal average codeword length in the class of instantaneous code with a single code table. However, it is known that there exist time-variant encoders, which achieve a shorter average codeword length than the Huffman code, ... |
1905.08740 | Konrad Simon Ph.D. | Konrad Simon and J\"orn Behrens | Semi-Lagrangian Subgrid Reconstruction for Advection-Dominant Multiscale
Problems | null | null | null | null | cs.CE cs.NA math.NA physics.ao-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a new framework of numerical multiscale methods for
advection-dominated problems motivated by climate sciences. Current numerical
multiscale methods (MsFEM) work well on stationary elliptic problems but have
difficulties when the model involves dominant lower order terms. Our idea to
overcome the assococ... | [
{
"created": "Tue, 21 May 2019 16:36:34 GMT",
"version": "v1"
},
{
"created": "Fri, 24 May 2019 18:25:49 GMT",
"version": "v2"
}
] | 2019-05-28 | [
[
"Simon",
"Konrad",
""
],
[
"Behrens",
"Jörn",
""
]
] | We introduce a new framework of numerical multiscale methods for advection-dominated problems motivated by climate sciences. Current numerical multiscale methods (MsFEM) work well on stationary elliptic problems but have difficulties when the model involves dominant lower order terms. Our idea to overcome the assococia... |
1907.10178 | Luca Anthony Thiede | Luca Anthony Thiede and Pratik Prabhanjan Brahma | Analyzing the Variety Loss in the Context of Probabilistic Trajectory
Prediction | Accepted for publication at ICCV 2019 | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Trajectory or behavior prediction of traffic agents is an important component
of autonomous driving and robot planning in general. It can be framed as a
probabilistic future sequence generation problem and recent literature has
studied the applicability of generative models in this context. The variety or
Minimum ove... | [
{
"created": "Tue, 23 Jul 2019 23:56:02 GMT",
"version": "v1"
}
] | 2019-07-25 | [
[
"Thiede",
"Luca Anthony",
""
],
[
"Brahma",
"Pratik Prabhanjan",
""
]
] | Trajectory or behavior prediction of traffic agents is an important component of autonomous driving and robot planning in general. It can be framed as a probabilistic future sequence generation problem and recent literature has studied the applicability of generative models in this context. The variety or Minimum over ... |
2306.05036 | Jonas Oppenlaender | Jonas Oppenlaender, Joonas H\"am\"al\"ainen | Mapping the Challenges of HCI: An Application and Evaluation of ChatGPT
and GPT-4 for Mining Insights at Scale | 42 pages, 5 figures, 4 tables | null | null | null | cs.HC cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs), such as ChatGPT and GPT-4, are gaining
wide-spread real world use. Yet, these LLMs are closed source, and little is
known about their performance in real-world use cases. In this paper, we apply
and evaluate the combination of ChatGPT and GPT-4 for the real-world task of
mining insights ... | [
{
"created": "Thu, 8 Jun 2023 08:41:30 GMT",
"version": "v1"
},
{
"created": "Sat, 7 Oct 2023 14:56:40 GMT",
"version": "v2"
},
{
"created": "Tue, 12 Dec 2023 11:57:22 GMT",
"version": "v3"
},
{
"created": "Thu, 4 Jul 2024 11:47:23 GMT",
"version": "v4"
}
] | 2024-07-08 | [
[
"Oppenlaender",
"Jonas",
""
],
[
"Hämäläinen",
"Joonas",
""
]
] | Large language models (LLMs), such as ChatGPT and GPT-4, are gaining wide-spread real world use. Yet, these LLMs are closed source, and little is known about their performance in real-world use cases. In this paper, we apply and evaluate the combination of ChatGPT and GPT-4 for the real-world task of mining insights fr... |
1007.3250 | Laurent Hubert | Elvira Albert, Miguel G\'omez-Zamalloa, Laurent Hubert, German Puebla | Verification of Java Bytecode using Analysis and Transformation of Logic
Programs | null | The International Symposium on Practical Aspects of Declarative
Languages 4354 (2007) 124-139 | 10.1007/978-3-540-69611-7_8 | null | cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | State of the art analyzers in the Logic Programming (LP) paradigm are
nowadays mature and sophisticated. They allow inferring a wide variety of
global properties including termination, bounds on resource consumption, etc.
The aim of this work is to automatically transfer the power of such analysis
tools for LP to the... | [
{
"created": "Mon, 19 Jul 2010 19:46:43 GMT",
"version": "v1"
}
] | 2010-11-22 | [
[
"Albert",
"Elvira",
""
],
[
"Gómez-Zamalloa",
"Miguel",
""
],
[
"Hubert",
"Laurent",
""
],
[
"Puebla",
"German",
""
]
] | State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including termination, bounds on resource consumption, etc. The aim of this work is to automatically transfer the power of such analysis tools for LP to the a... |
cs/9902002 | Kuang-hua Chen | Kuang-hua Chen | Automatic Identification of Subjects for Textual Documents in Digital
Libraries | 7 pages, 6 tables | null | null | null | cs.DL cs.CL | null | The amount of electronic documents in the Internet grows very quickly. How to
effectively identify subjects for documents becomes an important issue. In
past, the researches focus on the behavior of nouns in documents. Although
subjects are composed of nouns, the constituents that determine which nouns are
subjects a... | [
{
"created": "Mon, 1 Feb 1999 11:01:23 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Chen",
"Kuang-hua",
""
]
] | The amount of electronic documents in the Internet grows very quickly. How to effectively identify subjects for documents becomes an important issue. In past, the researches focus on the behavior of nouns in documents. Although subjects are composed of nouns, the constituents that determine which nouns are subjects are... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.