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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2206.01990 | Lorenzo Tamellini | Emily A. Baker, Alessandro Cappato, Sara Todeschini, Lorenzo
Tamellini, Giancarlo Sangalli, Alessandro Reali, Sauro Manenti | Combining the Morris Method and Multiple Error Metrics to Assess Aquifer
Characteristics and Recharge in the Lower Ticino Basin, in Italy | second submission after minor revisions | null | null | null | cs.CE | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Groundwater flow model accuracy is often limited by the uncertainty in model
parameters that characterize aquifer properties and aquifer recharge. Aquifer
properties such as hydraulic conductivity can have an uncertainty spanning
orders of magnitude. Meanwhile, parameters used to configure model boundary
conditions c... | [
{
"created": "Sat, 4 Jun 2022 13:28:39 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Sep 2022 08:12:56 GMT",
"version": "v2"
}
] | 2022-09-09 | [
[
"Baker",
"Emily A.",
""
],
[
"Cappato",
"Alessandro",
""
],
[
"Todeschini",
"Sara",
""
],
[
"Tamellini",
"Lorenzo",
""
],
[
"Sangalli",
"Giancarlo",
""
],
[
"Reali",
"Alessandro",
""
],
[
"Manenti",
"Sauro",
... | Groundwater flow model accuracy is often limited by the uncertainty in model parameters that characterize aquifer properties and aquifer recharge. Aquifer properties such as hydraulic conductivity can have an uncertainty spanning orders of magnitude. Meanwhile, parameters used to configure model boundary conditions can... |
2404.12143 | Hilde Weerts | Hilde Weerts, Rapha\"ele Xenidis, Fabien Tarissan, Henrik Palmer
Olsen, Mykola Pechenizkiy | The Neutrality Fallacy: When Algorithmic Fairness Interventions are
(Not) Positive Action | null | 2024 ACM Conference on Fairness, Accountability, and Transparency
(FAccT '24) | 10.1145/3630106.3659025 | null | cs.AI cs.CY | http://creativecommons.org/licenses/by/4.0/ | Various metrics and interventions have been developed to identify and
mitigate unfair outputs of machine learning systems. While individuals and
organizations have an obligation to avoid discrimination, the use of
fairness-aware machine learning interventions has also been described as
amounting to 'algorithmic posit... | [
{
"created": "Thu, 18 Apr 2024 12:44:35 GMT",
"version": "v1"
}
] | 2024-04-19 | [
[
"Weerts",
"Hilde",
""
],
[
"Xenidis",
"Raphaële",
""
],
[
"Tarissan",
"Fabien",
""
],
[
"Olsen",
"Henrik Palmer",
""
],
[
"Pechenizkiy",
"Mykola",
""
]
] | Various metrics and interventions have been developed to identify and mitigate unfair outputs of machine learning systems. While individuals and organizations have an obligation to avoid discrimination, the use of fairness-aware machine learning interventions has also been described as amounting to 'algorithmic positiv... |
2311.12205 | Mansi Girdhar | Mansi Girdhar, Junho Hong, Wencong Su, Akila Herath, Chen-Ching Liu | SDN-Based Dynamic Cybersecurity Framework of IEC-61850 Communications in
Smart Grid | 5 pages, 6 figures, 1 table, conference paper, supported by DOE
(CESER) program | null | null | null | cs.CR cs.CY | http://creativecommons.org/licenses/by-sa/4.0/ | In recent years, critical infrastructure and power grids have experienced a
series of cyber-attacks, leading to temporary, widespread blackouts of
considerable magnitude. Since most substations are unmanned and have limited
physical security protection, cyber breaches into power grid substations
present a risk. Nowad... | [
{
"created": "Mon, 20 Nov 2023 21:49:41 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Mar 2024 17:17:43 GMT",
"version": "v2"
}
] | 2024-03-08 | [
[
"Girdhar",
"Mansi",
""
],
[
"Hong",
"Junho",
""
],
[
"Su",
"Wencong",
""
],
[
"Herath",
"Akila",
""
],
[
"Liu",
"Chen-Ching",
""
]
] | In recent years, critical infrastructure and power grids have experienced a series of cyber-attacks, leading to temporary, widespread blackouts of considerable magnitude. Since most substations are unmanned and have limited physical security protection, cyber breaches into power grid substations present a risk. Nowaday... |
2303.01042 | Yuhu Shang | Yuhu Shang, Xuexiong Luo, Lihong Wang, Hao Peng, Xiankun Zhang, Yimeng
Ren, Kun Liang | Reinforcement Learning Guided Multi-Objective Exam Paper Generation | null | null | null | null | cs.LG cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To reduce the repetitive and complex work of instructors, exam paper
generation (EPG) technique has become a salient topic in the intelligent
education field, which targets at generating high-quality exam paper
automatically according to instructor-specified assessment criteria. The
current advances utilize the abili... | [
{
"created": "Thu, 2 Mar 2023 07:55:52 GMT",
"version": "v1"
}
] | 2023-03-03 | [
[
"Shang",
"Yuhu",
""
],
[
"Luo",
"Xuexiong",
""
],
[
"Wang",
"Lihong",
""
],
[
"Peng",
"Hao",
""
],
[
"Zhang",
"Xiankun",
""
],
[
"Ren",
"Yimeng",
""
],
[
"Liang",
"Kun",
""
]
] | To reduce the repetitive and complex work of instructors, exam paper generation (EPG) technique has become a salient topic in the intelligent education field, which targets at generating high-quality exam paper automatically according to instructor-specified assessment criteria. The current advances utilize the ability... |
0802.3563 | Usman Khan | Usman A. Khan, Soummya Kar, and Jose' M. F. Moura | Distributed Sensor Localization in Random Environments using Minimal
Number of Anchor Nodes | 30 pages, submitted to IEEE Transactions on Signal Processing | U. A. Khan, S. Kar, and J. M. F. Moura, "Distributed sensor
localization in random environments using minimal number of anchor nodes,"
IEEE Transactions on Signal Processing, vol. 57, no. 5, pp. 2000-2016, May
2009 | 10.1109/TSP.2009.2014812 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The paper develops DILOC, a \emph{distributive}, \emph{iterative} algorithm
that locates M sensors in $\mathbb{R}^m, m\geq 1$, with respect to a minimal
number of m+1 anchors with known locations. The sensors exchange data with
their neighbors only; no centralized data processing or communication occurs,
nor is there... | [
{
"created": "Mon, 25 Feb 2008 07:29:19 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Aug 2008 03:07:12 GMT",
"version": "v2"
}
] | 2013-12-19 | [
[
"Khan",
"Usman A.",
""
],
[
"Kar",
"Soummya",
""
],
[
"Moura",
"Jose' M. F.",
""
]
] | The paper develops DILOC, a \emph{distributive}, \emph{iterative} algorithm that locates M sensors in $\mathbb{R}^m, m\geq 1$, with respect to a minimal number of m+1 anchors with known locations. The sensors exchange data with their neighbors only; no centralized data processing or communication occurs, nor is there c... |
2104.11396 | Linjian Ma | Linjian Ma and Chao Yang | Low Rank Approximation in Simulations of Quantum Algorithms | null | null | null | null | cs.CE cs.NA math.NA | http://creativecommons.org/licenses/by/4.0/ | Simulating quantum algorithms on classical computers is challenging when the
system size, i.e., the number of qubits used in the quantum algorithm, is
moderately large. However, some quantum algorithms and the corresponding
quantum circuits can be simulated efficiently on a classical computer if the
input quantum sta... | [
{
"created": "Fri, 23 Apr 2021 03:12:52 GMT",
"version": "v1"
}
] | 2021-04-26 | [
[
"Ma",
"Linjian",
""
],
[
"Yang",
"Chao",
""
]
] | Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, some quantum algorithms and the corresponding quantum circuits can be simulated efficiently on a classical computer if the input quantum state... |
2309.09112 | Jackson Woodruff | Jackson Woodruff and Thomas Koehler and Alexander Brauckmann and Chris
Cummins and Sam Ainsworth and Michael F.P. O'Boyle | Rewriting History: Repurposing Domain-Specific CGRAs | null | null | null | null | cs.PL cs.AR | http://creativecommons.org/licenses/by/4.0/ | Coarse-grained reconfigurable arrays (CGRAs) are domain-specific devices
promising both the flexibility of FPGAs and the performance of ASICs. However,
with restricted domains comes a danger: designing chips that cannot accelerate
enough current and future software to justify the hardware cost. We introduce
FlexC, th... | [
{
"created": "Sat, 16 Sep 2023 23:58:55 GMT",
"version": "v1"
}
] | 2023-09-19 | [
[
"Woodruff",
"Jackson",
""
],
[
"Koehler",
"Thomas",
""
],
[
"Brauckmann",
"Alexander",
""
],
[
"Cummins",
"Chris",
""
],
[
"Ainsworth",
"Sam",
""
],
[
"O'Boyle",
"Michael F. P.",
""
]
] | Coarse-grained reconfigurable arrays (CGRAs) are domain-specific devices promising both the flexibility of FPGAs and the performance of ASICs. However, with restricted domains comes a danger: designing chips that cannot accelerate enough current and future software to justify the hardware cost. We introduce FlexC, the ... |
1401.5612 | Aymen Louati | Aymen Louati, Chadlia Jerad, Kamel Barkaoui | Formalization and Verification of Hierarchical Use of Interaction
Overview Diagrams Using Timing Diagrams | 8 pages, 6 figures | null | null | null | cs.SE cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Thanks to its graphical notation and simplicity, Unified Modeling Language
(UML) is a de facto standard and a widespread language used in both industry
and academia, despite the fact that its semantics is still informal. The
Interaction Overview Diagram (IOD) is introduced in UML2; it allows the
specification of the ... | [
{
"created": "Wed, 22 Jan 2014 10:22:32 GMT",
"version": "v1"
}
] | 2014-01-23 | [
[
"Louati",
"Aymen",
""
],
[
"Jerad",
"Chadlia",
""
],
[
"Barkaoui",
"Kamel",
""
]
] | Thanks to its graphical notation and simplicity, Unified Modeling Language (UML) is a de facto standard and a widespread language used in both industry and academia, despite the fact that its semantics is still informal. The Interaction Overview Diagram (IOD) is introduced in UML2; it allows the specification of the be... |
2004.06286 | Dongrui Wu | Dongrui Wu and Yifan Xu and Bao-Liang Lu | Transfer Learning for EEG-Based Brain-Computer Interfaces: A Review of
Progress Made Since 2016 | null | IEEE Trans. on Cognitive and Developmental Systems, 14(1):4-19,
2022 | null | null | cs.HC cs.LG eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A brain-computer interface (BCI) enables a user to communicate with a
computer directly using brain signals. The most common non-invasive BCI
modality, electroencephalogram (EEG), is sensitive to noise/artifact and
suffers between-subject/within-subject non-stationarity. Therefore, it is
difficult to build a generic ... | [
{
"created": "Mon, 13 Apr 2020 16:44:55 GMT",
"version": "v1"
},
{
"created": "Sat, 18 Apr 2020 22:13:09 GMT",
"version": "v2"
},
{
"created": "Wed, 6 May 2020 22:19:40 GMT",
"version": "v3"
},
{
"created": "Fri, 3 Jul 2020 23:34:11 GMT",
"version": "v4"
}
] | 2022-11-15 | [
[
"Wu",
"Dongrui",
""
],
[
"Xu",
"Yifan",
""
],
[
"Lu",
"Bao-Liang",
""
]
] | A brain-computer interface (BCI) enables a user to communicate with a computer directly using brain signals. The most common non-invasive BCI modality, electroencephalogram (EEG), is sensitive to noise/artifact and suffers between-subject/within-subject non-stationarity. Therefore, it is difficult to build a generic pa... |
1102.5400 | Xianfu Chen | Xianfu Chen, Zhifeng Zhao, and Honggang Zhang | Power Allocation for Cognitive Wireless Mesh Networks by Applying
Multi-agent Q-learning Approach | null | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/3.0/ | As the scarce spectrum resource is becoming over-crowded, cognitive radios
(CRs) indicate great flexibility to improve the spectrum efficiency by
opportunistically accessing the authorized frequency bands. One of the critical
challenges for operating such radios in a network is how to efficiently
allocate transmissio... | [
{
"created": "Sat, 26 Feb 2011 10:29:23 GMT",
"version": "v1"
}
] | 2011-03-01 | [
[
"Chen",
"Xianfu",
""
],
[
"Zhao",
"Zhifeng",
""
],
[
"Zhang",
"Honggang",
""
]
] | As the scarce spectrum resource is becoming over-crowded, cognitive radios (CRs) indicate great flexibility to improve the spectrum efficiency by opportunistically accessing the authorized frequency bands. One of the critical challenges for operating such radios in a network is how to efficiently allocate transmission ... |
2404.02806 | Hussein Mozannar | Hussein Mozannar, Valerie Chen, Mohammed Alsobay, Subhro Das,
Sebastian Zhao, Dennis Wei, Manish Nagireddy, Prasanna Sattigeri, Ameet
Talwalkar, David Sontag | The RealHumanEval: Evaluating Large Language Models' Abilities to
Support Programmers | null | null | null | null | cs.SE cs.AI cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Evaluation of large language models (LLMs) for code has primarily relied on
static benchmarks, including HumanEval (Chen et al., 2021), which measure the
ability of LLMs to generate complete code that passes unit tests. As LLMs are
increasingly used as programmer assistants, we study whether gains on existing
benchma... | [
{
"created": "Wed, 3 Apr 2024 15:20:57 GMT",
"version": "v1"
}
] | 2024-04-04 | [
[
"Mozannar",
"Hussein",
""
],
[
"Chen",
"Valerie",
""
],
[
"Alsobay",
"Mohammed",
""
],
[
"Das",
"Subhro",
""
],
[
"Zhao",
"Sebastian",
""
],
[
"Wei",
"Dennis",
""
],
[
"Nagireddy",
"Manish",
""
],
[
... | Evaluation of large language models (LLMs) for code has primarily relied on static benchmarks, including HumanEval (Chen et al., 2021), which measure the ability of LLMs to generate complete code that passes unit tests. As LLMs are increasingly used as programmer assistants, we study whether gains on existing benchmark... |
1712.09014 | Michael Gagen Dr | M. J. Gagen | Null Dynamical State Models of Human Cognitive Dysfunction | 17 pages, 0 figures | null | null | null | cs.AI cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The hard problem in artificial intelligence asks how the shuffling of
syntactical symbols in a program can lead to systems which experience semantics
and qualia. We address this question in three stages. First, we introduce a new
class of human semantic symbols which appears when unexpected and drastic
environmental ... | [
{
"created": "Mon, 25 Dec 2017 05:46:19 GMT",
"version": "v1"
}
] | 2017-12-27 | [
[
"Gagen",
"M. J.",
""
]
] | The hard problem in artificial intelligence asks how the shuffling of syntactical symbols in a program can lead to systems which experience semantics and qualia. We address this question in three stages. First, we introduce a new class of human semantic symbols which appears when unexpected and drastic environmental ch... |
1006.5927 | Debotosh Bhattacharjee | Sandhya Arora, Latesh Malik, Debotosh Bhattacharjee, and Mita Nasipuri | Classification Of Gradient Change Features Using MLP For Handwritten
Character Recognition | null | EAIT 2006 | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A novel, generic scheme for off-line handwritten English alphabets character
images is proposed. The advantage of the technique is that it can be applied in
a generic manner to different applications and is expected to perform better in
uncertain and noisy environments. The recognition scheme is using a multilayer
pe... | [
{
"created": "Wed, 30 Jun 2010 17:14:40 GMT",
"version": "v1"
}
] | 2010-07-01 | [
[
"Arora",
"Sandhya",
""
],
[
"Malik",
"Latesh",
""
],
[
"Bhattacharjee",
"Debotosh",
""
],
[
"Nasipuri",
"Mita",
""
]
] | A novel, generic scheme for off-line handwritten English alphabets character images is proposed. The advantage of the technique is that it can be applied in a generic manner to different applications and is expected to perform better in uncertain and noisy environments. The recognition scheme is using a multilayer perc... |
2404.13179 | Zeinab Nezami | Zeinab Nezami, Emmanouil Chaniotakis, Evangelos Pournaras | When Computing follows Vehicles: Decentralized Mobility-Aware Resource
Allocation for Edge-to-Cloud Continuum | null | null | null | null | cs.DC cs.MA | http://creativecommons.org/licenses/by/4.0/ | The transformation of smart mobility is unprecedented--Autonomous, shared and
electric connected vehicles, along with the urgent need to meet ambitious
net-zero targets by shifting to low-carbon transport modalities result in new
traffic patterns and requirements for real-time computation at large-scale, for
instance... | [
{
"created": "Fri, 19 Apr 2024 21:03:54 GMT",
"version": "v1"
},
{
"created": "Sun, 5 May 2024 16:41:34 GMT",
"version": "v2"
}
] | 2024-05-07 | [
[
"Nezami",
"Zeinab",
""
],
[
"Chaniotakis",
"Emmanouil",
""
],
[
"Pournaras",
"Evangelos",
""
]
] | The transformation of smart mobility is unprecedented--Autonomous, shared and electric connected vehicles, along with the urgent need to meet ambitious net-zero targets by shifting to low-carbon transport modalities result in new traffic patterns and requirements for real-time computation at large-scale, for instance, ... |
2104.09827 | Sagnik Mukherjee | Jay Mundra, Rohan Gupta, Sagnik Mukherjee | WASSA@IITK at WASSA 2021: Multi-task Learning and Transformer Finetuning
for Emotion Classification and Empathy Prediction | Accepted at WASSA-2021, 4 Pages + 1 Page (references) | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper describes our contribution to the WASSA 2021 shared task on
Empathy Prediction and Emotion Classification. The broad goal of this task was
to model an empathy score, a distress score and the overall level of emotion of
an essay written in response to a newspaper article associated with harm to
someone. We ... | [
{
"created": "Tue, 20 Apr 2021 08:24:10 GMT",
"version": "v1"
}
] | 2021-04-21 | [
[
"Mundra",
"Jay",
""
],
[
"Gupta",
"Rohan",
""
],
[
"Mukherjee",
"Sagnik",
""
]
] | This paper describes our contribution to the WASSA 2021 shared task on Empathy Prediction and Emotion Classification. The broad goal of this task was to model an empathy score, a distress score and the overall level of emotion of an essay written in response to a newspaper article associated with harm to someone. We ha... |
2208.12743 | Man Zhang | Man Zhang, Andrea Arcuri, Yonggang Li, Yang Liu, Kaiming Xue | White-box Fuzzing RPC-based APIs with EvoMaster: An Industrial Case
Study | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Remote Procedure Call (RPC) is a communication protocol to support
client-server interactions among services over a network. RPC is widely applied
in industry for building large-scale distributed systems, such as
Microservices. Modern RPC frameworks include for example Thrift, gRPC, SOFARPC
and Dubbo. Testing such sy... | [
{
"created": "Fri, 26 Aug 2022 15:54:07 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Feb 2023 10:05:21 GMT",
"version": "v2"
}
] | 2023-02-06 | [
[
"Zhang",
"Man",
""
],
[
"Arcuri",
"Andrea",
""
],
[
"Li",
"Yonggang",
""
],
[
"Liu",
"Yang",
""
],
[
"Xue",
"Kaiming",
""
]
] | Remote Procedure Call (RPC) is a communication protocol to support client-server interactions among services over a network. RPC is widely applied in industry for building large-scale distributed systems, such as Microservices. Modern RPC frameworks include for example Thrift, gRPC, SOFARPC and Dubbo. Testing such syst... |
2302.14299 | Andrea Trevi\~no Gavito | Andrea Trevi\~no Gavito, Diego Klabjan, Jean Utke | Gradient-Boosted Based Structured and Unstructured Learning | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose two frameworks to deal with problem settings in which both
structured and unstructured data are available. Structured data problems are
best solved by traditional machine learning models such as boosting and
tree-based algorithms, whereas deep learning has been widely applied to
problems dealing with image... | [
{
"created": "Tue, 28 Feb 2023 04:16:42 GMT",
"version": "v1"
}
] | 2023-03-01 | [
[
"Gavito",
"Andrea Treviño",
""
],
[
"Klabjan",
"Diego",
""
],
[
"Utke",
"Jean",
""
]
] | We propose two frameworks to deal with problem settings in which both structured and unstructured data are available. Structured data problems are best solved by traditional machine learning models such as boosting and tree-based algorithms, whereas deep learning has been widely applied to problems dealing with images,... |
2207.14406 | Kalyan Veeramachaneni | Kevin Zhang, Neha Patki, Kalyan Veeramachaneni | Sequential Models in the Synthetic Data Vault | 17 pages, 8 figures | null | null | null | cs.LG cs.MS | http://creativecommons.org/licenses/by/4.0/ | The goal of this paper is to describe a system for generating synthetic
sequential data within the Synthetic data vault. To achieve this, we present
the Sequential model currently in SDV, an end-to-end framework that builds a
generative model for multi-sequence, real-world data. This includes a novel
neural network-b... | [
{
"created": "Thu, 28 Jul 2022 23:17:51 GMT",
"version": "v1"
}
] | 2022-08-01 | [
[
"Zhang",
"Kevin",
""
],
[
"Patki",
"Neha",
""
],
[
"Veeramachaneni",
"Kalyan",
""
]
] | The goal of this paper is to describe a system for generating synthetic sequential data within the Synthetic data vault. To achieve this, we present the Sequential model currently in SDV, an end-to-end framework that builds a generative model for multi-sequence, real-world data. This includes a novel neural network-bas... |
1301.4848 | Christophe Cruz | Frank Boochs (i3mainz), Andreas Marbs (i3mainz), Hung Truong (i3mainz,
Le2i), Helmi Ben Hmida (i3mainz), Ashish Karmacharya (i3mainz, Le2i),
Christophe Cruz (Le2i), Adlane Habed (Le2i), Yvon Voisin (Le2i), Christophe
Nicolle (Le2i) | Integration of knowledge to support automatic object reconstruction from
images and 3D data | null | Systems, Signals and Devices (SSD), 2011 8th International
Multi-Conference on, Chemnitz : Germany (2011) | 10.1109/SSD.2011.5993558 | null | cs.CG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Object reconstruction is an important task in many fields of application as
it allows to generate digital representations of our physical world used as
base for analysis, planning, construction, visualization or other aims. A
reconstruction itself normally is based on reliable data (images, 3D point
clouds for exampl... | [
{
"created": "Mon, 21 Jan 2013 12:42:54 GMT",
"version": "v1"
}
] | 2013-01-22 | [
[
"Boochs",
"Frank",
"",
"i3mainz"
],
[
"Marbs",
"Andreas",
"",
"i3mainz"
],
[
"Truong",
"Hung",
"",
"i3mainz,\n Le2i"
],
[
"Hmida",
"Helmi Ben",
"",
"i3mainz"
],
[
"Karmacharya",
"Ashish",
"",
"i3mainz, Le2i"
],
[
... | Object reconstruction is an important task in many fields of application as it allows to generate digital representations of our physical world used as base for analysis, planning, construction, visualization or other aims. A reconstruction itself normally is based on reliable data (images, 3D point clouds for example)... |
2104.01744 | Immanuel Trummer Mr. | Junxiong Wang and Immanuel Trummer and Debabrota Basu | UDO: Universal Database Optimization using Reinforcement Learning | null | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | UDO is a versatile tool for offline tuning of database systems for specific
workloads. UDO can consider a variety of tuning choices, reaching from picking
transaction code variants over index selections up to database system parameter
tuning. UDO uses reinforcement learning to converge to near-optimal
configurations,... | [
{
"created": "Mon, 5 Apr 2021 02:40:38 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Aug 2021 14:46:08 GMT",
"version": "v2"
}
] | 2021-08-27 | [
[
"Wang",
"Junxiong",
""
],
[
"Trummer",
"Immanuel",
""
],
[
"Basu",
"Debabrota",
""
]
] | UDO is a versatile tool for offline tuning of database systems for specific workloads. UDO can consider a variety of tuning choices, reaching from picking transaction code variants over index selections up to database system parameter tuning. UDO uses reinforcement learning to converge to near-optimal configurations, c... |
1801.03291 | Benjamin Sliwa | Benjamin Sliwa and Marcus Haferkamp and Manar Al-Askary and Dennis
Dorn and Christian Wietfeld | A Radio-fingerprinting-based Vehicle Classification System for
Intelligent Traffic Control in Smart Cities | null | 2018 Annual IEEE International Systems Conference (SysCon) | 10.1109/SYSCON.2018.8369511 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The measurement and provision of precise and upto-date traffic-related key
performance indicators is a key element and crucial factor for intelligent
traffic controls systems in upcoming smart cities. The street network is
considered as a highly-dynamic Cyber Physical System (CPS) where measured
information forms the... | [
{
"created": "Wed, 10 Jan 2018 10:29:23 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Jun 2018 05:22:36 GMT",
"version": "v2"
}
] | 2018-06-13 | [
[
"Sliwa",
"Benjamin",
""
],
[
"Haferkamp",
"Marcus",
""
],
[
"Al-Askary",
"Manar",
""
],
[
"Dorn",
"Dennis",
""
],
[
"Wietfeld",
"Christian",
""
]
] | The measurement and provision of precise and upto-date traffic-related key performance indicators is a key element and crucial factor for intelligent traffic controls systems in upcoming smart cities. The street network is considered as a highly-dynamic Cyber Physical System (CPS) where measured information forms the f... |
2403.03691 | Yufan Chen | Yufan Chen, Ching Ting Leung, Yong Huang, Jianwei Sun, Hao Chen, Hanyu
Gao | MolNexTR: A Generalized Deep Learning Model for Molecular Image
Recognition | Submitted to the Journal of Cheminformatics | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | In the field of chemical structure recognition, the task of converting
molecular images into graph structures and SMILES string stands as a
significant challenge, primarily due to the varied drawing styles and
conventions prevalent in chemical literature. To bridge this gap, we proposed
MolNexTR, a novel image-to-gra... | [
{
"created": "Wed, 6 Mar 2024 13:17:41 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Mar 2024 06:32:12 GMT",
"version": "v2"
}
] | 2024-03-11 | [
[
"Chen",
"Yufan",
""
],
[
"Leung",
"Ching Ting",
""
],
[
"Huang",
"Yong",
""
],
[
"Sun",
"Jianwei",
""
],
[
"Chen",
"Hao",
""
],
[
"Gao",
"Hanyu",
""
]
] | In the field of chemical structure recognition, the task of converting molecular images into graph structures and SMILES string stands as a significant challenge, primarily due to the varied drawing styles and conventions prevalent in chemical literature. To bridge this gap, we proposed MolNexTR, a novel image-to-graph... |
2201.07409 | Haoran Yang | Haoran Yang, Hongxu Chen, Shirui Pan, Lin Li, Philip S. Yu, Guandong
Xu | Dual Space Graph Contrastive Learning | null | null | 10.1145/3485447.3512211 | null | cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Unsupervised graph representation learning has emerged as a powerful tool to
address real-world problems and achieves huge success in the graph learning
domain. Graph contrastive learning is one of the unsupervised graph
representation learning methods, which recently attracts attention from
researchers and has achie... | [
{
"created": "Wed, 19 Jan 2022 04:10:29 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Mar 2022 20:09:47 GMT",
"version": "v2"
}
] | 2022-03-08 | [
[
"Yang",
"Haoran",
""
],
[
"Chen",
"Hongxu",
""
],
[
"Pan",
"Shirui",
""
],
[
"Li",
"Lin",
""
],
[
"Yu",
"Philip S.",
""
],
[
"Xu",
"Guandong",
""
]
] | Unsupervised graph representation learning has emerged as a powerful tool to address real-world problems and achieves huge success in the graph learning domain. Graph contrastive learning is one of the unsupervised graph representation learning methods, which recently attracts attention from researchers and has achieve... |
2403.02093 | Dominik Scheinert | Benjamin J. J. Pfister and Dominik Scheinert and Morgan K. Geldenhuys
and Odej Kao | Daedalus: Self-Adaptive Horizontal Autoscaling for Resource Efficiency
of Distributed Stream Processing Systems | 12 pages, 11 figures, 1 table | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed Stream Processing (DSP) systems are capable of processing large
streams of unbounded data, offering high throughput and low latencies. To
maintain a stable Quality of Service (QoS), these systems require a sufficient
allocation of resources. At the same time, over-provisioning can result in
wasted energy ... | [
{
"created": "Mon, 4 Mar 2024 14:53:50 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Mar 2024 10:31:37 GMT",
"version": "v2"
}
] | 2024-03-06 | [
[
"Pfister",
"Benjamin J. J.",
""
],
[
"Scheinert",
"Dominik",
""
],
[
"Geldenhuys",
"Morgan K.",
""
],
[
"Kao",
"Odej",
""
]
] | Distributed Stream Processing (DSP) systems are capable of processing large streams of unbounded data, offering high throughput and low latencies. To maintain a stable Quality of Service (QoS), these systems require a sufficient allocation of resources. At the same time, over-provisioning can result in wasted energy an... |
1911.10501 | Qifu Sun | Rina Su, Qifu Tyler Sun, Zhongshan Zhang | Delay-Complexity Trade-off of Random Linear Network Coding in Wireless
Broadcast | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In wireless broadcast, random linear network coding (RLNC) over GF(2^L) is
known to asymptotically achieve the optimal completion delay with increasing L.
However, the high decoding complexity hinders the potential applicability of
RLNC schemes over large GF(2^L). In this paper, a comprehensive analysis of
completion... | [
{
"created": "Sun, 24 Nov 2019 11:07:20 GMT",
"version": "v1"
},
{
"created": "Sat, 16 May 2020 01:20:07 GMT",
"version": "v2"
}
] | 2020-05-19 | [
[
"Su",
"Rina",
""
],
[
"Sun",
"Qifu Tyler",
""
],
[
"Zhang",
"Zhongshan",
""
]
] | In wireless broadcast, random linear network coding (RLNC) over GF(2^L) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF(2^L). In this paper, a comprehensive analysis of completion d... |
1406.5266 | Yaniv Taigman | Yaniv Taigman, Ming Yang, Marc'Aurelio Ranzato, Lior Wolf | Web-Scale Training for Face Identification | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Scaling machine learning methods to very large datasets has attracted
considerable attention in recent years, thanks to easy access to ubiquitous
sensing and data from the web. We study face recognition and show that three
distinct properties have surprising effects on the transferability of deep
convolutional networ... | [
{
"created": "Fri, 20 Jun 2014 02:51:31 GMT",
"version": "v1"
},
{
"created": "Sat, 18 Apr 2015 09:18:19 GMT",
"version": "v2"
}
] | 2015-04-21 | [
[
"Taigman",
"Yaniv",
""
],
[
"Yang",
"Ming",
""
],
[
"Ranzato",
"Marc'Aurelio",
""
],
[
"Wolf",
"Lior",
""
]
] | Scaling machine learning methods to very large datasets has attracted considerable attention in recent years, thanks to easy access to ubiquitous sensing and data from the web. We study face recognition and show that three distinct properties have surprising effects on the transferability of deep convolutional networks... |
2301.02889 | Zirou Qiu | Zirou Qiu, Chen Chen, Madhav V. Marathe, S. S. Ravi, Daniel J.
Rosenkrantz, Richard E. Stearns, Anil Vullikanti | Networked Anti-Coordination Games Meet Graphical Dynamical Systems:
Equilibria and Convergence | Accepted at AAAI-23 | null | null | null | cs.GT | http://creativecommons.org/licenses/by/4.0/ | Evolutionary anti-coordination games on networks capture real-world strategic
situations such as traffic routing and market competition. In such games,
agents maximize their utility by choosing actions that differ from their
neighbors' actions. Two important problems concerning evolutionary games are
the existence of... | [
{
"created": "Sat, 7 Jan 2023 16:32:22 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Mar 2023 18:25:09 GMT",
"version": "v2"
},
{
"created": "Fri, 8 Dec 2023 19:32:30 GMT",
"version": "v3"
},
{
"created": "Sun, 18 Feb 2024 19:22:12 GMT",
"version": "v4"
},
{
"crea... | 2024-04-02 | [
[
"Qiu",
"Zirou",
""
],
[
"Chen",
"Chen",
""
],
[
"Marathe",
"Madhav V.",
""
],
[
"Ravi",
"S. S.",
""
],
[
"Rosenkrantz",
"Daniel J.",
""
],
[
"Stearns",
"Richard E.",
""
],
[
"Vullikanti",
"Anil",
""
]
] | Evolutionary anti-coordination games on networks capture real-world strategic situations such as traffic routing and market competition. In such games, agents maximize their utility by choosing actions that differ from their neighbors' actions. Two important problems concerning evolutionary games are the existence of a... |
2203.12590 | Jaeun Phyo | Jauen Phyo, Wonjun Ko, Eunjin Jeon, and Heung-Il Suk | TransSleep: Transitioning-aware Attention-based Deep Neural Network for
Sleep Staging | 13 pages, 9 figures | null | null | null | cs.LG cs.AI cs.HC eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sleep staging is essential for sleep assessment and plays a vital role as a
health indicator. Many recent studies have devised various machine learning as
well as deep learning architectures for sleep staging. However, two key
challenges hinder the practical use of these architectures: effectively
capturing salient w... | [
{
"created": "Tue, 22 Mar 2022 08:55:32 GMT",
"version": "v1"
}
] | 2022-03-24 | [
[
"Phyo",
"Jauen",
""
],
[
"Ko",
"Wonjun",
""
],
[
"Jeon",
"Eunjin",
""
],
[
"Suk",
"Heung-Il",
""
]
] | Sleep staging is essential for sleep assessment and plays a vital role as a health indicator. Many recent studies have devised various machine learning as well as deep learning architectures for sleep staging. However, two key challenges hinder the practical use of these architectures: effectively capturing salient wav... |
2303.16753 | Peiyu Liu | Peiyu Liu, Ze-Feng Gao, Yushuo Chen, Wayne Xin Zhao, Ji-Rong Wen | Scaling Pre-trained Language Models to Deeper via Parameter-efficient
Architecture | 14 pages, 4 figures, 6 tables | null | null | null | cs.CL | http://creativecommons.org/publicdomain/zero/1.0/ | In this paper, we propose a highly parameter-efficient approach to scaling
pre-trained language models (PLMs) to a deeper model depth. Unlike prior work
that shares all parameters or uses extra blocks, we design a more capable
parameter-sharing architecture based on matrix product operator (MPO). MPO
decomposition ca... | [
{
"created": "Mon, 27 Mar 2023 02:34:09 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Apr 2023 02:45:10 GMT",
"version": "v2"
}
] | 2023-04-12 | [
[
"Liu",
"Peiyu",
""
],
[
"Gao",
"Ze-Feng",
""
],
[
"Chen",
"Yushuo",
""
],
[
"Zhao",
"Wayne Xin",
""
],
[
"Wen",
"Ji-Rong",
""
]
] | In this paper, we propose a highly parameter-efficient approach to scaling pre-trained language models (PLMs) to a deeper model depth. Unlike prior work that shares all parameters or uses extra blocks, we design a more capable parameter-sharing architecture based on matrix product operator (MPO). MPO decomposition can ... |
1901.06441 | Kenneth S. Palacio-Baus | Kenneth Palacio-Baus and Natasha Devroye | Achievable Error Exponents of One-Way and Two-Way AWGN Channels | 46 pages, 18 figures, Submitted to IEEE Transactions on Information
Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Achievable error exponents for the one-way with noisy feedback and two-way
AWGN channels are derived for the transmission of a finite number of messages
$M$ using fixed block length $n$, under the almost sure (AS) and the expected
block (EXP) power constraints. In the one-way setting under noisy AWGN
feedback, it is ... | [
{
"created": "Fri, 18 Jan 2019 23:27:43 GMT",
"version": "v1"
}
] | 2019-01-23 | [
[
"Palacio-Baus",
"Kenneth",
""
],
[
"Devroye",
"Natasha",
""
]
] | Achievable error exponents for the one-way with noisy feedback and two-way AWGN channels are derived for the transmission of a finite number of messages $M$ using fixed block length $n$, under the almost sure (AS) and the expected block (EXP) power constraints. In the one-way setting under noisy AWGN feedback, it is sh... |
1812.02953 | Han Yu | Han Yu, Zhiqi Shen, Chunyan Miao, Cyril Leung, Victor R. Lesser and
Qiang Yang | Building Ethics into Artificial Intelligence | null | H. Yu, Z. Shen, C. Miao, C. Leung, V. R. Lesser & Q. Yang,
"Building Ethics into Artificial Intelligence," in Proceedings of the 27th
International Joint Conference on Artificial Intelligence (IJCAI'18), pp.
5527-5533, 2018 | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As artificial intelligence (AI) systems become increasingly ubiquitous, the
topic of AI governance for ethical decision-making by AI has captured public
imagination. Within the AI research community, this topic remains less familiar
to many researchers. In this paper, we complement existing surveys, which
largely foc... | [
{
"created": "Fri, 7 Dec 2018 09:18:01 GMT",
"version": "v1"
}
] | 2018-12-10 | [
[
"Yu",
"Han",
""
],
[
"Shen",
"Zhiqi",
""
],
[
"Miao",
"Chunyan",
""
],
[
"Leung",
"Cyril",
""
],
[
"Lesser",
"Victor R.",
""
],
[
"Yang",
"Qiang",
""
]
] | As artificial intelligence (AI) systems become increasingly ubiquitous, the topic of AI governance for ethical decision-making by AI has captured public imagination. Within the AI research community, this topic remains less familiar to many researchers. In this paper, we complement existing surveys, which largely focus... |
2406.19433 | Armin Namavari | Armin Namavari, Barry Wang, Sanketh Menda, Ben Nassi, Nirvan Tyagi,
James Grimmelmann, Amy Zhang, Thomas Ristenpart | Private Hierarchical Governance for Encrypted Messaging | Published in IEEE Security and Privacy 2024 | null | 10.1109/SP54263.2024.00235 | null | cs.CR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The increasing harms caused by hate, harassment, and other forms of abuse
online have motivated major platforms to explore hierarchical governance. The
idea is to allow communities to have designated members take on moderation and
leadership duties; meanwhile, members can still escalate issues to the
platform. But th... | [
{
"created": "Thu, 27 Jun 2024 17:33:23 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Jul 2024 20:25:10 GMT",
"version": "v2"
}
] | 2024-07-04 | [
[
"Namavari",
"Armin",
""
],
[
"Wang",
"Barry",
""
],
[
"Menda",
"Sanketh",
""
],
[
"Nassi",
"Ben",
""
],
[
"Tyagi",
"Nirvan",
""
],
[
"Grimmelmann",
"James",
""
],
[
"Zhang",
"Amy",
""
],
[
"Ristenpa... | The increasing harms caused by hate, harassment, and other forms of abuse online have motivated major platforms to explore hierarchical governance. The idea is to allow communities to have designated members take on moderation and leadership duties; meanwhile, members can still escalate issues to the platform. But thes... |
2107.02139 | Lin Chen | Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu | Feature Cross Search via Submodular Optimization | Accepted to ESA 2021. Authors are ordered alphabetically | null | null | null | cs.LG cs.AI cs.CC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study feature cross search as a fundamental primitive in
feature engineering. The importance of feature cross search especially for the
linear model has been known for a while, with well-known textbook examples. In
this problem, the goal is to select a small subset of features, combine them to
form ... | [
{
"created": "Mon, 5 Jul 2021 16:58:31 GMT",
"version": "v1"
}
] | 2021-07-06 | [
[
"Chen",
"Lin",
""
],
[
"Esfandiari",
"Hossein",
""
],
[
"Fu",
"Gang",
""
],
[
"Mirrokni",
"Vahab S.",
""
],
[
"Yu",
"Qian",
""
]
] | In this paper, we study feature cross search as a fundamental primitive in feature engineering. The importance of feature cross search especially for the linear model has been known for a while, with well-known textbook examples. In this problem, the goal is to select a small subset of features, combine them to form a ... |
2304.03502 | Jaeho Jeong | Jaeho Jeong, Hosung Park, Hee-Youl Kwak, Jong-Seon No, Hahyeon Jeon,
Jeong Wook Lee, Jae-Won Kim | Iterative Soft Decoding Algorithm for DNA Storage Using Quality Score
and Redecoding | null | null | 10.1109/TNB.2023.3284406 | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | Ever since deoxyribonucleic acid (DNA) was considered as a next-generation
data-storage medium, lots of research efforts have been made to correct errors
occurred during the synthesis, storage, and sequencing processes using error
correcting codes (ECCs). Previous works on recovering the data from the
sequenced DNA p... | [
{
"created": "Fri, 7 Apr 2023 06:47:00 GMT",
"version": "v1"
}
] | 2023-06-14 | [
[
"Jeong",
"Jaeho",
""
],
[
"Park",
"Hosung",
""
],
[
"Kwak",
"Hee-Youl",
""
],
[
"No",
"Jong-Seon",
""
],
[
"Jeon",
"Hahyeon",
""
],
[
"Lee",
"Jeong Wook",
""
],
[
"Kim",
"Jae-Won",
""
]
] | Ever since deoxyribonucleic acid (DNA) was considered as a next-generation data-storage medium, lots of research efforts have been made to correct errors occurred during the synthesis, storage, and sequencing processes using error correcting codes (ECCs). Previous works on recovering the data from the sequenced DNA poo... |
2211.12581 | Chris Cameron | Chris Cameron, Jason Hartford, Taylor Lundy, Tuan Truong, Alan
Milligan, Rex Chen, Kevin Leyton-Brown | UNSAT Solver Synthesis via Monte Carlo Forest Search | null | null | 10.1007/978-3-031-60597-0_12 | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We introduce Monte Carlo Forest Search (MCFS), a class of reinforcement
learning (RL) algorithms for learning policies in {tree MDPs}, for which policy
execution involves traversing an exponential-sized tree. Examples of such
problems include proving unsatisfiability of a SAT formula; counting the number
of solutions... | [
{
"created": "Tue, 22 Nov 2022 20:52:50 GMT",
"version": "v1"
},
{
"created": "Fri, 26 May 2023 00:02:42 GMT",
"version": "v2"
},
{
"created": "Sat, 13 Jul 2024 02:55:33 GMT",
"version": "v3"
}
] | 2024-07-16 | [
[
"Cameron",
"Chris",
""
],
[
"Hartford",
"Jason",
""
],
[
"Lundy",
"Taylor",
""
],
[
"Truong",
"Tuan",
""
],
[
"Milligan",
"Alan",
""
],
[
"Chen",
"Rex",
""
],
[
"Leyton-Brown",
"Kevin",
""
]
] | We introduce Monte Carlo Forest Search (MCFS), a class of reinforcement learning (RL) algorithms for learning policies in {tree MDPs}, for which policy execution involves traversing an exponential-sized tree. Examples of such problems include proving unsatisfiability of a SAT formula; counting the number of solutions o... |
1704.08347 | Jiachun Liao | Jiachun Liao, Lalitha Sankar, Vincent Y. F. Tan and Flavio P. Calmon | Hypothesis Testing under Mutual Information Privacy Constraints in the
High Privacy Regime | 13 pages, 7 figures. The paper is submitted to "Transactions on
Information Forensics & Security". Comparing to the paper arXiv:1607.00533
"Hypothesis Testing in the High Privacy Limit", the overlapping content is
results for binary hypothesis testing with a zero error exponent, and the
extended contents are th... | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hypothesis testing is a statistical inference framework for determining the
true distribution among a set of possible distributions for a given dataset.
Privacy restrictions may require the curator of the data or the respondents
themselves to share data with the test only after applying a randomizing
privacy mechanis... | [
{
"created": "Wed, 26 Apr 2017 20:48:58 GMT",
"version": "v1"
}
] | 2017-04-28 | [
[
"Liao",
"Jiachun",
""
],
[
"Sankar",
"Lalitha",
""
],
[
"Tan",
"Vincent Y. F.",
""
],
[
"Calmon",
"Flavio P.",
""
]
] | Hypothesis testing is a statistical inference framework for determining the true distribution among a set of possible distributions for a given dataset. Privacy restrictions may require the curator of the data or the respondents themselves to share data with the test only after applying a randomizing privacy mechanism.... |
1910.00308 | Martin Schirneck | Thomas Bl\"asius, Tobias Friedrich, Martin Schirneck | The Minimization of Random Hypergraphs | 28 pages, 2 figures; Changes: binomial characterization unified,
improvement of the Chernoff-Hoeffding theorem extended to case x --> p | null | null | null | cs.DM cs.DS math.CO math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the maximum-entropy model $\mathcal{B}_{n,m,p}$ for random
$n$-vertex, $m$-edge multi-hypergraphs with expected edge size $pn$. We show
that the expected size of the minimization of $\mathcal{B}_{n,m,p}$, i.e., the
number of its inclusion-wise minimal edges, undergoes a phase transition with
respect to... | [
{
"created": "Tue, 1 Oct 2019 11:23:19 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Feb 2020 15:32:14 GMT",
"version": "v2"
},
{
"created": "Fri, 30 Oct 2020 11:17:31 GMT",
"version": "v3"
}
] | 2020-11-03 | [
[
"Bläsius",
"Thomas",
""
],
[
"Friedrich",
"Tobias",
""
],
[
"Schirneck",
"Martin",
""
]
] | We investigate the maximum-entropy model $\mathcal{B}_{n,m,p}$ for random $n$-vertex, $m$-edge multi-hypergraphs with expected edge size $pn$. We show that the expected size of the minimization of $\mathcal{B}_{n,m,p}$, i.e., the number of its inclusion-wise minimal edges, undergoes a phase transition with respect to $... |
2011.03915 | Kun He | Weiming Feng, Kun He, Yitong Yin | Sampling Constraint Satisfaction Solutions in the Local Lemma Regime | null | null | null | null | cs.DS cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give a Markov chain based algorithm for sampling almost uniform solutions
of constraint satisfaction problems (CSPs). Assuming a canonical setting for
the Lov\'asz local lemma, where each constraint is violated by a small number
of forbidden local configurations, our sampling algorithm is accurate in a
local lemma... | [
{
"created": "Sun, 8 Nov 2020 07:33:52 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Apr 2021 04:53:23 GMT",
"version": "v2"
}
] | 2021-04-13 | [
[
"Feng",
"Weiming",
""
],
[
"He",
"Kun",
""
],
[
"Yin",
"Yitong",
""
]
] | We give a Markov chain based algorithm for sampling almost uniform solutions of constraint satisfaction problems (CSPs). Assuming a canonical setting for the Lov\'asz local lemma, where each constraint is violated by a small number of forbidden local configurations, our sampling algorithm is accurate in a local lemma r... |
2311.01739 | John Tramm | John Tramm and Bryce Allen and Kazutomo Yoshii and Andrew Siegel and
Leighton Wilson | Efficient Algorithms for Monte Carlo Particle Transport on AI
Accelerator Hardware | null | null | null | null | cs.DC cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The recent trend toward deep learning has led to the development of a variety
of highly innovative AI accelerator architectures. One such architecture, the
Cerebras Wafer-Scale Engine 2 (WSE-2), features 40 GB of on-chip SRAM, making
it a potentially attractive platform for latency- or bandwidth-bound HPC
simulation ... | [
{
"created": "Fri, 3 Nov 2023 06:27:36 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Nov 2023 03:22:56 GMT",
"version": "v2"
}
] | 2023-11-08 | [
[
"Tramm",
"John",
""
],
[
"Allen",
"Bryce",
""
],
[
"Yoshii",
"Kazutomo",
""
],
[
"Siegel",
"Andrew",
""
],
[
"Wilson",
"Leighton",
""
]
] | The recent trend toward deep learning has led to the development of a variety of highly innovative AI accelerator architectures. One such architecture, the Cerebras Wafer-Scale Engine 2 (WSE-2), features 40 GB of on-chip SRAM, making it a potentially attractive platform for latency- or bandwidth-bound HPC simulation wo... |
2108.08798 | Roberto Machado | Roberto Assis Machado, Rafael G. L. D'Oliveira, Salim El Rouayheb and
Daniel Heinlein | Field Trace Polynomial Codes for Secure Distributed Matrix
Multiplication | null | 2021 XVII International Symposium "Problems of Redundancy in
Information and Control Systems" (REDUNDANCY) | 10.1109/REDUNDANCY52534.2021.9606447 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of communication efficient secure distributed matrix
multiplication. The previous literature has focused on reducing the number of
servers as a proxy for minimizing communication costs. The intuition being,
that the more servers used, the higher the communication cost. We show that
this is not... | [
{
"created": "Thu, 19 Aug 2021 17:16:12 GMT",
"version": "v1"
},
{
"created": "Thu, 9 Jun 2022 17:32:38 GMT",
"version": "v2"
}
] | 2022-06-10 | [
[
"Machado",
"Roberto Assis",
""
],
[
"D'Oliveira",
"Rafael G. L.",
""
],
[
"Rouayheb",
"Salim El",
""
],
[
"Heinlein",
"Daniel",
""
]
] | We consider the problem of communication efficient secure distributed matrix multiplication. The previous literature has focused on reducing the number of servers as a proxy for minimizing communication costs. The intuition being, that the more servers used, the higher the communication cost. We show that this is not t... |
1912.01107 | Marco Peressotti | Fabio Burco and Marino Miculan and Marco Peressotti | Towards a Formal Model for Composable Container Systems | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In modern cloud-based architectures, containers play a central role: they
provide powerful isolation mechanisms such that developers can focus on the
logic and dependencies of applications while system administrators can focus on
deployment and management issue. In this work, we propose a formal model for
container-b... | [
{
"created": "Mon, 2 Dec 2019 22:46:05 GMT",
"version": "v1"
}
] | 2019-12-04 | [
[
"Burco",
"Fabio",
""
],
[
"Miculan",
"Marino",
""
],
[
"Peressotti",
"Marco",
""
]
] | In modern cloud-based architectures, containers play a central role: they provide powerful isolation mechanisms such that developers can focus on the logic and dependencies of applications while system administrators can focus on deployment and management issue. In this work, we propose a formal model for container-bas... |
1409.1284 | Sawood Alam | Sawood Alam and Fateh ud din B Mehmood and Michael L. Nelson | Improving Accessibility of Archived Raster Dictionaries of Complex
Script Languages | 11 pages, 5 images, 2 codes, 1 table | null | 10.1145/2756406.2756926 | null | cs.DL cs.IR | http://creativecommons.org/licenses/by-nc-sa/3.0/ | We propose an approach to index raster images of dictionary pages which in
turn would require very little manual effort to enable direct access to the
appropriate pages of the dictionary for lookup. Accessibility is further
improved by feedback and crowdsourcing that enables highlighting of the
specific location on t... | [
{
"created": "Wed, 3 Sep 2014 23:27:18 GMT",
"version": "v1"
}
] | 2019-05-20 | [
[
"Alam",
"Sawood",
""
],
[
"Mehmood",
"Fateh ud din B",
""
],
[
"Nelson",
"Michael L.",
""
]
] | We propose an approach to index raster images of dictionary pages which in turn would require very little manual effort to enable direct access to the appropriate pages of the dictionary for lookup. Accessibility is further improved by feedback and crowdsourcing that enables highlighting of the specific location on the... |
cs/0611133 | Vladimir Migunov | Vladimir V. Migunov | The modelling of the automation schemes of technological processes in
CAD-system of renovation of the enterprises | 4 pages, 3 figures, in Russian | null | null | null | cs.CE | null | According to the requirements of the Russian standards, the automation
schemes are necessary practically in each project of renovation of industrial
buildings and facilities, in which any technological processes are realized.
The model representations of the automation schemes in CAD-system TechnoCAD
GlassX are descr... | [
{
"created": "Mon, 27 Nov 2006 04:39:09 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Migunov",
"Vladimir V.",
""
]
] | According to the requirements of the Russian standards, the automation schemes are necessary practically in each project of renovation of industrial buildings and facilities, in which any technological processes are realized. The model representations of the automation schemes in CAD-system TechnoCAD GlassX are describ... |
1507.05890 | Bart M. P. Jansen | Bart M. P. Jansen | On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs
Using 2-SAT | Presented at the 41st International Workshop on Graph-Theoretic
Concepts in Computer Science, WG 2015. (The statement of Lemma 4 was
corrected in this update.) | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hitting Set is a classic problem in combinatorial optimization. Its input
consists of a set system F over a finite universe U and an integer t; the
question is whether there is a set of t elements that intersects every set in
F. The Hitting Set problem parameterized by the size of the solution is a
well-known W[2]-co... | [
{
"created": "Tue, 21 Jul 2015 16:04:51 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Jul 2015 13:55:37 GMT",
"version": "v2"
}
] | 2015-07-27 | [
[
"Jansen",
"Bart M. P.",
""
]
] | Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting Set problem parameterized by the size of the solution is a well-known W[2]-comp... |
2005.12378 | Varoon Mathur | Varoon Mathur, Saptarshi Purkayastha, Judy Wawira Gichoya | Artificial Intelligence for Global Health: Learning From a Decade of
Digital Transformation in Health Care | Accepted Paper at ICLR 2020 Workshop on Practical ML for Developing
Countries | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The health needs of those living in resource-limited settings are a vastly
overlooked and understudied area in the intersection of machine learning (ML)
and health care. While the use of ML in health care is more recently
popularized over the last few years from the advancement of deep learning,
low-and-middle income... | [
{
"created": "Wed, 20 May 2020 23:50:17 GMT",
"version": "v1"
},
{
"created": "Wed, 27 May 2020 06:54:20 GMT",
"version": "v2"
}
] | 2020-05-28 | [
[
"Mathur",
"Varoon",
""
],
[
"Purkayastha",
"Saptarshi",
""
],
[
"Gichoya",
"Judy Wawira",
""
]
] | The health needs of those living in resource-limited settings are a vastly overlooked and understudied area in the intersection of machine learning (ML) and health care. While the use of ML in health care is more recently popularized over the last few years from the advancement of deep learning, low-and-middle income c... |
2210.15360 | Rui Liu | Yifan Hu, Rui Liu, Guanglai Gao, Haizhou Li | FCTalker: Fine and Coarse Grained Context Modeling for Expressive
Conversational Speech Synthesis | 5 pages, 4 figures, 1 table. Submitted to ICASSP 2023. We release the
source code at: https://github.com/walker-hyf/FCTalker | null | null | null | cs.CL cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Conversational Text-to-Speech (TTS) aims to synthesis an utterance with the
right linguistic and affective prosody in a conversational context. The
correlation between the current utterance and the dialogue history at the
utterance level was used to improve the expressiveness of synthesized speech.
However, the fine-... | [
{
"created": "Thu, 27 Oct 2022 12:20:20 GMT",
"version": "v1"
}
] | 2022-10-28 | [
[
"Hu",
"Yifan",
""
],
[
"Liu",
"Rui",
""
],
[
"Gao",
"Guanglai",
""
],
[
"Li",
"Haizhou",
""
]
] | Conversational Text-to-Speech (TTS) aims to synthesis an utterance with the right linguistic and affective prosody in a conversational context. The correlation between the current utterance and the dialogue history at the utterance level was used to improve the expressiveness of synthesized speech. However, the fine-gr... |
2207.09530 | Gilberto Ochoa-Ruiz | Pedro E. Chavarrias-Solanon and Mansoor Ali-Teevno and Gilberto
Ochoa-Ruiz and Sharib Ali | Knowledge distillation with a class-aware loss for endoscopic disease
detection | Paper accepted at the CaPTion workshop at MICCAI2022 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Prevalence of gastrointestinal (GI) cancer is growing alarmingly every year
leading to a substantial increase in the mortality rate. Endoscopic detection
is providing crucial diagnostic support, however, subtle lesions in upper and
lower GI are quite hard to detect and cause considerable missed detection. In
this wor... | [
{
"created": "Tue, 19 Jul 2022 19:56:12 GMT",
"version": "v1"
}
] | 2022-07-21 | [
[
"Chavarrias-Solanon",
"Pedro E.",
""
],
[
"Ali-Teevno",
"Mansoor",
""
],
[
"Ochoa-Ruiz",
"Gilberto",
""
],
[
"Ali",
"Sharib",
""
]
] | Prevalence of gastrointestinal (GI) cancer is growing alarmingly every year leading to a substantial increase in the mortality rate. Endoscopic detection is providing crucial diagnostic support, however, subtle lesions in upper and lower GI are quite hard to detect and cause considerable missed detection. In this work,... |
1408.5987 | Frank Neumann | Sergey Polyakovskiy, Rudolf Berghammer, Frank Neumann | Solving Hard Control Problems in Voting Systems via Integer Programming | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Voting problems are central in the area of social choice. In this article, we
investigate various voting systems and types of control of elections. We
present integer linear programming (ILP) formulations for a wide range of
NP-hard control problems. Our ILP formulations are flexible in the sense that
they can work w... | [
{
"created": "Tue, 26 Aug 2014 02:51:50 GMT",
"version": "v1"
},
{
"created": "Wed, 2 Sep 2015 01:10:24 GMT",
"version": "v2"
}
] | 2015-09-03 | [
[
"Polyakovskiy",
"Sergey",
""
],
[
"Berghammer",
"Rudolf",
""
],
[
"Neumann",
"Frank",
""
]
] | Voting problems are central in the area of social choice. In this article, we investigate various voting systems and types of control of elections. We present integer linear programming (ILP) formulations for a wide range of NP-hard control problems. Our ILP formulations are flexible in the sense that they can work wit... |
2307.04725 | Yuwei Guo | Yuwei Guo, Ceyuan Yang, Anyi Rao, Zhengyang Liang, Yaohui Wang, Yu
Qiao, Maneesh Agrawala, Dahua Lin, Bo Dai | AnimateDiff: Animate Your Personalized Text-to-Image Diffusion Models
without Specific Tuning | Codes and Supplementary Material:
https://github.com/guoyww/AnimateDiff | null | null | null | cs.CV cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the advance of text-to-image (T2I) diffusion models (e.g., Stable
Diffusion) and corresponding personalization techniques such as DreamBooth and
LoRA, everyone can manifest their imagination into high-quality images at an
affordable cost. However, adding motion dynamics to existing high-quality
personalized T2Is... | [
{
"created": "Mon, 10 Jul 2023 17:34:16 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Feb 2024 18:08:57 GMT",
"version": "v2"
}
] | 2024-02-09 | [
[
"Guo",
"Yuwei",
""
],
[
"Yang",
"Ceyuan",
""
],
[
"Rao",
"Anyi",
""
],
[
"Liang",
"Zhengyang",
""
],
[
"Wang",
"Yaohui",
""
],
[
"Qiao",
"Yu",
""
],
[
"Agrawala",
"Maneesh",
""
],
[
"Lin",
"Dahu... | With the advance of text-to-image (T2I) diffusion models (e.g., Stable Diffusion) and corresponding personalization techniques such as DreamBooth and LoRA, everyone can manifest their imagination into high-quality images at an affordable cost. However, adding motion dynamics to existing high-quality personalized T2Is a... |
2206.10944 | Alexey Skrynnik | Alexey Skrynnik, Anton Andreychuk, Konstantin Yakovlev, Aleksandr I.
Panov | POGEMA: Partially Observable Grid Environment for Multiple Agents | 7 pages, 7 figures | null | null | null | cs.LG cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce POGEMA (https://github.com/AIRI-Institute/pogema) a sandbox for
challenging partially observable multi-agent pathfinding (PO-MAPF) problems .
This is a grid-based environment that was specifically designed to be a
flexible, tunable and scalable benchmark. It can be tailored to a variety of
PO-MAPF, which... | [
{
"created": "Wed, 22 Jun 2022 09:39:50 GMT",
"version": "v1"
}
] | 2022-06-23 | [
[
"Skrynnik",
"Alexey",
""
],
[
"Andreychuk",
"Anton",
""
],
[
"Yakovlev",
"Konstantin",
""
],
[
"Panov",
"Aleksandr I.",
""
]
] | We introduce POGEMA (https://github.com/AIRI-Institute/pogema) a sandbox for challenging partially observable multi-agent pathfinding (PO-MAPF) problems . This is a grid-based environment that was specifically designed to be a flexible, tunable and scalable benchmark. It can be tailored to a variety of PO-MAPF, which c... |
2407.19674 | Cui Fangming | Fangming Cui, Xun Yang, Chao Wu, Liang Xiao, Xinmei Tian | Advancing Prompt Learning through an External Layer | null | null | 10.1145/3664647.3680953 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Prompt learning represents a promising method for adapting pre-trained
vision-language models (VLMs) to various downstream tasks by learning a set of
text embeddings. One challenge inherent to these methods is the poor
generalization performance due to the invalidity of the learned text embeddings
for unseen tasks. A... | [
{
"created": "Mon, 29 Jul 2024 03:30:09 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Jul 2024 05:26:13 GMT",
"version": "v2"
},
{
"created": "Wed, 7 Aug 2024 17:45:05 GMT",
"version": "v3"
},
{
"created": "Thu, 8 Aug 2024 02:39:15 GMT",
"version": "v4"
},
{
"cre... | 2024-08-12 | [
[
"Cui",
"Fangming",
""
],
[
"Yang",
"Xun",
""
],
[
"Wu",
"Chao",
""
],
[
"Xiao",
"Liang",
""
],
[
"Tian",
"Xinmei",
""
]
] | Prompt learning represents a promising method for adapting pre-trained vision-language models (VLMs) to various downstream tasks by learning a set of text embeddings. One challenge inherent to these methods is the poor generalization performance due to the invalidity of the learned text embeddings for unseen tasks. A s... |
2203.14581 | Shasha Mei | Shasha Mei | S2-Net: Self-supervision Guided Feature Representation Learning for
Cross-Modality Images | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Combining the respective advantages of cross-modality images can compensate
for the lack of information in the single modality, which has attracted
increasing attention of researchers into multi-modal image matching tasks.
Meanwhile, due to the great appearance differences between cross-modality image
pairs, it often... | [
{
"created": "Mon, 28 Mar 2022 08:47:49 GMT",
"version": "v1"
}
] | 2022-03-29 | [
[
"Mei",
"Shasha",
""
]
] | Combining the respective advantages of cross-modality images can compensate for the lack of information in the single modality, which has attracted increasing attention of researchers into multi-modal image matching tasks. Meanwhile, due to the great appearance differences between cross-modality image pairs, it often f... |
1702.00585 | Massimo Franceschet | Massimo Franceschet and Enrico Bozzo | The temporalized Massey's method | arXiv admin note: text overlap with arXiv:1701.03363 | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose and throughly investigate a temporalized version of the popular
Massey's technique for rating actors in sport competitions. The method can be
described as a dynamic temporal process in which team ratings are updated at
every match according to their performance during the match and the strength of
the oppo... | [
{
"created": "Thu, 2 Feb 2017 08:54:32 GMT",
"version": "v1"
}
] | 2017-02-03 | [
[
"Franceschet",
"Massimo",
""
],
[
"Bozzo",
"Enrico",
""
]
] | We propose and throughly investigate a temporalized version of the popular Massey's technique for rating actors in sport competitions. The method can be described as a dynamic temporal process in which team ratings are updated at every match according to their performance during the match and the strength of the oppone... |
2102.04010 | Aojun Zhou | Aojun Zhou, Yukun Ma, Junnan Zhu, Jianbo Liu, Zhijie Zhang, Kun Yuan,
Wenxiu Sun, Hongsheng Li | Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch | ICLR2021 | null | null | null | cs.CV cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sparsity in Deep Neural Networks (DNNs) has been widely studied to compress
and accelerate the models on resource-constrained environments. It can be
generally categorized into unstructured fine-grained sparsity that zeroes out
multiple individual weights distributed across the neural network, and
structured coarse-g... | [
{
"created": "Mon, 8 Feb 2021 05:55:47 GMT",
"version": "v1"
},
{
"created": "Sun, 18 Apr 2021 10:18:00 GMT",
"version": "v2"
}
] | 2021-04-20 | [
[
"Zhou",
"Aojun",
""
],
[
"Ma",
"Yukun",
""
],
[
"Zhu",
"Junnan",
""
],
[
"Liu",
"Jianbo",
""
],
[
"Zhang",
"Zhijie",
""
],
[
"Yuan",
"Kun",
""
],
[
"Sun",
"Wenxiu",
""
],
[
"Li",
"Hongsheng",
... | Sparsity in Deep Neural Networks (DNNs) has been widely studied to compress and accelerate the models on resource-constrained environments. It can be generally categorized into unstructured fine-grained sparsity that zeroes out multiple individual weights distributed across the neural network, and structured coarse-gra... |
cs/9908001 | Zvi Marx | Zvika Marx (1 and 2), Ido Dagan (1), Eli Shamir (2) ((1) Bar-Ilan
University, (2) The Hebrew University of Jerusalem) | Detecting Sub-Topic Correspondence through Bipartite Term Clustering | html with 3 gif figures; generated from 7 pages MS-Word file | Proceedings of ACL'99 Workshop on Unsupervised Learning in Natural
Language Processing, 1999, pp 45-51 | null | null | cs.CL | null | This paper addresses a novel task of detecting sub-topic correspondence in a
pair of text fragments, enhancing common notions of text similarity. This task
is addressed by coupling corresponding term subsets through bipartite
clustering. The paper presents a cost-based clustering scheme and compares it
with a biparti... | [
{
"created": "Sun, 1 Aug 1999 14:02:57 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Marx",
"Zvika",
"",
"1 and 2"
],
[
"Dagan",
"Ido",
""
],
[
"Shamir",
"Eli",
""
]
] | This paper addresses a novel task of detecting sub-topic correspondence in a pair of text fragments, enhancing common notions of text similarity. This task is addressed by coupling corresponding term subsets through bipartite clustering. The paper presents a cost-based clustering scheme and compares it with a bipartite... |
1708.01771 | Rongxiang Weng | Rongxiang Weng, Shujian Huang, Zaixiang Zheng, Xinyu Dai and Jiajun
Chen | Neural Machine Translation with Word Predictions | Accepted at EMNLP2017 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the encoder-decoder architecture for neural machine translation (NMT), the
hidden states of the recurrent structures in the encoder and decoder carry the
crucial information about the sentence.These vectors are generated by
parameters which are updated by back-propagation of translation errors through
time. We arg... | [
{
"created": "Sat, 5 Aug 2017 13:38:10 GMT",
"version": "v1"
}
] | 2017-08-08 | [
[
"Weng",
"Rongxiang",
""
],
[
"Huang",
"Shujian",
""
],
[
"Zheng",
"Zaixiang",
""
],
[
"Dai",
"Xinyu",
""
],
[
"Chen",
"Jiajun",
""
]
] | In the encoder-decoder architecture for neural machine translation (NMT), the hidden states of the recurrent structures in the encoder and decoder carry the crucial information about the sentence.These vectors are generated by parameters which are updated by back-propagation of translation errors through time. We argue... |
2007.13850 | Pankaj Khatiwada | Pankaj Khatiwada, Hari Bhusal, Ayan Chatterjee, Martin W. Gerdess | A Proposed Access Control-Based Privacy Preservation Model to Share
Healthcare Data in Cloud | null | null | null | null | cs.CR cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Healthcare data in cloud computing facilitates the treatment of patients
efficiently by sharing information about personal health data between the
healthcare providers for medical consultation. Furthermore, retaining the
confidentiality of data and patients' identity is a another challenging task.
This paper presents... | [
{
"created": "Mon, 27 Jul 2020 20:32:51 GMT",
"version": "v1"
}
] | 2020-07-29 | [
[
"Khatiwada",
"Pankaj",
""
],
[
"Bhusal",
"Hari",
""
],
[
"Chatterjee",
"Ayan",
""
],
[
"Gerdess",
"Martin W.",
""
]
] | Healthcare data in cloud computing facilitates the treatment of patients efficiently by sharing information about personal health data between the healthcare providers for medical consultation. Furthermore, retaining the confidentiality of data and patients' identity is a another challenging task. This paper presents t... |
2311.05221 | Sven Sickert | Tim B\"uchner and Sven Sickert and Gerd Fabian Volk and Christoph
Anders and Orlando Guntinas-Lichius and Joachim Denzler | Let's Get the FACS Straight -- Reconstructing Obstructed Facial Features | VISAPP 2023 paper | null | 10.5220/0011619900003417 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The human face is one of the most crucial parts in interhuman communication.
Even when parts of the face are hidden or obstructed the underlying facial
movements can be understood. Machine learning approaches often fail in that
regard due to the complexity of the facial structures. To alleviate this
problem a common ... | [
{
"created": "Thu, 9 Nov 2023 09:09:20 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Nov 2023 07:38:33 GMT",
"version": "v2"
}
] | 2024-02-14 | [
[
"Büchner",
"Tim",
""
],
[
"Sickert",
"Sven",
""
],
[
"Volk",
"Gerd Fabian",
""
],
[
"Anders",
"Christoph",
""
],
[
"Guntinas-Lichius",
"Orlando",
""
],
[
"Denzler",
"Joachim",
""
]
] | The human face is one of the most crucial parts in interhuman communication. Even when parts of the face are hidden or obstructed the underlying facial movements can be understood. Machine learning approaches often fail in that regard due to the complexity of the facial structures. To alleviate this problem a common ap... |
2311.07780 | Rui Duan | Rui Duan, Zhe Qu, Leah Ding, Yao Liu, Zhuo Lu | Parrot-Trained Adversarial Examples: Pushing the Practicality of
Black-Box Audio Attacks against Speaker Recognition Models | null | null | null | null | cs.SD cs.AI eess.AS | http://creativecommons.org/publicdomain/zero/1.0/ | Audio adversarial examples (AEs) have posed significant security challenges
to real-world speaker recognition systems. Most black-box attacks still require
certain information from the speaker recognition model to be effective (e.g.,
keeping probing and requiring the knowledge of similarity scores). This work
aims to... | [
{
"created": "Mon, 13 Nov 2023 22:12:19 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Nov 2023 21:34:33 GMT",
"version": "v2"
}
] | 2023-11-21 | [
[
"Duan",
"Rui",
""
],
[
"Qu",
"Zhe",
""
],
[
"Ding",
"Leah",
""
],
[
"Liu",
"Yao",
""
],
[
"Lu",
"Zhuo",
""
]
] | Audio adversarial examples (AEs) have posed significant security challenges to real-world speaker recognition systems. Most black-box attacks still require certain information from the speaker recognition model to be effective (e.g., keeping probing and requiring the knowledge of similarity scores). This work aims to p... |
2208.00344 | Leena Mathur | Leena Mathur, Ralph Adolphs, Maja J Matari\'c | Towards Intercultural Affect Recognition: Audio-Visual Affect
Recognition in the Wild Across Six Cultures | Accepted at IEEE International Conference on Automatic Face and
Gesture Recognition (FG 2023), publication and presentation at refereed IEEE
workshop | null | null | null | cs.CV cs.HC cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In our multicultural world, affect-aware AI systems that support humans need
the ability to perceive affect across variations in emotion expression patterns
across cultures. These systems must perform well in cultural contexts without
annotated affect datasets available for training models. A standard assumption
in a... | [
{
"created": "Sun, 31 Jul 2022 02:39:17 GMT",
"version": "v1"
},
{
"created": "Sat, 17 Sep 2022 21:14:00 GMT",
"version": "v2"
},
{
"created": "Mon, 31 Oct 2022 08:28:04 GMT",
"version": "v3"
}
] | 2022-11-01 | [
[
"Mathur",
"Leena",
""
],
[
"Adolphs",
"Ralph",
""
],
[
"Matarić",
"Maja J",
""
]
] | In our multicultural world, affect-aware AI systems that support humans need the ability to perceive affect across variations in emotion expression patterns across cultures. These systems must perform well in cultural contexts without annotated affect datasets available for training models. A standard assumption in aff... |
2305.14208 | Anmol Kabra | Anmol Kabra, Ethan R. Elenberg | Domain Private Transformers for Multi-Domain Dialog Systems | Accepted to Findings of EMNLP 2023 (short paper). Code available at
https://github.com/asappresearch/domain-private-transformers | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large, general purpose language models have demonstrated impressive
performance across many different conversational domains. While multi-domain
language models achieve low overall perplexity, their outputs are not
guaranteed to stay within the domain of a given input prompt. This paper
proposes domain privacy as a n... | [
{
"created": "Tue, 23 May 2023 16:27:12 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Dec 2023 19:46:09 GMT",
"version": "v2"
}
] | 2023-12-11 | [
[
"Kabra",
"Anmol",
""
],
[
"Elenberg",
"Ethan R.",
""
]
] | Large, general purpose language models have demonstrated impressive performance across many different conversational domains. While multi-domain language models achieve low overall perplexity, their outputs are not guaranteed to stay within the domain of a given input prompt. This paper proposes domain privacy as a nov... |
1810.03145 | Ruohan Wang | Ruohan Wang and Pierluigi V. Amadori and Yiannis Demiris | Real-Time Workload Classification during Driving using HyperNetworks | 2018 IEEE/RSJ International Conference on Intelligent Robots and
Systems (IROS 2018) | null | null | null | cs.HC cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Classifying human cognitive states from behavioral and physiological signals
is a challenging problem with important applications in robotics. The problem
is challenging due to the data variability among individual users, and sensor
artefacts. In this work, we propose an end-to-end framework for real-time
cognitive w... | [
{
"created": "Sun, 7 Oct 2018 13:57:25 GMT",
"version": "v1"
}
] | 2018-10-09 | [
[
"Wang",
"Ruohan",
""
],
[
"Amadori",
"Pierluigi V.",
""
],
[
"Demiris",
"Yiannis",
""
]
] | Classifying human cognitive states from behavioral and physiological signals is a challenging problem with important applications in robotics. The problem is challenging due to the data variability among individual users, and sensor artefacts. In this work, we propose an end-to-end framework for real-time cognitive wor... |
1310.6901 | Trang Cao | Trang Cao Minh, Boris Bellalta, Simon Oechsner, Ruizhi Liao and Miquel
Oliver | Managing Heterogeneous WSNs in Smart Cities: Challenges and Requirements | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The dramatic advances in wireless communications and electronics have enabled
the development of Wireless Sensor Networks (WSNs). WSNs consist of many
affordable and portable sensor nodes for collecting data from the environment.
In this article, we address management requirements of WSNs through presenting
some key ... | [
{
"created": "Fri, 25 Oct 2013 13:08:27 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Oct 2013 10:47:02 GMT",
"version": "v2"
}
] | 2013-10-29 | [
[
"Minh",
"Trang Cao",
""
],
[
"Bellalta",
"Boris",
""
],
[
"Oechsner",
"Simon",
""
],
[
"Liao",
"Ruizhi",
""
],
[
"Oliver",
"Miquel",
""
]
] | The dramatic advances in wireless communications and electronics have enabled the development of Wireless Sensor Networks (WSNs). WSNs consist of many affordable and portable sensor nodes for collecting data from the environment. In this article, we address management requirements of WSNs through presenting some key ma... |
2402.11958 | Anqi Li | Anqi Li, Yu Lu, Nirui Song, Shuai Zhang, Lizhi Ma, Zhenzhong Lan | Automatic Evaluation for Mental Health Counseling using LLMs | 21 pages, 4 figures | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High-quality psychological counseling is crucial for mental health worldwide,
and timely evaluation is vital for ensuring its effectiveness. However,
obtaining professional evaluation for each counseling session is expensive and
challenging. Existing methods that rely on self or third-party manual reports
to assess t... | [
{
"created": "Mon, 19 Feb 2024 09:00:10 GMT",
"version": "v1"
}
] | 2024-02-20 | [
[
"Li",
"Anqi",
""
],
[
"Lu",
"Yu",
""
],
[
"Song",
"Nirui",
""
],
[
"Zhang",
"Shuai",
""
],
[
"Ma",
"Lizhi",
""
],
[
"Lan",
"Zhenzhong",
""
]
] | High-quality psychological counseling is crucial for mental health worldwide, and timely evaluation is vital for ensuring its effectiveness. However, obtaining professional evaluation for each counseling session is expensive and challenging. Existing methods that rely on self or third-party manual reports to assess the... |
2103.05187 | Mingjie Sun | Mingjie Sun, Jimin Xiao, Eng Gee Lim | Iterative Shrinking for Referring Expression Grounding Using Deep
Reinforcement Learning | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this paper, we are tackling the proposal-free referring expression
grounding task, aiming at localizing the target object according to a query
sentence, without relying on off-the-shelf object proposals. Existing
proposal-free methods employ a query-image matching branch to select the
highest-score point in the im... | [
{
"created": "Tue, 9 Mar 2021 02:36:45 GMT",
"version": "v1"
}
] | 2021-03-10 | [
[
"Sun",
"Mingjie",
""
],
[
"Xiao",
"Jimin",
""
],
[
"Lim",
"Eng Gee",
""
]
] | In this paper, we are tackling the proposal-free referring expression grounding task, aiming at localizing the target object according to a query sentence, without relying on off-the-shelf object proposals. Existing proposal-free methods employ a query-image matching branch to select the highest-score point in the imag... |
2105.03811 | Farzaneh Rajabi | Farzaneh Rajabi, Jack Siyuan He | Click-Through Rate Prediction Using Graph Neural Networks and Online
Learning | null | null | null | null | cs.IR cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Recommendation systems have been extensively studied by many literature in
the past and are ubiquitous in online advertisement, shopping
industry/e-commerce, query suggestions in search engines, and friend
recommendation in social networks. Moreover,
restaurant/music/product/movie/news/app recommendations are only a ... | [
{
"created": "Sun, 9 May 2021 01:35:49 GMT",
"version": "v1"
}
] | 2021-05-11 | [
[
"Rajabi",
"Farzaneh",
""
],
[
"He",
"Jack Siyuan",
""
]
] | Recommendation systems have been extensively studied by many literature in the past and are ubiquitous in online advertisement, shopping industry/e-commerce, query suggestions in search engines, and friend recommendation in social networks. Moreover, restaurant/music/product/movie/news/app recommendations are only a fe... |
2204.04392 | Ningyu Zhang | Xiaozhuan Liang, Ningyu Zhang, Siyuan Cheng, Zhenru Zhang, Chuanqi
Tan, Huajun Chen | Contrastive Demonstration Tuning for Pre-trained Language Models | Accepted to EMNLP 2022(Findings) | null | null | null | cs.CL cs.AI cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pretrained language models can be effectively stimulated by textual prompts
or demonstrations, especially in low-data scenarios. Recent works have focused
on automatically searching discrete or continuous prompts or optimized
verbalizers, yet studies for the demonstration are still limited. Concretely,
the demonstrat... | [
{
"created": "Sat, 9 Apr 2022 05:30:48 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Apr 2022 14:42:14 GMT",
"version": "v2"
},
{
"created": "Wed, 19 Oct 2022 15:54:59 GMT",
"version": "v3"
},
{
"created": "Tue, 19 Sep 2023 12:27:36 GMT",
"version": "v4"
}
] | 2023-09-20 | [
[
"Liang",
"Xiaozhuan",
""
],
[
"Zhang",
"Ningyu",
""
],
[
"Cheng",
"Siyuan",
""
],
[
"Zhang",
"Zhenru",
""
],
[
"Tan",
"Chuanqi",
""
],
[
"Chen",
"Huajun",
""
]
] | Pretrained language models can be effectively stimulated by textual prompts or demonstrations, especially in low-data scenarios. Recent works have focused on automatically searching discrete or continuous prompts or optimized verbalizers, yet studies for the demonstration are still limited. Concretely, the demonstratio... |
2012.13823 | Raphael Memmesheimer | Raphael Memmesheimer, Simon H\"aring, Nick Theisen, Dietrich Paulus | Skeleton-DML: Deep Metric Learning for Skeleton-Based One-Shot Action
Recognition | 8 pages, 8 figures, 4 tables | null | null | null | cs.CV cs.AI cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | One-shot action recognition allows the recognition of human-performed actions
with only a single training example. This can influence human-robot-interaction
positively by enabling the robot to react to previously unseen behaviour. We
formulate the one-shot action recognition problem as a deep metric learning
problem... | [
{
"created": "Sat, 26 Dec 2020 22:31:11 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Mar 2021 14:33:17 GMT",
"version": "v2"
}
] | 2021-03-09 | [
[
"Memmesheimer",
"Raphael",
""
],
[
"Häring",
"Simon",
""
],
[
"Theisen",
"Nick",
""
],
[
"Paulus",
"Dietrich",
""
]
] | One-shot action recognition allows the recognition of human-performed actions with only a single training example. This can influence human-robot-interaction positively by enabling the robot to react to previously unseen behaviour. We formulate the one-shot action recognition problem as a deep metric learning problem a... |
1903.01240 | Aran Sena Mr. | Aran Sena, Brendan Michael, Matthew Howard | Improving Task-Parameterised Movement Learning Generalisation with
Frame-Weighted Trajectory Generation | 8 pages, 6 figures, submitted to 2019 IEEE/RSJ International
Conference on Intelligent Robots and Systems (IROS) | null | null | null | cs.RO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learning from Demonstration depends on a robot learner generalising its
learned model to unseen conditions, as it is not feasible for a person to
provide a demonstration set that accounts for all possible variations in
non-trivial tasks. While there are many learning methods that can handle
interpolation of observed ... | [
{
"created": "Mon, 4 Mar 2019 13:50:49 GMT",
"version": "v1"
}
] | 2019-03-05 | [
[
"Sena",
"Aran",
""
],
[
"Michael",
"Brendan",
""
],
[
"Howard",
"Matthew",
""
]
] | Learning from Demonstration depends on a robot learner generalising its learned model to unseen conditions, as it is not feasible for a person to provide a demonstration set that accounts for all possible variations in non-trivial tasks. While there are many learning methods that can handle interpolation of observed da... |
2405.18609 | Otman Benchekroun | Otman Benchekroun, Kaixiang Xie, Hsueh-Ti Derek Liu, Eitan Grinspun,
Sheldon Andrews, Victor Zordan | Actuators \`A La Mode: Modal Actuations for Soft Body Locomotion | 15 pages, 14 figures | null | null | null | cs.GR | http://creativecommons.org/licenses/by/4.0/ | Traditional character animation specializes in characters with a rigidly
articulated skeleton and a bipedal/quadripedal morphology. This assumption
simplifies many aspects for designing physically based animations, like
locomotion, but comes with the price of excluding characters of arbitrary
deformable geometries. T... | [
{
"created": "Tue, 28 May 2024 21:39:29 GMT",
"version": "v1"
}
] | 2024-05-30 | [
[
"Benchekroun",
"Otman",
""
],
[
"Xie",
"Kaixiang",
""
],
[
"Liu",
"Hsueh-Ti Derek",
""
],
[
"Grinspun",
"Eitan",
""
],
[
"Andrews",
"Sheldon",
""
],
[
"Zordan",
"Victor",
""
]
] | Traditional character animation specializes in characters with a rigidly articulated skeleton and a bipedal/quadripedal morphology. This assumption simplifies many aspects for designing physically based animations, like locomotion, but comes with the price of excluding characters of arbitrary deformable geometries. To ... |
2303.15847 | Hiroki Nakano | Hiroki Nakano, Daiki Chiba, Takashi Koide, Naoki Fukushi, Takeshi
Yagi, Takeo Hariu, Katsunari Yoshioka, Tsutomu Matsumoto | Canary in Twitter Mine: Collecting Phishing Reports from Experts and
Non-experts | Accepted at the 18th International Conference on Availability,
Reliability and Security (ARES 2023) | null | null | null | cs.CR cs.SI | http://creativecommons.org/licenses/by/4.0/ | The rise in phishing attacks via e-mail and short message service (SMS) has
not slowed down at all. The first thing we need to do to combat the
ever-increasing number of phishing attacks is to collect and characterize more
phishing cases that reach end users. Without understanding these
characteristics, anti-phishing... | [
{
"created": "Tue, 28 Mar 2023 09:38:37 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Jun 2023 05:30:12 GMT",
"version": "v2"
}
] | 2023-06-07 | [
[
"Nakano",
"Hiroki",
""
],
[
"Chiba",
"Daiki",
""
],
[
"Koide",
"Takashi",
""
],
[
"Fukushi",
"Naoki",
""
],
[
"Yagi",
"Takeshi",
""
],
[
"Hariu",
"Takeo",
""
],
[
"Yoshioka",
"Katsunari",
""
],
[
"M... | The rise in phishing attacks via e-mail and short message service (SMS) has not slowed down at all. The first thing we need to do to combat the ever-increasing number of phishing attacks is to collect and characterize more phishing cases that reach end users. Without understanding these characteristics, anti-phishing c... |
2406.15765 | Zhongzhi Yu | Zhongzhi Yu, Zheng Wang, Yonggan Fu, Huihong Shi, Khalid Shaikh,
Yingyan Celine Lin | Unveiling and Harnessing Hidden Attention Sinks: Enhancing Large
Language Models without Training through Attention Calibration | null | null | null | null | cs.LG cs.CL | http://creativecommons.org/licenses/by/4.0/ | Attention is a fundamental component behind the remarkable achievements of
large language models (LLMs). However, our current understanding of the
attention mechanism, especially regarding how attention distributions are
established, remains limited. Inspired by recent studies that explore the
presence of attention s... | [
{
"created": "Sat, 22 Jun 2024 07:00:43 GMT",
"version": "v1"
}
] | 2024-06-25 | [
[
"Yu",
"Zhongzhi",
""
],
[
"Wang",
"Zheng",
""
],
[
"Fu",
"Yonggan",
""
],
[
"Shi",
"Huihong",
""
],
[
"Shaikh",
"Khalid",
""
],
[
"Lin",
"Yingyan Celine",
""
]
] | Attention is a fundamental component behind the remarkable achievements of large language models (LLMs). However, our current understanding of the attention mechanism, especially regarding how attention distributions are established, remains limited. Inspired by recent studies that explore the presence of attention sin... |
1806.08211 | Pranjul Yadav | Marcelo Tallis, Pranjul Yadav | Reacting to Variations in Product Demand: An Application for Conversion
Rate (CR) Prediction in Sponsored Search | null | null | null | null | cs.IR cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In online internet advertising, machine learning models are widely used to
compute the likelihood of a user engaging with product related advertisements.
However, the performance of traditional machine learning models is often
impacted due to variations in user and advertiser behavior. For example, search
engine traf... | [
{
"created": "Fri, 25 May 2018 23:15:00 GMT",
"version": "v1"
}
] | 2018-06-22 | [
[
"Tallis",
"Marcelo",
""
],
[
"Yadav",
"Pranjul",
""
]
] | In online internet advertising, machine learning models are widely used to compute the likelihood of a user engaging with product related advertisements. However, the performance of traditional machine learning models is often impacted due to variations in user and advertiser behavior. For example, search engine traffi... |
1910.00697 | Marthe Bonamy | Marthe Bonamy, Micha{\l} Pilipczuk | Graphs of bounded cliquewidth are polynomially $\chi$-bounded | 20 pages | null | null | null | cs.DM math.CO | http://creativecommons.org/licenses/by/4.0/ | We prove that if $\mathcal{C}$ is a hereditary class of graphs that is
polynomially $\chi$-bounded, then the class of graphs that admit decompositions
into pieces belonging to $\mathcal{C}$ along cuts of bounded rank is also
polynomially $\chi$-bounded. In particular, this implies that for every
positive integer $k$,... | [
{
"created": "Tue, 1 Oct 2019 22:15:31 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Dec 2019 12:34:44 GMT",
"version": "v2"
},
{
"created": "Tue, 7 Jul 2020 15:49:48 GMT",
"version": "v3"
}
] | 2020-07-08 | [
[
"Bonamy",
"Marthe",
""
],
[
"Pilipczuk",
"Michał",
""
]
] | We prove that if $\mathcal{C}$ is a hereditary class of graphs that is polynomially $\chi$-bounded, then the class of graphs that admit decompositions into pieces belonging to $\mathcal{C}$ along cuts of bounded rank is also polynomially $\chi$-bounded. In particular, this implies that for every positive integer $k$, t... |
1804.08416 | Zhaowei Zhu | Zhaowei Zhu, Ting Liu, Shengda Jin, and Xiliang Luo | Learn and Pick Right Nodes to Offload | 8 pages, 4 figures | null | null | null | cs.NI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Task offloading is a promising technology to exploit the benefits of fog
computing. An effective task offloading strategy is needed to utilize the
computational resources efficiently. In this paper, we endeavor to seek an
online task offloading strategy to minimize the long-term latency. In
particular, we formulate a... | [
{
"created": "Fri, 20 Apr 2018 05:18:09 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Apr 2018 11:49:29 GMT",
"version": "v2"
}
] | 2018-04-25 | [
[
"Zhu",
"Zhaowei",
""
],
[
"Liu",
"Ting",
""
],
[
"Jin",
"Shengda",
""
],
[
"Luo",
"Xiliang",
""
]
] | Task offloading is a promising technology to exploit the benefits of fog computing. An effective task offloading strategy is needed to utilize the computational resources efficiently. In this paper, we endeavor to seek an online task offloading strategy to minimize the long-term latency. In particular, we formulate a s... |
2001.07558 | Tiphaine Viard | Tiphaine Viard, Thomas McLachlan, Hamidreza Ghader, Satoshi Sekine | Classifying Wikipedia in a fine-grained hierarchy: what graphs can
contribute | 7 pages | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Wikipedia is a huge opportunity for machine learning, being the largest
semi-structured base of knowledge available. Because of this, many works
examine its contents, and focus on structuring it in order to make it usable in
learning tasks, for example by classifying it into an ontology. Beyond its
textual contents, ... | [
{
"created": "Tue, 21 Jan 2020 14:19:49 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Jan 2020 08:24:59 GMT",
"version": "v2"
}
] | 2020-01-23 | [
[
"Viard",
"Tiphaine",
""
],
[
"McLachlan",
"Thomas",
""
],
[
"Ghader",
"Hamidreza",
""
],
[
"Sekine",
"Satoshi",
""
]
] | Wikipedia is a huge opportunity for machine learning, being the largest semi-structured base of knowledge available. Because of this, many works examine its contents, and focus on structuring it in order to make it usable in learning tasks, for example by classifying it into an ontology. Beyond its textual contents, Wi... |
2108.12427 | Jessica Whittlestone | Jess Whittlestone, Jack Clark | Why and How Governments Should Monitor AI Development | null | null | null | null | cs.CY cs.AI | http://creativecommons.org/licenses/by/4.0/ | In this paper we outline a proposal for improving the governance of
artificial intelligence (AI) by investing in government capacity to
systematically measure and monitor the capabilities and impacts of AI systems.
If adopted, this would give governments greater information about the AI
ecosystem, equipping them to m... | [
{
"created": "Sat, 28 Aug 2021 19:41:22 GMT",
"version": "v1"
},
{
"created": "Tue, 31 Aug 2021 12:49:31 GMT",
"version": "v2"
}
] | 2021-09-01 | [
[
"Whittlestone",
"Jess",
""
],
[
"Clark",
"Jack",
""
]
] | In this paper we outline a proposal for improving the governance of artificial intelligence (AI) by investing in government capacity to systematically measure and monitor the capabilities and impacts of AI systems. If adopted, this would give governments greater information about the AI ecosystem, equipping them to mor... |
2109.11731 | Linlang Jiang | Linlang Jiang, Jingbo Zhou, Tong Xu, Yanyan Li, Hao Chen, Jizhou
Huang, Hui Xiong | Adversarial Neural Trip Recommendation | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Trip recommender system, which targets at recommending a trip consisting of
several ordered Points of Interest (POIs), has long been treated as an
important application for many location-based services. Currently, most prior
arts generate trips following pre-defined objectives based on constraint
programming, which m... | [
{
"created": "Fri, 24 Sep 2021 03:57:25 GMT",
"version": "v1"
}
] | 2021-09-27 | [
[
"Jiang",
"Linlang",
""
],
[
"Zhou",
"Jingbo",
""
],
[
"Xu",
"Tong",
""
],
[
"Li",
"Yanyan",
""
],
[
"Chen",
"Hao",
""
],
[
"Huang",
"Jizhou",
""
],
[
"Xiong",
"Hui",
""
]
] | Trip recommender system, which targets at recommending a trip consisting of several ordered Points of Interest (POIs), has long been treated as an important application for many location-based services. Currently, most prior arts generate trips following pre-defined objectives based on constraint programming, which may... |
1903.02810 | Dorothee Henke | Christoph Buchheim and Dorothee Henke | The robust bilevel continuous knapsack problem with uncertain
coefficients in the follower's objective | An extended version of Section 8 of v2 can be found at
arXiv:2108.12303 | Journal of Global Optimization 83(4), 803-824 (2022) | 10.1007/s10898-021-01117-9 | null | cs.DS cs.DM math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a bilevel continuous knapsack problem where the leader controls
the capacity of the knapsack and the follower chooses an optimal packing
according to his own profits, which may differ from those of the leader. To
this bilevel problem, we add uncertainty in a natural way, assuming that the
leader does not ... | [
{
"created": "Thu, 7 Mar 2019 10:15:54 GMT",
"version": "v1"
},
{
"created": "Fri, 6 Mar 2020 16:09:41 GMT",
"version": "v2"
},
{
"created": "Thu, 29 Jul 2021 12:34:23 GMT",
"version": "v3"
},
{
"created": "Tue, 11 Jan 2022 17:02:47 GMT",
"version": "v4"
}
] | 2022-07-19 | [
[
"Buchheim",
"Christoph",
""
],
[
"Henke",
"Dorothee",
""
]
] | We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack and the follower chooses an optimal packing according to his own profits, which may differ from those of the leader. To this bilevel problem, we add uncertainty in a natural way, assuming that the leader does not ha... |
1911.09565 | Cassie Meeker | Cassie Meeker, Maximilian Haas-Heger, Matei Ciocarlie | A Continuous Teleoperation Subspace with Empirical and Algorithmic
Mapping Algorithms for Non-Anthropomorphic Hands | 14 pages, 6 tables, 8 figures, accepted October 2020 IEEE T-ASE | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Teleoperation is a valuable tool for robotic manipulators in highly
unstructured environments. However, finding an intuitive mapping between a
human hand and a non-anthropomorphic robot hand can be difficult, due to the
hands' dissimilar kinematics. In this paper, we seek to create a mapping
between the human hand an... | [
{
"created": "Thu, 21 Nov 2019 15:58:26 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Apr 2020 19:45:52 GMT",
"version": "v2"
},
{
"created": "Fri, 10 Jul 2020 19:36:37 GMT",
"version": "v3"
},
{
"created": "Thu, 17 Sep 2020 15:02:15 GMT",
"version": "v4"
},
{
"cr... | 2020-10-30 | [
[
"Meeker",
"Cassie",
""
],
[
"Haas-Heger",
"Maximilian",
""
],
[
"Ciocarlie",
"Matei",
""
]
] | Teleoperation is a valuable tool for robotic manipulators in highly unstructured environments. However, finding an intuitive mapping between a human hand and a non-anthropomorphic robot hand can be difficult, due to the hands' dissimilar kinematics. In this paper, we seek to create a mapping between the human hand and ... |
1410.5358 | Claudio Cusano | Claudio Cusano, Paolo Napoletano, Raimondo Schettini | Remote sensing image classification exploiting multiple kernel learning | Accepted for publication on the IEEE Geoscience and Remote Sensing
letters | null | 10.1109/LGRS.2015.2476365 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a strategy for land use classification which exploits Multiple
Kernel Learning (MKL) to automatically determine a suitable combination of a
set of features without requiring any heuristic knowledge about the
classification task. We present a novel procedure that allows MKL to achieve
good performance in th... | [
{
"created": "Mon, 20 Oct 2014 17:15:50 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Dec 2014 13:17:27 GMT",
"version": "v2"
},
{
"created": "Tue, 1 Sep 2015 09:25:50 GMT",
"version": "v3"
}
] | 2016-11-17 | [
[
"Cusano",
"Claudio",
""
],
[
"Napoletano",
"Paolo",
""
],
[
"Schettini",
"Raimondo",
""
]
] | We propose a strategy for land use classification which exploits Multiple Kernel Learning (MKL) to automatically determine a suitable combination of a set of features without requiring any heuristic knowledge about the classification task. We present a novel procedure that allows MKL to achieve good performance in the ... |
2003.03417 | Jiaming Zha | Jiaming Zha, Xiangyu Wu, Joseph Kroeger, Natalia Perez and Mark W.
Mueller | A collision-resilient aerial vehicle with icosahedron tensegrity
structure | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aerial vehicles with collision resilience can operate with more confidence in
environments with obstacles that are hard to detect and avoid. This paper
presents the methodology used to design a collision resilient aerial vehicle
with icosahedron tensegrity structure. A simplified stress analysis of the
tensegrity fra... | [
{
"created": "Fri, 6 Mar 2020 20:14:32 GMT",
"version": "v1"
}
] | 2020-03-10 | [
[
"Zha",
"Jiaming",
""
],
[
"Wu",
"Xiangyu",
""
],
[
"Kroeger",
"Joseph",
""
],
[
"Perez",
"Natalia",
""
],
[
"Mueller",
"Mark W.",
""
]
] | Aerial vehicles with collision resilience can operate with more confidence in environments with obstacles that are hard to detect and avoid. This paper presents the methodology used to design a collision resilient aerial vehicle with icosahedron tensegrity structure. A simplified stress analysis of the tensegrity frame... |
1610.05121 | Fang Junhua | Junhua Fang, Rong Zhang, Tom Z.J.Fu, Zhenjie Zhang, Aoying Zhou,
Junhua Zhu | Parallel Stream Processing Against Workload Skewness and Variance | null | null | null | null | cs.DC cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Key-based workload partitioning is a common strategy used in parallel stream
processing engines, enabling effective key-value tuple distribution over worker
threads in a logical operator. While randomized hashing on the keys is capable
of balancing the workload for key-based partitioning when the keys generally
follo... | [
{
"created": "Mon, 17 Oct 2016 14:03:41 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Dec 2016 09:04:03 GMT",
"version": "v2"
}
] | 2016-12-14 | [
[
"Fang",
"Junhua",
""
],
[
"Zhang",
"Rong",
""
],
[
"Fu",
"Tom Z. J.",
""
],
[
"Zhang",
"Zhenjie",
""
],
[
"Zhou",
"Aoying",
""
],
[
"Zhu",
"Junhua",
""
]
] | Key-based workload partitioning is a common strategy used in parallel stream processing engines, enabling effective key-value tuple distribution over worker threads in a logical operator. While randomized hashing on the keys is capable of balancing the workload for key-based partitioning when the keys generally follow ... |
2402.02499 | Pinhao Song | Pinhao Song, Pengteng Li, Erwin Aertbelien, Renaud Detry | Robot Trajectron: Trajectory Prediction-based Shared Control for Robot
Manipulation | Accepted by ICRA2024 | null | null | null | cs.RO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of (a) predicting the trajectory of an arm reaching
motion, based on a few seconds of the motion's onset, and (b) leveraging this
predictor to facilitate shared-control manipulation tasks, easing the cognitive
load of the operator by assisting them in their anticipated direction of
motion. Our ... | [
{
"created": "Sun, 4 Feb 2024 14:18:20 GMT",
"version": "v1"
}
] | 2024-02-06 | [
[
"Song",
"Pinhao",
""
],
[
"Li",
"Pengteng",
""
],
[
"Aertbelien",
"Erwin",
""
],
[
"Detry",
"Renaud",
""
]
] | We address the problem of (a) predicting the trajectory of an arm reaching motion, based on a few seconds of the motion's onset, and (b) leveraging this predictor to facilitate shared-control manipulation tasks, easing the cognitive load of the operator by assisting them in their anticipated direction of motion. Our no... |
2312.02659 | Sergio Davies PhD | Sergio Davies and Andrew Gait and Andrew Rowley and Alessandro Di
Nuovo | Supervised learning of spatial features with STDP and homeostasis using
Spiking Neural Networks on SpiNNaker | 14 pages, 6 figures (figure 6 has 9 sub-figures) for a total of 14
images, 10 tables, submitted to the Journal of Neural Networks | null | null | null | cs.NE cs.AI | http://creativecommons.org/licenses/by/4.0/ | Artificial Neural Networks (ANN) have gained significant popularity thanks to
their ability to learn using the well-known backpropagation algorithm.
Conversely, Spiking Neural Networks (SNNs), despite having broader capabilities
than ANNs, have always posed challenges in the training phase. This paper shows
a new met... | [
{
"created": "Tue, 5 Dec 2023 10:53:31 GMT",
"version": "v1"
},
{
"created": "Mon, 24 Jun 2024 22:15:57 GMT",
"version": "v2"
}
] | 2024-06-26 | [
[
"Davies",
"Sergio",
""
],
[
"Gait",
"Andrew",
""
],
[
"Rowley",
"Andrew",
""
],
[
"Di Nuovo",
"Alessandro",
""
]
] | Artificial Neural Networks (ANN) have gained significant popularity thanks to their ability to learn using the well-known backpropagation algorithm. Conversely, Spiking Neural Networks (SNNs), despite having broader capabilities than ANNs, have always posed challenges in the training phase. This paper shows a new metho... |
2011.01360 | Gerry Chen | Shuo Yang, Gerry Chen, Yetong Zhang, Howie Choset, and Frank Dellaert | Equality Constrained Linear Optimal Control With Factor Graphs | 6 pages + references, 8 figures | null | 10.1109/ICRA48506.2021.9562000 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel factor graph-based approach to solve the
discrete-time finite-horizon Linear Quadratic Regulator problem subject to
auxiliary linear equality constraints within and across time steps. We
represent such optimal control problems using constrained factor graphs and
optimize the factor graphs ... | [
{
"created": "Mon, 2 Nov 2020 22:36:52 GMT",
"version": "v1"
},
{
"created": "Thu, 30 Sep 2021 04:30:15 GMT",
"version": "v2"
}
] | 2021-10-27 | [
[
"Yang",
"Shuo",
""
],
[
"Chen",
"Gerry",
""
],
[
"Zhang",
"Yetong",
""
],
[
"Choset",
"Howie",
""
],
[
"Dellaert",
"Frank",
""
]
] | This paper presents a novel factor graph-based approach to solve the discrete-time finite-horizon Linear Quadratic Regulator problem subject to auxiliary linear equality constraints within and across time steps. We represent such optimal control problems using constrained factor graphs and optimize the factor graphs to... |
2403.10066 | Ziyu Shan | Ziyu Shan, Yujie Zhang, Qi Yang, Haichen Yang, Yiling Xu, Jenq-Neng
Hwang, Xiaozhong Xu and Shan Liu | Contrastive Pre-Training with Multi-View Fusion for No-Reference Point
Cloud Quality Assessment | null | null | null | null | cs.CV cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | No-reference point cloud quality assessment (NR-PCQA) aims to automatically
evaluate the perceptual quality of distorted point clouds without available
reference, which have achieved tremendous improvements due to the utilization
of deep neural networks. However, learning-based NR-PCQA methods suffer from
the scarcit... | [
{
"created": "Fri, 15 Mar 2024 07:16:07 GMT",
"version": "v1"
},
{
"created": "Mon, 25 Mar 2024 06:27:57 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Mar 2024 02:25:51 GMT",
"version": "v3"
}
] | 2024-03-28 | [
[
"Shan",
"Ziyu",
""
],
[
"Zhang",
"Yujie",
""
],
[
"Yang",
"Qi",
""
],
[
"Yang",
"Haichen",
""
],
[
"Xu",
"Yiling",
""
],
[
"Hwang",
"Jenq-Neng",
""
],
[
"Xu",
"Xiaozhong",
""
],
[
"Liu",
"Shan",... | No-reference point cloud quality assessment (NR-PCQA) aims to automatically evaluate the perceptual quality of distorted point clouds without available reference, which have achieved tremendous improvements due to the utilization of deep neural networks. However, learning-based NR-PCQA methods suffer from the scarcity ... |
2001.11062 | Olivia Brown | Stephen Mell, Olivia Brown, Justin Goodwin, Sung-Hyun Son | Safe Predictors for Enforcing Input-Output Specifications | 10 pages, 5 figures, paper accepted to the NeurIPS 2019 Workshop on
Machine Learning with Guarantees and the NeurIPS 2019 Workshop on Safety and
Robustness in Decision Making | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an approach for designing correct-by-construction neural networks
(and other machine learning models) that are guaranteed to be consistent with a
collection of input-output specifications before, during, and after algorithm
training. Our method involves designing a constrained predictor for each set of
com... | [
{
"created": "Wed, 29 Jan 2020 19:39:22 GMT",
"version": "v1"
}
] | 2020-01-31 | [
[
"Mell",
"Stephen",
""
],
[
"Brown",
"Olivia",
""
],
[
"Goodwin",
"Justin",
""
],
[
"Son",
"Sung-Hyun",
""
]
] | We present an approach for designing correct-by-construction neural networks (and other machine learning models) that are guaranteed to be consistent with a collection of input-output specifications before, during, and after algorithm training. Our method involves designing a constrained predictor for each set of compa... |
1404.5507 | Shun Watanabe | Shun Watanabe and Masahito Hayashi | Strong Converse and Second-Order Asymptotics of Channel Resolvability | 7 pages, a shorter version will appear in ISIT 2014, this version
includes the proofs of technical lemmas in appendices | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of channel resolvability for fixed i.i.d. input
distributions and discrete memoryless channels (DMCs), and derive the strong
converse theorem for any DMCs that are not necessarily full rank. We also
derive the optimal second-order rate under a condition. Furthermore, under the
condition that a DM... | [
{
"created": "Tue, 22 Apr 2014 14:10:34 GMT",
"version": "v1"
}
] | 2014-04-23 | [
[
"Watanabe",
"Shun",
""
],
[
"Hayashi",
"Masahito",
""
]
] | We study the problem of channel resolvability for fixed i.i.d. input distributions and discrete memoryless channels (DMCs), and derive the strong converse theorem for any DMCs that are not necessarily full rank. We also derive the optimal second-order rate under a condition. Furthermore, under the condition that a DMC ... |
2001.09782 | Tram Truong-Huu | Tien-Dung Cao, Tram Truong-Huu, Hien Tran, and Khanh Tran | A Federated Deep Learning Framework for Privacy Preservation and
Communication Efficiency | null | Journal of Systems Architecture, vol. 124, March 2022 | 10.1016/j.sysarc.2022.102413 | null | cs.DC cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning has achieved great success in many applications. However, its
deployment in practice has been hurdled by two issues: the privacy of data that
has to be aggregated centrally for model training and high communication
overhead due to transmission of a large amount of data usually geographically
distributed... | [
{
"created": "Wed, 22 Jan 2020 02:52:31 GMT",
"version": "v1"
},
{
"created": "Fri, 29 May 2020 14:39:14 GMT",
"version": "v2"
},
{
"created": "Wed, 5 Jan 2022 05:05:42 GMT",
"version": "v3"
}
] | 2022-02-04 | [
[
"Cao",
"Tien-Dung",
""
],
[
"Truong-Huu",
"Tram",
""
],
[
"Tran",
"Hien",
""
],
[
"Tran",
"Khanh",
""
]
] | Deep learning has achieved great success in many applications. However, its deployment in practice has been hurdled by two issues: the privacy of data that has to be aggregated centrally for model training and high communication overhead due to transmission of a large amount of data usually geographically distributed. ... |
2307.04816 | Huixin Sun | Mingze Wang, Huixin Sun, Jun Shi, Xuhui Liu, Baochang Zhang, Xianbin
Cao | Q-YOLO: Efficient Inference for Real-time Object Detection | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Real-time object detection plays a vital role in various computer vision
applications. However, deploying real-time object detectors on
resource-constrained platforms poses challenges due to high computational and
memory requirements. This paper describes a low-bit quantization method to
build a highly efficient one-... | [
{
"created": "Sat, 1 Jul 2023 03:50:32 GMT",
"version": "v1"
}
] | 2023-07-12 | [
[
"Wang",
"Mingze",
""
],
[
"Sun",
"Huixin",
""
],
[
"Shi",
"Jun",
""
],
[
"Liu",
"Xuhui",
""
],
[
"Zhang",
"Baochang",
""
],
[
"Cao",
"Xianbin",
""
]
] | Real-time object detection plays a vital role in various computer vision applications. However, deploying real-time object detectors on resource-constrained platforms poses challenges due to high computational and memory requirements. This paper describes a low-bit quantization method to build a highly efficient one-st... |
2308.10427 | Rongfei Fan | Shiyuan Zuo, Rongfei Fan, Han Hu, Ning Zhang, and Shimin Gong | Federated Learning Robust to Byzantine Attacks: Achieving Zero
Optimality Gap | null | null | null | null | cs.LG cs.CR cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a robust aggregation method for federated learning
(FL) that can effectively tackle malicious Byzantine attacks. At each user,
model parameter is firstly updated by multiple steps, which is adjustable over
iterations, and then pushed to the aggregation center directly. This decreases
the num... | [
{
"created": "Mon, 21 Aug 2023 02:43:38 GMT",
"version": "v1"
}
] | 2023-08-22 | [
[
"Zuo",
"Shiyuan",
""
],
[
"Fan",
"Rongfei",
""
],
[
"Hu",
"Han",
""
],
[
"Zhang",
"Ning",
""
],
[
"Gong",
"Shimin",
""
]
] | In this paper, we propose a robust aggregation method for federated learning (FL) that can effectively tackle malicious Byzantine attacks. At each user, model parameter is firstly updated by multiple steps, which is adjustable over iterations, and then pushed to the aggregation center directly. This decreases the numbe... |
1210.3598 | Jaume Barcelo | Jaume Barcelo, Nuria Garcia, Azadeh Faridi, Simon Oechsner and Boris
Bellalta | Modelling a Decentralized Constraint Satisfaction Solver for
Collision-Free Channel Access | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, the problem of assigning channel slots to a number of
contending stations is modeled as a Constraint Satisfaction Problem (CSP). A
learning MAC protocol that uses deterministic backoffs after successful
transmissions is used as a decentralized solver for the CSP. The convergence
process of the solver i... | [
{
"created": "Fri, 12 Oct 2012 18:49:38 GMT",
"version": "v1"
}
] | 2012-10-15 | [
[
"Barcelo",
"Jaume",
""
],
[
"Garcia",
"Nuria",
""
],
[
"Faridi",
"Azadeh",
""
],
[
"Oechsner",
"Simon",
""
],
[
"Bellalta",
"Boris",
""
]
] | In this paper, the problem of assigning channel slots to a number of contending stations is modeled as a Constraint Satisfaction Problem (CSP). A learning MAC protocol that uses deterministic backoffs after successful transmissions is used as a decentralized solver for the CSP. The convergence process of the solver is ... |
0807.3593 | Chandra Nair | Chandra Nair | An outer bound for 2-receiver discrete memoryless broadcast channels | 3 pages, a note | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An outer bound to the two-receiver discrete memoryless broadcast channel is
presented. We compare it to the known outer bounds and show that the outer
bound presented is at least as tight as the existing bounds.
| [
{
"created": "Wed, 23 Jul 2008 03:43:30 GMT",
"version": "v1"
}
] | 2008-07-24 | [
[
"Nair",
"Chandra",
""
]
] | An outer bound to the two-receiver discrete memoryless broadcast channel is presented. We compare it to the known outer bounds and show that the outer bound presented is at least as tight as the existing bounds. |
2302.10688 | Tianyu Pang | Tianyu Pang, Cheng Lu, Chao Du, Min Lin, Shuicheng Yan, Zhijie Deng | On Calibrating Diffusion Probabilistic Models | NeurIPS 2023 | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, diffusion probabilistic models (DPMs) have achieved promising
results in diverse generative tasks. A typical DPM framework includes a forward
process that gradually diffuses the data distribution and a reverse process
that recovers the data distribution from time-dependent data scores. In this
work, we obse... | [
{
"created": "Tue, 21 Feb 2023 14:14:40 GMT",
"version": "v1"
},
{
"created": "Fri, 26 May 2023 12:55:29 GMT",
"version": "v2"
},
{
"created": "Sun, 29 Oct 2023 12:14:29 GMT",
"version": "v3"
}
] | 2023-10-31 | [
[
"Pang",
"Tianyu",
""
],
[
"Lu",
"Cheng",
""
],
[
"Du",
"Chao",
""
],
[
"Lin",
"Min",
""
],
[
"Yan",
"Shuicheng",
""
],
[
"Deng",
"Zhijie",
""
]
] | Recently, diffusion probabilistic models (DPMs) have achieved promising results in diverse generative tasks. A typical DPM framework includes a forward process that gradually diffuses the data distribution and a reverse process that recovers the data distribution from time-dependent data scores. In this work, we observ... |
2003.04359 | Chaoyue Niu | Chaoyue Niu, Danesh Tarapore and Klaus-Peter Zauner | Low-viewpoint forest depth dataset for sparse rover swarms | This paper has been accepted to IROS 2020 for oral presentation | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rapid progress in embedded computing hardware increasingly enables on-board
image processing on small robots. This development opens the path to replacing
costly sensors with sophisticated computer vision techniques. A case in point
is the prediction of scene depth information from a monocular camera for
autonomous n... | [
{
"created": "Mon, 9 Mar 2020 18:53:24 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Oct 2020 14:57:34 GMT",
"version": "v2"
}
] | 2020-10-27 | [
[
"Niu",
"Chaoyue",
""
],
[
"Tarapore",
"Danesh",
""
],
[
"Zauner",
"Klaus-Peter",
""
]
] | Rapid progress in embedded computing hardware increasingly enables on-board image processing on small robots. This development opens the path to replacing costly sensors with sophisticated computer vision techniques. A case in point is the prediction of scene depth information from a monocular camera for autonomous nav... |
2204.03516 | Guillaume Sartoretti | Yutong Wang and Mehul Damani and Pamela Wang and Yuhong Cao and
Guillaume Sartoretti | Distributed Reinforcement Learning for Robot Teams: A Review | Preprint of the paper submitted to Springer's Current Robotics
Reports | null | null | null | cs.RO cs.AI cs.LG cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Purpose of review: Recent advances in sensing, actuation, and computation
have opened the door to multi-robot systems consisting of hundreds/thousands of
robots, with promising applications to automated manufacturing, disaster
relief, harvesting, last-mile delivery, port/airport operations, or search and
rescue. The ... | [
{
"created": "Thu, 7 Apr 2022 15:34:19 GMT",
"version": "v1"
}
] | 2022-04-08 | [
[
"Wang",
"Yutong",
""
],
[
"Damani",
"Mehul",
""
],
[
"Wang",
"Pamela",
""
],
[
"Cao",
"Yuhong",
""
],
[
"Sartoretti",
"Guillaume",
""
]
] | Purpose of review: Recent advances in sensing, actuation, and computation have opened the door to multi-robot systems consisting of hundreds/thousands of robots, with promising applications to automated manufacturing, disaster relief, harvesting, last-mile delivery, port/airport operations, or search and rescue. The co... |
2012.01096 | Liu Liu | Liu Liu, Hongdong Li, Haodong Yao and Ruyi Zha | PlueckerNet: Learn to Register 3D Line Reconstructions | 12 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aligning two partially-overlapped 3D line reconstructions in Euclidean space
is challenging, as we need to simultaneously solve correspondences and relative
pose between line reconstructions. This paper proposes a neural network based
method and it has three modules connected in sequence: (i) a Multilayer
Perceptron ... | [
{
"created": "Wed, 2 Dec 2020 11:31:56 GMT",
"version": "v1"
}
] | 2020-12-03 | [
[
"Liu",
"Liu",
""
],
[
"Li",
"Hongdong",
""
],
[
"Yao",
"Haodong",
""
],
[
"Zha",
"Ruyi",
""
]
] | Aligning two partially-overlapped 3D line reconstructions in Euclidean space is challenging, as we need to simultaneously solve correspondences and relative pose between line reconstructions. This paper proposes a neural network based method and it has three modules connected in sequence: (i) a Multilayer Perceptron (M... |
2110.14432 | Weiyang Liu | Weiyang Liu, Zhen Liu, Hanchen Wang, Liam Paull, Bernhard Sch\"olkopf,
Adrian Weller | Iterative Teaching by Label Synthesis | NeurIPS 2021 Spotlight (v5: 28 pages, 20 figures, fixed typos in v4) | null | null | null | cs.LG cs.AI cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider the problem of iterative machine teaching, where a
teacher provides examples sequentially based on the current iterative learner.
In contrast to previous methods that have to scan over the entire pool and
select teaching examples from it in each iteration, we propose a label
synthesis teach... | [
{
"created": "Wed, 27 Oct 2021 13:45:29 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Nov 2021 04:06:59 GMT",
"version": "v2"
},
{
"created": "Mon, 25 Jul 2022 20:43:59 GMT",
"version": "v3"
},
{
"created": "Sun, 11 Sep 2022 20:36:24 GMT",
"version": "v4"
},
{
"c... | 2023-01-27 | [
[
"Liu",
"Weiyang",
""
],
[
"Liu",
"Zhen",
""
],
[
"Wang",
"Hanchen",
""
],
[
"Paull",
"Liam",
""
],
[
"Schölkopf",
"Bernhard",
""
],
[
"Weller",
"Adrian",
""
]
] | In this paper, we consider the problem of iterative machine teaching, where a teacher provides examples sequentially based on the current iterative learner. In contrast to previous methods that have to scan over the entire pool and select teaching examples from it in each iteration, we propose a label synthesis teachin... |
1602.00812 | Richard Moot | Richard Moot (LaBRI, CNRS) | The Grail theorem prover: Type theory for syntax and semantics | null | Modern Perspectives in Type Theoretical Semantics, Springer, 2016 | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the name suggests, type-logical grammars are a grammar formalism based on
logic and type theory. From the prespective of grammar design, type-logical
grammars develop the syntactic and semantic aspects of linguistic phenomena
hand-in-hand, letting the desired semantics of an expression inform the
syntactic type an... | [
{
"created": "Tue, 2 Feb 2016 07:35:02 GMT",
"version": "v1"
},
{
"created": "Fri, 26 Aug 2016 07:04:29 GMT",
"version": "v2"
}
] | 2016-08-29 | [
[
"Moot",
"Richard",
"",
"LaBRI, CNRS"
]
] | As the name suggests, type-logical grammars are a grammar formalism based on logic and type theory. From the prespective of grammar design, type-logical grammars develop the syntactic and semantic aspects of linguistic phenomena hand-in-hand, letting the desired semantics of an expression inform the syntactic type and ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.