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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2103.16351 | Kun Jin | Kun Jin and Mingyan Liu | Multi-planner intervention in network games with community structures | Accepted in 60th IEEE Conference of Decision and Control 2021 | null | null | null | cs.GT cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network games study the strategic interaction of agents connected through a
network. Interventions in such a game -- actions a coordinator or planner may
take that change the utility of the agents and thus shift the equilibrium
action profile -- are introduced to improve the planner's objective. We study
the problem ... | [
{
"created": "Thu, 25 Mar 2021 18:13:37 GMT",
"version": "v1"
},
{
"created": "Sun, 19 Sep 2021 21:05:20 GMT",
"version": "v2"
}
] | 2021-09-21 | [
[
"Jin",
"Kun",
""
],
[
"Liu",
"Mingyan",
""
]
] | Network games study the strategic interaction of agents connected through a network. Interventions in such a game -- actions a coordinator or planner may take that change the utility of the agents and thus shift the equilibrium action profile -- are introduced to improve the planner's objective. We study the problem of... |
2106.04775 | Luis Torres-Trevi\~no PhD | Luis Torres-Trevi\~no | A 2020 taxonomy of algorithms inspired on living beings behavior | a collection of algorithms names, 24 pages, two figures, 9 tables, a
recompilation | null | null | null | cs.NE cs.AI | http://creativecommons.org/licenses/by/4.0/ | Taking the role of a computer naturalist, a journey is taken through bio
inspired algorithms taking account on algorithms which are inspired on living
being behaviors. A compilation of algorithms is made considering several
reviews or surveys of bio-inspired heuristics and swarm intelligence until 2020
year. A classi... | [
{
"created": "Wed, 9 Jun 2021 02:37:46 GMT",
"version": "v1"
}
] | 2021-06-10 | [
[
"Torres-Treviño",
"Luis",
""
]
] | Taking the role of a computer naturalist, a journey is taken through bio inspired algorithms taking account on algorithms which are inspired on living being behaviors. A compilation of algorithms is made considering several reviews or surveys of bio-inspired heuristics and swarm intelligence until 2020 year. A classifi... |
2307.09793 | Andrew Gao | Sarah Gao, Andrew Kean Gao | On the Origin of LLMs: An Evolutionary Tree and Graph for 15,821 Large
Language Models | 14 pages, 6 figures, 1 table | null | null | null | cs.DL cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Since late 2022, Large Language Models (LLMs) have become very prominent with
LLMs like ChatGPT and Bard receiving millions of users. Hundreds of new LLMs
are announced each week, many of which are deposited to Hugging Face, a
repository of machine learning models and datasets. To date, nearly 16,000 Text
Generation ... | [
{
"created": "Wed, 19 Jul 2023 07:17:43 GMT",
"version": "v1"
}
] | 2023-07-20 | [
[
"Gao",
"Sarah",
""
],
[
"Gao",
"Andrew Kean",
""
]
] | Since late 2022, Large Language Models (LLMs) have become very prominent with LLMs like ChatGPT and Bard receiving millions of users. Hundreds of new LLMs are announced each week, many of which are deposited to Hugging Face, a repository of machine learning models and datasets. To date, nearly 16,000 Text Generation mo... |
2311.08303 | Elliot Schumacher | Elliot Schumacher, Daniel Rosenthal, Varun Nair, Luladay Price,
Geoffrey Tso, Anitha Kannan | Extrinsically-Focused Evaluation of Omissions in Medical Summarization | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | The goal of automated summarization techniques (Paice, 1990; Kupiec et al,
1995) is to condense text by focusing on the most critical information.
Generative large language models (LLMs) have shown to be robust summarizers,
yet traditional metrics struggle to capture resulting performance (Goyal et al,
2022) in more ... | [
{
"created": "Tue, 14 Nov 2023 16:46:15 GMT",
"version": "v1"
}
] | 2023-11-15 | [
[
"Schumacher",
"Elliot",
""
],
[
"Rosenthal",
"Daniel",
""
],
[
"Nair",
"Varun",
""
],
[
"Price",
"Luladay",
""
],
[
"Tso",
"Geoffrey",
""
],
[
"Kannan",
"Anitha",
""
]
] | The goal of automated summarization techniques (Paice, 1990; Kupiec et al, 1995) is to condense text by focusing on the most critical information. Generative large language models (LLMs) have shown to be robust summarizers, yet traditional metrics struggle to capture resulting performance (Goyal et al, 2022) in more po... |
1904.05979 | Hang Zhao | Hang Zhao, Chuang Gan, Wei-Chiu Ma, Antonio Torralba | The Sound of Motions | null | null | null | null | cs.CV cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sounds originate from object motions and vibrations of surrounding air.
Inspired by the fact that humans is capable of interpreting sound sources from
how objects move visually, we propose a novel system that explicitly captures
such motion cues for the task of sound localization and separation. Our system
is compose... | [
{
"created": "Thu, 11 Apr 2019 23:05:52 GMT",
"version": "v1"
}
] | 2019-04-16 | [
[
"Zhao",
"Hang",
""
],
[
"Gan",
"Chuang",
""
],
[
"Ma",
"Wei-Chiu",
""
],
[
"Torralba",
"Antonio",
""
]
] | Sounds originate from object motions and vibrations of surrounding air. Inspired by the fact that humans is capable of interpreting sound sources from how objects move visually, we propose a novel system that explicitly captures such motion cues for the task of sound localization and separation. Our system is composed ... |
cs/0702073 | Pulkit Grover | Pulkit Grover | Tradeoff between decoding complexity and rate for codes on graphs | null | null | null | null | cs.IT cs.CC math.IT | null | We consider transmission over a general memoryless channel, with bounded
decoding complexity per bit under message passing decoding. We show that the
achievable rate is bounded below capacity if there is a finite success in the
decoding in a specified number of operations per bit at the decoder for some
codes on grap... | [
{
"created": "Tue, 13 Feb 2007 03:39:56 GMT",
"version": "v1"
}
] | 2007-07-13 | [
[
"Grover",
"Pulkit",
""
]
] | We consider transmission over a general memoryless channel, with bounded decoding complexity per bit under message passing decoding. We show that the achievable rate is bounded below capacity if there is a finite success in the decoding in a specified number of operations per bit at the decoder for some codes on graphs... |
2202.08114 | Lizhen Zhu | Lizhen Zhu, Brad Wyble, James Z. Wang | Using Navigational Information to Learn Visual Representations | Abstract submission to Computational and Systems Neuroscience
(Cosyne) 2022, accepted | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Children learn to build a visual representation of the world from
unsupervised exploration and we hypothesize that a key part of this learning
ability is the use of self-generated navigational information as a similarity
label to drive a learning objective for self-supervised learning. The goal of
this work is to exp... | [
{
"created": "Thu, 10 Feb 2022 20:17:55 GMT",
"version": "v1"
}
] | 2022-02-17 | [
[
"Zhu",
"Lizhen",
""
],
[
"Wyble",
"Brad",
""
],
[
"Wang",
"James Z.",
""
]
] | Children learn to build a visual representation of the world from unsupervised exploration and we hypothesize that a key part of this learning ability is the use of self-generated navigational information as a similarity label to drive a learning objective for self-supervised learning. The goal of this work is to explo... |
2312.09015 | William Leeney | William Leeney and Ryan McConville | Uncertainty in GNN Learning Evaluations: A Comparison Between Measures
for Quantifying Randomness in GNN Community Detection | 12 pages, 2 figures, contribution from COMPLEX NETWORKS 2023 selected
for a possible publication in the special issue of the journal Entropy
dedicated to the conference. arXiv admin note: substantial text overlap with
arXiv:2305.06026 | null | null | null | cs.LG cs.SI physics.soc-ph | http://creativecommons.org/licenses/by-nc-nd/4.0/ | (1) The enhanced capability of Graph Neural Networks (GNNs) in unsupervised
community detection of clustered nodes is attributed to their capacity to
encode both the connectivity and feature information spaces of graphs. The
identification of latent communities holds practical significance in various
domains, from so... | [
{
"created": "Thu, 14 Dec 2023 15:06:29 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Jan 2024 14:23:03 GMT",
"version": "v2"
}
] | 2024-01-05 | [
[
"Leeney",
"William",
""
],
[
"McConville",
"Ryan",
""
]
] | (1) The enhanced capability of Graph Neural Networks (GNNs) in unsupervised community detection of clustered nodes is attributed to their capacity to encode both the connectivity and feature information spaces of graphs. The identification of latent communities holds practical significance in various domains, from soci... |
1210.4980 | S{\l}awomir Lasota | Miko{\l}aj Boja\'nczyk and S{\l}awomir Lasota | Minimization of semilinear automata | null | null | null | null | cs.LO cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate finite deterministic automata in sets with non-homogeneous
atoms: integers with successor. As there are uncount- ably many deterministic
finite automata in this setting, we restrict our attention to automata with
semilinear transition function. The main re- sults is a minimization procedure
for semilin... | [
{
"created": "Wed, 17 Oct 2012 22:40:53 GMT",
"version": "v1"
}
] | 2012-10-19 | [
[
"Bojańczyk",
"Mikołaj",
""
],
[
"Lasota",
"Sławomir",
""
]
] | We investigate finite deterministic automata in sets with non-homogeneous atoms: integers with successor. As there are uncount- ably many deterministic finite automata in this setting, we restrict our attention to automata with semilinear transition function. The main re- sults is a minimization procedure for semilinea... |
1911.02850 | Rishiraj Saha Roy | Magdalena Kaiser, Rishiraj Saha Roy, Gerhard Weikum | CROWN: Conversational Passage Ranking by Reasoning over Word Networks | TREC 2019, 14 pages | TREC 2019 | null | null | cs.IR cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Information needs around a topic cannot be satisfied in a single turn; users
typically ask follow-up questions referring to the same theme and a system must
be capable of understanding the conversational context of a request to retrieve
correct answers. In this paper, we present our submission to the TREC
Conversatio... | [
{
"created": "Thu, 7 Nov 2019 11:02:21 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Nov 2019 23:54:15 GMT",
"version": "v2"
},
{
"created": "Tue, 11 Feb 2020 10:36:32 GMT",
"version": "v3"
}
] | 2020-02-12 | [
[
"Kaiser",
"Magdalena",
""
],
[
"Roy",
"Rishiraj Saha",
""
],
[
"Weikum",
"Gerhard",
""
]
] | Information needs around a topic cannot be satisfied in a single turn; users typically ask follow-up questions referring to the same theme and a system must be capable of understanding the conversational context of a request to retrieve correct answers. In this paper, we present our submission to the TREC Conversationa... |
1505.00341 | Martin Lackner | Edith Elkind, Martin Lackner | Structure in Dichotomous Preferences | A preliminary version appeared in the proceedings of IJCAI 2015, the
International Joint Conference on Artificial Intelligence | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many hard computational social choice problems are known to become tractable
when voters' preferences belong to a restricted domain, such as those of
single-peaked or single-crossing preferences. However, to date, all algorithmic
results of this type have been obtained for the setting where each voter's
preference li... | [
{
"created": "Sat, 2 May 2015 13:23:21 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Feb 2016 17:25:55 GMT",
"version": "v2"
}
] | 2016-02-12 | [
[
"Elkind",
"Edith",
""
],
[
"Lackner",
"Martin",
""
]
] | Many hard computational social choice problems are known to become tractable when voters' preferences belong to a restricted domain, such as those of single-peaked or single-crossing preferences. However, to date, all algorithmic results of this type have been obtained for the setting where each voter's preference list... |
2204.13695 | Zhang-Wei Hong | Zhang-Wei Hong, Ge Yang, Pulkit Agrawal | Bilinear value networks | null | Published at ICLR 2022 | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | The dominant framework for off-policy multi-goal reinforcement learning
involves estimating goal conditioned Q-value function. When learning to achieve
multiple goals, data efficiency is intimately connected with the generalization
of the Q-function to new goals. The de-facto paradigm is to approximate Q(s, a,
g) usi... | [
{
"created": "Thu, 28 Apr 2022 17:58:48 GMT",
"version": "v1"
},
{
"created": "Thu, 15 Jun 2023 04:32:59 GMT",
"version": "v2"
},
{
"created": "Mon, 26 Jun 2023 21:15:39 GMT",
"version": "v3"
}
] | 2023-06-28 | [
[
"Hong",
"Zhang-Wei",
""
],
[
"Yang",
"Ge",
""
],
[
"Agrawal",
"Pulkit",
""
]
] | The dominant framework for off-policy multi-goal reinforcement learning involves estimating goal conditioned Q-value function. When learning to achieve multiple goals, data efficiency is intimately connected with the generalization of the Q-function to new goals. The de-facto paradigm is to approximate Q(s, a, g) using... |
2204.09975 | Mingsong Chen | Jun Xia, Ting Wang, Jiepin Ding, Xian Wei, Mingsong Chen | Eliminating Backdoor Triggers for Deep Neural Networks Using Attention
Relation Graph Distillation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Due to the prosperity of Artificial Intelligence (AI) techniques, more and
more backdoors are designed by adversaries to attack Deep Neural Networks
(DNNs).Although the state-of-the-art method Neural Attention Distillation (NAD)
can effectively erase backdoor triggers from DNNs, it still suffers from
non-negligible A... | [
{
"created": "Thu, 21 Apr 2022 09:01:22 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Apr 2022 03:22:38 GMT",
"version": "v2"
}
] | 2022-04-26 | [
[
"Xia",
"Jun",
""
],
[
"Wang",
"Ting",
""
],
[
"Ding",
"Jiepin",
""
],
[
"Wei",
"Xian",
""
],
[
"Chen",
"Mingsong",
""
]
] | Due to the prosperity of Artificial Intelligence (AI) techniques, more and more backdoors are designed by adversaries to attack Deep Neural Networks (DNNs).Although the state-of-the-art method Neural Attention Distillation (NAD) can effectively erase backdoor triggers from DNNs, it still suffers from non-negligible Att... |
2208.13252 | Hoang H. Nguyen | Hoang H. Nguyen, Nhat-Minh Nguyen, Chunyao Xie, Zahra Ahmadi, Daniel
Kudendo, Thanh-Nam Doan, Lingxiao Jiang | MANDO: Multi-Level Heterogeneous Graph Embeddings for Fine-Grained
Detection of Smart Contract Vulnerabilities | Accepted at the 9th IEEE International Conference on Data Science and
Advanced Analytics (DSAA 2022 - Research Track) | null | null | null | cs.SE cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Learning heterogeneous graphs consisting of different types of nodes and
edges enhances the results of homogeneous graph techniques. An interesting
example of such graphs is control-flow graphs representing possible software
code execution flows. As such graphs represent more semantic information of
code, developing ... | [
{
"created": "Sun, 28 Aug 2022 17:03:34 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Sep 2022 10:22:10 GMT",
"version": "v2"
}
] | 2022-09-08 | [
[
"Nguyen",
"Hoang H.",
""
],
[
"Nguyen",
"Nhat-Minh",
""
],
[
"Xie",
"Chunyao",
""
],
[
"Ahmadi",
"Zahra",
""
],
[
"Kudendo",
"Daniel",
""
],
[
"Doan",
"Thanh-Nam",
""
],
[
"Jiang",
"Lingxiao",
""
]
] | Learning heterogeneous graphs consisting of different types of nodes and edges enhances the results of homogeneous graph techniques. An interesting example of such graphs is control-flow graphs representing possible software code execution flows. As such graphs represent more semantic information of code, developing te... |
2210.02775 | Adam Polak | Antonios Antoniadis, Joan Boyar, Marek Eli\'a\v{s}, Lene M. Favrholdt,
Ruben Hoeksma, Kim S. Larsen, Adam Polak, Bertrand Simon | Paging with Succinct Predictions | null | null | null | null | cs.LG cs.DS cs.OS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Paging is a prototypical problem in the area of online algorithms. It has
also played a central role in the development of learning-augmented algorithms
-- a recent line of research that aims to ameliorate the shortcomings of
classical worst-case analysis by giving algorithms access to predictions. Such
predictions c... | [
{
"created": "Thu, 6 Oct 2022 09:26:34 GMT",
"version": "v1"
}
] | 2022-10-07 | [
[
"Antoniadis",
"Antonios",
""
],
[
"Boyar",
"Joan",
""
],
[
"Eliáš",
"Marek",
""
],
[
"Favrholdt",
"Lene M.",
""
],
[
"Hoeksma",
"Ruben",
""
],
[
"Larsen",
"Kim S.",
""
],
[
"Polak",
"Adam",
""
],
[
... | Paging is a prototypical problem in the area of online algorithms. It has also played a central role in the development of learning-augmented algorithms -- a recent line of research that aims to ameliorate the shortcomings of classical worst-case analysis by giving algorithms access to predictions. Such predictions can... |
2301.13615 | Drishti Yadav | Ezio Bartocci, Leonardo Mariani, Dejan Nickovic, Drishti Yadav | Property-Based Mutation Testing | Accepted at the 16th IEEE International Conference on Software
Testing, Verification and Validation (ICST) 2023 | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mutation testing is an established software quality assurance technique for
the assessment of test suites. While it is well-suited to estimate the general
fault-revealing capability of a test suite, it is not practical and informative
when the software under test must be validated against specific requirements.
This ... | [
{
"created": "Tue, 31 Jan 2023 13:17:15 GMT",
"version": "v1"
}
] | 2023-02-01 | [
[
"Bartocci",
"Ezio",
""
],
[
"Mariani",
"Leonardo",
""
],
[
"Nickovic",
"Dejan",
""
],
[
"Yadav",
"Drishti",
""
]
] | Mutation testing is an established software quality assurance technique for the assessment of test suites. While it is well-suited to estimate the general fault-revealing capability of a test suite, it is not practical and informative when the software under test must be validated against specific requirements. This is... |
2005.07107 | Alexey Kutalev | Alexey Kutalev | Natural Way to Overcome the Catastrophic Forgetting in Neural Networks | 9 pages, 3 figures | null | 10.25559/SITITO.16.202002.331-337 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Not so long ago, a method was discovered that successfully overcomes the
catastrophic forgetting in neural networks. Although we know about the cases of
using this method to preserve skills when adapting pre-trained networks to
particular tasks, it has not obtained widespread distribution yet. In this
paper, we would... | [
{
"created": "Mon, 27 Apr 2020 11:17:57 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Jun 2021 17:44:46 GMT",
"version": "v2"
}
] | 2021-06-07 | [
[
"Kutalev",
"Alexey",
""
]
] | Not so long ago, a method was discovered that successfully overcomes the catastrophic forgetting in neural networks. Although we know about the cases of using this method to preserve skills when adapting pre-trained networks to particular tasks, it has not obtained widespread distribution yet. In this paper, we would l... |
1808.06887 | Abhinav Valada | Noha Radwan, Wolfram Burgard and Abhinav Valada | Multimodal Interaction-aware Motion Prediction for Autonomous Street
Crossing | The International Journal of Robotics Research (2020) | The International Journal of Robotics Research (IJRR), vol. 39,
no. 13, pp. 1567-1598, 2020 | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For mobile robots navigating on sidewalks, it is essential to be able to
safely cross street intersections. Most existing approaches rely on the
recognition of the traffic light signal to make an informed crossing decision.
Although these approaches have been crucial enablers for urban navigation, the
capabilities of... | [
{
"created": "Tue, 21 Aug 2018 13:18:27 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Aug 2018 20:27:51 GMT",
"version": "v2"
},
{
"created": "Mon, 1 Jul 2019 13:47:16 GMT",
"version": "v3"
},
{
"created": "Thu, 28 May 2020 16:32:54 GMT",
"version": "v4"
},
{
"cr... | 2021-11-05 | [
[
"Radwan",
"Noha",
""
],
[
"Burgard",
"Wolfram",
""
],
[
"Valada",
"Abhinav",
""
]
] | For mobile robots navigating on sidewalks, it is essential to be able to safely cross street intersections. Most existing approaches rely on the recognition of the traffic light signal to make an informed crossing decision. Although these approaches have been crucial enablers for urban navigation, the capabilities of r... |
1909.06767 | Amir Pasha Motamed | Amir Pasha Motamed, Behnam Bahrak | Quantitative analysis of cryptocurrencies transaction graph | null | null | null | null | cs.SI cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cryptocurrencies as a new way of transferring assets and securing financial
transactions have gained popularity in recent years. Transactions in
cryptocurrencies are publicly available, hence, statistical studies on
different aspects of these currencies are possible. However, previous
statistical analysis on cryptocu... | [
{
"created": "Sun, 15 Sep 2019 09:13:50 GMT",
"version": "v1"
}
] | 2019-09-17 | [
[
"Motamed",
"Amir Pasha",
""
],
[
"Bahrak",
"Behnam",
""
]
] | Cryptocurrencies as a new way of transferring assets and securing financial transactions have gained popularity in recent years. Transactions in cryptocurrencies are publicly available, hence, statistical studies on different aspects of these currencies are possible. However, previous statistical analysis on cryptocurr... |
1706.05039 | Rui Zhang | Rui Zhang, Quanyan Zhu | Consensus-Based Transfer Linear Support Vector Machines for
Decentralized Multi-Task Multi-Agent Learning | null | null | null | null | cs.LG cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transfer learning has been developed to improve the performances of different
but related tasks in machine learning. However, such processes become less
efficient with the increase of the size of training data and the number of
tasks. Moreover, privacy can be violated as some tasks may contain sensitive
and private d... | [
{
"created": "Thu, 15 Jun 2017 18:53:11 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Mar 2018 13:45:06 GMT",
"version": "v2"
}
] | 2018-03-28 | [
[
"Zhang",
"Rui",
""
],
[
"Zhu",
"Quanyan",
""
]
] | Transfer learning has been developed to improve the performances of different but related tasks in machine learning. However, such processes become less efficient with the increase of the size of training data and the number of tasks. Moreover, privacy can be violated as some tasks may contain sensitive and private dat... |
2203.15502 | Xiangri Lu | Xiangri Lu, Hongbin Ma, Zhanqing Wang | Analysis of OODA Loop based on Adversarial for Complex Game Environments | null | null | null | null | cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | To address the problem of imperfect confrontation strategy caused by the lack
of information of game environment in the simulation of non-complete
information dynamic countermeasure modeling for intelligent game, the
hierarchical analysis game strategy of confrontation model based on OODA ring
(Observation, Orientati... | [
{
"created": "Fri, 25 Mar 2022 09:17:07 GMT",
"version": "v1"
}
] | 2022-03-30 | [
[
"Lu",
"Xiangri",
""
],
[
"Ma",
"Hongbin",
""
],
[
"Wang",
"Zhanqing",
""
]
] | To address the problem of imperfect confrontation strategy caused by the lack of information of game environment in the simulation of non-complete information dynamic countermeasure modeling for intelligent game, the hierarchical analysis game strategy of confrontation model based on OODA ring (Observation, Orientation... |
2211.14983 | Daniel Garces | Daniel Garces, Sushmita Bhattacharya, Stephanie Gil, Dimitri Bertsekas | Multiagent Reinforcement Learning for Autonomous Routing and Pickup
Problem with Adaptation to Variable Demand | 8 pages, 6 figures, 3 tables, accepted to ICRA 2023 | null | 10.1109/ICRA48891.2023.10161067 | null | cs.MA cs.AI cs.LG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We derive a learning framework to generate routing/pickup policies for a
fleet of autonomous vehicles tasked with servicing stochastically appearing
requests on a city map. We focus on policies that 1) give rise to coordination
amongst the vehicles, thereby reducing wait times for servicing requests, 2)
are non-myopi... | [
{
"created": "Mon, 28 Nov 2022 01:11:11 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Mar 2023 15:18:48 GMT",
"version": "v2"
}
] | 2023-07-07 | [
[
"Garces",
"Daniel",
""
],
[
"Bhattacharya",
"Sushmita",
""
],
[
"Gil",
"Stephanie",
""
],
[
"Bertsekas",
"Dimitri",
""
]
] | We derive a learning framework to generate routing/pickup policies for a fleet of autonomous vehicles tasked with servicing stochastically appearing requests on a city map. We focus on policies that 1) give rise to coordination amongst the vehicles, thereby reducing wait times for servicing requests, 2) are non-myopic,... |
1902.08115 | Gianluca Frison | Gianluca Frison, Tommaso Sartor, Andrea Zanelli, Moritz Diehl | The BLAS API of BLASFEO: optimizing performance for small matrices | null | ACM Transactions on Mathematical Software (TOMS): Volume 46 Issue
2, May 2020 | 10.1145/3378671 | null | cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | BLASFEO is a dense linear algebra library providing high-performance
implementations of BLAS- and LAPACK-like routines for use in embedded
optimization and other applications targeting relatively small matrices.
BLASFEO defines an API which uses a packed matrix format as its native format.
This format is analogous to... | [
{
"created": "Thu, 21 Feb 2019 16:05:43 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Feb 2019 09:15:44 GMT",
"version": "v2"
},
{
"created": "Sun, 22 Sep 2019 10:38:09 GMT",
"version": "v3"
},
{
"created": "Tue, 4 Feb 2020 12:26:49 GMT",
"version": "v4"
}
] | 2020-06-09 | [
[
"Frison",
"Gianluca",
""
],
[
"Sartor",
"Tommaso",
""
],
[
"Zanelli",
"Andrea",
""
],
[
"Diehl",
"Moritz",
""
]
] | BLASFEO is a dense linear algebra library providing high-performance implementations of BLAS- and LAPACK-like routines for use in embedded optimization and other applications targeting relatively small matrices. BLASFEO defines an API which uses a packed matrix format as its native format. This format is analogous to t... |
2209.11704 | Durgakant Pushp | Durgakant Pushp, Swapnil Kalhapure, Kaushik Das and Lantao Liu | UAV-miniUGV Hybrid System for Hidden Area Exploration and Manipulation | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel hybrid system (both hardware and software) of an Unmanned
Aerial Vehicle (UAV) carrying a miniature Unmanned Ground Vehicle (miniUGV) to
perform a complex search and manipulation task. This system leverages
heterogeneous robots to accomplish a task that cannot be done using a single
robot system. I... | [
{
"created": "Fri, 23 Sep 2022 16:24:09 GMT",
"version": "v1"
}
] | 2022-09-26 | [
[
"Pushp",
"Durgakant",
""
],
[
"Kalhapure",
"Swapnil",
""
],
[
"Das",
"Kaushik",
""
],
[
"Liu",
"Lantao",
""
]
] | We propose a novel hybrid system (both hardware and software) of an Unmanned Aerial Vehicle (UAV) carrying a miniature Unmanned Ground Vehicle (miniUGV) to perform a complex search and manipulation task. This system leverages heterogeneous robots to accomplish a task that cannot be done using a single robot system. It ... |
1811.02396 | Paramanand Chandramouli | Paramanand Chandramouli, Samuel Burri, Claudio Bruschini, Edoardo
Charbon and Andreas Kolb | A Bit Too Much? High Speed Imaging from Sparse Photon Counts | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in photographic sensing technologies have made it possible to
achieve light detection in terms of a single photon. Photon counting sensors
are being increasingly used in many diverse applications. We address the
problem of jointly recovering spatial and temporal scene radiance from very few
photon cou... | [
{
"created": "Tue, 6 Nov 2018 15:07:08 GMT",
"version": "v1"
},
{
"created": "Fri, 21 Dec 2018 16:38:09 GMT",
"version": "v2"
},
{
"created": "Sat, 11 May 2019 14:30:00 GMT",
"version": "v3"
}
] | 2019-05-14 | [
[
"Chandramouli",
"Paramanand",
""
],
[
"Burri",
"Samuel",
""
],
[
"Bruschini",
"Claudio",
""
],
[
"Charbon",
"Edoardo",
""
],
[
"Kolb",
"Andreas",
""
]
] | Recent advances in photographic sensing technologies have made it possible to achieve light detection in terms of a single photon. Photon counting sensors are being increasingly used in many diverse applications. We address the problem of jointly recovering spatial and temporal scene radiance from very few photon count... |
1402.5259 | Gattaca Lv | Gattaca Lv | An Analysis of Rank Aggregation Algorithms | null | null | null | null | cs.DS cs.GT cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rank aggregation is an essential approach for aggregating the preferences of
multiple agents. One rule of particular interest is the Kemeny rule, which
maximises the number of pairwise agreements between the final ranking and the
existing rankings. However, Kemeny rankings are NP-hard to compute. This has
resulted in... | [
{
"created": "Fri, 21 Feb 2014 11:25:42 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Feb 2014 12:00:15 GMT",
"version": "v2"
},
{
"created": "Thu, 10 Apr 2014 05:07:10 GMT",
"version": "v3"
},
{
"created": "Sat, 26 Apr 2014 15:16:20 GMT",
"version": "v4"
},
{
"c... | 2014-05-06 | [
[
"Lv",
"Gattaca",
""
]
] | Rank aggregation is an essential approach for aggregating the preferences of multiple agents. One rule of particular interest is the Kemeny rule, which maximises the number of pairwise agreements between the final ranking and the existing rankings. However, Kemeny rankings are NP-hard to compute. This has resulted in t... |
2402.04391 | Diego Kozlowski | Diego Kozlowski, Thema Monroe-White, Vincent Larivi\`ere and Cassidy
R. Sugimoto | The Howard-Harvard effect: Institutional reproduction of intersectional
inequalities | null | null | null | null | cs.DL cs.CY | http://creativecommons.org/licenses/by/4.0/ | The US higher education system concentrates the production of science and
scientists within a few institutions. This has implications for minoritized
scholars and the topics with which they are disproportionately associated. This
paper examines topical alignment between institutions and authors of varying
intersectio... | [
{
"created": "Tue, 6 Feb 2024 20:46:54 GMT",
"version": "v1"
}
] | 2024-02-08 | [
[
"Kozlowski",
"Diego",
""
],
[
"Monroe-White",
"Thema",
""
],
[
"Larivière",
"Vincent",
""
],
[
"Sugimoto",
"Cassidy R.",
""
]
] | The US higher education system concentrates the production of science and scientists within a few institutions. This has implications for minoritized scholars and the topics with which they are disproportionately associated. This paper examines topical alignment between institutions and authors of varying intersectiona... |
2012.05582 | Radu P Horaud | Yves Dufournaud, Cordelia Schmid, and Radu Horaud | Image Matching with Scale Adjustment | null | Computer Vision and Image Understanding, volume 93, 2004 | 10.1016/j.cviu.2003.07.003 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this paper we address the problem of matching two images with two
different resolutions: a high-resolution image and a low-resolution one. The
difference in resolution between the two images is not known and without loss
of generality one of the images is assumed to be the high-resolution one. On
the premise that ... | [
{
"created": "Thu, 10 Dec 2020 11:03:25 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Nov 2023 14:17:15 GMT",
"version": "v2"
}
] | 2023-11-21 | [
[
"Dufournaud",
"Yves",
""
],
[
"Schmid",
"Cordelia",
""
],
[
"Horaud",
"Radu",
""
]
] | In this paper we address the problem of matching two images with two different resolutions: a high-resolution image and a low-resolution one. The difference in resolution between the two images is not known and without loss of generality one of the images is assumed to be the high-resolution one. On the premise that ch... |
2112.10106 | Maksym Planeta | Till Miemietz (1), Maksym Planeta (2), Viktor Laurin Reusch (1 and 2)
((1) Barkhausen Institut, Germany, (2) TU Dresden, Germany) | New Mechanism for Fast System Calls | null | null | null | null | cs.OS | http://creativecommons.org/licenses/by-sa/4.0/ | System calls have no place on the fast path of microsecond-scale systems.
However, kernel bypass prevents the OS from controlling and supervising access
to the hardware. In this paper we introduce the fastcall space, a new layer in
the traditional OS architecture, that hosts fastcalls. A fastcall implements
the fast ... | [
{
"created": "Sun, 19 Dec 2021 10:26:55 GMT",
"version": "v1"
}
] | 2021-12-21 | [
[
"Miemietz",
"Till",
"",
"Barkhausen Institut, Germany"
],
[
"Planeta",
"Maksym",
"",
"TU Dresden, Germany"
],
[
"Reusch",
"Viktor Laurin",
"",
"1 and 2"
]
] | System calls have no place on the fast path of microsecond-scale systems. However, kernel bypass prevents the OS from controlling and supervising access to the hardware. In this paper we introduce the fastcall space, a new layer in the traditional OS architecture, that hosts fastcalls. A fastcall implements the fast pa... |
2406.04516 | Paul Mineiro | Paul Mineiro | Online Joint Fine-tuning of Multi-Agent Flows | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A Flow is a collection of component models ("Agents") which constructs the
solution to a complex problem via iterative communication. Flows have emerged
as state of the art architectures for code generation, and are the raison
d'etre for frameworks like Autogen. However, flows are currently constructed
via a combinat... | [
{
"created": "Thu, 6 Jun 2024 21:21:03 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jun 2024 01:08:53 GMT",
"version": "v2"
},
{
"created": "Tue, 16 Jul 2024 13:46:36 GMT",
"version": "v3"
}
] | 2024-07-17 | [
[
"Mineiro",
"Paul",
""
]
] | A Flow is a collection of component models ("Agents") which constructs the solution to a complex problem via iterative communication. Flows have emerged as state of the art architectures for code generation, and are the raison d'etre for frameworks like Autogen. However, flows are currently constructed via a combinatio... |
2403.01755 | Matt Ziegler | Matt Ziegler, Sarah Lothian, Brian O'Neill, Richard Anderson,
Yoshitaka Ota | AI Language Models Could Both Help and Harm Equity in Marine
Policymaking: The Case Study of the BBNJ Question-Answering Bot | null | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | AI Large Language Models (LLMs) like ChatGPT are set to reshape some aspects
of policymaking processes. Policy practitioners are already using ChatGPT for
help with a variety of tasks: from drafting statements, submissions, and
presentations, to conducting background research. We are cautiously hopeful
that LLMs coul... | [
{
"created": "Mon, 4 Mar 2024 06:21:02 GMT",
"version": "v1"
}
] | 2024-03-05 | [
[
"Ziegler",
"Matt",
""
],
[
"Lothian",
"Sarah",
""
],
[
"O'Neill",
"Brian",
""
],
[
"Anderson",
"Richard",
""
],
[
"Ota",
"Yoshitaka",
""
]
] | AI Large Language Models (LLMs) like ChatGPT are set to reshape some aspects of policymaking processes. Policy practitioners are already using ChatGPT for help with a variety of tasks: from drafting statements, submissions, and presentations, to conducting background research. We are cautiously hopeful that LLMs could ... |
1802.03316 | Jose Nunez-Yanez Dr | Jose Nunez-Yanez, Mohammad Hosseinabady, Moslem Amiri, Andr\'es
Rodr\'iguez, Rafael Asenjo, Angeles Navarro, Rub\'en Gran-Tejero and Dar\'io
Su\'arez-Gracia | Parallelizing Workload Execution in Embedded and High-Performance
Heterogeneous Systems | Presented at HIP3ES, 2018 | null | null | HIP3ES/2018/2 | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we introduce a software-defined framework that enables the
parallel utilization of all the programmable processing resources available in
heterogeneous system-on-chip (SoC) including FPGA-based hardware accelerators
and programmable CPUs. Two platforms with different architectures are
considered, and a... | [
{
"created": "Fri, 9 Feb 2018 15:52:15 GMT",
"version": "v1"
}
] | 2018-02-12 | [
[
"Nunez-Yanez",
"Jose",
""
],
[
"Hosseinabady",
"Mohammad",
""
],
[
"Amiri",
"Moslem",
""
],
[
"Rodríguez",
"Andrés",
""
],
[
"Asenjo",
"Rafael",
""
],
[
"Navarro",
"Angeles",
""
],
[
"Gran-Tejero",
"Rubén",
... | In this paper, we introduce a software-defined framework that enables the parallel utilization of all the programmable processing resources available in heterogeneous system-on-chip (SoC) including FPGA-based hardware accelerators and programmable CPUs. Two platforms with different architectures are considered, and a s... |
1801.05101 | Hoang Dau | Hoang Dau and Iwan Duursma and Hien Chu | On the I/O Costs of Some Repair Schemes for Full-Length Reed-Solomon
Codes | Accepted by the ISIT'18 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Network transfer and disk read are the most time consuming operations in the
repair process for node failures in erasure-code-based distributed storage
systems. Recent developments on Reed-Solomon codes, the most widely used
erasure codes in practical storage systems, have shown that efficient repair
schemes specific... | [
{
"created": "Tue, 16 Jan 2018 02:40:01 GMT",
"version": "v1"
},
{
"created": "Wed, 9 May 2018 07:39:49 GMT",
"version": "v2"
}
] | 2018-05-10 | [
[
"Dau",
"Hoang",
""
],
[
"Duursma",
"Iwan",
""
],
[
"Chu",
"Hien",
""
]
] | Network transfer and disk read are the most time consuming operations in the repair process for node failures in erasure-code-based distributed storage systems. Recent developments on Reed-Solomon codes, the most widely used erasure codes in practical storage systems, have shown that efficient repair schemes specifical... |
2209.01874 | Jean Pauphilet | Julien Grand-Cl\'ement and Jean Pauphilet | The Best Decisions Are Not the Best Advice: Making Adherence-Aware
Recommendations | null | null | null | null | cs.HC cs.AI | http://creativecommons.org/licenses/by/4.0/ | Many high-stake decisions follow an expert-in-loop structure in that a human
operator receives recommendations from an algorithm but is the ultimate
decision maker. Hence, the algorithm's recommendation may differ from the
actual decision implemented in practice. However, most algorithmic
recommendations are obtained... | [
{
"created": "Mon, 5 Sep 2022 10:11:09 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Sep 2022 09:31:04 GMT",
"version": "v2"
},
{
"created": "Fri, 16 Jun 2023 16:20:05 GMT",
"version": "v3"
},
{
"created": "Sat, 9 Dec 2023 09:32:03 GMT",
"version": "v4"
}
] | 2023-12-13 | [
[
"Grand-Clément",
"Julien",
""
],
[
"Pauphilet",
"Jean",
""
]
] | Many high-stake decisions follow an expert-in-loop structure in that a human operator receives recommendations from an algorithm but is the ultimate decision maker. Hence, the algorithm's recommendation may differ from the actual decision implemented in practice. However, most algorithmic recommendations are obtained b... |
2007.03568 | Alexander Acker | Alexander Acker, Thorsten Wittkopp, Sasho Nedelkoski, Jasmin
Bogatinovski, Odej Kao | Superiority of Simplicity: A Lightweight Model for Network Device
Workload Prediction | null | null | null | null | cs.LG cs.SY eess.SY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid growth and distribution of IT systems increases their complexity
and aggravates operation and maintenance. To sustain control over large sets of
hosts and the connecting networks, monitoring solutions are employed and
constantly enhanced. They collect diverse key performance indicators (KPIs)
(e.g. CPU util... | [
{
"created": "Tue, 7 Jul 2020 15:44:16 GMT",
"version": "v1"
}
] | 2020-07-08 | [
[
"Acker",
"Alexander",
""
],
[
"Wittkopp",
"Thorsten",
""
],
[
"Nedelkoski",
"Sasho",
""
],
[
"Bogatinovski",
"Jasmin",
""
],
[
"Kao",
"Odej",
""
]
] | The rapid growth and distribution of IT systems increases their complexity and aggravates operation and maintenance. To sustain control over large sets of hosts and the connecting networks, monitoring solutions are employed and constantly enhanced. They collect diverse key performance indicators (KPIs) (e.g. CPU utiliz... |
1410.4573 | Jayadeva | Jayadeva, Suresh Chandra, Siddarth Sabharwal, and Sanjit S. Batra | Learning a hyperplane regressor by minimizing an exact bound on the VC
dimension | see
http://www.sciencedirect.com/science/article/pii/S0925231214010194 or
arXiv:1408.2803 for background information | Neurocomputing, Volume 171, 1 January 2016, Pages 1610-1616, ISSN
0925-2312 | 10.1016/j.neucom.2015.06.065 | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The capacity of a learning machine is measured by its Vapnik-Chervonenkis
dimension, and learning machines with a low VC dimension generalize better. It
is well known that the VC dimension of SVMs can be very large or unbounded,
even though they generally yield state-of-the-art learning performance. In this
paper, we... | [
{
"created": "Thu, 16 Oct 2014 20:04:49 GMT",
"version": "v1"
}
] | 2017-05-02 | [
[
"Jayadeva",
"",
""
],
[
"Chandra",
"Suresh",
""
],
[
"Sabharwal",
"Siddarth",
""
],
[
"Batra",
"Sanjit S.",
""
]
] | The capacity of a learning machine is measured by its Vapnik-Chervonenkis dimension, and learning machines with a low VC dimension generalize better. It is well known that the VC dimension of SVMs can be very large or unbounded, even though they generally yield state-of-the-art learning performance. In this paper, we s... |
1711.00231 | Sathish Vadhiyar | Ananya Raval, Rupesh Nasre, Vivek Kumar, Vasudevan R, Sathish
Vadhiyar, Keshav Pingali | Dynamic Load Balancing Strategies for Graph Applications on GPUs | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Acceleration of graph applications on GPUs has found large interest due to
the ubiquitous use of graph processing in various domains. The inherent
\textit{irregularity} in graph applications leads to several challenges for
parallelization. A key challenge, which we address in this paper, is that of
load-imbalance. If... | [
{
"created": "Wed, 1 Nov 2017 07:24:24 GMT",
"version": "v1"
}
] | 2017-11-02 | [
[
"Raval",
"Ananya",
""
],
[
"Nasre",
"Rupesh",
""
],
[
"Kumar",
"Vivek",
""
],
[
"R",
"Vasudevan",
""
],
[
"Vadhiyar",
"Sathish",
""
],
[
"Pingali",
"Keshav",
""
]
] | Acceleration of graph applications on GPUs has found large interest due to the ubiquitous use of graph processing in various domains. The inherent \textit{irregularity} in graph applications leads to several challenges for parallelization. A key challenge, which we address in this paper, is that of load-imbalance. If t... |
1708.02639 | Ran Raz | Sumegha Garg, Ran Raz, Avishay Tal | Extractor-Based Time-Space Lower Bounds for Learning | null | null | null | null | cs.LG cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A matrix $M: A \times X \rightarrow \{-1,1\}$ corresponds to the following
learning problem: An unknown element $x \in X$ is chosen uniformly at random. A
learner tries to learn $x$ from a stream of samples, $(a_1, b_1), (a_2, b_2)
\ldots$, where for every $i$, $a_i \in A$ is chosen uniformly at random and
$b_i = M(a... | [
{
"created": "Tue, 8 Aug 2017 20:13:39 GMT",
"version": "v1"
}
] | 2017-08-10 | [
[
"Garg",
"Sumegha",
""
],
[
"Raz",
"Ran",
""
],
[
"Tal",
"Avishay",
""
]
] | A matrix $M: A \times X \rightarrow \{-1,1\}$ corresponds to the following learning problem: An unknown element $x \in X$ is chosen uniformly at random. A learner tries to learn $x$ from a stream of samples, $(a_1, b_1), (a_2, b_2) \ldots$, where for every $i$, $a_i \in A$ is chosen uniformly at random and $b_i = M(a_i... |
2203.13645 | Xuenan Xu | Siyu Lou, Xuenan Xu, Mengyue Wu, Kai Yu | Audio-text Retrieval in Context | null | null | null | null | cs.SD cs.CL eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Audio-text retrieval based on natural language descriptions is a challenging
task. It involves learning cross-modality alignments between long sequences
under inadequate data conditions. In this work, we investigate several audio
features as well as sequence aggregation methods for better audio-text
alignment. Moreov... | [
{
"created": "Fri, 25 Mar 2022 13:41:17 GMT",
"version": "v1"
},
{
"created": "Tue, 29 Mar 2022 04:32:47 GMT",
"version": "v2"
}
] | 2022-03-30 | [
[
"Lou",
"Siyu",
""
],
[
"Xu",
"Xuenan",
""
],
[
"Wu",
"Mengyue",
""
],
[
"Yu",
"Kai",
""
]
] | Audio-text retrieval based on natural language descriptions is a challenging task. It involves learning cross-modality alignments between long sequences under inadequate data conditions. In this work, we investigate several audio features as well as sequence aggregation methods for better audio-text alignment. Moreover... |
2406.12783 | Dongqing Wu Professor | Jiakuang He, Dongqing Wu | Zeroing neural dynamics solving time-variant complex conjugate matrix
equation | null | null | null | null | cs.NE cs.DC cs.NA cs.SY eess.SY math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Complex conjugate matrix equations (CCME) have aroused the interest of many
researchers because of computations and antilinear systems. Existing research
is dominated by its time-invariant solving methods, but lacks proposed theories
for solving its time-variant version. Moreover, artificial neural networks are
rarel... | [
{
"created": "Tue, 18 Jun 2024 16:50:26 GMT",
"version": "v1"
}
] | 2024-06-19 | [
[
"He",
"Jiakuang",
""
],
[
"Wu",
"Dongqing",
""
]
] | Complex conjugate matrix equations (CCME) have aroused the interest of many researchers because of computations and antilinear systems. Existing research is dominated by its time-invariant solving methods, but lacks proposed theories for solving its time-variant version. Moreover, artificial neural networks are rarely ... |
2301.08068 | Michael Pantic | Michael Pantic, Isar Meijer, Rik B\"ahnemann, Nikhilesh Alatur, Olov
Andersson, Cesar Cadena Lerma, Roland Siegwart, Lionel Ott | Obstacle avoidance using raycasting and Riemannian Motion Policies at
kHz rates for MAVs | Accepted to IROS 2023 | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a novel method for using Riemannian Motion Policies
on volumetric maps, shown in the example of obstacle avoidance for Micro Aerial
Vehicles (MAVs). While sampling or optimization-based planners are widely used
for obstacle avoidance with volumetric maps, they are computationally expensive
a... | [
{
"created": "Thu, 19 Jan 2023 13:26:35 GMT",
"version": "v1"
}
] | 2023-01-20 | [
[
"Pantic",
"Michael",
""
],
[
"Meijer",
"Isar",
""
],
[
"Bähnemann",
"Rik",
""
],
[
"Alatur",
"Nikhilesh",
""
],
[
"Andersson",
"Olov",
""
],
[
"Lerma",
"Cesar Cadena",
""
],
[
"Siegwart",
"Roland",
""
],
... | In this paper, we present a novel method for using Riemannian Motion Policies on volumetric maps, shown in the example of obstacle avoidance for Micro Aerial Vehicles (MAVs). While sampling or optimization-based planners are widely used for obstacle avoidance with volumetric maps, they are computationally expensive and... |
2311.07722 | Haochen Li | Haochen Li, Zhaolin Wang, Xidong Mu, Zhiwen Pan, and Yuanwei Liu | Near-Field Integrated Sensing, Positioning, and Communication: A
Downlink and Uplink Framework | 13 pages, 6 figures | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A near-field integrated sensing, positioning, and communication (ISPAC)
framework is proposed, where a base station (BS) simultaneously serves multiple
communication users and carries out target sensing and positioning. A novel
double-array structure is proposed to enable the near-field ISPAC at the BS.
Specifically,... | [
{
"created": "Mon, 13 Nov 2023 20:05:28 GMT",
"version": "v1"
}
] | 2023-11-15 | [
[
"Li",
"Haochen",
""
],
[
"Wang",
"Zhaolin",
""
],
[
"Mu",
"Xidong",
""
],
[
"Pan",
"Zhiwen",
""
],
[
"Liu",
"Yuanwei",
""
]
] | A near-field integrated sensing, positioning, and communication (ISPAC) framework is proposed, where a base station (BS) simultaneously serves multiple communication users and carries out target sensing and positioning. A novel double-array structure is proposed to enable the near-field ISPAC at the BS. Specifically, a... |
2308.14104 | Chao Qian | Chengrui Gao, Haopu Shang, Ke Xue, Dong Li, Chao Qian | Towards Generalizable Neural Solvers for Vehicle Routing Problems via
Ensemble with Transferrable Local Policy | Accepted by IJCAI 2024 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning has been adapted to help solve NP-hard combinatorial
optimization problems. One prevalent way is learning to construct solutions by
deep neural networks, which has been receiving more and more attention due to
the high efficiency and less requirement for expert knowledge. However, many
neural constru... | [
{
"created": "Sun, 27 Aug 2023 13:22:50 GMT",
"version": "v1"
},
{
"created": "Thu, 25 Jan 2024 07:44:10 GMT",
"version": "v2"
},
{
"created": "Sun, 5 May 2024 13:55:07 GMT",
"version": "v3"
}
] | 2024-05-07 | [
[
"Gao",
"Chengrui",
""
],
[
"Shang",
"Haopu",
""
],
[
"Xue",
"Ke",
""
],
[
"Li",
"Dong",
""
],
[
"Qian",
"Chao",
""
]
] | Machine learning has been adapted to help solve NP-hard combinatorial optimization problems. One prevalent way is learning to construct solutions by deep neural networks, which has been receiving more and more attention due to the high efficiency and less requirement for expert knowledge. However, many neural construct... |
2307.14754 | Alex Oesterling | Alex Oesterling, Jiaqi Ma, Flavio P. Calmon, Hima Lakkaraju | Fair Machine Unlearning: Data Removal while Mitigating Disparities | 25 pages, 3 figures, accepted to AISTATS 2024. Code is provided at
https://github.com/AI4LIFE-GROUP/fair-unlearning | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Right to be Forgotten is a core principle outlined by regulatory
frameworks such as the EU's General Data Protection Regulation (GDPR). This
principle allows individuals to request that their personal data be deleted
from deployed machine learning models. While "forgetting" can be naively
achieved by retraining o... | [
{
"created": "Thu, 27 Jul 2023 10:26:46 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Feb 2024 01:42:48 GMT",
"version": "v2"
}
] | 2024-02-19 | [
[
"Oesterling",
"Alex",
""
],
[
"Ma",
"Jiaqi",
""
],
[
"Calmon",
"Flavio P.",
""
],
[
"Lakkaraju",
"Hima",
""
]
] | The Right to be Forgotten is a core principle outlined by regulatory frameworks such as the EU's General Data Protection Regulation (GDPR). This principle allows individuals to request that their personal data be deleted from deployed machine learning models. While "forgetting" can be naively achieved by retraining on ... |
1411.4604 | Robert Koenighofer | Roderick Bloem, Krishnendu Chatterjee, Swen Jacobs, Robert Koenighofer | Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial
Information | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Synthesis of program parts is very useful for concurrent systems. However,
most synthesis approaches do not support common design tasks, like modifying a
single process without having to re-synthesize or verify the whole system.
Assume-guarantee synthesis (AGS) provides robustness against modifications of
system part... | [
{
"created": "Mon, 17 Nov 2014 19:43:35 GMT",
"version": "v1"
}
] | 2014-11-18 | [
[
"Bloem",
"Roderick",
""
],
[
"Chatterjee",
"Krishnendu",
""
],
[
"Jacobs",
"Swen",
""
],
[
"Koenighofer",
"Robert",
""
]
] | Synthesis of program parts is very useful for concurrent systems. However, most synthesis approaches do not support common design tasks, like modifying a single process without having to re-synthesize or verify the whole system. Assume-guarantee synthesis (AGS) provides robustness against modifications of system parts,... |
2207.07816 | Prasanna Kumar Muthukumar | Michael Shoemate and Kevin Jett and Ethan Cowan and Sean Colbath and
James Honaker and Prasanna Muthukumar | Sotto Voce: Federated Speech Recognition with Differential Privacy
Guarantees | null | null | null | null | cs.CR cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | Speech data is expensive to collect, and incredibly sensitive to its sources.
It is often the case that organizations independently collect small datasets
for their own use, but often these are not performant for the demands of
machine learning. Organizations could pool these datasets together and jointly
build a str... | [
{
"created": "Sat, 16 Jul 2022 02:48:54 GMT",
"version": "v1"
}
] | 2022-07-19 | [
[
"Shoemate",
"Michael",
""
],
[
"Jett",
"Kevin",
""
],
[
"Cowan",
"Ethan",
""
],
[
"Colbath",
"Sean",
""
],
[
"Honaker",
"James",
""
],
[
"Muthukumar",
"Prasanna",
""
]
] | Speech data is expensive to collect, and incredibly sensitive to its sources. It is often the case that organizations independently collect small datasets for their own use, but often these are not performant for the demands of machine learning. Organizations could pool these datasets together and jointly build a stron... |
2003.05136 | Jun Wan | Ajian Li, Zichang Tan, Xuan Li, Jun Wan, Sergio Escalera, Guodong Guo,
Stan Z. Li | CASIA-SURF CeFA: A Benchmark for Multi-modal Cross-ethnicity Face
Anti-spoofing | 17 pages, 4 figures. arXiv admin note: substantial text overlap with
arXiv:1912.02340 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ethnic bias has proven to negatively affect the performance of face
recognition systems, and it remains an open research problem in face
anti-spoofing. In order to study the ethnic bias for face anti-spoofing, we
introduce the largest up to date CASIA-SURF Cross-ethnicity Face Anti-spoofing
(CeFA) dataset (briefly na... | [
{
"created": "Wed, 11 Mar 2020 06:58:54 GMT",
"version": "v1"
}
] | 2020-03-12 | [
[
"Li",
"Ajian",
""
],
[
"Tan",
"Zichang",
""
],
[
"Li",
"Xuan",
""
],
[
"Wan",
"Jun",
""
],
[
"Escalera",
"Sergio",
""
],
[
"Guo",
"Guodong",
""
],
[
"Li",
"Stan Z.",
""
]
] | Ethnic bias has proven to negatively affect the performance of face recognition systems, and it remains an open research problem in face anti-spoofing. In order to study the ethnic bias for face anti-spoofing, we introduce the largest up to date CASIA-SURF Cross-ethnicity Face Anti-spoofing (CeFA) dataset (briefly name... |
2304.00979 | Xinwei Liu | Xinwei Liu, Kiran Raja, Renfang Wang, Hong Qiu, Hucheng Wu, Dechao
Sun, Qiguang Zheng, Nian Liu, Xiaoxia Wang, Gehang Huang, Raghavendra
Ramachandra, Christoph Busch | A Latent Fingerprint in the Wild Database | Submitted to IEEE Transactions on Information Forensics and Security
(under review) | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Latent fingerprints are among the most important and widely used evidence in
crime scenes, digital forensics and law enforcement worldwide. Despite the
number of advancements reported in recent works, we note that significant open
issues such as independent benchmarking and lack of large-scale evaluation
databases fo... | [
{
"created": "Mon, 3 Apr 2023 13:47:38 GMT",
"version": "v1"
}
] | 2023-04-04 | [
[
"Liu",
"Xinwei",
""
],
[
"Raja",
"Kiran",
""
],
[
"Wang",
"Renfang",
""
],
[
"Qiu",
"Hong",
""
],
[
"Wu",
"Hucheng",
""
],
[
"Sun",
"Dechao",
""
],
[
"Zheng",
"Qiguang",
""
],
[
"Liu",
"Nian",
... | Latent fingerprints are among the most important and widely used evidence in crime scenes, digital forensics and law enforcement worldwide. Despite the number of advancements reported in recent works, we note that significant open issues such as independent benchmarking and lack of large-scale evaluation databases for ... |
2202.06854 | Tao Yu | Tao Yu, Christopher De Sa | Random Laplacian Features for Learning with Hyperbolic Space | ICLR 2023 | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Due to its geometric properties, hyperbolic space can support high-fidelity
embeddings of tree- and graph-structured data, upon which various hyperbolic
networks have been developed. Existing hyperbolic networks encode geometric
priors not only for the input, but also at every layer of the network. This
approach invo... | [
{
"created": "Mon, 14 Feb 2022 16:40:24 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Aug 2022 05:07:21 GMT",
"version": "v2"
},
{
"created": "Mon, 13 Mar 2023 17:53:07 GMT",
"version": "v3"
}
] | 2023-03-14 | [
[
"Yu",
"Tao",
""
],
[
"De Sa",
"Christopher",
""
]
] | Due to its geometric properties, hyperbolic space can support high-fidelity embeddings of tree- and graph-structured data, upon which various hyperbolic networks have been developed. Existing hyperbolic networks encode geometric priors not only for the input, but also at every layer of the network. This approach involv... |
2011.11138 | Jie Gao | Jie Gao, Weihua Zhuang, Mushu Li, Xuemin (Sherman) Shen, Xu Li | MAC for Machine Type Communications in Industrial IoT -- Part I:
Protocol Design and Analysis | null | null | null | null | cs.NI cs.SY eess.SY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In this two-part paper, we propose a novel medium access control (MAC)
protocol for machine-type communications in the industrial internet of things.
The considered use case features a limited geographical area and a massive
number of devices with sporadic data traffic and different priority types. We
target at suppo... | [
{
"created": "Sun, 22 Nov 2020 23:33:41 GMT",
"version": "v1"
}
] | 2020-11-24 | [
[
"Gao",
"Jie",
"",
"Sherman"
],
[
"Zhuang",
"Weihua",
"",
"Sherman"
],
[
"Li",
"Mushu",
"",
"Sherman"
],
[
"Xuemin",
"",
"",
"Sherman"
],
[
"Shen",
"",
""
],
[
"Li",
"Xu",
""
]
] | In this two-part paper, we propose a novel medium access control (MAC) protocol for machine-type communications in the industrial internet of things. The considered use case features a limited geographical area and a massive number of devices with sporadic data traffic and different priority types. We target at support... |
2002.02100 | S.H. Shabbeer Basha | S.H. Shabbeer Basha, Viswanath Pulabaigari, Snehasis Mukherjee | An Information-rich Sampling Technique over Spatio-Temporal CNN for
Classification of Human Actions in Videos | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel scheme for human action recognition in videos, using a
3-dimensional Convolutional Neural Network (3D CNN) based classifier.
Traditionally in deep learning based human activity recognition approaches,
either a few random frames or every $k^{th}$ frame of the video is considered
for training the 3D ... | [
{
"created": "Thu, 6 Feb 2020 05:07:41 GMT",
"version": "v1"
},
{
"created": "Fri, 7 Feb 2020 06:42:20 GMT",
"version": "v2"
}
] | 2020-02-10 | [
[
"Basha",
"S. H. Shabbeer",
""
],
[
"Pulabaigari",
"Viswanath",
""
],
[
"Mukherjee",
"Snehasis",
""
]
] | We propose a novel scheme for human action recognition in videos, using a 3-dimensional Convolutional Neural Network (3D CNN) based classifier. Traditionally in deep learning based human activity recognition approaches, either a few random frames or every $k^{th}$ frame of the video is considered for training the 3D CN... |
2001.02107 | Chengkun Lang | Huiwei Zhou, Zhuang Liu, Shixian Ning, Yunlong Yang, Chengkun Lang,
Yingyu Lin, Kun Ma | Leveraging Prior Knowledge for Protein-Protein Interaction Extraction
with Memory Network | Published on Database-The Journal of Biological Databases and
Curation, 11 pages, 5 figures | Database-The Journal of Biological Databases and Curation, 2018,
2018: bay071 | 10.1093/database/bay071 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Automatically extracting Protein-Protein Interactions (PPI) from biomedical
literature provides additional support for precision medicine efforts. This
paper proposes a novel memory network-based model (MNM) for PPI extraction,
which leverages prior knowledge about protein-protein pairs with memory
networks. The prop... | [
{
"created": "Tue, 7 Jan 2020 15:11:27 GMT",
"version": "v1"
}
] | 2020-01-08 | [
[
"Zhou",
"Huiwei",
""
],
[
"Liu",
"Zhuang",
""
],
[
"Ning",
"Shixian",
""
],
[
"Yang",
"Yunlong",
""
],
[
"Lang",
"Chengkun",
""
],
[
"Lin",
"Yingyu",
""
],
[
"Ma",
"Kun",
""
]
] | Automatically extracting Protein-Protein Interactions (PPI) from biomedical literature provides additional support for precision medicine efforts. This paper proposes a novel memory network-based model (MNM) for PPI extraction, which leverages prior knowledge about protein-protein pairs with memory networks. The propos... |
2210.02615 | Andrew Nam | Andrew J. Nam, Mengye Ren, Chelsea Finn, James L. McClelland | Learning to Reason With Relational Abstractions | null | null | null | null | cs.LG cs.AI cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Large language models have recently shown promising progress in mathematical
reasoning when fine-tuned with human-generated sequences walking through a
sequence of solution steps. However, the solution sequences are not formally
structured and the resulting model-generated sequences may not reflect the kind
of system... | [
{
"created": "Thu, 6 Oct 2022 00:27:50 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Dec 2022 23:29:37 GMT",
"version": "v2"
}
] | 2022-12-07 | [
[
"Nam",
"Andrew J.",
""
],
[
"Ren",
"Mengye",
""
],
[
"Finn",
"Chelsea",
""
],
[
"McClelland",
"James L.",
""
]
] | Large language models have recently shown promising progress in mathematical reasoning when fine-tuned with human-generated sequences walking through a sequence of solution steps. However, the solution sequences are not formally structured and the resulting model-generated sequences may not reflect the kind of systemat... |
1307.3181 | Siyang Zhong | Siyang Zhong, Xun Huang | Compressive sensing based beamforming for noisy measurements | 15 pages, 3 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressive sensing is the newly emerging method in information technology
that could impact array beamforming and the associated engineering
applications. However, practical measurements are inevitably polluted by noise
from external interference and internal acquisition process. Then, compressive
sensing based beam... | [
{
"created": "Thu, 11 Jul 2013 16:49:59 GMT",
"version": "v1"
}
] | 2013-07-12 | [
[
"Zhong",
"Siyang",
""
],
[
"Huang",
"Xun",
""
]
] | Compressive sensing is the newly emerging method in information technology that could impact array beamforming and the associated engineering applications. However, practical measurements are inevitably polluted by noise from external interference and internal acquisition process. Then, compressive sensing based beamfo... |
1908.09990 | Xugong Qin | Xugong Qin, Yu Zhou, Dongbao Yang, Weiping Wang | Curved Text Detection in Natural Scene Images with Semi- and
Weakly-Supervised Learning | Accepted by ICDAR 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Detecting curved text in the wild is very challenging. Recently, most
state-of-the-art methods are segmentation based and require pixel-level
annotations. We propose a novel scheme to train an accurate text detector using
only a small amount of pixel-level annotated data and a large amount of data
annotated with rect... | [
{
"created": "Tue, 27 Aug 2019 02:21:49 GMT",
"version": "v1"
}
] | 2019-08-28 | [
[
"Qin",
"Xugong",
""
],
[
"Zhou",
"Yu",
""
],
[
"Yang",
"Dongbao",
""
],
[
"Wang",
"Weiping",
""
]
] | Detecting curved text in the wild is very challenging. Recently, most state-of-the-art methods are segmentation based and require pixel-level annotations. We propose a novel scheme to train an accurate text detector using only a small amount of pixel-level annotated data and a large amount of data annotated with rectan... |
2108.06868 | Mohammad Reza Ehsani | Mohammad Reza Ehsani, Ariyan Zarei, Hoshin V. Gupta, Kobus Barnard,
Ali Behrangi | Nowcasting-Nets: Deep Neural Network Structures for Precipitation
Nowcasting Using IMERG | 41 Pages, 18 Figures | null | 10.1109/TGRS.2022.3158888 | null | cs.LG cs.CV cs.NE | http://creativecommons.org/licenses/by/4.0/ | Accurate and timely estimation of precipitation is critical for issuing
hazard warnings (e.g., for flash floods or landslides). Current remotely sensed
precipitation products have a few hours of latency, associated with the
acquisition and processing of satellite data. By applying a robust nowcasting
system to these ... | [
{
"created": "Mon, 16 Aug 2021 02:55:32 GMT",
"version": "v1"
}
] | 2022-04-20 | [
[
"Ehsani",
"Mohammad Reza",
""
],
[
"Zarei",
"Ariyan",
""
],
[
"Gupta",
"Hoshin V.",
""
],
[
"Barnard",
"Kobus",
""
],
[
"Behrangi",
"Ali",
""
]
] | Accurate and timely estimation of precipitation is critical for issuing hazard warnings (e.g., for flash floods or landslides). Current remotely sensed precipitation products have a few hours of latency, associated with the acquisition and processing of satellite data. By applying a robust nowcasting system to these pr... |
2402.11618 | Hai Dao | Dao Thanh Hai, Isaac Woungang | On Network Design and Planning 2.0 for Optical-computing-enabled
Networks | 12 pages, 6 figures, 2 tables, accepted version to The 38th
International Conference on Advanced Information Networking and Applications
(AINA-2024) | null | null | null | cs.NI | http://creativecommons.org/licenses/by/4.0/ | In accommodating the continued explosive growth in Internet traffic, optical
core networks have been evolving accordingly thanks to numerous technological
and architectural innovations. From an architectural perspective, the adoption
of optical-bypass networking in the last two decades has resulted in
substantial cos... | [
{
"created": "Sun, 18 Feb 2024 15:20:24 GMT",
"version": "v1"
}
] | 2024-02-20 | [
[
"Hai",
"Dao Thanh",
""
],
[
"Woungang",
"Isaac",
""
]
] | In accommodating the continued explosive growth in Internet traffic, optical core networks have been evolving accordingly thanks to numerous technological and architectural innovations. From an architectural perspective, the adoption of optical-bypass networking in the last two decades has resulted in substantial cost ... |
2401.11673 | Xinlin Ren | Chenjie Cao, Xinlin Ren, Yanwei Fu | MVSFormer++: Revealing the Devil in Transformer's Details for Multi-View
Stereo | Accepted to ICLR2024 | ICLR(International Conference on Learning Representations) 2024 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advancements in learning-based Multi-View Stereo (MVS) methods have
prominently featured transformer-based models with attention mechanisms.
However, existing approaches have not thoroughly investigated the profound
influence of transformers on different MVS modules, resulting in limited depth
estimation capab... | [
{
"created": "Mon, 22 Jan 2024 03:22:49 GMT",
"version": "v1"
}
] | 2024-01-23 | [
[
"Cao",
"Chenjie",
""
],
[
"Ren",
"Xinlin",
""
],
[
"Fu",
"Yanwei",
""
]
] | Recent advancements in learning-based Multi-View Stereo (MVS) methods have prominently featured transformer-based models with attention mechanisms. However, existing approaches have not thoroughly investigated the profound influence of transformers on different MVS modules, resulting in limited depth estimation capabil... |
1912.01111 | Jayanta Mandi | Dipankar Chakrabarti, Neelam Patodia, Udayan Bhattacharya, Indranil
Mitra, Satyaki Roy, Jayanta Mandi, Nandini Roy, Prasun Nandy | Use of Artificial Intelligence to Analyse Risk in Legal Documents for a
Better Decision Support | null | null | null | null | cs.CL cs.AI cs.IR cs.LG cs.NE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Assessing risk for voluminous legal documents such as request for proposal;
contracts is tedious and error prone. We have developed "risk-o-meter", a
framework, based on machine learning and natural language processing to review
and assess risks of any legal document. Our framework uses Paragraph Vector, an
unsupervi... | [
{
"created": "Fri, 22 Nov 2019 16:07:02 GMT",
"version": "v1"
}
] | 2019-12-04 | [
[
"Chakrabarti",
"Dipankar",
""
],
[
"Patodia",
"Neelam",
""
],
[
"Bhattacharya",
"Udayan",
""
],
[
"Mitra",
"Indranil",
""
],
[
"Roy",
"Satyaki",
""
],
[
"Mandi",
"Jayanta",
""
],
[
"Roy",
"Nandini",
""
],... | Assessing risk for voluminous legal documents such as request for proposal; contracts is tedious and error prone. We have developed "risk-o-meter", a framework, based on machine learning and natural language processing to review and assess risks of any legal document. Our framework uses Paragraph Vector, an unsupervise... |
1811.00755 | Jialin Song | Jialin Song, Yuxin Chen, Yisong Yue | A General Framework for Multi-fidelity Bayesian Optimization with
Gaussian Processes | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | How can we efficiently gather information to optimize an unknown function,
when presented with multiple, mutually dependent information sources with
different costs? For example, when optimizing a robotic system, intelligently
trading off computer simulations and real robot testings can lead to
significant savings. E... | [
{
"created": "Fri, 2 Nov 2018 06:36:13 GMT",
"version": "v1"
}
] | 2018-11-05 | [
[
"Song",
"Jialin",
""
],
[
"Chen",
"Yuxin",
""
],
[
"Yue",
"Yisong",
""
]
] | How can we efficiently gather information to optimize an unknown function, when presented with multiple, mutually dependent information sources with different costs? For example, when optimizing a robotic system, intelligently trading off computer simulations and real robot testings can lead to significant savings. Exi... |
1712.08583 | Umang Natubhai Yadav | Umang Yadav, Sherif N Abbas, Dimitrios Hatzinakos | Evaluation of PPG Biometrics for Authentication in different states | Accepted at 11th IAPR/IEEE International Conference on Biometrics,
2018. 6 pages, 6 figures | null | null | null | cs.CR cs.CV eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Amongst all medical biometric traits, Photoplethysmograph (PPG) is the
easiest to acquire. PPG records the blood volume change with just combination
of Light Emitting Diode and Photodiode from any part of the body. With IoT and
smart homes' penetration, PPG recording can easily be integrated with other
vital wearable... | [
{
"created": "Fri, 22 Dec 2017 17:29:31 GMT",
"version": "v1"
}
] | 2017-12-25 | [
[
"Yadav",
"Umang",
""
],
[
"Abbas",
"Sherif N",
""
],
[
"Hatzinakos",
"Dimitrios",
""
]
] | Amongst all medical biometric traits, Photoplethysmograph (PPG) is the easiest to acquire. PPG records the blood volume change with just combination of Light Emitting Diode and Photodiode from any part of the body. With IoT and smart homes' penetration, PPG recording can easily be integrated with other vital wearable d... |
2007.14838 | Richard Savery | Richard Savery, Gil Weinberg | A Survey of Robotics and Emotion: Classifications and Models of
Emotional Interaction | The 29th IEEE International Conference on Robot & Human Interactive
Communication | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As emotion plays a growing role in robotic research it is crucial to develop
methods to analyze and compare among the wide range of approaches. To this end
we present a survey of 1427 IEEE and ACM publications that include robotics and
emotion. This includes broad categorizations of trends in emotion input
analysis, ... | [
{
"created": "Wed, 29 Jul 2020 13:55:37 GMT",
"version": "v1"
}
] | 2020-07-30 | [
[
"Savery",
"Richard",
""
],
[
"Weinberg",
"Gil",
""
]
] | As emotion plays a growing role in robotic research it is crucial to develop methods to analyze and compare among the wide range of approaches. To this end we present a survey of 1427 IEEE and ACM publications that include robotics and emotion. This includes broad categorizations of trends in emotion input analysis, ro... |
2407.20647 | Bin Wang | Bin Wang, Yuying Liang, Lei Cai, Huakun Huang, and Huanqiang Zeng | Image Re-Identification: Where Self-supervision Meets Vision-Language
Learning | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, large-scale vision-language pre-trained models like CLIP have shown
impressive performance in image re-identification (ReID). In this work, we
explore whether self-supervision can aid in the use of CLIP for image ReID
tasks. Specifically, we propose SVLL-ReID, the first attempt to integrate
self-supervision... | [
{
"created": "Tue, 30 Jul 2024 08:43:53 GMT",
"version": "v1"
}
] | 2024-07-31 | [
[
"Wang",
"Bin",
""
],
[
"Liang",
"Yuying",
""
],
[
"Cai",
"Lei",
""
],
[
"Huang",
"Huakun",
""
],
[
"Zeng",
"Huanqiang",
""
]
] | Recently, large-scale vision-language pre-trained models like CLIP have shown impressive performance in image re-identification (ReID). In this work, we explore whether self-supervision can aid in the use of CLIP for image ReID tasks. Specifically, we propose SVLL-ReID, the first attempt to integrate self-supervision a... |
1709.10083 | Alireza Talebpour | Sina Arefizadeh, Alireza Talebpour and Igor Zelenko | Platooning in the Presence of a Speed Drop: A Generalized Control Model | null | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The positive impacts of platooning on travel time reliability, congestion,
emissions, and energy consumption have been shown for homogeneous roadway
segments. However, speed limit changes frequently throughout the transportation
network, due to either safety-related considerations (e.g., workzone
operations) or conge... | [
{
"created": "Thu, 28 Sep 2017 17:46:13 GMT",
"version": "v1"
}
] | 2017-09-29 | [
[
"Arefizadeh",
"Sina",
""
],
[
"Talebpour",
"Alireza",
""
],
[
"Zelenko",
"Igor",
""
]
] | The positive impacts of platooning on travel time reliability, congestion, emissions, and energy consumption have been shown for homogeneous roadway segments. However, speed limit changes frequently throughout the transportation network, due to either safety-related considerations (e.g., workzone operations) or congest... |
2309.16952 | Nils Lukas | Nils Lukas, Abdulrahman Diaa, Lucas Fenaux, Florian Kerschbaum | Leveraging Optimization for Adaptive Attacks on Image Watermarks | ICLR'24 | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by/4.0/ | Untrustworthy users can misuse image generators to synthesize high-quality
deepfakes and engage in unethical activities. Watermarking deters misuse by
marking generated content with a hidden message, enabling its detection using a
secret watermarking key. A core security property of watermarking is
robustness, which ... | [
{
"created": "Fri, 29 Sep 2023 03:36:42 GMT",
"version": "v1"
},
{
"created": "Sat, 20 Jan 2024 19:43:04 GMT",
"version": "v2"
}
] | 2024-01-23 | [
[
"Lukas",
"Nils",
""
],
[
"Diaa",
"Abdulrahman",
""
],
[
"Fenaux",
"Lucas",
""
],
[
"Kerschbaum",
"Florian",
""
]
] | Untrustworthy users can misuse image generators to synthesize high-quality deepfakes and engage in unethical activities. Watermarking deters misuse by marking generated content with a hidden message, enabling its detection using a secret watermarking key. A core security property of watermarking is robustness, which st... |
2401.13020 | Yixuan Sun | Yixuan Sun, Sami Khairy, Richard B. Vilim, Rui Hu, Akshay J. Dave | A Safe Reinforcement Learning Algorithm for Supervisory Control of Power
Plants | null | null | 10.1016/j.knosys.2024.112312 | null | cs.SY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditional control theory-based methods require tailored engineering for
each system and constant fine-tuning. In power plant control, one often needs
to obtain a precise representation of the system dynamics and carefully design
the control scheme accordingly. Model-free Reinforcement learning (RL) has
emerged as a... | [
{
"created": "Tue, 23 Jan 2024 17:52:49 GMT",
"version": "v1"
}
] | 2024-08-06 | [
[
"Sun",
"Yixuan",
""
],
[
"Khairy",
"Sami",
""
],
[
"Vilim",
"Richard B.",
""
],
[
"Hu",
"Rui",
""
],
[
"Dave",
"Akshay J.",
""
]
] | Traditional control theory-based methods require tailored engineering for each system and constant fine-tuning. In power plant control, one often needs to obtain a precise representation of the system dynamics and carefully design the control scheme accordingly. Model-free Reinforcement learning (RL) has emerged as a p... |
1312.0617 | Jing Liu | Yi Zheng, Zhi-Zhu He, Jun Yang, Jing Liu | Fully Automatic Liquid Metal Printer towards Personal Electronics
Manufacture | null | null | null | null | cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Printed electronics is quickly emerging with tremendous value in a wide
variety of latest electrical engineering areas. However, restricted to the
rather limited conductive inks and printing strategies, the currently existing
electronics manufacturing tools are generally complicated, expensive, time,
material, water ... | [
{
"created": "Fri, 22 Nov 2013 08:01:38 GMT",
"version": "v1"
}
] | 2013-12-04 | [
[
"Zheng",
"Yi",
""
],
[
"He",
"Zhi-Zhu",
""
],
[
"Yang",
"Jun",
""
],
[
"Liu",
"Jing",
""
]
] | Printed electronics is quickly emerging with tremendous value in a wide variety of latest electrical engineering areas. However, restricted to the rather limited conductive inks and printing strategies, the currently existing electronics manufacturing tools are generally complicated, expensive, time, material, water an... |
1410.0600 | Ghislain Fourny | Ghislain Fourny | Cell Stores | Technical report - 10 pages | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cell stores provide a relational-like, tabular level of abstraction to
business users while leveraging recent database technologies, such as key-value
stores and document stores. This allows to scale up and out the efficient
storage and retrieval of highly dimensional data. Cells are the primary
citizens and exist in... | [
{
"created": "Thu, 2 Oct 2014 16:14:22 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Oct 2014 15:51:58 GMT",
"version": "v2"
}
] | 2014-10-08 | [
[
"Fourny",
"Ghislain",
""
]
] | Cell stores provide a relational-like, tabular level of abstraction to business users while leveraging recent database technologies, such as key-value stores and document stores. This allows to scale up and out the efficient storage and retrieval of highly dimensional data. Cells are the primary citizens and exist in d... |
2305.18752 | Lin Song | Rui Yang, Lin Song, Yanwei Li, Sijie Zhao, Yixiao Ge, Xiu Li, Ying
Shan | GPT4Tools: Teaching Large Language Model to Use Tools via
Self-instruction | null | null | null | null | cs.CV cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper aims to efficiently enable Large Language Models (LLMs) to use
multimodal tools. Advanced proprietary LLMs, such as ChatGPT and GPT-4, have
shown great potential for tool usage through sophisticated prompt engineering.
Nevertheless, these models typically rely on prohibitive computational costs
and publicl... | [
{
"created": "Tue, 30 May 2023 05:27:21 GMT",
"version": "v1"
}
] | 2023-05-31 | [
[
"Yang",
"Rui",
""
],
[
"Song",
"Lin",
""
],
[
"Li",
"Yanwei",
""
],
[
"Zhao",
"Sijie",
""
],
[
"Ge",
"Yixiao",
""
],
[
"Li",
"Xiu",
""
],
[
"Shan",
"Ying",
""
]
] | This paper aims to efficiently enable Large Language Models (LLMs) to use multimodal tools. Advanced proprietary LLMs, such as ChatGPT and GPT-4, have shown great potential for tool usage through sophisticated prompt engineering. Nevertheless, these models typically rely on prohibitive computational costs and publicly ... |
2102.02038 | Lu Liu | Lu Liu, Tianyi Zhou, Guodong Long, Jing Jiang, Xuanyi Dong, Chengqi
Zhang | Isometric Propagation Network for Generalized Zero-shot Learning | Accepted by ICLR 2021 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Zero-shot learning (ZSL) aims to classify images of an unseen class only
based on a few attributes describing that class but no access to any training
sample. A popular strategy is to learn a mapping between the semantic space of
class attributes and the visual space of images based on the seen classes and
their data... | [
{
"created": "Wed, 3 Feb 2021 12:45:38 GMT",
"version": "v1"
}
] | 2021-02-04 | [
[
"Liu",
"Lu",
""
],
[
"Zhou",
"Tianyi",
""
],
[
"Long",
"Guodong",
""
],
[
"Jiang",
"Jing",
""
],
[
"Dong",
"Xuanyi",
""
],
[
"Zhang",
"Chengqi",
""
]
] | Zero-shot learning (ZSL) aims to classify images of an unseen class only based on a few attributes describing that class but no access to any training sample. A popular strategy is to learn a mapping between the semantic space of class attributes and the visual space of images based on the seen classes and their data. ... |
1711.09681 | YoungJoon Yoo | YoungJoon Yoo, Seonguk Park, Junyoung Choi, Sangdoo Yun, Nojun Kwak | Butterfly Effect: Bidirectional Control of Classification Performance by
Small Additive Perturbation | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper proposes a new algorithm for controlling classification results by
generating a small additive perturbation without changing the classifier
network. Our work is inspired by existing works generating adversarial
perturbation that worsens classification performance. In contrast to the
existing methods, our w... | [
{
"created": "Mon, 27 Nov 2017 13:32:45 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Dec 2017 05:39:10 GMT",
"version": "v2"
}
] | 2017-12-05 | [
[
"Yoo",
"YoungJoon",
""
],
[
"Park",
"Seonguk",
""
],
[
"Choi",
"Junyoung",
""
],
[
"Yun",
"Sangdoo",
""
],
[
"Kwak",
"Nojun",
""
]
] | This paper proposes a new algorithm for controlling classification results by generating a small additive perturbation without changing the classifier network. Our work is inspired by existing works generating adversarial perturbation that worsens classification performance. In contrast to the existing methods, our wor... |
2403.16405 | Wei Huang | Kaikang Zhao, Xi Chen, Wei Huang, Liuxin Ding, Xianglong Kong, Fan
Zhang | Ensemble Adversarial Defense via Integration of Multiple Dispersed Low
Curvature Models | Accepted to The 2024 International Joint Conference on Neural
Networks (IJCNN) | null | null | null | cs.LG cs.CR cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The integration of an ensemble of deep learning models has been extensively
explored to enhance defense against adversarial attacks. The diversity among
sub-models increases the attack cost required to deceive the majority of the
ensemble, thereby improving the adversarial robustness. While existing
approaches mainly... | [
{
"created": "Mon, 25 Mar 2024 03:44:36 GMT",
"version": "v1"
}
] | 2024-03-26 | [
[
"Zhao",
"Kaikang",
""
],
[
"Chen",
"Xi",
""
],
[
"Huang",
"Wei",
""
],
[
"Ding",
"Liuxin",
""
],
[
"Kong",
"Xianglong",
""
],
[
"Zhang",
"Fan",
""
]
] | The integration of an ensemble of deep learning models has been extensively explored to enhance defense against adversarial attacks. The diversity among sub-models increases the attack cost required to deceive the majority of the ensemble, thereby improving the adversarial robustness. While existing approaches mainly c... |
2110.14090 | Sergei Skorobogatov | Sergei Skorobogatov | Teardown and feasibility study of IronKey -- the most secure USB Flash
drive | 16 pages, 73 figures, Hardwear.IO conference 28-29 October 2021,
Hague, Netherlands | null | null | null | cs.CR | http://creativecommons.org/licenses/by/4.0/ | There are many solutions for protecting user data on USB Flash drives.
However, the family of IronKey devices was designed with the highest security
expectations. They are definitely standing above others by being certified to
FIPS 140-2 Level 3 and also claimed as certified by NATO for Top-Secret use.
Many encrypted... | [
{
"created": "Wed, 27 Oct 2021 00:03:16 GMT",
"version": "v1"
}
] | 2021-10-28 | [
[
"Skorobogatov",
"Sergei",
""
]
] | There are many solutions for protecting user data on USB Flash drives. However, the family of IronKey devices was designed with the highest security expectations. They are definitely standing above others by being certified to FIPS 140-2 Level 3 and also claimed as certified by NATO for Top-Secret use. Many encrypted U... |
1507.06906 | Luiz Capretz Dr. | Jie Xu, Luiz Fernando Capretz, Danny Ho | Exploratory Analysis of Quality Practices in Open Source Domain | null | Computer and Information Science, 3(4):35-48, 2010 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Software quality assurance has been a heated topic for several decades, but
relatively few analyses were performed on open source software (OSS). As OSS
has become very popular in our daily life, many researchers have been keen on
the quality practices in this area. Although quality management presents
distinct patte... | [
{
"created": "Fri, 24 Jul 2015 16:20:16 GMT",
"version": "v1"
}
] | 2015-07-27 | [
[
"Xu",
"Jie",
""
],
[
"Capretz",
"Luiz Fernando",
""
],
[
"Ho",
"Danny",
""
]
] | Software quality assurance has been a heated topic for several decades, but relatively few analyses were performed on open source software (OSS). As OSS has become very popular in our daily life, many researchers have been keen on the quality practices in this area. Although quality management presents distinct pattern... |
1902.06776 | Heidi Howard | Heidi Howard, Richard Mortier | A Generalised Solution to Distributed Consensus | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed consensus, the ability to reach agreement in the face of failures
and asynchrony, is a fundamental primitive for constructing reliable
distributed systems from unreliable components. The Paxos algorithm is
synonymous with distributed consensus, yet it performs poorly in practice and
is famously difficult ... | [
{
"created": "Mon, 18 Feb 2019 19:53:56 GMT",
"version": "v1"
}
] | 2019-02-20 | [
[
"Howard",
"Heidi",
""
],
[
"Mortier",
"Richard",
""
]
] | Distributed consensus, the ability to reach agreement in the face of failures and asynchrony, is a fundamental primitive for constructing reliable distributed systems from unreliable components. The Paxos algorithm is synonymous with distributed consensus, yet it performs poorly in practice and is famously difficult to... |
2202.00787 | Peizhao Li | Peizhao Li and Hongfu Liu | Achieving Fairness at No Utility Cost via Data Reweighing with Influence | To appear in ICML 2022 | null | null | null | cs.LG cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | With the fast development of algorithmic governance, fairness has become a
compulsory property for machine learning models to suppress unintentional
discrimination. In this paper, we focus on the pre-processing aspect for
achieving fairness, and propose a data reweighing approach that only adjusts
the weight for samp... | [
{
"created": "Tue, 1 Feb 2022 22:12:17 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Jun 2022 03:47:02 GMT",
"version": "v2"
}
] | 2022-06-20 | [
[
"Li",
"Peizhao",
""
],
[
"Liu",
"Hongfu",
""
]
] | With the fast development of algorithmic governance, fairness has become a compulsory property for machine learning models to suppress unintentional discrimination. In this paper, we focus on the pre-processing aspect for achieving fairness, and propose a data reweighing approach that only adjusts the weight for sample... |
2302.01090 | Tim Ziemer | Tim Ziemer | Goniometers are a Powerful Acoustic Feature for Music Information
Retrieval Tasks | null | null | null | null | cs.SD cs.IR eess.AS | http://creativecommons.org/licenses/by/4.0/ | Goniometers, also known as Phase Scopes or Vector Scopes, are audio metering
tools that help music producers and mixing engineers monitor spatial aspects of
a music mix, such as the stereo panorama, the width of single sources, the
amount and diffuseness of reverberation as well as phase cancellations that may
occur ... | [
{
"created": "Thu, 2 Feb 2023 13:23:54 GMT",
"version": "v1"
}
] | 2023-08-17 | [
[
"Ziemer",
"Tim",
""
]
] | Goniometers, also known as Phase Scopes or Vector Scopes, are audio metering tools that help music producers and mixing engineers monitor spatial aspects of a music mix, such as the stereo panorama, the width of single sources, the amount and diffuseness of reverberation as well as phase cancellations that may occur on... |
2110.10857 | Blaise Pascal Tine | Blaise Tine, Fares Elsabbagh, Krishna Yalamarthy, Hyesoon Kim | Vortex: Extending the RISC-V ISA for GPGPU and 3D-GraphicsResearch | null | MICRO'21: 54th Annual IEEE/ACM International Symposium on
Microarchitecture (MICRO '21), October 18--22, 2021, Virtual Event, Greece | null | null | cs.AR | http://creativecommons.org/licenses/by/4.0/ | The importance of open-source hardware and software has been increasing.
However, despite GPUs being one of the more popular accelerators across various
applications, there is very little open-source GPU infrastructure in the public
domain. We argue that one of the reasons for the lack of open-source
infrastructure f... | [
{
"created": "Thu, 21 Oct 2021 02:39:54 GMT",
"version": "v1"
}
] | 2021-10-22 | [
[
"Tine",
"Blaise",
""
],
[
"Elsabbagh",
"Fares",
""
],
[
"Yalamarthy",
"Krishna",
""
],
[
"Kim",
"Hyesoon",
""
]
] | The importance of open-source hardware and software has been increasing. However, despite GPUs being one of the more popular accelerators across various applications, there is very little open-source GPU infrastructure in the public domain. We argue that one of the reasons for the lack of open-source infrastructure for... |
2405.06691 | Lars Henning Klein | Akhil Arora, Lars Klein, Nearchos Potamitis, Roland Aydin, Caglar
Gulcehre, Robert West | Fleet of Agents: Coordinated Problem Solving with Large Language Models
using Genetic Particle Filtering | 11 pages, 1 figure, 4 tables | null | null | null | cs.CL cs.AI cs.LG cs.NE | http://creativecommons.org/licenses/by/4.0/ | Large language models (LLMs) have significantly evolved, moving from simple
output generation to complex reasoning and from stand-alone usage to being
embedded into broader frameworks. In this paper, we introduce \emph{Fleet of
Agents (FoA)}, a novel framework utilizing LLMs as agents to navigate through
dynamic tree... | [
{
"created": "Tue, 7 May 2024 09:36:23 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Arora",
"Akhil",
""
],
[
"Klein",
"Lars",
""
],
[
"Potamitis",
"Nearchos",
""
],
[
"Aydin",
"Roland",
""
],
[
"Gulcehre",
"Caglar",
""
],
[
"West",
"Robert",
""
]
] | Large language models (LLMs) have significantly evolved, moving from simple output generation to complex reasoning and from stand-alone usage to being embedded into broader frameworks. In this paper, we introduce \emph{Fleet of Agents (FoA)}, a novel framework utilizing LLMs as agents to navigate through dynamic tree s... |
2208.04343 | Jimiama Mosima Mafeni Mase | Aayush Kumar, Jimiama Mafeni Mase, Divish Rengasamy, Benjamin
Rothwell, Mercedes Torres Torres, David A. Winkler, Grazziela P. Figueredo | EFI: A Toolbox for Feature Importance Fusion and Interpretation in
Python | 16 pages, 5 tables, 9 figures | null | null | null | cs.LG cs.LO | http://creativecommons.org/licenses/by/4.0/ | This paper presents an open-source Python toolbox called Ensemble Feature
Importance (EFI) to provide machine learning (ML) researchers, domain experts,
and decision makers with robust and accurate feature importance quantification
and more reliable mechanistic interpretation of feature importance for
prediction prob... | [
{
"created": "Mon, 8 Aug 2022 18:02:37 GMT",
"version": "v1"
}
] | 2022-08-12 | [
[
"Kumar",
"Aayush",
""
],
[
"Mase",
"Jimiama Mafeni",
""
],
[
"Rengasamy",
"Divish",
""
],
[
"Rothwell",
"Benjamin",
""
],
[
"Torres",
"Mercedes Torres",
""
],
[
"Winkler",
"David A.",
""
],
[
"Figueredo",
"Graz... | This paper presents an open-source Python toolbox called Ensemble Feature Importance (EFI) to provide machine learning (ML) researchers, domain experts, and decision makers with robust and accurate feature importance quantification and more reliable mechanistic interpretation of feature importance for prediction proble... |
1609.01466 | Radu Horaud P | Georgios Evangelidis and Radu Horaud | Joint Alignment of Multiple Point Sets with Batch and Incremental
Expectation-Maximization | 14 pages, 12 figures, 5 tables | IEEE Transactions on Pattern Analysis and Machine Intelligence,
40(6), 1397 - 1410, 2018 | 10.1109/TPAMI.2017.2717829 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper addresses the problem of registering multiple point sets.
Solutions to this problem are often approximated by repeatedly solving for
pairwise registration, which results in an uneven treatment of the sets forming
a pair: a model set and a data set. The main drawback of this strategy is that
the model set m... | [
{
"created": "Tue, 6 Sep 2016 10:00:46 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Mar 2017 10:47:50 GMT",
"version": "v2"
}
] | 2018-10-15 | [
[
"Evangelidis",
"Georgios",
""
],
[
"Horaud",
"Radu",
""
]
] | This paper addresses the problem of registering multiple point sets. Solutions to this problem are often approximated by repeatedly solving for pairwise registration, which results in an uneven treatment of the sets forming a pair: a model set and a data set. The main drawback of this strategy is that the model set may... |
2002.05239 | Matthias Lanzinger | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon | Complexity Analysis of Generalized and Fractional Hypertree
Decompositions | This is a significantly extended and enhanced version of
arXiv:1611.01090 | null | 10.1145/3457374 | null | cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hypertree decompositions (HDs), as well as the more powerful generalized
hypertree decompositions (GHDs), and the yet more general fractional hypertree
decompositions (FHDs) are hypergraph decomposition methods successfully used
for answering conjunctive queries and for solving constraint satisfaction
problems. Every... | [
{
"created": "Wed, 12 Feb 2020 21:21:05 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Mar 2020 13:18:58 GMT",
"version": "v2"
}
] | 2021-11-22 | [
[
"Gottlob",
"Georg",
""
],
[
"Lanzinger",
"Matthias",
""
],
[
"Pichler",
"Reinhard",
""
],
[
"Razgon",
"Igor",
""
]
] | Hypertree decompositions (HDs), as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHDs) are hypergraph decomposition methods successfully used for answering conjunctive queries and for solving constraint satisfaction problems. Every h... |
2003.07370 | Vivian Lai | Vivian Lai, Samuel Carton, Chenhao Tan | Harnessing Explanations to Bridge AI and Humans | 4 pages, CHI 2020 Fair & Responsible AI Workshop | null | null | null | cs.HC cs.AI cs.CL cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning models are increasingly integrated into societally critical
applications such as recidivism prediction and medical diagnosis, thanks to
their superior predictive power. In these applications, however, full
automation is often not desired due to ethical and legal concerns. The research
community has t... | [
{
"created": "Mon, 16 Mar 2020 18:00:02 GMT",
"version": "v1"
}
] | 2020-03-18 | [
[
"Lai",
"Vivian",
""
],
[
"Carton",
"Samuel",
""
],
[
"Tan",
"Chenhao",
""
]
] | Machine learning models are increasingly integrated into societally critical applications such as recidivism prediction and medical diagnosis, thanks to their superior predictive power. In these applications, however, full automation is often not desired due to ethical and legal concerns. The research community has thu... |
1906.11829 | Cody Coleman | Cody Coleman, Christopher Yeh, Stephen Mussmann, Baharan
Mirzasoleiman, Peter Bailis, Percy Liang, Jure Leskovec, Matei Zaharia | Selection via Proxy: Efficient Data Selection for Deep Learning | ICLR 2020 | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data selection methods, such as active learning and core-set selection, are
useful tools for machine learning on large datasets. However, they can be
prohibitively expensive to apply in deep learning because they depend on
feature representations that need to be learned. In this work, we show that we
can greatly impr... | [
{
"created": "Wed, 26 Jun 2019 23:01:47 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Oct 2019 22:40:23 GMT",
"version": "v2"
},
{
"created": "Tue, 18 Feb 2020 04:28:27 GMT",
"version": "v3"
},
{
"created": "Tue, 27 Oct 2020 00:52:20 GMT",
"version": "v4"
}
] | 2020-10-28 | [
[
"Coleman",
"Cody",
""
],
[
"Yeh",
"Christopher",
""
],
[
"Mussmann",
"Stephen",
""
],
[
"Mirzasoleiman",
"Baharan",
""
],
[
"Bailis",
"Peter",
""
],
[
"Liang",
"Percy",
""
],
[
"Leskovec",
"Jure",
""
],
... | Data selection methods, such as active learning and core-set selection, are useful tools for machine learning on large datasets. However, they can be prohibitively expensive to apply in deep learning because they depend on feature representations that need to be learned. In this work, we show that we can greatly improv... |
1706.04317 | Ken Kansky | Ken Kansky, Tom Silver, David A. M\'ely, Mohamed Eldawy, Miguel
L\'azaro-Gredilla, Xinghua Lou, Nimrod Dorfman, Szymon Sidor, Scott Phoenix,
Dileep George | Schema Networks: Zero-shot Transfer with a Generative Causal Model of
Intuitive Physics | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recent adaptation of deep neural network-based methods to reinforcement
learning and planning domains has yielded remarkable progress on individual
tasks. Nonetheless, progress on task-to-task transfer remains limited. In
pursuit of efficient and robust generalization, we introduce the Schema
Network, an object-o... | [
{
"created": "Wed, 14 Jun 2017 05:11:08 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Aug 2017 23:37:54 GMT",
"version": "v2"
}
] | 2017-08-21 | [
[
"Kansky",
"Ken",
""
],
[
"Silver",
"Tom",
""
],
[
"Mély",
"David A.",
""
],
[
"Eldawy",
"Mohamed",
""
],
[
"Lázaro-Gredilla",
"Miguel",
""
],
[
"Lou",
"Xinghua",
""
],
[
"Dorfman",
"Nimrod",
""
],
[
... | The recent adaptation of deep neural network-based methods to reinforcement learning and planning domains has yielded remarkable progress on individual tasks. Nonetheless, progress on task-to-task transfer remains limited. In pursuit of efficient and robust generalization, we introduce the Schema Network, an object-ori... |
1704.07187 | Irina Petrova | Irina Petrova, Arina Buzdalova | Reinforcement Learning Based Dynamic Selection of Auxiliary Objectives
with Preserving of the Best Found Solution | this is a full version of a paper which has been accepted as a
student workshop paper to GECCO conference 2017 | null | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Efficiency of single-objective optimization can be improved by introducing
some auxiliary objectives. Ideally, auxiliary objectives should be helpful.
However, in practice, objectives may be efficient on some optimization stages
but obstructive on others. In this paper we propose a modification of the EA+RL
method wh... | [
{
"created": "Mon, 24 Apr 2017 12:52:51 GMT",
"version": "v1"
}
] | 2017-04-25 | [
[
"Petrova",
"Irina",
""
],
[
"Buzdalova",
"Arina",
""
]
] | Efficiency of single-objective optimization can be improved by introducing some auxiliary objectives. Ideally, auxiliary objectives should be helpful. However, in practice, objectives may be efficient on some optimization stages but obstructive on others. In this paper we propose a modification of the EA+RL method whic... |
1403.1897 | Yongjune Kim | Yongjune Kim, B V K Vijaya Kumar | On the Duality of Erasures and Defects | 40 pages, 8 figures, submitted to IEEE Transactions on Information
Theory | null | 10.1109/JCN.2018.000051 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, the duality of erasures and defects will be investigated by
comparing the binary erasure channel (BEC) and the binary defect channel (BDC).
The duality holds for channel capacities, capacity achieving schemes, minimum
distances, and upper bounds on the probability of failure to retrieve the
original me... | [
{
"created": "Fri, 7 Mar 2014 23:22:15 GMT",
"version": "v1"
}
] | 2019-12-25 | [
[
"Kim",
"Yongjune",
""
],
[
"Kumar",
"B V K Vijaya",
""
]
] | In this paper, the duality of erasures and defects will be investigated by comparing the binary erasure channel (BEC) and the binary defect channel (BDC). The duality holds for channel capacities, capacity achieving schemes, minimum distances, and upper bounds on the probability of failure to retrieve the original mess... |
1411.1906 | Christos Mousas | Christos Mousas, Paul Newbury and Christos-Nikolaos Anagnostopoulos | Footprint-Driven Locomotion Composition | null | International Journal of Computer Graphics & Animation (IJCGA)
Vol.4, No.4, pp. 27-42, October 2014 | 10.5121/ijcga.2014.4403 | null | cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most efficient ways of generating goal-directed walking motions is
synthesising the final motion based on footprints. Nevertheless, current
implementations have not examined the generation of continuous motion based on
footprints, where different behaviours can be generated automatically.
Therefore, in thi... | [
{
"created": "Fri, 7 Nov 2014 13:29:06 GMT",
"version": "v1"
}
] | 2014-11-10 | [
[
"Mousas",
"Christos",
""
],
[
"Newbury",
"Paul",
""
],
[
"Anagnostopoulos",
"Christos-Nikolaos",
""
]
] | One of the most efficient ways of generating goal-directed walking motions is synthesising the final motion based on footprints. Nevertheless, current implementations have not examined the generation of continuous motion based on footprints, where different behaviours can be generated automatically. Therefore, in this ... |
2310.03026 | Mingyu Ding | Hao Sha, Yao Mu, Yuxuan Jiang, Li Chen, Chenfeng Xu, Ping Luo, Shengbo
Eben Li, Masayoshi Tomizuka, Wei Zhan, Mingyu Ding | LanguageMPC: Large Language Models as Decision Makers for Autonomous
Driving | null | null | null | null | cs.RO cs.AI cs.CL cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Existing learning-based autonomous driving (AD) systems face challenges in
comprehending high-level information, generalizing to rare events, and
providing interpretability. To address these problems, this work employs Large
Language Models (LLMs) as a decision-making component for complex AD scenarios
that require h... | [
{
"created": "Wed, 4 Oct 2023 17:59:49 GMT",
"version": "v1"
},
{
"created": "Fri, 13 Oct 2023 16:13:43 GMT",
"version": "v2"
}
] | 2023-10-16 | [
[
"Sha",
"Hao",
""
],
[
"Mu",
"Yao",
""
],
[
"Jiang",
"Yuxuan",
""
],
[
"Chen",
"Li",
""
],
[
"Xu",
"Chenfeng",
""
],
[
"Luo",
"Ping",
""
],
[
"Li",
"Shengbo Eben",
""
],
[
"Tomizuka",
"Masayoshi"... | Existing learning-based autonomous driving (AD) systems face challenges in comprehending high-level information, generalizing to rare events, and providing interpretability. To address these problems, this work employs Large Language Models (LLMs) as a decision-making component for complex AD scenarios that require hum... |
2208.03096 | EPTCS | Zach Hansen (University of Nebraska Omaha) | Tools and Methodologies for Verifying Answer Set Programs | In Proceedings ICLP 2022, arXiv:2208.02685 | EPTCS 364, 2022, pp. 211-216 | 10.4204/EPTCS.364.36 | null | cs.LO cs.AI cs.PL | http://creativecommons.org/licenses/by/4.0/ | Answer Set Programming (ASP) is a powerful declarative programming paradigm
commonly used for solving challenging search and optimization problems. The
modeling languages of ASP are supported by sophisticated solving algorithms
(solvers) that make the solution search efficient while enabling the programmer
to model t... | [
{
"created": "Fri, 5 Aug 2022 10:50:21 GMT",
"version": "v1"
}
] | 2022-08-08 | [
[
"Hansen",
"Zach",
"",
"University of Nebraska Omaha"
]
] | Answer Set Programming (ASP) is a powerful declarative programming paradigm commonly used for solving challenging search and optimization problems. The modeling languages of ASP are supported by sophisticated solving algorithms (solvers) that make the solution search efficient while enabling the programmer to model the... |
2310.10509 | Changhao Wang | Xiang Zhang, Changhao Wang, Lingfeng Sun, Zheng Wu, Xinghao Zhu,
Masayoshi Tomizuka | Efficient Sim-to-real Transfer of Contact-Rich Manipulation Skills with
Online Admittance Residual Learning | Conference on Robot Learning (CoRL) 2023 | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Learning contact-rich manipulation skills is essential. Such skills require
the robots to interact with the environment with feasible manipulation
trajectories and suitable compliance control parameters to enable safe and
stable contact. However, learning these skills is challenging due to data
inefficiency in the re... | [
{
"created": "Mon, 16 Oct 2023 15:28:10 GMT",
"version": "v1"
}
] | 2023-10-17 | [
[
"Zhang",
"Xiang",
""
],
[
"Wang",
"Changhao",
""
],
[
"Sun",
"Lingfeng",
""
],
[
"Wu",
"Zheng",
""
],
[
"Zhu",
"Xinghao",
""
],
[
"Tomizuka",
"Masayoshi",
""
]
] | Learning contact-rich manipulation skills is essential. Such skills require the robots to interact with the environment with feasible manipulation trajectories and suitable compliance control parameters to enable safe and stable contact. However, learning these skills is challenging due to data inefficiency in the real... |
1901.07509 | Anoosheh Heidarzadeh | Anoosheh Heidarzadeh, Swanand Kadhe, Salim El Rouayheb, and Alex
Sprintson | Single-Server Multi-Message Individually-Private Information Retrieval
with Side Information | 11 pages; This work is a long version of an article submitted to IEEE
for possible publication; This version includes more details on Conjecture 2 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a multi-user variant of the private information retrieval problem
described as follows. Suppose there are $D$ users, each of which wants to
privately retrieve a distinct message from a server with the help of a trusted
agent. We assume that the agent has a random subset of $M$ messages that is not
known t... | [
{
"created": "Tue, 22 Jan 2019 18:34:37 GMT",
"version": "v1"
},
{
"created": "Sat, 2 Feb 2019 00:33:18 GMT",
"version": "v2"
}
] | 2019-02-05 | [
[
"Heidarzadeh",
"Anoosheh",
""
],
[
"Kadhe",
"Swanand",
""
],
[
"Rouayheb",
"Salim El",
""
],
[
"Sprintson",
"Alex",
""
]
] | We consider a multi-user variant of the private information retrieval problem described as follows. Suppose there are $D$ users, each of which wants to privately retrieve a distinct message from a server with the help of a trusted agent. We assume that the agent has a random subset of $M$ messages that is not known to ... |
2304.11130 | Preslav Nakov | Ashraf Haddad, Najwa Aaraj, Preslav Nakov, Septimiu Fabian Mare | Automated Mapping of CVE Vulnerability Records to MITRE CWE Weaknesses | cybersecurity, MITRE, CVE, CWE | null | null | null | cs.CR cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, a proliferation of cyber-security threats and diversity has
been on the rise culminating in an increase in their reporting and analysis. To
counter that, many non-profit organizations have emerged in this domain, such
as MITRE and OSWAP, which have been actively tracking vulnerabilities, and
publishi... | [
{
"created": "Thu, 13 Apr 2023 19:46:54 GMT",
"version": "v1"
}
] | 2023-04-24 | [
[
"Haddad",
"Ashraf",
""
],
[
"Aaraj",
"Najwa",
""
],
[
"Nakov",
"Preslav",
""
],
[
"Mare",
"Septimiu Fabian",
""
]
] | In recent years, a proliferation of cyber-security threats and diversity has been on the rise culminating in an increase in their reporting and analysis. To counter that, many non-profit organizations have emerged in this domain, such as MITRE and OSWAP, which have been actively tracking vulnerabilities, and publishing... |
2408.00964 | Mustafa Abdallah | Md Reya Shad Azim, and Mustafa Abdallah | A Quantal Response Analysis of Defender-Attacker Sequential Security
Games | null | null | null | null | cs.GT cs.CR cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | We explore a scenario involving two sites and a sequential game between a
defender and an attacker, where the defender is responsible for securing the
sites while the attacker aims to attack them. Each site holds a loss value for
the defender when compromised, along with a probability of successful attack.
The defend... | [
{
"created": "Fri, 2 Aug 2024 00:40:48 GMT",
"version": "v1"
}
] | 2024-08-05 | [
[
"Azim",
"Md Reya Shad",
""
],
[
"Abdallah",
"Mustafa",
""
]
] | We explore a scenario involving two sites and a sequential game between a defender and an attacker, where the defender is responsible for securing the sites while the attacker aims to attack them. Each site holds a loss value for the defender when compromised, along with a probability of successful attack. The defender... |
2012.13376 | Zhaobin Mo | Zhaobin Mo, Xuan Di, Rongye Shi | A Physics-Informed Deep Learning Paradigm for Car-Following Models | null | null | 10.1016/j.trc.2021.103240 | null | cs.LG eess.SP | http://creativecommons.org/licenses/by/4.0/ | Car-following behavior has been extensively studied using physics-based
models, such as the Intelligent Driver Model. These models successfully
interpret traffic phenomena observed in the real-world but may not fully
capture the complex cognitive process of driving. Deep learning models, on the
other hand, have demon... | [
{
"created": "Thu, 24 Dec 2020 18:04:08 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Dec 2020 22:56:35 GMT",
"version": "v2"
},
{
"created": "Thu, 27 May 2021 14:15:31 GMT",
"version": "v3"
},
{
"created": "Wed, 14 Jul 2021 00:54:45 GMT",
"version": "v4"
}
] | 2021-07-15 | [
[
"Mo",
"Zhaobin",
""
],
[
"Di",
"Xuan",
""
],
[
"Shi",
"Rongye",
""
]
] | Car-following behavior has been extensively studied using physics-based models, such as the Intelligent Driver Model. These models successfully interpret traffic phenomena observed in the real-world but may not fully capture the complex cognitive process of driving. Deep learning models, on the other hand, have demonst... |
2210.03422 | Jose Manuel Gomez-Perez Dr. | Andr\'es Garc\'ia-Silva, Cristian Berr\'io, Jos\'e Manuel
G\'omez-P\'erez, Jos\'e Antonio Mart\'inez-Heras, Alessandro Donati, Ilaria
Roma | SpaceQA: Answering Questions about the Design of Space Missions and
Space Craft Concepts | In proceedings of the 45th International ACM SIGIR Conference on
Research and Development in Information Retrieval (SIGIR 2022) | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present SpaceQA, to the best of our knowledge the first open-domain QA
system in Space mission design. SpaceQA is part of an initiative by the
European Space Agency (ESA) to facilitate the access, sharing and reuse of
information about Space mission design within the agency and with the public.
We adopt a state-of... | [
{
"created": "Fri, 7 Oct 2022 09:41:39 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Nov 2022 09:51:43 GMT",
"version": "v2"
}
] | 2022-11-07 | [
[
"García-Silva",
"Andrés",
""
],
[
"Berrío",
"Cristian",
""
],
[
"Gómez-Pérez",
"José Manuel",
""
],
[
"Martínez-Heras",
"José Antonio",
""
],
[
"Donati",
"Alessandro",
""
],
[
"Roma",
"Ilaria",
""
]
] | We present SpaceQA, to the best of our knowledge the first open-domain QA system in Space mission design. SpaceQA is part of an initiative by the European Space Agency (ESA) to facilitate the access, sharing and reuse of information about Space mission design within the agency and with the public. We adopt a state-of-t... |
2407.00119 | Yuntao Shou | Yuntao Shou, Wei Ai, Jiayi Du, Tao Meng, Haiyan Liu | Efficient Long-distance Latent Relation-aware Graph Neural Network for
Multi-modal Emotion Recognition in Conversations | 11 pages, 3 tables | null | null | null | cs.LG cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | The task of multi-modal emotion recognition in conversation (MERC) aims to
analyze the genuine emotional state of each utterance based on the multi-modal
information in the conversation, which is crucial for conversation
understanding. Existing methods focus on using graph neural networks (GNN) to
model conversationa... | [
{
"created": "Thu, 27 Jun 2024 15:54:12 GMT",
"version": "v1"
}
] | 2024-07-02 | [
[
"Shou",
"Yuntao",
""
],
[
"Ai",
"Wei",
""
],
[
"Du",
"Jiayi",
""
],
[
"Meng",
"Tao",
""
],
[
"Liu",
"Haiyan",
""
]
] | The task of multi-modal emotion recognition in conversation (MERC) aims to analyze the genuine emotional state of each utterance based on the multi-modal information in the conversation, which is crucial for conversation understanding. Existing methods focus on using graph neural networks (GNN) to model conversational ... |
2003.03882 | Yong Liu | Yong Liu and Lizhong Ding and Weiping Wang | Theoretical Analysis of Divide-and-Conquer ERM: Beyond Square Loss and
RKHS | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Theoretical analysis of the divide-and-conquer based distributed learning
with least square loss in the reproducing kernel Hilbert space (RKHS) have
recently been explored within the framework of learning theory. However, the
studies on learning theory for general loss functions and hypothesis spaces
remain limited. ... | [
{
"created": "Mon, 9 Mar 2020 01:50:19 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Mar 2020 01:34:05 GMT",
"version": "v2"
},
{
"created": "Tue, 21 Apr 2020 07:59:08 GMT",
"version": "v3"
}
] | 2020-04-22 | [
[
"Liu",
"Yong",
""
],
[
"Ding",
"Lizhong",
""
],
[
"Wang",
"Weiping",
""
]
] | Theoretical analysis of the divide-and-conquer based distributed learning with least square loss in the reproducing kernel Hilbert space (RKHS) have recently been explored within the framework of learning theory. However, the studies on learning theory for general loss functions and hypothesis spaces remain limited. To... |
2401.11207 | Sai Akash Bathini | Bathini Sai Akash, Akshara Kupireddy, Lalita Bhanu Murthy | Unfair TOS: An Automated Approach using Customized BERT | null | null | null | null | cs.CL cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Terms of Service (ToS) form an integral part of any agreement as it defines
the legal relationship between a service provider and an end-user. Not only do
they establish and delineate reciprocal rights and responsibilities, but they
also provide users with information on essential aspects of contracts that
pertain to... | [
{
"created": "Sat, 20 Jan 2024 10:42:15 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Jan 2024 05:37:33 GMT",
"version": "v2"
}
] | 2024-01-29 | [
[
"Akash",
"Bathini Sai",
""
],
[
"Kupireddy",
"Akshara",
""
],
[
"Murthy",
"Lalita Bhanu",
""
]
] | Terms of Service (ToS) form an integral part of any agreement as it defines the legal relationship between a service provider and an end-user. Not only do they establish and delineate reciprocal rights and responsibilities, but they also provide users with information on essential aspects of contracts that pertain to t... |
1809.05956 | Athanasia Panousopoulou | A. Panousopoulou, S. Farrens, K. Fotiadou, A. Woiselle, G.
Tsagkatakis, J-L. Starck, P. Tsakalides | A Distributed Learning Architecture for Scientific Imaging Problems | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Current trends in scientific imaging are challenged by the emerging need of
integrating sophisticated machine learning with Big Data analytics platforms.
This work proposes an in-memory distributed learning architecture for enabling
sophisticated learning and optimization techniques on scientific imaging
problems, wh... | [
{
"created": "Sun, 16 Sep 2018 21:01:17 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Sep 2018 21:19:47 GMT",
"version": "v2"
}
] | 2018-10-01 | [
[
"Panousopoulou",
"A.",
""
],
[
"Farrens",
"S.",
""
],
[
"Fotiadou",
"K.",
""
],
[
"Woiselle",
"A.",
""
],
[
"Tsagkatakis",
"G.",
""
],
[
"Starck",
"J-L.",
""
],
[
"Tsakalides",
"P.",
""
]
] | Current trends in scientific imaging are challenged by the emerging need of integrating sophisticated machine learning with Big Data analytics platforms. This work proposes an in-memory distributed learning architecture for enabling sophisticated learning and optimization techniques on scientific imaging problems, whic... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.