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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2005.04540 | Linjian Ma | Linjian Ma, Jiayu Ye, Edgar Solomonik | AutoHOOT: Automatic High-Order Optimization for Tensors | 18 pages, 8 figures | null | null | null | cs.MS cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High-order optimization methods, including Newton's method and its variants
as well as alternating minimization methods, dominate the optimization
algorithms for tensor decompositions and tensor networks. These tensor methods
are used for data analysis and simulation of quantum systems. In this work, we
introduce Aut... | [
{
"created": "Sun, 10 May 2020 01:15:37 GMT",
"version": "v1"
},
{
"created": "Thu, 24 Dec 2020 20:18:57 GMT",
"version": "v2"
}
] | 2020-12-29 | [
[
"Ma",
"Linjian",
""
],
[
"Ye",
"Jiayu",
""
],
[
"Solomonik",
"Edgar",
""
]
] | High-order optimization methods, including Newton's method and its variants as well as alternating minimization methods, dominate the optimization algorithms for tensor decompositions and tensor networks. These tensor methods are used for data analysis and simulation of quantum systems. In this work, we introduce AutoH... |
2306.01788 | Saud Al Harbi | Saud Hakem Al Harbi, Lionel Nganyewou Tidjon and Foutse Khomh | Responsible Design Patterns for Machine Learning Pipelines | 20 pages, 4 figures, 5 tables | null | null | null | cs.SE cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Integrating ethical practices into the AI development process for artificial
intelligence (AI) is essential to ensure safe, fair, and responsible operation.
AI ethics involves applying ethical principles to the entire life cycle of AI
systems. This is essential to mitigate potential risks and harms associated
with AI... | [
{
"created": "Wed, 31 May 2023 15:47:12 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Jun 2023 15:00:21 GMT",
"version": "v2"
},
{
"created": "Wed, 7 Jun 2023 21:55:28 GMT",
"version": "v3"
}
] | 2023-06-09 | [
[
"Harbi",
"Saud Hakem Al",
""
],
[
"Tidjon",
"Lionel Nganyewou",
""
],
[
"Khomh",
"Foutse",
""
]
] | Integrating ethical practices into the AI development process for artificial intelligence (AI) is essential to ensure safe, fair, and responsible operation. AI ethics involves applying ethical principles to the entire life cycle of AI systems. This is essential to mitigate potential risks and harms associated with AI, ... |
1605.03817 | Fabio Del Vigna | Fabio Del Vigna, Marco Avvenuti, Clara Bacciu, Paolo Deluca, Andrea
Marchetti, Marinella Petrocchi, Maurizio Tesconi | Spotting the diffusion of New Psychoactive Substances over the Internet | null | null | null | null | cs.CY cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Online availability and diffusion of New Psychoactive Substances (NPS)
represent an emerging threat to healthcare systems. In this work, we analyse
drugs forums, online shops, and Twitter. By mining the data from these sources,
it is possible to understand the dynamics of drugs diffusion and their
endorsement, as wel... | [
{
"created": "Thu, 12 May 2016 14:02:05 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Jul 2016 11:21:26 GMT",
"version": "v2"
}
] | 2016-07-12 | [
[
"Del Vigna",
"Fabio",
""
],
[
"Avvenuti",
"Marco",
""
],
[
"Bacciu",
"Clara",
""
],
[
"Deluca",
"Paolo",
""
],
[
"Marchetti",
"Andrea",
""
],
[
"Petrocchi",
"Marinella",
""
],
[
"Tesconi",
"Maurizio",
""
... | Online availability and diffusion of New Psychoactive Substances (NPS) represent an emerging threat to healthcare systems. In this work, we analyse drugs forums, online shops, and Twitter. By mining the data from these sources, it is possible to understand the dynamics of drugs diffusion and their endorsement, as well ... |
1910.08634 | Marco Patrignani | Marco Patrignani, Robert K\"unnemann, Riad S. Wahby | Universal Composability is Robust Compilation | null | null | null | null | cs.PL cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper discusses the relationship between two frameworks: universal
composability (UC) and robust compilation (RC). In cryptography, UC is a
framework for the specification and analysis of cryptographic protocols with a
strong compositionality guarantee: UC protocols remain secure even when
composed with other pr... | [
{
"created": "Fri, 18 Oct 2019 21:28:56 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Jul 2020 16:59:28 GMT",
"version": "v2"
},
{
"created": "Thu, 15 Dec 2022 18:16:17 GMT",
"version": "v3"
}
] | 2022-12-16 | [
[
"Patrignani",
"Marco",
""
],
[
"Künnemann",
"Robert",
""
],
[
"Wahby",
"Riad S.",
""
]
] | This paper discusses the relationship between two frameworks: universal composability (UC) and robust compilation (RC). In cryptography, UC is a framework for the specification and analysis of cryptographic protocols with a strong compositionality guarantee: UC protocols remain secure even when composed with other prot... |
1406.7727 | Emanuel Laci\'c | Emanuel Lacic, Dominik Kowald, Paul Seitlinger, Christoph Trattner,
Denis Parra | Recommending Items in Social Tagging Systems Using Tag and Time
Information | 6 pages, 2 tables, 9 figures | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work we present a novel item recommendation approach that aims at
improving Collaborative Filtering (CF) in social tagging systems using the
information about tags and time. Our algorithm follows a two-step approach,
where in the first step a potentially interesting candidate item-set is found
using user-base... | [
{
"created": "Mon, 30 Jun 2014 13:29:33 GMT",
"version": "v1"
}
] | 2014-07-01 | [
[
"Lacic",
"Emanuel",
""
],
[
"Kowald",
"Dominik",
""
],
[
"Seitlinger",
"Paul",
""
],
[
"Trattner",
"Christoph",
""
],
[
"Parra",
"Denis",
""
]
] | In this work we present a novel item recommendation approach that aims at improving Collaborative Filtering (CF) in social tagging systems using the information about tags and time. Our algorithm follows a two-step approach, where in the first step a potentially interesting candidate item-set is found using user-based ... |
2310.19223 | Zhaocong Li | Zhaocong Li | Modular Anti-noise Deep Learning Network for Robotic Grasp Detection
Based on RGB Images | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While traditional methods relies on depth sensors, the current trend leans
towards utilizing cost-effective RGB images, despite their absence of depth
cues. This paper introduces an interesting approach to detect grasping pose
from a single RGB image. To this end, we propose a modular learning network
augmented with ... | [
{
"created": "Mon, 30 Oct 2023 02:01:49 GMT",
"version": "v1"
}
] | 2023-10-31 | [
[
"Li",
"Zhaocong",
""
]
] | While traditional methods relies on depth sensors, the current trend leans towards utilizing cost-effective RGB images, despite their absence of depth cues. This paper introduces an interesting approach to detect grasping pose from a single RGB image. To this end, we propose a modular learning network augmented with gr... |
2404.15236 | Aidan Yang | Aidan Z.H. Yang, Sophia Kolak, Vincent J. Hellendoorn, Ruben Martins,
Claire Le Goues | Revisiting Unnaturalness for Automated Program Repair in the Era of
Large Language Models | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Language models have improved by orders of magnitude with the recent
emergence of Transformer-based Large Language Models (LLMs). LLMs have
demonstrated their ability to generate natural code that is highly similar to
code written by professional developers. One intermediate value an LLM can emit
is entropy, which me... | [
{
"created": "Tue, 23 Apr 2024 17:12:45 GMT",
"version": "v1"
}
] | 2024-04-24 | [
[
"Yang",
"Aidan Z. H.",
""
],
[
"Kolak",
"Sophia",
""
],
[
"Hellendoorn",
"Vincent J.",
""
],
[
"Martins",
"Ruben",
""
],
[
"Goues",
"Claire Le",
""
]
] | Language models have improved by orders of magnitude with the recent emergence of Transformer-based Large Language Models (LLMs). LLMs have demonstrated their ability to generate natural code that is highly similar to code written by professional developers. One intermediate value an LLM can emit is entropy, which meas... |
2012.09632 | Vincent Lemaire | Pierre Nodet, Vincent Lemaire, Alexis Bondu, Antoine Cornu\'ejols and
Adam Ouorou | From Weakly Supervised Learning to Biquality Learning: an Introduction | null | null | 10.1109/IJCNN52387.2021.9533353 | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The field of Weakly Supervised Learning (WSL) has recently seen a surge of
popularity, with numerous papers addressing different types of "supervision
deficiencies". In WSL use cases, a variety of situations exists where the
collected "information" is imperfect. The paradigm of WSL attempts to list and
cover these pr... | [
{
"created": "Wed, 16 Dec 2020 07:59:48 GMT",
"version": "v1"
},
{
"created": "Mon, 15 Mar 2021 08:13:22 GMT",
"version": "v2"
},
{
"created": "Fri, 23 Apr 2021 17:49:15 GMT",
"version": "v3"
}
] | 2021-09-28 | [
[
"Nodet",
"Pierre",
""
],
[
"Lemaire",
"Vincent",
""
],
[
"Bondu",
"Alexis",
""
],
[
"Cornuéjols",
"Antoine",
""
],
[
"Ouorou",
"Adam",
""
]
] | The field of Weakly Supervised Learning (WSL) has recently seen a surge of popularity, with numerous papers addressing different types of "supervision deficiencies". In WSL use cases, a variety of situations exists where the collected "information" is imperfect. The paradigm of WSL attempts to list and cover these prob... |
1810.12703 | Benjamin Marie | Benjamin Marie and Atsushi Fujita | Unsupervised Neural Machine Translation Initialized by Unsupervised
Statistical Machine Translation | preliminary work | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent work achieved remarkable results in training neural machine
translation (NMT) systems in a fully unsupervised way, with new and dedicated
architectures that rely on monolingual corpora only. In this work, we propose
to define unsupervised NMT (UNMT) as NMT trained with the supervision of
synthetic bilingual da... | [
{
"created": "Tue, 30 Oct 2018 12:33:03 GMT",
"version": "v1"
}
] | 2018-10-31 | [
[
"Marie",
"Benjamin",
""
],
[
"Fujita",
"Atsushi",
""
]
] | Recent work achieved remarkable results in training neural machine translation (NMT) systems in a fully unsupervised way, with new and dedicated architectures that rely on monolingual corpora only. In this work, we propose to define unsupervised NMT (UNMT) as NMT trained with the supervision of synthetic bilingual data... |
2308.12544 | Hsuan-Po Liu | Hsuan-Po Liu, Mahdi Soleymani, and Hessam Mahdavifar | Analog Multi-Party Computing: Locally Differential Private Protocols for
Collaborative Computations | null | null | null | null | cs.DC cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a fully-decentralized scenario in which no central trusted entity
exists and all clients are honest-but-curious. The state-of-the-art approaches
to this problem often rely on cryptographic protocols, such as multiparty
computation (MPC), that require mapping real-valued data to a discrete
alphabet, specif... | [
{
"created": "Thu, 24 Aug 2023 04:01:34 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Oct 2023 06:02:18 GMT",
"version": "v2"
}
] | 2023-10-19 | [
[
"Liu",
"Hsuan-Po",
""
],
[
"Soleymani",
"Mahdi",
""
],
[
"Mahdavifar",
"Hessam",
""
]
] | We consider a fully-decentralized scenario in which no central trusted entity exists and all clients are honest-but-curious. The state-of-the-art approaches to this problem often rely on cryptographic protocols, such as multiparty computation (MPC), that require mapping real-valued data to a discrete alphabet, specific... |
2305.16581 | Adam Wiemerslage | Adam Wiemerslage, Changbing Yang, Garrett Nicolai, Miikka Silfverberg,
and Katharina Kann | An Investigation of Noise in Morphological Inflection | ACL 2023 Findings | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | With a growing focus on morphological inflection systems for languages where
high-quality data is scarce, training data noise is a serious but so far
largely ignored concern. We aim at closing this gap by investigating the types
of noise encountered within a pipeline for truly unsupervised morphological
paradigm comp... | [
{
"created": "Fri, 26 May 2023 02:14:34 GMT",
"version": "v1"
}
] | 2023-05-29 | [
[
"Wiemerslage",
"Adam",
""
],
[
"Yang",
"Changbing",
""
],
[
"Nicolai",
"Garrett",
""
],
[
"Silfverberg",
"Miikka",
""
],
[
"Kann",
"Katharina",
""
]
] | With a growing focus on morphological inflection systems for languages where high-quality data is scarce, training data noise is a serious but so far largely ignored concern. We aim at closing this gap by investigating the types of noise encountered within a pipeline for truly unsupervised morphological paradigm comple... |
2108.01265 | Fuyuan Lyu | Fuyuan Lyu, Xing Tang, Huifeng Guo, Ruiming Tang, Xiuqiang He, Rui
Zhang, Xue Liu | Memorize, Factorize, or be Na\"ive: Learning Optimal Feature Interaction
Methods for CTR Prediction | Published in ICDE 2022 | null | null | null | cs.LG cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Click-through rate prediction is one of the core tasks in commercial
recommender systems. It aims to predict the probability of a user clicking a
particular item given user and item features. As feature interactions bring in
non-linearity, they are widely adopted to improve the performance of CTR
prediction models. T... | [
{
"created": "Tue, 3 Aug 2021 03:03:34 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Aug 2021 07:42:39 GMT",
"version": "v2"
},
{
"created": "Wed, 24 Nov 2021 15:53:17 GMT",
"version": "v3"
}
] | 2021-11-25 | [
[
"Lyu",
"Fuyuan",
""
],
[
"Tang",
"Xing",
""
],
[
"Guo",
"Huifeng",
""
],
[
"Tang",
"Ruiming",
""
],
[
"He",
"Xiuqiang",
""
],
[
"Zhang",
"Rui",
""
],
[
"Liu",
"Xue",
""
]
] | Click-through rate prediction is one of the core tasks in commercial recommender systems. It aims to predict the probability of a user clicking a particular item given user and item features. As feature interactions bring in non-linearity, they are widely adopted to improve the performance of CTR prediction models. The... |
1507.02314 | Stefan Kiefer | Stefan Kiefer and A. Prasad Sistla | Distinguishing Hidden Markov Chains | This is the full version of a LICS'16 paper | null | null | null | cs.DS cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Hidden Markov Chains (HMCs) are commonly used mathematical models of
probabilistic systems. They are employed in various fields such as speech
recognition, signal processing, and biological sequence analysis. We consider
the problem of distinguishing two given HMCs based on an observation sequence
that one of the HMC... | [
{
"created": "Wed, 8 Jul 2015 21:14:14 GMT",
"version": "v1"
},
{
"created": "Mon, 9 May 2016 11:43:06 GMT",
"version": "v2"
}
] | 2016-05-10 | [
[
"Kiefer",
"Stefan",
""
],
[
"Sistla",
"A. Prasad",
""
]
] | Hidden Markov Chains (HMCs) are commonly used mathematical models of probabilistic systems. They are employed in various fields such as speech recognition, signal processing, and biological sequence analysis. We consider the problem of distinguishing two given HMCs based on an observation sequence that one of the HMCs ... |
2107.12351 | Kai-En Lin | Tiancheng Sun, Kai-En Lin, Sai Bi, Zexiang Xu, Ravi Ramamoorthi | NeLF: Neural Light-transport Field for Portrait View Synthesis and
Relighting | Published at EGSR 2021. Project page with video and code:
http://cseweb.ucsd.edu/~viscomp/projects/EGSR21NeLF/ | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human portraits exhibit various appearances when observed from different
views under different lighting conditions. We can easily imagine how the face
will look like in another setup, but computer algorithms still fail on this
problem given limited observations. To this end, we present a system for
portrait view synt... | [
{
"created": "Mon, 26 Jul 2021 17:44:52 GMT",
"version": "v1"
}
] | 2021-07-27 | [
[
"Sun",
"Tiancheng",
""
],
[
"Lin",
"Kai-En",
""
],
[
"Bi",
"Sai",
""
],
[
"Xu",
"Zexiang",
""
],
[
"Ramamoorthi",
"Ravi",
""
]
] | Human portraits exhibit various appearances when observed from different views under different lighting conditions. We can easily imagine how the face will look like in another setup, but computer algorithms still fail on this problem given limited observations. To this end, we present a system for portrait view synthe... |
2403.18426 | Jamshid Mozafari | Jamshid Mozafari, Anubhav Jangra, Adam Jatowt | TriviaHG: A Dataset for Automatic Hint Generation from Factoid Questions | Accepted at SIGIR 2024 | Proceedings of the 47th International ACM SIGIR Conference on
Research and Development in Information Retrieval (SIGIR 2024) | 10.1145/3626772.3657855 | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Nowadays, individuals tend to engage in dialogues with Large Language Models,
seeking answers to their questions. In times when such answers are readily
accessible to anyone, the stimulation and preservation of human's cognitive
abilities, as well as the assurance of maintaining good reasoning skills by
humans become... | [
{
"created": "Wed, 27 Mar 2024 10:27:28 GMT",
"version": "v1"
},
{
"created": "Fri, 10 May 2024 17:10:47 GMT",
"version": "v2"
}
] | 2024-05-13 | [
[
"Mozafari",
"Jamshid",
""
],
[
"Jangra",
"Anubhav",
""
],
[
"Jatowt",
"Adam",
""
]
] | Nowadays, individuals tend to engage in dialogues with Large Language Models, seeking answers to their questions. In times when such answers are readily accessible to anyone, the stimulation and preservation of human's cognitive abilities, as well as the assurance of maintaining good reasoning skills by humans becomes ... |
2103.11991 | Luc Berger-Vergiat | Sivasankaran Rajamanickam, Seher Acer, Luc Berger-Vergiat, Vinh Dang,
Nathan Ellingwood, Evan Harvey, Brian Kelley, Christian R. Trott, Jeremiah
Wilke, Ichitaro Yamazaki | Kokkos Kernels: Performance Portable Sparse/Dense Linear Algebra and
Graph Kernels | null | null | null | SAND2021-3421 O | cs.MS | http://creativecommons.org/licenses/by-nc-sa/4.0/ | As hardware architectures are evolving in the push towards exascale,
developing Computational Science and Engineering (CSE) applications depend on
performance portable approaches for sustainable software development. This
paper describes one aspect of performance portability with respect to
developing a portable libr... | [
{
"created": "Mon, 22 Mar 2021 16:36:12 GMT",
"version": "v1"
}
] | 2021-03-23 | [
[
"Rajamanickam",
"Sivasankaran",
""
],
[
"Acer",
"Seher",
""
],
[
"Berger-Vergiat",
"Luc",
""
],
[
"Dang",
"Vinh",
""
],
[
"Ellingwood",
"Nathan",
""
],
[
"Harvey",
"Evan",
""
],
[
"Kelley",
"Brian",
""
],... | As hardware architectures are evolving in the push towards exascale, developing Computational Science and Engineering (CSE) applications depend on performance portable approaches for sustainable software development. This paper describes one aspect of performance portability with respect to developing a portable librar... |
2306.06551 | Hritom Das | Hritom Das, Rocco D. Febbo, SNB Tushar, Nishith N. Chakraborty,
Maximilian Liehr, Nathaniel Cady, Garrett S. Rose | An Efficient and Accurate Memristive Memory for Array-based Spiking
Neural Networks | null | IEEE Transactions on Circuits and Systems I: Regular Papers, 10
August 2023 | 10.1109/TCSI.2023.3301020 | null | cs.NE cs.ET | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Memristors provide a tempting solution for weighted synapse connections in
neuromorphic computing due to their size and non-volatile nature. However,
memristors are unreliable in the commonly used voltage-pulse-based programming
approaches and require precisely shaped pulses to avoid programming failure. In
this pape... | [
{
"created": "Sun, 11 Jun 2023 00:47:09 GMT",
"version": "v1"
},
{
"created": "Thu, 10 Aug 2023 21:14:17 GMT",
"version": "v2"
},
{
"created": "Wed, 6 Sep 2023 20:59:49 GMT",
"version": "v3"
}
] | 2023-09-08 | [
[
"Das",
"Hritom",
""
],
[
"Febbo",
"Rocco D.",
""
],
[
"Tushar",
"SNB",
""
],
[
"Chakraborty",
"Nishith N.",
""
],
[
"Liehr",
"Maximilian",
""
],
[
"Cady",
"Nathaniel",
""
],
[
"Rose",
"Garrett S.",
""
]
] | Memristors provide a tempting solution for weighted synapse connections in neuromorphic computing due to their size and non-volatile nature. However, memristors are unreliable in the commonly used voltage-pulse-based programming approaches and require precisely shaped pulses to avoid programming failure. In this paper,... |
1411.0062 | Qilong Feng | Feng Shi, Jianer Chen, Qilong Feng, Xiaojun Ding, Jianxin Wang | Algorithms for Maximum Agreement Forest of Multiple General Trees | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Maximum Agreement Forest (Maf) problem is a well-studied problem in
evolutionary biology, which asks for a largest common subforest of a given
collection of phylogenetic trees with identical leaf label-set. However, the
previous work about the Maf problem are mainly on two binary phylogenetic trees
or two general... | [
{
"created": "Sat, 1 Nov 2014 03:45:00 GMT",
"version": "v1"
}
] | 2014-11-04 | [
[
"Shi",
"Feng",
""
],
[
"Chen",
"Jianer",
""
],
[
"Feng",
"Qilong",
""
],
[
"Ding",
"Xiaojun",
""
],
[
"Wang",
"Jianxin",
""
]
] | The Maximum Agreement Forest (Maf) problem is a well-studied problem in evolutionary biology, which asks for a largest common subforest of a given collection of phylogenetic trees with identical leaf label-set. However, the previous work about the Maf problem are mainly on two binary phylogenetic trees or two general (... |
2207.00669 | Kevin Tracy | Kevin Tracy, Taylor A. Howell, Zachary Manchester | Differentiable Collision Detection for a Set of Convex Primitives | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Collision detection between objects is critical for simulation, control, and
learning for robotic systems. However, existing collision detection routines
are inherently non-differentiable, limiting their applications in
gradient-based optimization tools. In this work, we propose DCOL: a fast and
fully differentiable ... | [
{
"created": "Fri, 1 Jul 2022 22:03:27 GMT",
"version": "v1"
},
{
"created": "Wed, 14 Sep 2022 21:03:21 GMT",
"version": "v2"
},
{
"created": "Thu, 18 May 2023 15:24:44 GMT",
"version": "v3"
}
] | 2023-05-19 | [
[
"Tracy",
"Kevin",
""
],
[
"Howell",
"Taylor A.",
""
],
[
"Manchester",
"Zachary",
""
]
] | Collision detection between objects is critical for simulation, control, and learning for robotic systems. However, existing collision detection routines are inherently non-differentiable, limiting their applications in gradient-based optimization tools. In this work, we propose DCOL: a fast and fully differentiable co... |
1708.04167 | Sinan Kahraman | Sinan Kahraman | Strange Attractor for Efficient Polar Code Design | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a definition of a construction for long polar codes.
Recently, we know that partial order is a universal property of the
construction with a sublinear complexity for polar codes. In order to describe
the partial order, addition and left-swap operators are only defined as
universal up to now. In th... | [
{
"created": "Mon, 14 Aug 2017 15:10:37 GMT",
"version": "v1"
}
] | 2017-08-15 | [
[
"Kahraman",
"Sinan",
""
]
] | This paper presents a definition of a construction for long polar codes. Recently, we know that partial order is a universal property of the construction with a sublinear complexity for polar codes. In order to describe the partial order, addition and left-swap operators are only defined as universal up to now. In this... |
2305.17989 | Alysson Bessani | Robin Vassantlal, Hasan Heydari, Alysson Bessani | On the Minimal Knowledge Required for Solving Stellar Consensus | Preprint of a paper to appear at the 43rd IEEE International
Conference on Distributed Computing Systems (ICDCS 2023) | null | null | null | cs.DC cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Byzantine Consensus is fundamental for building consistent and fault-tolerant
distributed systems. In traditional quorum-based consensus protocols, quorums
are defined using globally known assumptions shared among all participants.
Motivated by decentralized applications on open networks, the Stellar
blockchain relax... | [
{
"created": "Mon, 29 May 2023 09:59:43 GMT",
"version": "v1"
},
{
"created": "Fri, 23 Jun 2023 10:28:23 GMT",
"version": "v2"
}
] | 2023-06-26 | [
[
"Vassantlal",
"Robin",
""
],
[
"Heydari",
"Hasan",
""
],
[
"Bessani",
"Alysson",
""
]
] | Byzantine Consensus is fundamental for building consistent and fault-tolerant distributed systems. In traditional quorum-based consensus protocols, quorums are defined using globally known assumptions shared among all participants. Motivated by decentralized applications on open networks, the Stellar blockchain relaxes... |
2110.07201 | Zijian Gao | Zijian Gao and Huanyu Liu and Jingyu Liu | Coarse to Fine: Video Retrieval before Moment Localization | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The current state-of-the-art methods for video corpus moment retrieval (VCMR)
often use similarity-based feature alignment approach for the sake of
convenience and speed. However, late fusion methods like cosine similarity
alignment are unable to make full use of the information from both query texts
and videos. In t... | [
{
"created": "Thu, 14 Oct 2021 07:54:36 GMT",
"version": "v1"
}
] | 2021-10-15 | [
[
"Gao",
"Zijian",
""
],
[
"Liu",
"Huanyu",
""
],
[
"Liu",
"Jingyu",
""
]
] | The current state-of-the-art methods for video corpus moment retrieval (VCMR) often use similarity-based feature alignment approach for the sake of convenience and speed. However, late fusion methods like cosine similarity alignment are unable to make full use of the information from both query texts and videos. In thi... |
2307.06323 | Sajani Vithana | Sajani Vithana and Sennur Ulukus | Information-Theoretically Private Federated Submodel Learning with
Storage Constrained Databases | arXiv admin note: text overlap with arXiv:2302.03670 | null | null | null | cs.IT cs.CR cs.NI eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In federated submodel learning (FSL), a machine learning model is divided
into multiple submodels based on different types of data used for training.
Each user involved in the training process only downloads and updates the
submodel relevant to the user's local data, which significantly reduces the
communication cost... | [
{
"created": "Wed, 12 Jul 2023 17:40:21 GMT",
"version": "v1"
}
] | 2023-07-13 | [
[
"Vithana",
"Sajani",
""
],
[
"Ulukus",
"Sennur",
""
]
] | In federated submodel learning (FSL), a machine learning model is divided into multiple submodels based on different types of data used for training. Each user involved in the training process only downloads and updates the submodel relevant to the user's local data, which significantly reduces the communication cost c... |
2312.12732 | Paolo D'Alberto | Paolo D'Alberto | Strassen's Matrix Multiplication Algorithm Is Still Faster | 8 pages, 2 images, mathematical software | null | null | null | cs.MS cs.PF | http://creativecommons.org/licenses/by/4.0/ | Recently, reinforcement algorithms discovered new algorithms that really
jump-started a wave of excitements and a flourishing of publications. However,
there is little on implementations, applications, and, especially, no absolute
performance and, we show here they are not here to replace Strassen's original
fast mat... | [
{
"created": "Wed, 20 Dec 2023 03:09:50 GMT",
"version": "v1"
}
] | 2023-12-21 | [
[
"D'Alberto",
"Paolo",
""
]
] | Recently, reinforcement algorithms discovered new algorithms that really jump-started a wave of excitements and a flourishing of publications. However, there is little on implementations, applications, and, especially, no absolute performance and, we show here they are not here to replace Strassen's original fast matri... |
2006.05490 | Yu Chen | Yu Chen, Sampath Kannan, Sanjeev Khanna | Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation | ICALP 2020 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of designing sublinear time algorithms for estimating
the cost of a minimum metric traveling salesman (TSP) tour. Specifically, given
access to a $n \times n$ distance matrix $D$ that specifies pairwise distances
between $n$ points, the goal is to estimate the TSP cost by performing only
subli... | [
{
"created": "Tue, 9 Jun 2020 20:08:09 GMT",
"version": "v1"
}
] | 2020-06-11 | [
[
"Chen",
"Yu",
""
],
[
"Kannan",
"Sampath",
""
],
[
"Khanna",
"Sanjeev",
""
]
] | We consider the problem of designing sublinear time algorithms for estimating the cost of a minimum metric traveling salesman (TSP) tour. Specifically, given access to a $n \times n$ distance matrix $D$ that specifies pairwise distances between $n$ points, the goal is to estimate the TSP cost by performing only subline... |
2112.11763 | Sascha Kurz | Sascha Kurz | Divisible Codes | 105 pages; typos corrected and references updated | null | null | null | cs.IT math.CO math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A linear code over $\mathbb{F}_q$ with the Hamming metric is called
$\Delta$-divisible if the weights of all codewords are divisible by $\Delta$.
They have been introduced by Harold Ward a few decades ago. Applications
include subspace codes, partial spreads, vector space partitions, and distance
optimal codes. The d... | [
{
"created": "Wed, 22 Dec 2021 10:03:31 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Dec 2022 09:05:04 GMT",
"version": "v2"
},
{
"created": "Fri, 22 Dec 2023 13:46:58 GMT",
"version": "v3"
}
] | 2023-12-25 | [
[
"Kurz",
"Sascha",
""
]
] | A linear code over $\mathbb{F}_q$ with the Hamming metric is called $\Delta$-divisible if the weights of all codewords are divisible by $\Delta$. They have been introduced by Harold Ward a few decades ago. Applications include subspace codes, partial spreads, vector space partitions, and distance optimal codes. The det... |
1910.03230 | Wenhu Chen | Wenhu Chen, Zhe Gan, Linjie Li, Yu Cheng, William Wang, Jingjing Liu | Meta Module Network for Compositional Visual Reasoning | Accepted to WACV 21 (Oral) | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural Module Network (NMN) exhibits strong interpretability and
compositionality thanks to its handcrafted neural modules with explicit
multi-hop reasoning capability. However, most NMNs suffer from two critical
drawbacks: 1) scalability: customized module for specific function renders it
impractical when scaling up... | [
{
"created": "Tue, 8 Oct 2019 06:28:24 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Nov 2019 19:39:46 GMT",
"version": "v2"
},
{
"created": "Sun, 18 Oct 2020 20:28:29 GMT",
"version": "v3"
},
{
"created": "Tue, 3 Nov 2020 17:55:05 GMT",
"version": "v4"
},
{
"cre... | 2020-11-10 | [
[
"Chen",
"Wenhu",
""
],
[
"Gan",
"Zhe",
""
],
[
"Li",
"Linjie",
""
],
[
"Cheng",
"Yu",
""
],
[
"Wang",
"William",
""
],
[
"Liu",
"Jingjing",
""
]
] | Neural Module Network (NMN) exhibits strong interpretability and compositionality thanks to its handcrafted neural modules with explicit multi-hop reasoning capability. However, most NMNs suffer from two critical drawbacks: 1) scalability: customized module for specific function renders it impractical when scaling up t... |
2105.11025 | John Shin | John Y. Shin | Compressing Heavy-Tailed Weight Matrices for Non-Vacuous Generalization
Bounds | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Heavy-tailed distributions have been studied in statistics, random matrix
theory, physics, and econometrics as models of correlated systems, among other
domains. Further, heavy-tail distributed eigenvalues of the covariance matrix
of the weight matrices in neural networks have been shown to empirically
correlate with... | [
{
"created": "Sun, 23 May 2021 21:36:33 GMT",
"version": "v1"
}
] | 2021-05-25 | [
[
"Shin",
"John Y.",
""
]
] | Heavy-tailed distributions have been studied in statistics, random matrix theory, physics, and econometrics as models of correlated systems, among other domains. Further, heavy-tail distributed eigenvalues of the covariance matrix of the weight matrices in neural networks have been shown to empirically correlate with t... |
2105.01419 | Tianyu Liu | Hang Yu, Tianyu Liu, Jie Lu and Guangquan Zhang | Automatic Learning to Detect Concept Drift | null | null | null | null | cs.AI | http://creativecommons.org/publicdomain/zero/1.0/ | Many methods have been proposed to detect concept drift, i.e., the change in
the distribution of streaming data, due to concept drift causes a decrease in
the prediction accuracy of algorithms. However, the most of current detection
methods are based on the assessment of the degree of change in the data
distribution,... | [
{
"created": "Tue, 4 May 2021 11:10:39 GMT",
"version": "v1"
}
] | 2021-05-05 | [
[
"Yu",
"Hang",
""
],
[
"Liu",
"Tianyu",
""
],
[
"Lu",
"Jie",
""
],
[
"Zhang",
"Guangquan",
""
]
] | Many methods have been proposed to detect concept drift, i.e., the change in the distribution of streaming data, due to concept drift causes a decrease in the prediction accuracy of algorithms. However, the most of current detection methods are based on the assessment of the degree of change in the data distribution, c... |
1804.04121 | Joon Son Chung | Triantafyllos Afouras, Joon Son Chung, Andrew Zisserman | The Conversation: Deep Audio-Visual Speech Enhancement | To appear in Interspeech 2018. We provide supplementary material with
interactive demonstrations on
http://www.robots.ox.ac.uk/~vgg/demo/theconversation | null | null | null | cs.CV cs.SD | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Our goal is to isolate individual speakers from multi-talker simultaneous
speech in videos. Existing works in this area have focussed on trying to
separate utterances from known speakers in controlled environments. In this
paper, we propose a deep audio-visual speech enhancement network that is able
to separate a spe... | [
{
"created": "Wed, 11 Apr 2018 17:57:28 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Jun 2018 17:51:32 GMT",
"version": "v2"
}
] | 2018-06-20 | [
[
"Afouras",
"Triantafyllos",
""
],
[
"Chung",
"Joon Son",
""
],
[
"Zisserman",
"Andrew",
""
]
] | Our goal is to isolate individual speakers from multi-talker simultaneous speech in videos. Existing works in this area have focussed on trying to separate utterances from known speakers in controlled environments. In this paper, we propose a deep audio-visual speech enhancement network that is able to separate a speak... |
0805.3605 | Chung Chan | Chung Chan | Success Exponent of Wiretapper: A Tradeoff between Secrecy and
Reliability | 16 pages, 10 figures | null | null | null | cs.IT cs.CR math.IT math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Equivocation rate has been widely used as an information-theoretic measure of
security after Shannon[10]. It simplifies problems by removing the effect of
atypical behavior from the system. In [9], however, Merhav and Arikan
considered the alternative of using guessing exponent to analyze the Shannon's
cipher system.... | [
{
"created": "Fri, 23 May 2008 10:45:12 GMT",
"version": "v1"
},
{
"created": "Sun, 25 May 2008 23:51:08 GMT",
"version": "v2"
},
{
"created": "Wed, 28 May 2008 00:21:54 GMT",
"version": "v3"
},
{
"created": "Sat, 31 May 2008 21:10:55 GMT",
"version": "v4"
}
] | 2008-06-01 | [
[
"Chan",
"Chung",
""
]
] | Equivocation rate has been widely used as an information-theoretic measure of security after Shannon[10]. It simplifies problems by removing the effect of atypical behavior from the system. In [9], however, Merhav and Arikan considered the alternative of using guessing exponent to analyze the Shannon's cipher system. B... |
2202.03207 | Nader Bshouty | Nader H. Bshouty | Almost Optimal Proper Learning and Testing Polynomials | null | null | null | null | cs.LG cs.DS stat.ML | http://creativecommons.org/licenses/by/4.0/ | We give the first almost optimal polynomial-time proper learning algorithm of
Boolean sparse multivariate polynomial under the uniform distribution. For
$s$-sparse polynomial over $n$ variables and $\epsilon=1/s^\beta$, $\beta>1$,
our algorithm makes $$q_U=\left(\frac{s}{\epsilon}\right)^{\frac{\log
\beta}{\beta}+O(\... | [
{
"created": "Mon, 7 Feb 2022 14:15:20 GMT",
"version": "v1"
}
] | 2022-02-08 | [
[
"Bshouty",
"Nader H.",
""
]
] | We give the first almost optimal polynomial-time proper learning algorithm of Boolean sparse multivariate polynomial under the uniform distribution. For $s$-sparse polynomial over $n$ variables and $\epsilon=1/s^\beta$, $\beta>1$, our algorithm makes $$q_U=\left(\frac{s}{\epsilon}\right)^{\frac{\log \beta}{\beta}+O(\fr... |
2403.06261 | Pengyu Pan | Xiaobo Ma, Pengyu Pan, Jianfeng Li, Wei Wang, Weizhi Meng, Xiaohong
Guan | ABC-Channel: An Advanced Blockchain-based Covert Channel | 5 pages, section 3.C; Corrected the description | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Establishing efficient and robust covert channels is crucial for secure
communication within insecure network environments. With its inherent benefits
of decentralization and anonymization, blockchain has gained considerable
attention in developing covert channels. To guarantee a highly secure covert
channel, channel... | [
{
"created": "Sun, 10 Mar 2024 16:57:53 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Mar 2024 13:49:28 GMT",
"version": "v2"
}
] | 2024-03-26 | [
[
"Ma",
"Xiaobo",
""
],
[
"Pan",
"Pengyu",
""
],
[
"Li",
"Jianfeng",
""
],
[
"Wang",
"Wei",
""
],
[
"Meng",
"Weizhi",
""
],
[
"Guan",
"Xiaohong",
""
]
] | Establishing efficient and robust covert channels is crucial for secure communication within insecure network environments. With its inherent benefits of decentralization and anonymization, blockchain has gained considerable attention in developing covert channels. To guarantee a highly secure covert channel, channel n... |
2310.19331 | Penghui Zhang | Penghui Zhang, Hua Zhang, Yibo Pi, Zijian Cao, Jingyu Wang and Jianxin
Liao | AdapINT: A Flexible and Adaptive In-Band Network Telemetry System Based
on Deep Reinforcement Learning | 14 pages, 19 figures | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In-band Network Telemetry (INT) has emerged as a promising network
measurement technology. However, existing network telemetry systems lack the
flexibility to meet diverse telemetry requirements and are also difficult to
adapt to dynamic network environments. In this paper, we propose AdapINT, a
versatile and adaptiv... | [
{
"created": "Mon, 30 Oct 2023 08:02:35 GMT",
"version": "v1"
}
] | 2023-10-31 | [
[
"Zhang",
"Penghui",
""
],
[
"Zhang",
"Hua",
""
],
[
"Pi",
"Yibo",
""
],
[
"Cao",
"Zijian",
""
],
[
"Wang",
"Jingyu",
""
],
[
"Liao",
"Jianxin",
""
]
] | In-band Network Telemetry (INT) has emerged as a promising network measurement technology. However, existing network telemetry systems lack the flexibility to meet diverse telemetry requirements and are also difficult to adapt to dynamic network environments. In this paper, we propose AdapINT, a versatile and adaptive ... |
2307.08624 | Haibing Lu | Sihang Li, Kuangzheng Li, Haibing Lu | National Origin Discrimination in Deep-learning-powered Automated Resume
Screening | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Many companies and organizations have started to use some form of AIenabled
auto mated tools to assist in their hiring process, e.g. screening resumes,
interviewing candi dates, performance evaluation. While those AI tools have
greatly improved human re source operations efficiency and provided
conveniences to job se... | [
{
"created": "Thu, 13 Jul 2023 01:35:29 GMT",
"version": "v1"
}
] | 2023-07-18 | [
[
"Li",
"Sihang",
""
],
[
"Li",
"Kuangzheng",
""
],
[
"Lu",
"Haibing",
""
]
] | Many companies and organizations have started to use some form of AIenabled auto mated tools to assist in their hiring process, e.g. screening resumes, interviewing candi dates, performance evaluation. While those AI tools have greatly improved human re source operations efficiency and provided conveniences to job seek... |
2010.12472 | Tommaso Caselli | Tommaso Caselli, Valerio Basile, Jelena Mitrovi\'c, Michael Granitzer | HateBERT: Retraining BERT for Abusive Language Detection in English | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In this paper, we introduce HateBERT, a re-trained BERT model for abusive
language detection in English. The model was trained on RAL-E, a large-scale
dataset of Reddit comments in English from communities banned for being
offensive, abusive, or hateful that we have collected and made available to the
public. We pres... | [
{
"created": "Fri, 23 Oct 2020 15:14:14 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Feb 2021 10:00:07 GMT",
"version": "v2"
}
] | 2021-02-05 | [
[
"Caselli",
"Tommaso",
""
],
[
"Basile",
"Valerio",
""
],
[
"Mitrović",
"Jelena",
""
],
[
"Granitzer",
"Michael",
""
]
] | In this paper, we introduce HateBERT, a re-trained BERT model for abusive language detection in English. The model was trained on RAL-E, a large-scale dataset of Reddit comments in English from communities banned for being offensive, abusive, or hateful that we have collected and made available to the public. We presen... |
2210.09629 | Jiajun Zhang | Jiajun Zhang and Boyu Chen and Zhilong Ji and Jinfeng Bai and Zonghai
Hu | 1st Place Solutions for the UVO Challenge 2022 | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper describes the approach we have taken in the challenge. We still
adopted the two-stage scheme same as the last champion, that is, detection
first and segmentation followed. We trained more powerful detector and
segmentor separately. Besides, we also perform pseudo-label training on the
test set, based on st... | [
{
"created": "Tue, 18 Oct 2022 06:54:37 GMT",
"version": "v1"
}
] | 2022-10-19 | [
[
"Zhang",
"Jiajun",
""
],
[
"Chen",
"Boyu",
""
],
[
"Ji",
"Zhilong",
""
],
[
"Bai",
"Jinfeng",
""
],
[
"Hu",
"Zonghai",
""
]
] | This paper describes the approach we have taken in the challenge. We still adopted the two-stage scheme same as the last champion, that is, detection first and segmentation followed. We trained more powerful detector and segmentor separately. Besides, we also perform pseudo-label training on the test set, based on stud... |
1710.11376 | Weibo Chu | Weibo Chu, Mostafa Dehghan, John C.S. Lui, Don Towsley, Zhi-Li Zhang | Joint Cache Resource Allocation and Request Routing for In-network
Caching Services | 15 pages | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In-network caching is recognized as an effective solution to offload content
servers and the network. A cache service provider (SP) always has incentives to
better utilize its cache resources by taking into account diverse roles that
content providers (CPs) play, e.g., their business models, traffic
characteristics, ... | [
{
"created": "Tue, 31 Oct 2017 08:59:50 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Dec 2017 03:54:00 GMT",
"version": "v2"
}
] | 2017-12-12 | [
[
"Chu",
"Weibo",
""
],
[
"Dehghan",
"Mostafa",
""
],
[
"Lui",
"John C. S.",
""
],
[
"Towsley",
"Don",
""
],
[
"Zhang",
"Zhi-Li",
""
]
] | In-network caching is recognized as an effective solution to offload content servers and the network. A cache service provider (SP) always has incentives to better utilize its cache resources by taking into account diverse roles that content providers (CPs) play, e.g., their business models, traffic characteristics, pr... |
1712.04139 | Aydogan Ozcan | Yair Rivenson, Hatice Ceylan Koydemir, Hongda Wang, Zhensong Wei,
Zhengshuang Ren, Harun Gunaydin, Yibo Zhang, Zoltan Gorocs, Kyle Liang, Derek
Tseng, Aydogan Ozcan | Deep learning enhanced mobile-phone microscopy | null | ACS Photonics (2018) | 10.1021/acsphotonics.8b00146 | null | cs.LG cs.CV physics.med-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile-phones have facilitated the creation of field-portable, cost-effective
imaging and sensing technologies that approach laboratory-grade instrument
performance. However, the optical imaging interfaces of mobile-phones are not
designed for microscopy and produce spatial and spectral distortions in imaging
microsc... | [
{
"created": "Tue, 12 Dec 2017 06:03:27 GMT",
"version": "v1"
}
] | 2018-03-19 | [
[
"Rivenson",
"Yair",
""
],
[
"Koydemir",
"Hatice Ceylan",
""
],
[
"Wang",
"Hongda",
""
],
[
"Wei",
"Zhensong",
""
],
[
"Ren",
"Zhengshuang",
""
],
[
"Gunaydin",
"Harun",
""
],
[
"Zhang",
"Yibo",
""
],
[
... | Mobile-phones have facilitated the creation of field-portable, cost-effective imaging and sensing technologies that approach laboratory-grade instrument performance. However, the optical imaging interfaces of mobile-phones are not designed for microscopy and produce spatial and spectral distortions in imaging microscop... |
2308.02810 | Sibo Cheng | Sibo Cheng and Yike Guo and Rossella Arcucci | A generative model for surrogates of spatial-temporal wildfire
nowcasting | null | null | null | null | cs.LG cs.AI physics.comp-ph | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recent increase in wildfires worldwide has led to the need for real-time fire
nowcasting. Physics-driven models, such as cellular automata and computational
fluid dynamics can provide high-fidelity fire spread simulations but they are
computationally expensive and time-consuming. Much effort has been put into
develop... | [
{
"created": "Sat, 5 Aug 2023 06:54:18 GMT",
"version": "v1"
}
] | 2023-08-08 | [
[
"Cheng",
"Sibo",
""
],
[
"Guo",
"Yike",
""
],
[
"Arcucci",
"Rossella",
""
]
] | Recent increase in wildfires worldwide has led to the need for real-time fire nowcasting. Physics-driven models, such as cellular automata and computational fluid dynamics can provide high-fidelity fire spread simulations but they are computationally expensive and time-consuming. Much effort has been put into developin... |
2204.08760 | Pantelimon Stanica | Chunlei Li, Constanza Riera, Pantelimon Stanica | Low c-differentially uniform functions via an extension of Dillon's
switching method | 21 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we generalize Dillon's switching method to characterize the
exact $c$-differential uniformity of functions constructed via this method.
More precisely, we modify some PcN/APcN and other functions with known
$c$-differential uniformity in a controllable number of coordinates to render
more such functions... | [
{
"created": "Tue, 19 Apr 2022 08:57:55 GMT",
"version": "v1"
}
] | 2022-04-20 | [
[
"Li",
"Chunlei",
""
],
[
"Riera",
"Constanza",
""
],
[
"Stanica",
"Pantelimon",
""
]
] | In this paper we generalize Dillon's switching method to characterize the exact $c$-differential uniformity of functions constructed via this method. More precisely, we modify some PcN/APcN and other functions with known $c$-differential uniformity in a controllable number of coordinates to render more such functions. ... |
2406.18152 | Junkai Zhang | Junkai Zhang, Yifan Zhang, Xi Sheryl Zhang, Yifan Zang, Jian Cheng | Intrinsic Action Tendency Consistency for Cooperative Multi-Agent
Reinforcement Learning | The AAAI-2024 paper with the appendix | null | null | null | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Efficient collaboration in the centralized training with decentralized
execution (CTDE) paradigm remains a challenge in cooperative multi-agent
systems. We identify divergent action tendencies among agents as a significant
obstacle to CTDE's training efficiency, requiring a large number of training
samples to achieve... | [
{
"created": "Wed, 26 Jun 2024 08:06:29 GMT",
"version": "v1"
}
] | 2024-06-27 | [
[
"Zhang",
"Junkai",
""
],
[
"Zhang",
"Yifan",
""
],
[
"Zhang",
"Xi Sheryl",
""
],
[
"Zang",
"Yifan",
""
],
[
"Cheng",
"Jian",
""
]
] | Efficient collaboration in the centralized training with decentralized execution (CTDE) paradigm remains a challenge in cooperative multi-agent systems. We identify divergent action tendencies among agents as a significant obstacle to CTDE's training efficiency, requiring a large number of training samples to achieve a... |
1710.11540 | Jinsong Wu | Zhifang Liao, Benhong Zhao, Shengzong Liu, Haozhi Jin, Dayu He, Liu
Yang, Jinsong Wu, Yan Zhang | A Prediction Model of the Project Life-span in Open Source Software
Ecosystem | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In nature ecosystems, animal life-spans are determined by genes and some
other biological characteristics. Similarly, the software project life-spans
are related to some internal or external characteristics. Analyzing the
relations between these characteristics and the project life-span, may help
developers, investor... | [
{
"created": "Tue, 31 Oct 2017 15:53:21 GMT",
"version": "v1"
}
] | 2017-11-01 | [
[
"Liao",
"Zhifang",
""
],
[
"Zhao",
"Benhong",
""
],
[
"Liu",
"Shengzong",
""
],
[
"Jin",
"Haozhi",
""
],
[
"He",
"Dayu",
""
],
[
"Yang",
"Liu",
""
],
[
"Wu",
"Jinsong",
""
],
[
"Zhang",
"Yan",
... | In nature ecosystems, animal life-spans are determined by genes and some other biological characteristics. Similarly, the software project life-spans are related to some internal or external characteristics. Analyzing the relations between these characteristics and the project life-span, may help developers, investors,... |
1309.3513 | Sabyasachi Mukhopadhyay | Sabyasachi Mukhopadhyay, Paritosh Bhattacharya, B.B.Ghosh | Application of Vertex coloring in a particular triangular closed path
structure and in Krafts inequality | null | null | null | null | cs.DM math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A good deal of research has been done and published on coloring of the
vertices of graphs for several years while studying of the excellent work of
those maestros, we get inspire to work on the vertex coloring of graphs in case
of a particular triangular closed path structure what we achieve from the front
view of a ... | [
{
"created": "Thu, 22 Aug 2013 10:46:32 GMT",
"version": "v1"
}
] | 2013-09-16 | [
[
"Mukhopadhyay",
"Sabyasachi",
""
],
[
"Bhattacharya",
"Paritosh",
""
],
[
"Ghosh",
"B. B.",
""
]
] | A good deal of research has been done and published on coloring of the vertices of graphs for several years while studying of the excellent work of those maestros, we get inspire to work on the vertex coloring of graphs in case of a particular triangular closed path structure what we achieve from the front view of a py... |
2401.14409 | Ray Titus Prof.Dr. | Sarvesh Jadhav, Ray Titus, Tina Babu, R.Chinnaiyan | Evaluation of Consumer Behavior Regarding Food Delivery Applications in
India | 12 Pages,6 Figures , 2 Tables | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | . This paper explores consumer behavior towards food delivery apps, focusing
on attributes like restaurant variety, food packaging quality, and application
design and user interface. The study reveals that a diverse range of
restaurants positively influences consumer satisfaction, leading to increased
app usage. Conv... | [
{
"created": "Fri, 8 Dec 2023 09:58:23 GMT",
"version": "v1"
}
] | 2024-01-29 | [
[
"Jadhav",
"Sarvesh",
""
],
[
"Titus",
"Ray",
""
],
[
"Babu",
"Tina",
""
],
[
"Chinnaiyan",
"R.",
""
]
] | . This paper explores consumer behavior towards food delivery apps, focusing on attributes like restaurant variety, food packaging quality, and application design and user interface. The study reveals that a diverse range of restaurants positively influences consumer satisfaction, leading to increased app usage. Conver... |
1809.08358 | Xin Ma | Xin Ma, Liang Chang, Shuangchen Li, Lei Deng, Yufei Ding, Yuan Xie | In-memory multiplication engine with SOT-MRAM based stochastic computing | null | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Processing-in-memory (PIM) turns out to be a promising solution to
breakthrough the memory wall and the power wall. While prior PIM designs yield
successful implementation of bitwise Boolean logic operations locally in
memory, it is difficult to accomplish the multiplication (MUL) instruction in a
fast and efficient ... | [
{
"created": "Sat, 22 Sep 2018 00:57:09 GMT",
"version": "v1"
}
] | 2018-09-25 | [
[
"Ma",
"Xin",
""
],
[
"Chang",
"Liang",
""
],
[
"Li",
"Shuangchen",
""
],
[
"Deng",
"Lei",
""
],
[
"Ding",
"Yufei",
""
],
[
"Xie",
"Yuan",
""
]
] | Processing-in-memory (PIM) turns out to be a promising solution to breakthrough the memory wall and the power wall. While prior PIM designs yield successful implementation of bitwise Boolean logic operations locally in memory, it is difficult to accomplish the multiplication (MUL) instruction in a fast and efficient ma... |
2007.01862 | HMN Dilum Bandara | M. Shazmin Marikar and H.M.N. Dilum Bandara | An Analysis of Data Driven, Decision-Making Capabilities of Managers in
Banks | 19 pages, 8 figues, 5 tables | null | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Organizations are adopting data analytics and Business Intelligence (BI)
tools to gain insights from the past data, forecast future events, and to get
timely and reliable information for decision making. While the tools are
becoming mature, affordable, and more comfortable to use, it is also essential
to understand w... | [
{
"created": "Fri, 3 Jul 2020 08:14:56 GMT",
"version": "v1"
}
] | 2020-07-07 | [
[
"Marikar",
"M. Shazmin",
""
],
[
"Bandara",
"H. M. N. Dilum",
""
]
] | Organizations are adopting data analytics and Business Intelligence (BI) tools to gain insights from the past data, forecast future events, and to get timely and reliable information for decision making. While the tools are becoming mature, affordable, and more comfortable to use, it is also essential to understand whe... |
2307.14805 | Fabian Mitterwallner | Fabian Mitterwallner, Aart Middeldorp and Ren\'e Thiemann | Linear Termination over N is Undecidable | Presented at WST 2023 | null | null | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | Recently it was shown that it is undecidable whether a term rewrite system
can be proved terminating by a polynomial interpretation in the natural
numbers. In this paper we show that this is also the case when restricting the
interpretations to linear polynomials, as is often done in tools, and when only
considering ... | [
{
"created": "Thu, 27 Jul 2023 12:20:22 GMT",
"version": "v1"
}
] | 2023-07-28 | [
[
"Mitterwallner",
"Fabian",
""
],
[
"Middeldorp",
"Aart",
""
],
[
"Thiemann",
"René",
""
]
] | Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the interpretations to linear polynomials, as is often done in tools, and when only considering si... |
2011.00566 | Hang Zhou | Hang Zhou, Dongdong Chen, Jing Liao, Weiming Zhang, Kejiang Chen,
Xiaoyi Dong, Kunlin Liu, Gang Hua and Nenghai Yu | LG-GAN: Label Guided Adversarial Network for Flexible Targeted Attack of
Point Cloud-based Deep Networks | CVPR 2020, code available at: https://github.com/RyanHangZhou/LG-GAN | null | null | null | cs.CV cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks have made tremendous progress in 3D point-cloud
recognition. Recent works have shown that these 3D recognition networks are
also vulnerable to adversarial samples produced from various attack methods,
including optimization-based 3D Carlini-Wagner attack, gradient-based iterative
fast gradient me... | [
{
"created": "Sun, 1 Nov 2020 17:17:10 GMT",
"version": "v1"
}
] | 2020-11-03 | [
[
"Zhou",
"Hang",
""
],
[
"Chen",
"Dongdong",
""
],
[
"Liao",
"Jing",
""
],
[
"Zhang",
"Weiming",
""
],
[
"Chen",
"Kejiang",
""
],
[
"Dong",
"Xiaoyi",
""
],
[
"Liu",
"Kunlin",
""
],
[
"Hua",
"Gang... | Deep neural networks have made tremendous progress in 3D point-cloud recognition. Recent works have shown that these 3D recognition networks are also vulnerable to adversarial samples produced from various attack methods, including optimization-based 3D Carlini-Wagner attack, gradient-based iterative fast gradient meth... |
1411.4287 | M. Avendi | M. R. Avendi and Hamid Jafarkhani | Differential Distributed Space-Time Coding with Imperfect
Synchronization in Frequency-Selective Channels | to appear in IEEE Transaction on Wireless Communications, 2014 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Differential distributed space-time coding (D-DSTC) is a cooperative
transmission technique that can improve diversity in wireless relay networks in
the absence of channel information. Conventionally, it is assumed that channels
are flat-fading and relays are perfectly synchronized at the symbol level.
However, due t... | [
{
"created": "Sun, 16 Nov 2014 18:07:40 GMT",
"version": "v1"
}
] | 2014-11-18 | [
[
"Avendi",
"M. R.",
""
],
[
"Jafarkhani",
"Hamid",
""
]
] | Differential distributed space-time coding (D-DSTC) is a cooperative transmission technique that can improve diversity in wireless relay networks in the absence of channel information. Conventionally, it is assumed that channels are flat-fading and relays are perfectly synchronized at the symbol level. However, due to ... |
2108.02117 | Jae Ro | Jae Hun Ro, Ananda Theertha Suresh, Ke Wu | FedJAX: Federated learning simulation with JAX | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Federated learning is a machine learning technique that enables training
across decentralized data. Recently, federated learning has become an active
area of research due to an increased focus on privacy and security. In light of
this, a variety of open source federated learning libraries have been developed
and rele... | [
{
"created": "Wed, 4 Aug 2021 15:41:32 GMT",
"version": "v1"
},
{
"created": "Sat, 6 Nov 2021 01:11:43 GMT",
"version": "v2"
}
] | 2021-11-09 | [
[
"Ro",
"Jae Hun",
""
],
[
"Suresh",
"Ananda Theertha",
""
],
[
"Wu",
"Ke",
""
]
] | Federated learning is a machine learning technique that enables training across decentralized data. Recently, federated learning has become an active area of research due to an increased focus on privacy and security. In light of this, a variety of open source federated learning libraries have been developed and releas... |
1810.03551 | Diptarka Chakraborty | Diptarka Chakraborty, Debarati Das, Michal Koucky | Approximate Online Pattern Matching in Sub-linear Time | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the approximate pattern matching problem under edit distance. In
this problem we are given a pattern $P$ of length $w$ and a text $T$ of length
$n$ over some alphabet $\Sigma$, and a positive integer $k$. The goal is to
find all the positions $j$ in $T$ such that there is a substring of $T$ ending
at $j$ ... | [
{
"created": "Mon, 8 Oct 2018 16:10:17 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Nov 2018 11:03:00 GMT",
"version": "v2"
}
] | 2018-11-06 | [
[
"Chakraborty",
"Diptarka",
""
],
[
"Das",
"Debarati",
""
],
[
"Koucky",
"Michal",
""
]
] | We consider the approximate pattern matching problem under edit distance. In this problem we are given a pattern $P$ of length $w$ and a text $T$ of length $n$ over some alphabet $\Sigma$, and a positive integer $k$. The goal is to find all the positions $j$ in $T$ such that there is a substring of $T$ ending at $j$ wh... |
1806.07328 | Kunal Garg | Kunal Garg and Dimitra Panagou | Hybrid Planning and Control for Multiple Fixed-Wing Aircraft under Input
Constraints | Best Student Paper Finalist, AIAA-SciTech GNC Conference, 2019 | null | 10.2514/6.2019-0655 | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a novel hybrid control protocol for de-conflicting
multiple vehicles with constraints on control inputs. We consider turning rate
and linear speed constraints to represent fixed-wing or car-like vehicles. A
set of state-feedback controllers along with a state-dependent switching logic
are synthesi... | [
{
"created": "Tue, 19 Jun 2018 16:14:45 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Nov 2018 16:05:45 GMT",
"version": "v2"
}
] | 2021-06-11 | [
[
"Garg",
"Kunal",
""
],
[
"Panagou",
"Dimitra",
""
]
] | This paper presents a novel hybrid control protocol for de-conflicting multiple vehicles with constraints on control inputs. We consider turning rate and linear speed constraints to represent fixed-wing or car-like vehicles. A set of state-feedback controllers along with a state-dependent switching logic are synthesize... |
2405.10255 | XianZheng Ma | Xianzheng Ma, Yash Bhalgat, Brandon Smart, Shuai Chen, Xinghui Li,
Jian Ding, Jindong Gu, Dave Zhenyu Chen, Songyou Peng, Jia-Wang Bian, Philip
H Torr, Marc Pollefeys, Matthias Nie{\ss}ner, Ian D Reid, Angel X. Chang, Iro
Laina, Victor Adrian Prisacariu | When LLMs step into the 3D World: A Survey and Meta-Analysis of 3D Tasks
via Multi-modal Large Language Models | null | null | null | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As large language models (LLMs) evolve, their integration with 3D spatial
data (3D-LLMs) has seen rapid progress, offering unprecedented capabilities for
understanding and interacting with physical spaces. This survey provides a
comprehensive overview of the methodologies enabling LLMs to process,
understand, and gen... | [
{
"created": "Thu, 16 May 2024 16:59:58 GMT",
"version": "v1"
}
] | 2024-05-17 | [
[
"Ma",
"Xianzheng",
""
],
[
"Bhalgat",
"Yash",
""
],
[
"Smart",
"Brandon",
""
],
[
"Chen",
"Shuai",
""
],
[
"Li",
"Xinghui",
""
],
[
"Ding",
"Jian",
""
],
[
"Gu",
"Jindong",
""
],
[
"Chen",
"Dave... | As large language models (LLMs) evolve, their integration with 3D spatial data (3D-LLMs) has seen rapid progress, offering unprecedented capabilities for understanding and interacting with physical spaces. This survey provides a comprehensive overview of the methodologies enabling LLMs to process, understand, and gener... |
2403.02130 | Alexander Brinkmann | Alexander Brinkmann, Nick Baumann, Christian Bizer | Using LLMs for the Extraction and Normalization of Product Attribute
Values | The paper has been accepted at ADBIS2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Product offers on e-commerce websites often consist of a product title and a
textual product description. In order to enable features such as faceted
product search or to generate product comparison tables, it is necessary to
extract structured attribute-value pairs from the unstructured product titles
and descriptio... | [
{
"created": "Mon, 4 Mar 2024 15:39:59 GMT",
"version": "v1"
},
{
"created": "Tue, 5 Mar 2024 08:12:18 GMT",
"version": "v2"
},
{
"created": "Thu, 4 Jul 2024 10:12:38 GMT",
"version": "v3"
},
{
"created": "Mon, 15 Jul 2024 10:16:14 GMT",
"version": "v4"
}
] | 2024-07-16 | [
[
"Brinkmann",
"Alexander",
""
],
[
"Baumann",
"Nick",
""
],
[
"Bizer",
"Christian",
""
]
] | Product offers on e-commerce websites often consist of a product title and a textual product description. In order to enable features such as faceted product search or to generate product comparison tables, it is necessary to extract structured attribute-value pairs from the unstructured product titles and descriptions... |
2306.10615 | Konstantinos Stavropoulos | Aravind Gollakota and Parikshit Gopalan and Adam R. Klivans and
Konstantinos Stavropoulos | Agnostically Learning Single-Index Models using Omnipredictors | 21 pages | null | null | null | cs.LG cs.DS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We give the first result for agnostically learning Single-Index Models (SIMs)
with arbitrary monotone and Lipschitz activations. All prior work either held
only in the realizable setting or required the activation to be known.
Moreover, we only require the marginal to have bounded second moments, whereas
all prior wo... | [
{
"created": "Sun, 18 Jun 2023 18:40:07 GMT",
"version": "v1"
}
] | 2023-06-21 | [
[
"Gollakota",
"Aravind",
""
],
[
"Gopalan",
"Parikshit",
""
],
[
"Klivans",
"Adam R.",
""
],
[
"Stavropoulos",
"Konstantinos",
""
]
] | We give the first result for agnostically learning Single-Index Models (SIMs) with arbitrary monotone and Lipschitz activations. All prior work either held only in the realizable setting or required the activation to be known. Moreover, we only require the marginal to have bounded second moments, whereas all prior work... |
1707.06320 | Douwe Kiela | Douwe Kiela, Alexis Conneau, Allan Jabri and Maximilian Nickel | Learning Visually Grounded Sentence Representations | Published at NAACL-18 | null | null | null | cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a variety of models, trained on a supervised image captioning
corpus to predict the image features for a given caption, to perform sentence
representation grounding. We train a grounded sentence encoder that achieves
good performance on COCO caption and image retrieval and subsequently show that
this enc... | [
{
"created": "Wed, 19 Jul 2017 23:12:57 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Jun 2018 20:19:28 GMT",
"version": "v2"
}
] | 2018-06-06 | [
[
"Kiela",
"Douwe",
""
],
[
"Conneau",
"Alexis",
""
],
[
"Jabri",
"Allan",
""
],
[
"Nickel",
"Maximilian",
""
]
] | We introduce a variety of models, trained on a supervised image captioning corpus to predict the image features for a given caption, to perform sentence representation grounding. We train a grounded sentence encoder that achieves good performance on COCO caption and image retrieval and subsequently show that this encod... |
2003.13345 | Tomislav Duricic | Tomislav Duricic, Hussain Hussain, Emanuel Lacic, Dominik Kowald,
Denis Helic, Elisabeth Lex | Empirical Comparison of Graph Embeddings for Trust-Based Collaborative
Filtering | 10 pages, Accepted as a full paper on the 25th International
Symposium on Methodologies for Intelligent Systems (ISMIS'20) | Lecture Notes in Computer Science, vol 12117. Springer, Cham. 2020 | 10.1007/978-3-030-59491-6_17 | null | cs.SI cs.IR cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we study the utility of graph embeddings to generate latent
user representations for trust-based collaborative filtering. In a cold-start
setting, on three publicly available datasets, we evaluate approaches from four
method families: (i) factorization-based, (ii) random walk-based, (iii) deep
learning-... | [
{
"created": "Mon, 30 Mar 2020 11:22:44 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Feb 2021 15:30:58 GMT",
"version": "v2"
}
] | 2021-02-02 | [
[
"Duricic",
"Tomislav",
""
],
[
"Hussain",
"Hussain",
""
],
[
"Lacic",
"Emanuel",
""
],
[
"Kowald",
"Dominik",
""
],
[
"Helic",
"Denis",
""
],
[
"Lex",
"Elisabeth",
""
]
] | In this work, we study the utility of graph embeddings to generate latent user representations for trust-based collaborative filtering. In a cold-start setting, on three publicly available datasets, we evaluate approaches from four method families: (i) factorization-based, (ii) random walk-based, (iii) deep learning-ba... |
1902.04891 | Ziqiang Shi | Liwen Zhang, Ziqiang Shi, Jiqing Han, Anyan Shi, Ding Ma | FurcaNeXt: End-to-end monaural speech separation with dynamic gated
dilated temporal convolutional networks | Arxiv only allows figures with a small resolution. If you need to see
large-resolution figures, please contact us. arXiv admin note: substantial
text overlap with arXiv:1902.00651 | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep dilated temporal convolutional networks (TCN) have been proved to be
very effective in sequence modeling. In this paper we propose several
improvements of TCN for end-to-end approach to monaural speech separation,
which consists of 1) multi-scale dynamic weighted gated dilated convolutional
pyramids network (Fur... | [
{
"created": "Tue, 12 Feb 2019 09:07:07 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Feb 2019 08:35:44 GMT",
"version": "v2"
},
{
"created": "Fri, 22 Mar 2019 07:49:54 GMT",
"version": "v3"
},
{
"created": "Thu, 4 Apr 2019 08:16:09 GMT",
"version": "v4"
},
{
"cr... | 2023-06-27 | [
[
"Zhang",
"Liwen",
""
],
[
"Shi",
"Ziqiang",
""
],
[
"Han",
"Jiqing",
""
],
[
"Shi",
"Anyan",
""
],
[
"Ma",
"Ding",
""
]
] | Deep dilated temporal convolutional networks (TCN) have been proved to be very effective in sequence modeling. In this paper we propose several improvements of TCN for end-to-end approach to monaural speech separation, which consists of 1) multi-scale dynamic weighted gated dilated convolutional pyramids network (Furca... |
1802.05312 | Karl Ridgeway | Karl Ridgeway, Michael C. Mozer | Learning Deep Disentangled Embeddings with the F-Statistic Loss | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep-embedding methods aim to discover representations of a domain that make
explicit the domain's class structure and thereby support few-shot learning.
Disentangling methods aim to make explicit compositional or factorial
structure. We combine these two active but independent lines of research and
propose a new par... | [
{
"created": "Wed, 14 Feb 2018 20:28:38 GMT",
"version": "v1"
},
{
"created": "Sun, 20 May 2018 00:25:08 GMT",
"version": "v2"
}
] | 2018-05-22 | [
[
"Ridgeway",
"Karl",
""
],
[
"Mozer",
"Michael C.",
""
]
] | Deep-embedding methods aim to discover representations of a domain that make explicit the domain's class structure and thereby support few-shot learning. Disentangling methods aim to make explicit compositional or factorial structure. We combine these two active but independent lines of research and propose a new parad... |
2302.00932 | Junbo Zhao | Junbo Zhao, Xuefei Ning, Enshu Liu, Binxin Ru, Zixuan Zhou, Tianchen
Zhao, Chen Chen, Jiajin Zhang, Qingmin Liao and Yu Wang | Dynamic Ensemble of Low-fidelity Experts: Mitigating NAS "Cold-Start" | null | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predictor-based Neural Architecture Search (NAS) employs an architecture
performance predictor to improve the sample efficiency. However,
predictor-based NAS suffers from the severe ``cold-start'' problem, since a
large amount of architecture-performance data is required to get a working
predictor. In this paper, we ... | [
{
"created": "Thu, 2 Feb 2023 08:22:35 GMT",
"version": "v1"
}
] | 2023-02-03 | [
[
"Zhao",
"Junbo",
""
],
[
"Ning",
"Xuefei",
""
],
[
"Liu",
"Enshu",
""
],
[
"Ru",
"Binxin",
""
],
[
"Zhou",
"Zixuan",
""
],
[
"Zhao",
"Tianchen",
""
],
[
"Chen",
"Chen",
""
],
[
"Zhang",
"Jiajin"... | Predictor-based Neural Architecture Search (NAS) employs an architecture performance predictor to improve the sample efficiency. However, predictor-based NAS suffers from the severe ``cold-start'' problem, since a large amount of architecture-performance data is required to get a working predictor. In this paper, we fo... |
2306.04461 | Gregory Dickinson | Gregory M. Dickinson | An Interpretive Framework for Narrower Immunity Under Section 230 of the
Communications Decency Act | null | 33 Harv. J.L. & Pub. Pol'y 863 (2010) | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Almost all courts to interpret Section 230 of the Communications Decency Act
have construed its ambiguously worded immunity provision broadly, shielding
Internet intermediaries from tort liability so long as they are not the literal
authors of offensive content. Although this broad interpretation effects the
basic go... | [
{
"created": "Mon, 5 Jun 2023 14:10:07 GMT",
"version": "v1"
}
] | 2023-06-08 | [
[
"Dickinson",
"Gregory M.",
""
]
] | Almost all courts to interpret Section 230 of the Communications Decency Act have construed its ambiguously worded immunity provision broadly, shielding Internet intermediaries from tort liability so long as they are not the literal authors of offensive content. Although this broad interpretation effects the basic goal... |
1404.4702 | Vitaly Feldman | Vitaly Feldman, Pravesh Kothari and Jan Vondr\'ak | Tight Bounds on $\ell_1$ Approximation and Learning of Self-Bounding
Functions | Fixed minor mistakes and typos | null | null | null | cs.LG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the complexity of learning and approximation of self-bounding
functions over the uniform distribution on the Boolean hypercube ${0,1}^n$.
Informally, a function $f:{0,1}^n \rightarrow \mathbb{R}$ is self-bounding if
for every $x \in {0,1}^n$, $f(x)$ upper bounds the sum of all the $n$ marginal
decreases in t... | [
{
"created": "Fri, 18 Apr 2014 06:49:49 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Sep 2017 07:38:04 GMT",
"version": "v2"
},
{
"created": "Sat, 1 Jun 2019 20:01:23 GMT",
"version": "v3"
}
] | 2019-06-04 | [
[
"Feldman",
"Vitaly",
""
],
[
"Kothari",
"Pravesh",
""
],
[
"Vondrák",
"Jan",
""
]
] | We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube ${0,1}^n$. Informally, a function $f:{0,1}^n \rightarrow \mathbb{R}$ is self-bounding if for every $x \in {0,1}^n$, $f(x)$ upper bounds the sum of all the $n$ marginal decreases in the... |
2401.11410 | Md Zubair | Md Zubair (1), Md. Shahidul Salim (2), Mehrab Mustafy Rahman (3),
Mohammad Jahid Ibna Basher (1), Shahin Imran (4) and Iqbal H. Sarker (5) ((1)
Chittagong University of Engineering & Technology, Chittagong, Bangladesh,
(2) Khulna University of Engineering & Technology, Khulna, Bangladesh, (3)
Department of Comp... | Agricultural Recommendation System based on Deep Learning: A
Multivariate Weather Forecasting Approach | 18 pages, 16 figures and 13 tables. Two figures and one table have
been added to this version | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Agriculture plays a fundamental role in driving economic growth and ensuring
food security for populations around the world. Although labor-intensive
agriculture has led to steady increases in food grain production in many
developing countries, it is frequently challenged by adverse weather
conditions, including heav... | [
{
"created": "Sun, 21 Jan 2024 06:33:45 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Mar 2024 02:03:20 GMT",
"version": "v2"
},
{
"created": "Fri, 12 Jul 2024 02:02:45 GMT",
"version": "v3"
}
] | 2024-07-15 | [
[
"Zubair",
"Md",
""
],
[
"Salim",
"Md. Shahidul",
""
],
[
"Rahman",
"Mehrab Mustafy",
""
],
[
"Basher",
"Mohammad Jahid Ibna",
""
],
[
"Imran",
"Shahin",
""
],
[
"Sarker",
"Iqbal H.",
""
]
] | Agriculture plays a fundamental role in driving economic growth and ensuring food security for populations around the world. Although labor-intensive agriculture has led to steady increases in food grain production in many developing countries, it is frequently challenged by adverse weather conditions, including heavy ... |
2312.16837 | Biwen Lei | Biwen Lei, Kai Yu, Mengyang Feng, Miaomiao Cui, Xuansong Xie | DiffusionGAN3D: Boosting Text-guided 3D Generation and Domain Adaptation
by Combining 3D GANs and Diffusion Priors | Accepted by CVPR2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text-guided domain adaptation and generation of 3D-aware portraits find many
applications in various fields. However, due to the lack of training data and
the challenges in handling the high variety of geometry and appearance, the
existing methods for these tasks suffer from issues like inflexibility,
instability, an... | [
{
"created": "Thu, 28 Dec 2023 05:46:26 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Dec 2023 01:59:19 GMT",
"version": "v2"
},
{
"created": "Fri, 12 Apr 2024 06:23:45 GMT",
"version": "v3"
}
] | 2024-04-15 | [
[
"Lei",
"Biwen",
""
],
[
"Yu",
"Kai",
""
],
[
"Feng",
"Mengyang",
""
],
[
"Cui",
"Miaomiao",
""
],
[
"Xie",
"Xuansong",
""
]
] | Text-guided domain adaptation and generation of 3D-aware portraits find many applications in various fields. However, due to the lack of training data and the challenges in handling the high variety of geometry and appearance, the existing methods for these tasks suffer from issues like inflexibility, instability, and ... |
2003.03353 | Llu\'is Alemany-Puig | Llu\'is Alemany-Puig, Merc\`e Mora and Ramon Ferrer-i-Cancho | Reappraising the distribution of the number of edge crossings of graphs
on a sphere | Corrected mistakes in equation 31. Added new figure (7). Added
acknowledgements to J. W. Moon. Other minor changes. Updated figures. Minor
changes in the last update | J. Stat. Mech. (2020) 083401 | 10.1088/1742-5468/aba0ab | null | cs.DM cond-mat.stat-mech cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many real transportation and mobility networks have their vertices placed on
the surface of the Earth. In such embeddings, the edges laid on that surface
may cross. In his pioneering research, Moon analyzed the distribution of the
number of crossings on complete graphs and complete bipartite graphs whose
vertices are... | [
{
"created": "Fri, 6 Mar 2020 18:31:17 GMT",
"version": "v1"
},
{
"created": "Fri, 1 May 2020 10:32:37 GMT",
"version": "v2"
},
{
"created": "Mon, 15 Jun 2020 08:38:37 GMT",
"version": "v3"
},
{
"created": "Fri, 31 Jul 2020 16:27:54 GMT",
"version": "v4"
}
] | 2020-08-12 | [
[
"Alemany-Puig",
"Lluís",
""
],
[
"Mora",
"Mercè",
""
],
[
"Ferrer-i-Cancho",
"Ramon",
""
]
] | Many real transportation and mobility networks have their vertices placed on the surface of the Earth. In such embeddings, the edges laid on that surface may cross. In his pioneering research, Moon analyzed the distribution of the number of crossings on complete graphs and complete bipartite graphs whose vertices are l... |
1603.02426 | Il-Gon Ho | IlGon Ho, YongHyok Ri | Robust static output feedback control using a Particle Swarm
Optimization-DE-linear matrix inequality algorithm hybrid algorithm | null | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Under the multi-objective framework, this paper presents a hybrid algorithm
to solve robust static output feedback control problem for continuous
poly-topic uncertain system. To obtain static output feedback gain, a new
hybrid algorithm is proposed by combination of a hybrid algorithm of the
Particle Swarm Optimizati... | [
{
"created": "Tue, 8 Mar 2016 09:15:17 GMT",
"version": "v1"
}
] | 2016-03-09 | [
[
"Ho",
"IlGon",
""
],
[
"Ri",
"YongHyok",
""
]
] | Under the multi-objective framework, this paper presents a hybrid algorithm to solve robust static output feedback control problem for continuous poly-topic uncertain system. To obtain static output feedback gain, a new hybrid algorithm is proposed by combination of a hybrid algorithm of the Particle Swarm Optimization... |
1206.3318 | Vanessa Burke | Michael Bowling, Martin Zinkevich | On Local Regret | This is the longer version of the same-titled paper appearing in the
Proceedings of the Twenty-Ninth International Conference on Machine Learning
(ICML), 2012 | null | null | TR12-04 | cs.AI | http://creativecommons.org/licenses/by/3.0/ | Online learning aims to perform nearly as well as the best hypothesis in
hindsight. For some hypothesis classes, though, even finding the best
hypothesis offline is challenging. In such offline cases, local search
techniques are often employed and only local optimality guaranteed. For online
decision-making with such... | [
{
"created": "Thu, 14 Jun 2012 20:07:30 GMT",
"version": "v1"
}
] | 2012-06-18 | [
[
"Bowling",
"Michael",
""
],
[
"Zinkevich",
"Martin",
""
]
] | Online learning aims to perform nearly as well as the best hypothesis in hindsight. For some hypothesis classes, though, even finding the best hypothesis offline is challenging. In such offline cases, local search techniques are often employed and only local optimality guaranteed. For online decision-making with such h... |
2306.15868 | Haifeng Li | Zhaoyang Zhang, Zhen Ren, Chao Tao, Yunsheng Zhang, Chengli Peng,
Haifeng Li | GraSS: Contrastive Learning with Gradient Guided Sampling Strategy for
Remote Sensing Image Semantic Segmentation | 14 pages, 10 figures, 4 tables | IEEE Transactions on Geoscience and Remote Sensing 2023 | 10.1109/TGRS.2023.3336285 | null | cs.LG cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Self-supervised contrastive learning (SSCL) has achieved significant
milestones in remote sensing image (RSI) understanding. Its essence lies in
designing an unsupervised instance discrimination pretext task to extract image
features from a large number of unlabeled images that are beneficial for
downstream tasks. Ho... | [
{
"created": "Wed, 28 Jun 2023 01:50:46 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jul 2023 02:57:13 GMT",
"version": "v2"
},
{
"created": "Tue, 28 Nov 2023 04:28:48 GMT",
"version": "v3"
}
] | 2023-11-29 | [
[
"Zhang",
"Zhaoyang",
""
],
[
"Ren",
"Zhen",
""
],
[
"Tao",
"Chao",
""
],
[
"Zhang",
"Yunsheng",
""
],
[
"Peng",
"Chengli",
""
],
[
"Li",
"Haifeng",
""
]
] | Self-supervised contrastive learning (SSCL) has achieved significant milestones in remote sensing image (RSI) understanding. Its essence lies in designing an unsupervised instance discrimination pretext task to extract image features from a large number of unlabeled images that are beneficial for downstream tasks. Howe... |
2305.01581 | Henry Sinclair-Banks | Marvin K\"unnemann, Filip Mazowiecki, Lia Sch\"utze, Henry
Sinclair-Banks, Karol W\k{e}grzycki | Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain
Conditional Optimality | Preprint for ICALP'23 containing 25 pages and 10 figures | null | null | null | cs.FL cs.CC | http://creativecommons.org/licenses/by/4.0/ | Seminal results establish that the coverability problem for Vector Addition
Systems with States (VASS) is in EXPSPACE (Rackoff, '78) and is EXPSPACE-hard
already under unary encodings (Lipton, '76). More precisely, Rosier and Yen
later utilise Rackoff's bounding technique to show that if coverability holds
then there... | [
{
"created": "Tue, 2 May 2023 16:30:33 GMT",
"version": "v1"
}
] | 2023-05-03 | [
[
"Künnemann",
"Marvin",
""
],
[
"Mazowiecki",
"Filip",
""
],
[
"Schütze",
"Lia",
""
],
[
"Sinclair-Banks",
"Henry",
""
],
[
"Węgrzycki",
"Karol",
""
]
] | Seminal results establish that the coverability problem for Vector Addition Systems with States (VASS) is in EXPSPACE (Rackoff, '78) and is EXPSPACE-hard already under unary encodings (Lipton, '76). More precisely, Rosier and Yen later utilise Rackoff's bounding technique to show that if coverability holds then there i... |
2304.05260 | Gwendolyne Legate | Gwen Legate, Lucas Caccia, Eugene Belilovsky | Re-Weighted Softmax Cross-Entropy to Control Forgetting in Federated
Learning | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | In Federated Learning, a global model is learned by aggregating model updates
computed at a set of independent client nodes, to reduce communication costs
multiple gradient steps are performed at each node prior to aggregation. A key
challenge in this setting is data heterogeneity across clients resulting in
differin... | [
{
"created": "Tue, 11 Apr 2023 14:51:55 GMT",
"version": "v1"
}
] | 2023-04-12 | [
[
"Legate",
"Gwen",
""
],
[
"Caccia",
"Lucas",
""
],
[
"Belilovsky",
"Eugene",
""
]
] | In Federated Learning, a global model is learned by aggregating model updates computed at a set of independent client nodes, to reduce communication costs multiple gradient steps are performed at each node prior to aggregation. A key challenge in this setting is data heterogeneity across clients resulting in differing ... |
2301.12866 | Junliang Guo | Rui Lv, Junliang Guo, Rui Wang, Xu Tan, Qi Liu, Tao Qin | N-Gram Nearest Neighbor Machine Translation | null | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Nearest neighbor machine translation augments the Autoregressive
Translation~(AT) with $k$-nearest-neighbor retrieval, by comparing the
similarity between the token-level context representations of the target tokens
in the query and the datastore. However, the token-level representation may
introduce noise when trans... | [
{
"created": "Mon, 30 Jan 2023 13:19:19 GMT",
"version": "v1"
},
{
"created": "Tue, 7 Feb 2023 14:15:26 GMT",
"version": "v2"
}
] | 2023-02-08 | [
[
"Lv",
"Rui",
""
],
[
"Guo",
"Junliang",
""
],
[
"Wang",
"Rui",
""
],
[
"Tan",
"Xu",
""
],
[
"Liu",
"Qi",
""
],
[
"Qin",
"Tao",
""
]
] | Nearest neighbor machine translation augments the Autoregressive Translation~(AT) with $k$-nearest-neighbor retrieval, by comparing the similarity between the token-level context representations of the target tokens in the query and the datastore. However, the token-level representation may introduce noise when transla... |
1909.08906 | Alexandre Gondran | Alexandre Gondran (ENAC), Vincent Duchamp (ENAC), Laurent Moalic
(Universit\'e de Haute-Alsace (UHA)) | Lower Bound for (Sum) Coloring Problem | null | null | null | null | cs.DM cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Minimum Sum Coloring Problem is a variant of the Graph Vertex Coloring
Problem, for which each color has a weight. This paper presents a new way to
find a lower bound of this problem, based on a relaxation into an integer
partition problem with additional constraints. We improve the lower bound for
18 graphs of s... | [
{
"created": "Thu, 19 Sep 2019 10:18:08 GMT",
"version": "v1"
}
] | 2019-09-20 | [
[
"Gondran",
"Alexandre",
"",
"ENAC"
],
[
"Duchamp",
"Vincent",
"",
"ENAC"
],
[
"Moalic",
"Laurent",
"",
"Université de Haute-Alsace"
]
] | The Minimum Sum Coloring Problem is a variant of the Graph Vertex Coloring Problem, for which each color has a weight. This paper presents a new way to find a lower bound of this problem, based on a relaxation into an integer partition problem with additional constraints. We improve the lower bound for 18 graphs of sta... |
cs/0410062 | Vincenzo Pallotta | Lonneke van der Plas, Vincenzo Pallotta, Martin Rajman, Hatem Ghorbel | Automatic Keyword Extraction from Spoken Text. A Comparison of two
Lexical Resources: the EDR and WordNet | 4 pages | Procedings of the LREC 2004 international conference, 26-28 May
2004, Lisbon, Portugal. Pages 2205-2208 | null | null | cs.CL cs.DL cs.IR | null | Lexical resources such as WordNet and the EDR electronic dictionary have been
used in several NLP tasks. Probably, partly due to the fact that the EDR is not
freely available, WordNet has been used far more often than the EDR. We have
used both resources on the same task in order to make a comparison possible.
The ta... | [
{
"created": "Mon, 25 Oct 2004 01:50:03 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"van der Plas",
"Lonneke",
""
],
[
"Pallotta",
"Vincenzo",
""
],
[
"Rajman",
"Martin",
""
],
[
"Ghorbel",
"Hatem",
""
]
] | Lexical resources such as WordNet and the EDR electronic dictionary have been used in several NLP tasks. Probably, partly due to the fact that the EDR is not freely available, WordNet has been used far more often than the EDR. We have used both resources on the same task in order to make a comparison possible. The task... |
2405.19538 | Pierre Chambon | Pierre Chambon, Jean-Benoit Delbrouck, Thomas Sounack, Shih-Cheng
Huang, Zhihong Chen, Maya Varma, Steven QH Truong, Chu The Chuong, Curtis P.
Langlotz | CheXpert Plus: Augmenting a Large Chest X-ray Dataset with Text
Radiology Reports, Patient Demographics and Additional Image Formats | 13 pages Updated title | null | null | null | cs.CL cs.AI cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Since the release of the original CheXpert paper five years ago, CheXpert has
become one of the most widely used and cited clinical AI datasets. The
emergence of vision language models has sparked an increase in demands for
sharing reports linked to CheXpert images, along with a growing interest among
AI fairness res... | [
{
"created": "Wed, 29 May 2024 21:48:56 GMT",
"version": "v1"
},
{
"created": "Mon, 3 Jun 2024 19:14:12 GMT",
"version": "v2"
}
] | 2024-06-05 | [
[
"Chambon",
"Pierre",
""
],
[
"Delbrouck",
"Jean-Benoit",
""
],
[
"Sounack",
"Thomas",
""
],
[
"Huang",
"Shih-Cheng",
""
],
[
"Chen",
"Zhihong",
""
],
[
"Varma",
"Maya",
""
],
[
"Truong",
"Steven QH",
""
]... | Since the release of the original CheXpert paper five years ago, CheXpert has become one of the most widely used and cited clinical AI datasets. The emergence of vision language models has sparked an increase in demands for sharing reports linked to CheXpert images, along with a growing interest among AI fairness resea... |
1912.10336 | Chao Qu ` | Chao Qu, Ty Nguyen, Camillo J. Taylor | Depth Completion via Deep Basis Fitting | WACV2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we consider the task of image-guided depth completion where our
system must infer the depth at every pixel of an input image based on the image
content and a sparse set of depth measurements. We propose a novel approach
that builds upon the strengths of modern deep learning techniques and classical
opti... | [
{
"created": "Sat, 21 Dec 2019 21:07:12 GMT",
"version": "v1"
}
] | 2019-12-24 | [
[
"Qu",
"Chao",
""
],
[
"Nguyen",
"Ty",
""
],
[
"Taylor",
"Camillo J.",
""
]
] | In this paper we consider the task of image-guided depth completion where our system must infer the depth at every pixel of an input image based on the image content and a sparse set of depth measurements. We propose a novel approach that builds upon the strengths of modern deep learning techniques and classical optimi... |
2105.04098 | Chun Yuan Yuan | Chunyuan Yuan, Wanhui Qian, Qianwen Ma, Wei Zhou, Songlin Hu | SRLF: A Stance-aware Reinforcement Learning Framework for Content-based
Rumor Detection on Social Media | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | The rapid development of social media changes the lifestyle of people and
simultaneously provides an ideal place for publishing and disseminating rumors,
which severely exacerbates social panic and triggers a crisis of social trust.
Early content-based methods focused on finding clues from the text and user
profiles ... | [
{
"created": "Mon, 10 May 2021 03:58:34 GMT",
"version": "v1"
}
] | 2021-05-11 | [
[
"Yuan",
"Chunyuan",
""
],
[
"Qian",
"Wanhui",
""
],
[
"Ma",
"Qianwen",
""
],
[
"Zhou",
"Wei",
""
],
[
"Hu",
"Songlin",
""
]
] | The rapid development of social media changes the lifestyle of people and simultaneously provides an ideal place for publishing and disseminating rumors, which severely exacerbates social panic and triggers a crisis of social trust. Early content-based methods focused on finding clues from the text and user profiles fo... |
2302.14438 | Guoqiang Sun | Guoqiang Sun, Yibin Shen, Sijin Zhou, Xiang Chen, Hongyan Liu,
Chunming Wu, Chenyi Lei, Xianhui Wei, Fei Fang | Self-Supervised Interest Transfer Network via Prototypical Contrastive
Learning for Recommendation | 9 pages, 3 figures, accepted by AAAI 2023 | null | null | null | cs.IR cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cross-domain recommendation has attracted increasing attention from industry
and academia recently. However, most existing methods do not exploit the
interest invariance between domains, which would yield sub-optimal solutions.
In this paper, we propose a cross-domain recommendation method: Self-supervised
Interest T... | [
{
"created": "Tue, 28 Feb 2023 09:30:24 GMT",
"version": "v1"
}
] | 2023-03-01 | [
[
"Sun",
"Guoqiang",
""
],
[
"Shen",
"Yibin",
""
],
[
"Zhou",
"Sijin",
""
],
[
"Chen",
"Xiang",
""
],
[
"Liu",
"Hongyan",
""
],
[
"Wu",
"Chunming",
""
],
[
"Lei",
"Chenyi",
""
],
[
"Wei",
"Xianhui... | Cross-domain recommendation has attracted increasing attention from industry and academia recently. However, most existing methods do not exploit the interest invariance between domains, which would yield sub-optimal solutions. In this paper, we propose a cross-domain recommendation method: Self-supervised Interest Tra... |
2110.00568 | Chi-Ken Lu | Chi-Ken Lu and Patrick Shafto | Conditional Deep Gaussian Processes: empirical Bayes hyperdata learning | Accepted by Special Issue "Probabilistic Methods for Deep Learning"
of Entropy, 15 pages, reference to recent papers of finite Bayesian neural
network added | Entropy 2021, 23(11), 1387 | 10.3390/e23111387 | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | It is desirable to combine the expressive power of deep learning with
Gaussian Process (GP) in one expressive Bayesian learning model. Deep kernel
learning showed success in adopting a deep network for feature extraction
followed by a GP used as function model. Recently,it was suggested that, albeit
training with mar... | [
{
"created": "Fri, 1 Oct 2021 17:50:48 GMT",
"version": "v1"
},
{
"created": "Sat, 23 Oct 2021 13:21:38 GMT",
"version": "v2"
}
] | 2021-10-26 | [
[
"Lu",
"Chi-Ken",
""
],
[
"Shafto",
"Patrick",
""
]
] | It is desirable to combine the expressive power of deep learning with Gaussian Process (GP) in one expressive Bayesian learning model. Deep kernel learning showed success in adopting a deep network for feature extraction followed by a GP used as function model. Recently,it was suggested that, albeit training with margi... |
2103.06579 | Zhuo Li | Zhuo Li, Xu Zhou, Junruo Gao, Yifang Qin | SDN Controller Load Balancing Based on Reinforcement Learning | null | 2018 IEEE 9th International Conference on Software Engineering and
Service Science (ICSESS) | 10.1109/ICSESS.2018.8663757 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Aiming at the local overload of multi-controller deployment in
software-defined networks, a load balancing mechanism of SDN controller based
on reinforcement learning is designed. The initial paired migrate-out domain
and migrate-in domain are obtained by calculating the load ratio deviation
between the controllers, ... | [
{
"created": "Thu, 11 Mar 2021 10:08:36 GMT",
"version": "v1"
}
] | 2021-03-12 | [
[
"Li",
"Zhuo",
""
],
[
"Zhou",
"Xu",
""
],
[
"Gao",
"Junruo",
""
],
[
"Qin",
"Yifang",
""
]
] | Aiming at the local overload of multi-controller deployment in software-defined networks, a load balancing mechanism of SDN controller based on reinforcement learning is designed. The initial paired migrate-out domain and migrate-in domain are obtained by calculating the load ratio deviation between the controllers, a ... |
1801.02642 | Akshay Pai | Marco Singh and Akshay Pai | Boundary Optimizing Network (BON) | null | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite all the success that deep neural networks have seen in classifying
certain datasets, the challenge of finding optimal solutions that generalize
still remains. In this paper, we propose the Boundary Optimizing Network (BON),
a new approach to generalization for deep neural networks when used for
supervised lea... | [
{
"created": "Mon, 8 Jan 2018 19:02:44 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Jan 2018 21:32:05 GMT",
"version": "v2"
},
{
"created": "Tue, 23 Jan 2018 10:24:09 GMT",
"version": "v3"
}
] | 2018-01-24 | [
[
"Singh",
"Marco",
""
],
[
"Pai",
"Akshay",
""
]
] | Despite all the success that deep neural networks have seen in classifying certain datasets, the challenge of finding optimal solutions that generalize still remains. In this paper, we propose the Boundary Optimizing Network (BON), a new approach to generalization for deep neural networks when used for supervised learn... |
1902.05546 | Deepak Pathak | Deepak Pathak, Chris Lu, Trevor Darrell, Phillip Isola, Alexei A.
Efros | Learning to Control Self-Assembling Morphologies: A Study of
Generalization via Modularity | NeurIPS 2019 (Spotlight). Videos at
https://pathak22.github.io/modular-assemblies/ | null | null | null | cs.LG cs.AI cs.CV cs.NE cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contemporary sensorimotor learning approaches typically start with an
existing complex agent (e.g., a robotic arm), which they learn to control. In
contrast, this paper investigates a modular co-evolution strategy: a collection
of primitive agents learns to dynamically self-assemble into composite bodies
while also l... | [
{
"created": "Thu, 14 Feb 2019 18:59:05 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Nov 2019 21:35:27 GMT",
"version": "v2"
}
] | 2019-11-25 | [
[
"Pathak",
"Deepak",
""
],
[
"Lu",
"Chris",
""
],
[
"Darrell",
"Trevor",
""
],
[
"Isola",
"Phillip",
""
],
[
"Efros",
"Alexei A.",
""
]
] | Contemporary sensorimotor learning approaches typically start with an existing complex agent (e.g., a robotic arm), which they learn to control. In contrast, this paper investigates a modular co-evolution strategy: a collection of primitive agents learns to dynamically self-assemble into composite bodies while also lea... |
2305.15138 | Chunpu Xu | Chunpu Xu, Jing Li, Piji Li, Min Yang | Topic-Guided Self-Introduction Generation for Social Media Users | null | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Millions of users are active on social media. To allow users to better
showcase themselves and network with others, we explore the auto-generation of
social media self-introduction, a short sentence outlining a user's personal
interests. While most prior work profiles users with tags (e.g., ages), we
investigate sent... | [
{
"created": "Wed, 24 May 2023 13:35:08 GMT",
"version": "v1"
}
] | 2023-05-25 | [
[
"Xu",
"Chunpu",
""
],
[
"Li",
"Jing",
""
],
[
"Li",
"Piji",
""
],
[
"Yang",
"Min",
""
]
] | Millions of users are active on social media. To allow users to better showcase themselves and network with others, we explore the auto-generation of social media self-introduction, a short sentence outlining a user's personal interests. While most prior work profiles users with tags (e.g., ages), we investigate senten... |
2408.04868 | Parisa Farmanifard | Parisa Farmanifard and Arun Ross | ChatGPT Meets Iris Biometrics | Published at IJCB 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This study utilizes the advanced capabilities of the GPT-4 multimodal Large
Language Model (LLM) to explore its potential in iris recognition - a field
less common and more specialized than face recognition. By focusing on this
niche yet crucial area, we investigate how well AI tools like ChatGPT can
understand and a... | [
{
"created": "Fri, 9 Aug 2024 05:13:07 GMT",
"version": "v1"
}
] | 2024-08-12 | [
[
"Farmanifard",
"Parisa",
""
],
[
"Ross",
"Arun",
""
]
] | This study utilizes the advanced capabilities of the GPT-4 multimodal Large Language Model (LLM) to explore its potential in iris recognition - a field less common and more specialized than face recognition. By focusing on this niche yet crucial area, we investigate how well AI tools like ChatGPT can understand and ana... |
1509.03753 | Petr Golovach | Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kant\'e, Dieter
Kratsch, Sigve H. S{\ae}ther, Yngve Villanger | Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear
MIM-Width | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The linear induced matching width (LMIM-width) of a graph is a width
parameter defined by using the notion of branch-decompositions of a set
function on ternary trees. In this paper we study output-polynomial enumeration
algorithms on graphs of bounded LMIM-width and graphs of bounded local
LMIM-width. In particular,... | [
{
"created": "Sat, 12 Sep 2015 15:00:20 GMT",
"version": "v1"
},
{
"created": "Tue, 15 Sep 2015 18:11:51 GMT",
"version": "v2"
}
] | 2015-09-16 | [
[
"Golovach",
"Petr A.",
""
],
[
"Heggernes",
"Pinar",
""
],
[
"Kanté",
"Mamadou Moustapha",
""
],
[
"Kratsch",
"Dieter",
""
],
[
"Sæther",
"Sigve H.",
""
],
[
"Villanger",
"Yngve",
""
]
] | The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this paper we study output-polynomial enumeration algorithms on graphs of bounded LMIM-width and graphs of bounded local LMIM-width. In particular, w... |
2407.12216 | Garima Agrawal | Garima Agrawal, Tharindu Kumarage, Zeyad Alghamdi, Huan Liu | Mindful-RAG: A Study of Points of Failure in Retrieval Augmented
Generation | null | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Large Language Models (LLMs) are proficient at generating coherent and
contextually relevant text but face challenges when addressing
knowledge-intensive queries in domain-specific and factual question-answering
tasks. Retrieval-augmented generation (RAG) systems mitigate this by
incorporating external knowledge sour... | [
{
"created": "Tue, 16 Jul 2024 23:50:07 GMT",
"version": "v1"
}
] | 2024-07-18 | [
[
"Agrawal",
"Garima",
""
],
[
"Kumarage",
"Tharindu",
""
],
[
"Alghamdi",
"Zeyad",
""
],
[
"Liu",
"Huan",
""
]
] | Large Language Models (LLMs) are proficient at generating coherent and contextually relevant text but face challenges when addressing knowledge-intensive queries in domain-specific and factual question-answering tasks. Retrieval-augmented generation (RAG) systems mitigate this by incorporating external knowledge source... |
1603.03657 | Koen Groenland | Koen Groenland, Sander Bohte | Efficient forward propagation of time-sequences in convolutional neural
networks using Deep Shifting | null | null | null | null | cs.LG cs.CV cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When a Convolutional Neural Network is used for on-the-fly evaluation of
continuously updating time-sequences, many redundant convolution operations are
performed. We propose the method of Deep Shifting, which remembers previously
calculated results of convolution operations in order to minimize the number of
calcula... | [
{
"created": "Fri, 11 Mar 2016 15:16:09 GMT",
"version": "v1"
}
] | 2016-03-14 | [
[
"Groenland",
"Koen",
""
],
[
"Bohte",
"Sander",
""
]
] | When a Convolutional Neural Network is used for on-the-fly evaluation of continuously updating time-sequences, many redundant convolution operations are performed. We propose the method of Deep Shifting, which remembers previously calculated results of convolution operations in order to minimize the number of calculati... |
1802.06289 | Christoph Hunkenschr\"oder | Friedrich Eisenbrand (1), Christoph Hunkenschr\"oder (1), Kim-Manuel
Klein (1) ((1) \'Ecole polytechnique f\'ed\'erale de Lausanne) | Faster Algorithms for Integer Programs with Block Structure | null | null | null | null | cs.DM cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider integer programming problems $\max \{ c^T x : \mathcal{A} x = b,
l \leq x \leq u, x \in \mathbb{Z}^{nt}\}$ where $\mathcal{A}$ has a (recursive)
block-structure generalizing "$n$-fold integer programs" which recently
received considerable attention in the literature. An $n$-fold IP is an integer
program w... | [
{
"created": "Sat, 17 Feb 2018 20:43:57 GMT",
"version": "v1"
}
] | 2018-02-20 | [
[
"Eisenbrand",
"Friedrich",
"",
"École polytechnique fédérale de Lausanne"
],
[
"Hunkenschröder",
"Christoph",
"",
"École polytechnique fédérale de Lausanne"
],
[
"Klein",
"Kim-Manuel",
"",
"École polytechnique fédérale de Lausanne"
]
] | We consider integer programming problems $\max \{ c^T x : \mathcal{A} x = b, l \leq x \leq u, x \in \mathbb{Z}^{nt}\}$ where $\mathcal{A}$ has a (recursive) block-structure generalizing "$n$-fold integer programs" which recently received considerable attention in the literature. An $n$-fold IP is an integer program whe... |
1212.1313 | Debajyoti Banerji | Debajyoti Banerji, Ranjit Ray, Jhankar Basu and Indrajit Basak | Autonomous Navigation by Robust Scan Matching Technique | 7 pages, 9 figures | INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND CREATIVE
ENGINEERING (ISSN:2045-8711), VOL.2 NO.10 OCTOBER 2012 | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For effective autonomous navigation,estimation of the pose of the robot is
essential at every sampling time. For computing an accurate
estimation,odometric error needs to be reduced with the help of data from
external sensor. In this work, a technique has been developed for accurate pose
estimation of mobile robot by... | [
{
"created": "Thu, 6 Dec 2012 12:53:26 GMT",
"version": "v1"
}
] | 2012-12-07 | [
[
"Banerji",
"Debajyoti",
""
],
[
"Ray",
"Ranjit",
""
],
[
"Basu",
"Jhankar",
""
],
[
"Basak",
"Indrajit",
""
]
] | For effective autonomous navigation,estimation of the pose of the robot is essential at every sampling time. For computing an accurate estimation,odometric error needs to be reduced with the help of data from external sensor. In this work, a technique has been developed for accurate pose estimation of mobile robot by u... |
2211.16574 | Atsuhiro Miyagi | Atsuhiro Miyagi, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto | Adaptive Scenario Subset Selection for Worst-Case Optimization and its
Application to Well Placement Optimization | null | null | null | null | cs.NE math.OC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | In this study, we consider simulation-based worst-case optimization problems
with continuous design variables and a finite scenario set. To reduce the
number of simulations required and increase the number of restarts for better
local optimum solutions, we propose a new approach referred to as adaptive
scenario subse... | [
{
"created": "Tue, 29 Nov 2022 20:16:52 GMT",
"version": "v1"
}
] | 2022-12-01 | [
[
"Miyagi",
"Atsuhiro",
""
],
[
"Fukuchi",
"Kazuto",
""
],
[
"Sakuma",
"Jun",
""
],
[
"Akimoto",
"Youhei",
""
]
] | In this study, we consider simulation-based worst-case optimization problems with continuous design variables and a finite scenario set. To reduce the number of simulations required and increase the number of restarts for better local optimum solutions, we propose a new approach referred to as adaptive scenario subset ... |
1006.0795 | Luis Salamanca | Luis Salamanca, Juan Jos\'e Murillo-Fuentes, Fernando P\'erez-Cruz | Channel Decoding with a Bayesian Equalizer | 5 pages, 6 figures, ISIT 2010 conference | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Low-density parity-check (LPDC) decoders assume the channel estate
information (CSI) is known and they have the true a posteriori probability
(APP) for each transmitted bit. But in most cases of interest, the CSI needs to
be estimated with the help of a short training sequence and the LDPC decoder
has to decode the r... | [
{
"created": "Fri, 4 Jun 2010 07:51:26 GMT",
"version": "v1"
}
] | 2010-06-07 | [
[
"Salamanca",
"Luis",
""
],
[
"Murillo-Fuentes",
"Juan José",
""
],
[
"Pérez-Cruz",
"Fernando",
""
]
] | Low-density parity-check (LPDC) decoders assume the channel estate information (CSI) is known and they have the true a posteriori probability (APP) for each transmitted bit. But in most cases of interest, the CSI needs to be estimated with the help of a short training sequence and the LDPC decoder has to decode the rec... |
2011.00576 | Andrew Wagenmaker | Andrew Wagenmaker, Julian Katz-Samuels, Kevin Jamieson | Experimental Design for Regret Minimization in Linear Bandits | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose a novel experimental design-based algorithm to
minimize regret in online stochastic linear and combinatorial bandits. While
existing literature tends to focus on optimism-based algorithms--which have
been shown to be suboptimal in many cases--our approach carefully plans which
action to take ... | [
{
"created": "Sun, 1 Nov 2020 17:59:19 GMT",
"version": "v1"
},
{
"created": "Sat, 27 Feb 2021 01:07:39 GMT",
"version": "v2"
}
] | 2021-03-02 | [
[
"Wagenmaker",
"Andrew",
""
],
[
"Katz-Samuels",
"Julian",
""
],
[
"Jamieson",
"Kevin",
""
]
] | In this paper we propose a novel experimental design-based algorithm to minimize regret in online stochastic linear and combinatorial bandits. While existing literature tends to focus on optimism-based algorithms--which have been shown to be suboptimal in many cases--our approach carefully plans which action to take by... |
2304.01487 | Kavita Kumari | Alessandro Pegoraro, Kavita Kumari, Hossein Fereidooni, Ahmad-Reza
Sadeghi | To ChatGPT, or not to ChatGPT: That is the question! | null | null | null | null | cs.LG cs.AI cs.CL | http://creativecommons.org/licenses/by-sa/4.0/ | ChatGPT has become a global sensation. As ChatGPT and other Large Language
Models (LLMs) emerge, concerns of misusing them in various ways increase, such
as disseminating fake news, plagiarism, manipulating public opinion, cheating,
and fraud. Hence, distinguishing AI-generated from human-generated becomes
increasing... | [
{
"created": "Tue, 4 Apr 2023 03:04:28 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Apr 2023 04:28:41 GMT",
"version": "v2"
}
] | 2023-04-06 | [
[
"Pegoraro",
"Alessandro",
""
],
[
"Kumari",
"Kavita",
""
],
[
"Fereidooni",
"Hossein",
""
],
[
"Sadeghi",
"Ahmad-Reza",
""
]
] | ChatGPT has become a global sensation. As ChatGPT and other Large Language Models (LLMs) emerge, concerns of misusing them in various ways increase, such as disseminating fake news, plagiarism, manipulating public opinion, cheating, and fraud. Hence, distinguishing AI-generated from human-generated becomes increasingly... |
2104.10228 | Lukasz Korycki | {\L}ukasz Korycki, Bartosz Krawczyk | Concept Drift Detection from Multi-Class Imbalanced Data Streams | 37th IEEE International Conference on Data Engineering (ICDE), 2021.
arXiv admin note: text overlap with arXiv:2009.09497 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Continual learning from data streams is among the most important topics in
contemporary machine learning. One of the biggest challenges in this domain
lies in creating algorithms that can continuously adapt to arriving data.
However, previously learned knowledge may become outdated, as streams evolve
over time. This ... | [
{
"created": "Tue, 20 Apr 2021 20:03:54 GMT",
"version": "v1"
}
] | 2021-04-22 | [
[
"Korycki",
"Łukasz",
""
],
[
"Krawczyk",
"Bartosz",
""
]
] | Continual learning from data streams is among the most important topics in contemporary machine learning. One of the biggest challenges in this domain lies in creating algorithms that can continuously adapt to arriving data. However, previously learned knowledge may become outdated, as streams evolve over time. This ph... |
1708.08728 | Nikolaos Sarafianos | Nikolaos Sarafianos, Theodore Giannakopoulos, Christophoros Nikou,
Ioannis A. Kakadiaris | Curriculum Learning for Multi-Task Classification of Visual Attributes | To appear in ICCV Workshops 2017 (TASK-CV) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Visual attributes, from simple objects (e.g., backpacks, hats) to
soft-biometrics (e.g., gender, height, clothing) have proven to be a powerful
representational approach for many applications such as image description and
human identification. In this paper, we introduce a novel method to combine the
advantages of bo... | [
{
"created": "Tue, 29 Aug 2017 12:40:52 GMT",
"version": "v1"
}
] | 2017-08-30 | [
[
"Sarafianos",
"Nikolaos",
""
],
[
"Giannakopoulos",
"Theodore",
""
],
[
"Nikou",
"Christophoros",
""
],
[
"Kakadiaris",
"Ioannis A.",
""
]
] | Visual attributes, from simple objects (e.g., backpacks, hats) to soft-biometrics (e.g., gender, height, clothing) have proven to be a powerful representational approach for many applications such as image description and human identification. In this paper, we introduce a novel method to combine the advantages of both... |
1902.05224 | Takaaki Nishimoto | Takaaki Nishimoto and Yasuo Tabei | Conversion from RLBWT to LZ77 | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Converting a compressed format of a string into another compressed format
without an explicit decompression is one of the central research topics in
string processing. We discuss the problem of converting the run-length
Burrows-Wheeler Transform (RLBWT) of a string to Lempel-Ziv 77 (LZ77) phrases
of the reversed stri... | [
{
"created": "Thu, 14 Feb 2019 05:09:57 GMT",
"version": "v1"
}
] | 2019-02-15 | [
[
"Nishimoto",
"Takaaki",
""
],
[
"Tabei",
"Yasuo",
""
]
] | Converting a compressed format of a string into another compressed format without an explicit decompression is one of the central research topics in string processing. We discuss the problem of converting the run-length Burrows-Wheeler Transform (RLBWT) of a string to Lempel-Ziv 77 (LZ77) phrases of the reversed string... |
2204.11909 | Shiyue Zhang | Shiyue Zhang, Ben Frey, Mohit Bansal | How can NLP Help Revitalize Endangered Languages? A Case Study and
Roadmap for the Cherokee Language | ACL 2022 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | More than 43% of the languages spoken in the world are endangered, and
language loss currently occurs at an accelerated rate because of globalization
and neocolonialism. Saving and revitalizing endangered languages has become
very important for maintaining the cultural diversity on our planet. In this
work, we focus ... | [
{
"created": "Mon, 25 Apr 2022 18:25:57 GMT",
"version": "v1"
}
] | 2022-04-27 | [
[
"Zhang",
"Shiyue",
""
],
[
"Frey",
"Ben",
""
],
[
"Bansal",
"Mohit",
""
]
] | More than 43% of the languages spoken in the world are endangered, and language loss currently occurs at an accelerated rate because of globalization and neocolonialism. Saving and revitalizing endangered languages has become very important for maintaining the cultural diversity on our planet. In this work, we focus on... |
1606.01849 | Christoforos Vlachos | Christoforos Vlachos, Vasilis Friderikos, Mischa Dohler | Optimal Virtualized Inter-Tenant Resource Sharing for Device-to-Device
Communications in 5G Networks | 10 pages, 7 figures | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Device-to-Device (D2D) communication is expected to enable a number of new
services and applications in future mobile networks and has attracted
significant research interest over the last few years. Remarkably, little
attention has been placed on the issue of D2D communication for users belonging
to different operat... | [
{
"created": "Mon, 6 Jun 2016 18:12:40 GMT",
"version": "v1"
}
] | 2016-06-07 | [
[
"Vlachos",
"Christoforos",
""
],
[
"Friderikos",
"Vasilis",
""
],
[
"Dohler",
"Mischa",
""
]
] | Device-to-Device (D2D) communication is expected to enable a number of new services and applications in future mobile networks and has attracted significant research interest over the last few years. Remarkably, little attention has been placed on the issue of D2D communication for users belonging to different operator... |
1912.09930 | Joanna Materzynska | Joanna Materzynska, Tete Xiao, Roei Herzig, Huijuan Xu, Xiaolong Wang,
Trevor Darrell | Something-Else: Compositional Action Recognition with Spatial-Temporal
Interaction Networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Human action is naturally compositional: humans can easily recognize and
perform actions with objects that are different from those used in training
demonstrations. In this paper, we study the compositionality of action by
looking into the dynamics of subject-object interactions. We propose a novel
model which can ex... | [
{
"created": "Fri, 20 Dec 2019 16:44:14 GMT",
"version": "v1"
},
{
"created": "Tue, 5 May 2020 09:55:33 GMT",
"version": "v2"
},
{
"created": "Sat, 12 Sep 2020 08:24:58 GMT",
"version": "v3"
}
] | 2020-09-15 | [
[
"Materzynska",
"Joanna",
""
],
[
"Xiao",
"Tete",
""
],
[
"Herzig",
"Roei",
""
],
[
"Xu",
"Huijuan",
""
],
[
"Wang",
"Xiaolong",
""
],
[
"Darrell",
"Trevor",
""
]
] | Human action is naturally compositional: humans can easily recognize and perform actions with objects that are different from those used in training demonstrations. In this paper, we study the compositionality of action by looking into the dynamics of subject-object interactions. We propose a novel model which can expl... |
2404.07817 | Lanpei Li | Lanpei Li, Elia Piccoli, Andrea Cossu, Davide Bacciu, Vincenzo
Lomonaco | Calibration of Continual Learning Models | Accepted at CLVISION workshop, CVPR 2024 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Continual Learning (CL) focuses on maximizing the predictive performance of a
model across a non-stationary stream of data. Unfortunately, CL models tend to
forget previous knowledge, thus often underperforming when compared with an
offline model trained jointly on the entire data stream. Given that any CL
model will... | [
{
"created": "Thu, 11 Apr 2024 14:59:49 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Apr 2024 12:33:26 GMT",
"version": "v2"
}
] | 2024-04-15 | [
[
"Li",
"Lanpei",
""
],
[
"Piccoli",
"Elia",
""
],
[
"Cossu",
"Andrea",
""
],
[
"Bacciu",
"Davide",
""
],
[
"Lomonaco",
"Vincenzo",
""
]
] | Continual Learning (CL) focuses on maximizing the predictive performance of a model across a non-stationary stream of data. Unfortunately, CL models tend to forget previous knowledge, thus often underperforming when compared with an offline model trained jointly on the entire data stream. Given that any CL model will e... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.