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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2308.00109 | Elliot Murphy | Gary Marcus, Evelina Leivada, Elliot Murphy | A Sentence is Worth a Thousand Pictures: Can Large Language Models
Understand Human Language? | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Artificial Intelligence applications show great potential for
language-related tasks that rely on next-word prediction. The current
generation of large language models have been linked to claims about human-like
linguistic performance and their applications are hailed both as a key step
towards Artificial General Int... | [
{
"created": "Wed, 26 Jul 2023 18:58:53 GMT",
"version": "v1"
}
] | 2023-08-02 | [
[
"Marcus",
"Gary",
""
],
[
"Leivada",
"Evelina",
""
],
[
"Murphy",
"Elliot",
""
]
] | Artificial Intelligence applications show great potential for language-related tasks that rely on next-word prediction. The current generation of large language models have been linked to claims about human-like linguistic performance and their applications are hailed both as a key step towards Artificial General Intel... |
2205.06969 | Minfa Wang | Minfa Wang | Mask CycleGAN: Unpaired Multi-modal Domain Translation with
Interpretable Latent Variable | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | We propose Mask CycleGAN, a novel architecture for unpaired image domain
translation built based on CycleGAN, with an aim to address two issues: 1)
unimodality in image translation and 2) lack of interpretability of latent
variables. Our innovation in the technical approach is comprised of three key
components: maski... | [
{
"created": "Sat, 14 May 2022 05:05:37 GMT",
"version": "v1"
}
] | 2022-05-17 | [
[
"Wang",
"Minfa",
""
]
] | We propose Mask CycleGAN, a novel architecture for unpaired image domain translation built based on CycleGAN, with an aim to address two issues: 1) unimodality in image translation and 2) lack of interpretability of latent variables. Our innovation in the technical approach is comprised of three key components: masking... |
2005.06602 | Martin P\"omsl | Martin P\"omsl (Osnabr\"uck University) and Roman Lyapin (Cogent Labs
Inc.) | CIRCE at SemEval-2020 Task 1: Ensembling Context-Free and
Context-Dependent Word Representations | Accepted at SemEval-2020 Task 1 @ COLING 2020. Code available at
https://github.com/mpoemsl/circe | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | This paper describes the winning contribution to SemEval-2020 Task 1:
Unsupervised Lexical Semantic Change Detection (Subtask 2) handed in by team UG
Student Intern. We present an ensemble model that makes predictions based on
context-free and context-dependent word representations. The key findings are
that (1) cont... | [
{
"created": "Thu, 30 Apr 2020 13:18:29 GMT",
"version": "v1"
},
{
"created": "Mon, 13 Jul 2020 10:10:05 GMT",
"version": "v2"
},
{
"created": "Tue, 6 Oct 2020 13:50:47 GMT",
"version": "v3"
}
] | 2020-10-07 | [
[
"Pömsl",
"Martin",
"",
"Osnabrück University"
],
[
"Lyapin",
"Roman",
"",
"Cogent Labs\n Inc."
]
] | This paper describes the winning contribution to SemEval-2020 Task 1: Unsupervised Lexical Semantic Change Detection (Subtask 2) handed in by team UG Student Intern. We present an ensemble model that makes predictions based on context-free and context-dependent word representations. The key findings are that (1) contex... |
1708.08750 | Allan Melvin Andrew | Allan Melvin Andrew, Ammar Zakaria, Shaharil Mad Saad and Ali Yeon Md
Shakaff | Multi-Stage Feature Selection Based Intelligent Classifier for
Classification of Incipient Stage Fire in Building | electronic nose; gas sensors; fire detection; feature selection;
feature fusion; Artificial intelligence, machine learning, neural networks,
remote sensing, decision support | Sensors 2016, 16, 31 | 10.3390/s16010031 | null | cs.CY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this study, an early fire detection algorithm has been proposed based on
low cost array sensing system, utilizing gas sensors, dust particles and
ambient sensors such as temperature and humidity sensor. The odor or
smell-print emanated from various fire sources and building construction
materials at early stage ar... | [
{
"created": "Sat, 12 Aug 2017 09:54:45 GMT",
"version": "v1"
}
] | 2017-08-30 | [
[
"Andrew",
"Allan Melvin",
""
],
[
"Zakaria",
"Ammar",
""
],
[
"Saad",
"Shaharil Mad",
""
],
[
"Shakaff",
"Ali Yeon Md",
""
]
] | In this study, an early fire detection algorithm has been proposed based on low cost array sensing system, utilizing gas sensors, dust particles and ambient sensors such as temperature and humidity sensor. The odor or smell-print emanated from various fire sources and building construction materials at early stage are ... |
2304.01959 | Taehoon Kim | Taehoon Kim, Bohyung Han | Randomized Adversarial Style Perturbations for Domain Generalization | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a novel domain generalization technique, referred to as Randomized
Adversarial Style Perturbation (RASP), which is motivated by the observation
that the characteristics of each domain are captured by the feature statistics
corresponding to style. The proposed algorithm perturbs the style of a feature
in an... | [
{
"created": "Tue, 4 Apr 2023 17:07:06 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Nov 2023 06:04:48 GMT",
"version": "v2"
}
] | 2023-11-23 | [
[
"Kim",
"Taehoon",
""
],
[
"Han",
"Bohyung",
""
]
] | We propose a novel domain generalization technique, referred to as Randomized Adversarial Style Perturbation (RASP), which is motivated by the observation that the characteristics of each domain are captured by the feature statistics corresponding to style. The proposed algorithm perturbs the style of a feature in an a... |
2009.05668 | Li Yang | Li Yang, Zhezhi He, Junshan Zhang, Deliang Fan | KSM: Fast Multiple Task Adaption via Kernel-wise Soft Mask Learning | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Neural Networks (DNN) could forget the knowledge about earlier tasks
when learning new tasks, and this is known as \textit{catastrophic forgetting}.
While recent continual learning methods are capable of alleviating the
catastrophic problem on toy-sized datasets, some issues still remain to be
tackled when apply... | [
{
"created": "Fri, 11 Sep 2020 21:48:39 GMT",
"version": "v1"
}
] | 2020-09-15 | [
[
"Yang",
"Li",
""
],
[
"He",
"Zhezhi",
""
],
[
"Zhang",
"Junshan",
""
],
[
"Fan",
"Deliang",
""
]
] | Deep Neural Networks (DNN) could forget the knowledge about earlier tasks when learning new tasks, and this is known as \textit{catastrophic forgetting}. While recent continual learning methods are capable of alleviating the catastrophic problem on toy-sized datasets, some issues still remain to be tackled when applyin... |
1606.01588 | Mahmoud Ismail | Salman Niazi (1), Mahmoud Ismail (1), Steffen Grohsschmiedt (2),
Mikael Ronstr\"om (3), Seif Haridi (1), Jim Dowling (1) ((1) KTH - Royal
Institute of Technology, (2) Spotify AB, (3) Oracle) | HopsFS: Scaling Hierarchical File System Metadata Using NewSQL Databases | null | The 15th USENIX Conference on File and Storage Technologies (FAST
17) (2017) 89-104 | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent improvements in both the performance and scalability of
shared-nothing, transactional, in-memory NewSQL databases have reopened the
research question of whether distributed metadata for hierarchical file systems
can be managed using commodity databases. In this paper, we introduce HopsFS, a
next generation dis... | [
{
"created": "Mon, 6 Jun 2016 00:10:35 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Feb 2017 14:18:02 GMT",
"version": "v2"
}
] | 2017-02-23 | [
[
"Niazi",
"Salman",
""
],
[
"Ismail",
"Mahmoud",
""
],
[
"Grohsschmiedt",
"Steffen",
""
],
[
"Ronström",
"Mikael",
""
],
[
"Haridi",
"Seif",
""
],
[
"Dowling",
"Jim",
""
]
] | Recent improvements in both the performance and scalability of shared-nothing, transactional, in-memory NewSQL databases have reopened the research question of whether distributed metadata for hierarchical file systems can be managed using commodity databases. In this paper, we introduce HopsFS, a next generation distr... |
2303.03340 | Eli Whitehouse | Eli Whitehouse | Symbolic Synthesis of Neural Networks | 8 pages, 1 figure. Minor formula correction and minor textual
revision | null | null | null | cs.NE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural networks adapt very well to distributed and continuous
representations, but struggle to generalize from small amounts of data.
Symbolic systems commonly achieve data efficient generalization by exploiting
modularity to benefit from local and discrete features of a representation.
These features allow symbolic ... | [
{
"created": "Mon, 6 Mar 2023 18:13:14 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Mar 2023 17:57:32 GMT",
"version": "v2"
}
] | 2023-03-15 | [
[
"Whitehouse",
"Eli",
""
]
] | Neural networks adapt very well to distributed and continuous representations, but struggle to generalize from small amounts of data. Symbolic systems commonly achieve data efficient generalization by exploiting modularity to benefit from local and discrete features of a representation. These features allow symbolic pr... |
1705.05267 | Ahmed Alaa | Ahmed M. Alaa, Scott Hu, Mihaela van der Schaar | Learning from Clinical Judgments: Semi-Markov-Modulated Marked Hawkes
Processes for Risk Prognosis | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Critically ill patients in regular wards are vulnerable to unanticipated
adverse events which require prompt transfer to the intensive care unit (ICU).
To allow for accurate prognosis of deteriorating patients, we develop a novel
continuous-time probabilistic model for a monitored patient's temporal sequence
of physi... | [
{
"created": "Mon, 15 May 2017 14:29:51 GMT",
"version": "v1"
}
] | 2017-05-16 | [
[
"Alaa",
"Ahmed M.",
""
],
[
"Hu",
"Scott",
""
],
[
"van der Schaar",
"Mihaela",
""
]
] | Critically ill patients in regular wards are vulnerable to unanticipated adverse events which require prompt transfer to the intensive care unit (ICU). To allow for accurate prognosis of deteriorating patients, we develop a novel continuous-time probabilistic model for a monitored patient's temporal sequence of physiol... |
2405.10999 | Oliver Kramer | Oliver Kramer | Large Language Models for Tuning Evolution Strategies | null | null | null | null | cs.LG cs.CL cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large Language Models (LLMs) exhibit world knowledge and inference
capabilities, making them powerful tools for various applications. This paper
proposes a feedback loop mechanism that leverages these capabilities to tune
Evolution Strategies (ES) parameters effectively. The mechanism involves a
structured process of... | [
{
"created": "Thu, 16 May 2024 21:14:32 GMT",
"version": "v1"
}
] | 2024-05-21 | [
[
"Kramer",
"Oliver",
""
]
] | Large Language Models (LLMs) exhibit world knowledge and inference capabilities, making them powerful tools for various applications. This paper proposes a feedback loop mechanism that leverages these capabilities to tune Evolution Strategies (ES) parameters effectively. The mechanism involves a structured process of p... |
2212.02112 | Meng Lan | Meng Lan, Jing Zhang, Lefei Zhang, Dacheng Tao | Learning to Learn Better for Video Object Segmentation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, the joint learning framework (JOINT) integrates matching based
transductive reasoning and online inductive learning to achieve accurate and
robust semi-supervised video object segmentation (SVOS). However, using the
mask embedding as the label to guide the generation of target features in the
two branches m... | [
{
"created": "Mon, 5 Dec 2022 09:10:34 GMT",
"version": "v1"
}
] | 2022-12-06 | [
[
"Lan",
"Meng",
""
],
[
"Zhang",
"Jing",
""
],
[
"Zhang",
"Lefei",
""
],
[
"Tao",
"Dacheng",
""
]
] | Recently, the joint learning framework (JOINT) integrates matching based transductive reasoning and online inductive learning to achieve accurate and robust semi-supervised video object segmentation (SVOS). However, using the mask embedding as the label to guide the generation of target features in the two branches may... |
2206.10185 | Sajad Khodadadian | Sajad Khodadadian, Pranay Sharma, Gauri Joshi, Siva Theja Maguluri | Federated Reinforcement Learning: Linear Speedup Under Markovian
Sampling | 69 pages, 1 figure, accepted to ICML 2022 for long presentation | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Since reinforcement learning algorithms are notoriously data-intensive, the
task of sampling observations from the environment is usually split across
multiple agents. However, transferring these observations from the agents to a
central location can be prohibitively expensive in terms of the communication
cost, and ... | [
{
"created": "Tue, 21 Jun 2022 08:39:12 GMT",
"version": "v1"
}
] | 2022-06-22 | [
[
"Khodadadian",
"Sajad",
""
],
[
"Sharma",
"Pranay",
""
],
[
"Joshi",
"Gauri",
""
],
[
"Maguluri",
"Siva Theja",
""
]
] | Since reinforcement learning algorithms are notoriously data-intensive, the task of sampling observations from the environment is usually split across multiple agents. However, transferring these observations from the agents to a central location can be prohibitively expensive in terms of the communication cost, and it... |
2103.07205 | Elochukwu Ukwandu Dr | Comfort Olebara, Obianuju Ezugwu, Adaora Obayi, Deborah Ebem, Ujunwa
Mbgoh, Elochukwu Ukwandu | Determining the Impacts of Social Media on Mood, Time Management and
Academic Activities of Students and the Relationship with their Academic
Performance | 7 pages, conference paper | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The number of social media sites have increased exponentially with new ones
cashing in on the weaknesses of older ones and others going beyond community
guidelines by offering uncensored content. The vendors of these platforms in
order to have a wider reach do not place restrictions on viewing age, promises
young peo... | [
{
"created": "Fri, 12 Mar 2021 10:58:46 GMT",
"version": "v1"
}
] | 2021-03-15 | [
[
"Olebara",
"Comfort",
""
],
[
"Ezugwu",
"Obianuju",
""
],
[
"Obayi",
"Adaora",
""
],
[
"Ebem",
"Deborah",
""
],
[
"Mbgoh",
"Ujunwa",
""
],
[
"Ukwandu",
"Elochukwu",
""
]
] | The number of social media sites have increased exponentially with new ones cashing in on the weaknesses of older ones and others going beyond community guidelines by offering uncensored content. The vendors of these platforms in order to have a wider reach do not place restrictions on viewing age, promises young peopl... |
2011.12143 | Lukun Zheng | Yuhang Jiang, Lukun Zheng | Deep learning for video game genre classification | 21 pages, 6 figures, 3 tables. arXiv admin note: substantial text
overlap with arXiv:2011.07658 | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Video game genre classification based on its cover and textual description
would be utterly beneficial to many modern identification, collocation, and
retrieval systems. At the same time, it is also an extremely challenging task
due to the following reasons: First, there exists a wide variety of video game
genres, ma... | [
{
"created": "Sat, 21 Nov 2020 22:31:43 GMT",
"version": "v1"
}
] | 2020-11-25 | [
[
"Jiang",
"Yuhang",
""
],
[
"Zheng",
"Lukun",
""
]
] | Video game genre classification based on its cover and textual description would be utterly beneficial to many modern identification, collocation, and retrieval systems. At the same time, it is also an extremely challenging task due to the following reasons: First, there exists a wide variety of video game genres, many... |
1810.01480 | Julia Kreutzer | Julia Kreutzer, Artem Sokolov | Learning to Segment Inputs for NMT Favors Character-Level Processing | Technical report for IWSLT 2018 paper | null | null | null | cs.CL stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most modern neural machine translation (NMT) systems rely on presegmented
inputs. Segmentation granularity importantly determines the input and output
sequence lengths, hence the modeling depth, and source and target vocabularies,
which in turn determine model size, computational costs of softmax
normalization, and h... | [
{
"created": "Tue, 2 Oct 2018 19:52:38 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Oct 2018 10:21:05 GMT",
"version": "v2"
},
{
"created": "Mon, 5 Nov 2018 09:14:21 GMT",
"version": "v3"
}
] | 2018-11-06 | [
[
"Kreutzer",
"Julia",
""
],
[
"Sokolov",
"Artem",
""
]
] | Most modern neural machine translation (NMT) systems rely on presegmented inputs. Segmentation granularity importantly determines the input and output sequence lengths, hence the modeling depth, and source and target vocabularies, which in turn determine model size, computational costs of softmax normalization, and han... |
2005.02549 | Dong Chen | Dong Chen, Hong Yu | Birth-Burst in Evolving Networks | 11 pages, 4 figures | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The evolution of complex networks is governed by both growing rules and
internal properties. Most evolving network models (e.g. preferential
attachment) emphasize on the growing strategy, while neglecting the
characteristics of individual nodes. In this study, we analyzed a widely
studied network: the evolving protei... | [
{
"created": "Wed, 6 May 2020 01:18:14 GMT",
"version": "v1"
}
] | 2020-05-07 | [
[
"Chen",
"Dong",
""
],
[
"Yu",
"Hong",
""
]
] | The evolution of complex networks is governed by both growing rules and internal properties. Most evolving network models (e.g. preferential attachment) emphasize on the growing strategy, while neglecting the characteristics of individual nodes. In this study, we analyzed a widely studied network: the evolving protein-... |
2108.00377 | Gil Shapira | Gil Shapira, Noga Levy, Ishay Goldin, Roy J. Jevnisek | Knowing When to Quit: Selective Cascaded Regression with Patch Attention
for Real-Time Face Alignment | Accepted to the 29th ACM International Conference on Multimedia (MM
21) | null | 10.1145/3474085.3475401 | null | cs.CV | http://creativecommons.org/publicdomain/zero/1.0/ | Facial landmarks (FLM) estimation is a critical component in many
face-related applications. In this work, we aim to optimize for both accuracy
and speed and explore the trade-off between them. Our key observation is that
not all faces are created equal. Frontal faces with neutral expressions
converge faster than fac... | [
{
"created": "Sun, 1 Aug 2021 06:51:47 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Aug 2021 07:21:08 GMT",
"version": "v2"
}
] | 2021-08-04 | [
[
"Shapira",
"Gil",
""
],
[
"Levy",
"Noga",
""
],
[
"Goldin",
"Ishay",
""
],
[
"Jevnisek",
"Roy J.",
""
]
] | Facial landmarks (FLM) estimation is a critical component in many face-related applications. In this work, we aim to optimize for both accuracy and speed and explore the trade-off between them. Our key observation is that not all faces are created equal. Frontal faces with neutral expressions converge faster than faces... |
2206.10234 | Kostia Chardonnet | Kostia Chardonnet, Marc de Visme, Beno\^it Valiron, Renaud Vilmart | The Many-Worlds Calculus | null | null | null | null | cs.LO quant-ph | http://creativecommons.org/licenses/by/4.0/ | We propose a new typed graphical language for quantum computation, based on
compact categories with biproducts. Our language generalizes existing
approaches such as ZX-calculus and quantum circuits, while offering a natural
framework to support quantum control: it natively supports "quantum tests". The
language comes... | [
{
"created": "Tue, 21 Jun 2022 10:10:26 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Aug 2022 14:44:15 GMT",
"version": "v2"
},
{
"created": "Thu, 30 Nov 2023 11:27:51 GMT",
"version": "v3"
}
] | 2023-12-01 | [
[
"Chardonnet",
"Kostia",
""
],
[
"de Visme",
"Marc",
""
],
[
"Valiron",
"Benoît",
""
],
[
"Vilmart",
"Renaud",
""
]
] | We propose a new typed graphical language for quantum computation, based on compact categories with biproducts. Our language generalizes existing approaches such as ZX-calculus and quantum circuits, while offering a natural framework to support quantum control: it natively supports "quantum tests". The language comes e... |
2211.13051 | Kevin Frans | Kevin Frans, Phillip Isola | Powderworld: A Platform for Understanding Generalization via Rich Task
Distributions | null | null | null | null | cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the grand challenges of reinforcement learning is the ability to
generalize to new tasks. However, general agents require a set of rich, diverse
tasks to train on. Designing a `foundation environment' for such tasks is
tricky -- the ideal environment would support a range of emergent phenomena, an
expressive t... | [
{
"created": "Wed, 23 Nov 2022 15:51:44 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Jun 2023 23:43:23 GMT",
"version": "v2"
},
{
"created": "Sun, 15 Oct 2023 21:15:16 GMT",
"version": "v3"
}
] | 2023-10-17 | [
[
"Frans",
"Kevin",
""
],
[
"Isola",
"Phillip",
""
]
] | One of the grand challenges of reinforcement learning is the ability to generalize to new tasks. However, general agents require a set of rich, diverse tasks to train on. Designing a `foundation environment' for such tasks is tricky -- the ideal environment would support a range of emergent phenomena, an expressive tas... |
2302.08613 | Zhijie Qiao | Zhijie Qiao, Helen Loeb, Venkata Gurrla, Matt Lebermann, Johannes
Betz, Rahul Mangharam | Drive Right: Promoting Autonomous Vehicle Education Through an
Integrated Simulation Platform | null | SAE Int. J. of CAV 5(4):2022 | 10.4271/12-05-04-0028 | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Autonomous vehicles (AVs) are being rapidly introduced into our lives.
However, public misunderstanding and mistrust have become prominent issues
hindering the acceptance of these driverless technologies. The primary
objective of this study is to evaluate the effectiveness of a driving simulator
to help the public ga... | [
{
"created": "Thu, 16 Feb 2023 22:35:08 GMT",
"version": "v1"
}
] | 2023-02-20 | [
[
"Qiao",
"Zhijie",
""
],
[
"Loeb",
"Helen",
""
],
[
"Gurrla",
"Venkata",
""
],
[
"Lebermann",
"Matt",
""
],
[
"Betz",
"Johannes",
""
],
[
"Mangharam",
"Rahul",
""
]
] | Autonomous vehicles (AVs) are being rapidly introduced into our lives. However, public misunderstanding and mistrust have become prominent issues hindering the acceptance of these driverless technologies. The primary objective of this study is to evaluate the effectiveness of a driving simulator to help the public gain... |
2407.05459 | Junjie Chen | Matteo Castiglioni, Junjie Chen | Hiring for An Uncertain Task: Joint Design of Information and Contracts | contract design, information design | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we initiate the computational problem of jointly designing
information and contracts. We consider three possible classes of contracts with
decreasing flexibility and increasing simplicity: ambiguous contracts, menus of
explicit contracts and explicit single contract. Ambiguous contracts allow the
princ... | [
{
"created": "Sun, 7 Jul 2024 18:10:00 GMT",
"version": "v1"
}
] | 2024-07-09 | [
[
"Castiglioni",
"Matteo",
""
],
[
"Chen",
"Junjie",
""
]
] | In this paper, we initiate the computational problem of jointly designing information and contracts. We consider three possible classes of contracts with decreasing flexibility and increasing simplicity: ambiguous contracts, menus of explicit contracts and explicit single contract. Ambiguous contracts allow the princip... |
1705.07086 | Emmanouil Antonios Platanios | Emmanouil A. Platanios, Hoifung Poon, Tom M. Mitchell, Eric Horvitz | Estimating Accuracy from Unlabeled Data: A Probabilistic Logic Approach | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an efficient method to estimate the accuracy of classifiers using
only unlabeled data. We consider a setting with multiple classification
problems where the target classes may be tied together through logical
constraints. For example, a set of classes may be mutually exclusive, meaning
that a data instance... | [
{
"created": "Fri, 19 May 2017 16:52:52 GMT",
"version": "v1"
}
] | 2017-05-22 | [
[
"Platanios",
"Emmanouil A.",
""
],
[
"Poon",
"Hoifung",
""
],
[
"Mitchell",
"Tom M.",
""
],
[
"Horvitz",
"Eric",
""
]
] | We propose an efficient method to estimate the accuracy of classifiers using only unlabeled data. We consider a setting with multiple classification problems where the target classes may be tied together through logical constraints. For example, a set of classes may be mutually exclusive, meaning that a data instance c... |
1811.11987 | Laurent Bou\'e | Laurent Bou\'e | Deep learning for pedestrians: backpropagation in CNNs | null | null | null | null | cs.LG cs.AI cs.CV cs.SC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The goal of this document is to provide a pedagogical introduction to the
main concepts underpinning the training of deep neural networks using gradient
descent; a process known as backpropagation. Although we focus on a very
influential class of architectures called "convolutional neural networks"
(CNNs) the approac... | [
{
"created": "Thu, 29 Nov 2018 07:00:09 GMT",
"version": "v1"
}
] | 2018-11-30 | [
[
"Boué",
"Laurent",
""
]
] | The goal of this document is to provide a pedagogical introduction to the main concepts underpinning the training of deep neural networks using gradient descent; a process known as backpropagation. Although we focus on a very influential class of architectures called "convolutional neural networks" (CNNs) the approach ... |
2310.15110 | Ruoxi Shi | Ruoxi Shi, Hansheng Chen, Zhuoyang Zhang, Minghua Liu, Chao Xu, Xinyue
Wei, Linghao Chen, Chong Zeng, Hao Su | Zero123++: a Single Image to Consistent Multi-view Diffusion Base Model | null | null | null | null | cs.CV cs.GR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We report Zero123++, an image-conditioned diffusion model for generating
3D-consistent multi-view images from a single input view. To take full
advantage of pretrained 2D generative priors, we develop various conditioning
and training schemes to minimize the effort of finetuning from off-the-shelf
image diffusion mod... | [
{
"created": "Mon, 23 Oct 2023 17:18:59 GMT",
"version": "v1"
}
] | 2023-10-24 | [
[
"Shi",
"Ruoxi",
""
],
[
"Chen",
"Hansheng",
""
],
[
"Zhang",
"Zhuoyang",
""
],
[
"Liu",
"Minghua",
""
],
[
"Xu",
"Chao",
""
],
[
"Wei",
"Xinyue",
""
],
[
"Chen",
"Linghao",
""
],
[
"Zeng",
"Chon... | We report Zero123++, an image-conditioned diffusion model for generating 3D-consistent multi-view images from a single input view. To take full advantage of pretrained 2D generative priors, we develop various conditioning and training schemes to minimize the effort of finetuning from off-the-shelf image diffusion model... |
2112.02198 | Georg Maringer | Georg Maringer and Marvin Xhemrishi and Sven Puchinger and Kathrin
Garb and Hedongliang Liu and Thomas Jerkovits and Ludwig K\"urzinger and
Matthias Hiller and Antonia Wachter-Zeh | Analysis of Communication Channels Related to Physical Unclonable
Functions | null | null | null | null | cs.IT cs.CR math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cryptographic algorithms rely on the secrecy of their corresponding keys. On
embedded systems with standard CMOS chips, where secure permanent memory such
as flash is not available as a key storage, the secret key can be derived from
Physical Unclonable Functions (PUFs) that make use of minuscule manufacturing
variat... | [
{
"created": "Sat, 4 Dec 2021 00:00:06 GMT",
"version": "v1"
}
] | 2021-12-07 | [
[
"Maringer",
"Georg",
""
],
[
"Xhemrishi",
"Marvin",
""
],
[
"Puchinger",
"Sven",
""
],
[
"Garb",
"Kathrin",
""
],
[
"Liu",
"Hedongliang",
""
],
[
"Jerkovits",
"Thomas",
""
],
[
"Kürzinger",
"Ludwig",
""
]... | Cryptographic algorithms rely on the secrecy of their corresponding keys. On embedded systems with standard CMOS chips, where secure permanent memory such as flash is not available as a key storage, the secret key can be derived from Physical Unclonable Functions (PUFs) that make use of minuscule manufacturing variatio... |
2103.08157 | Kwanghee Choi | Kwanghee Choi, Minyoung Choe, Hyelee Lee | Pretraining Neural Architecture Search Controllers with Locality-based
Self-Supervised Learning | Accepted to NeurIPS 2020 Workshop: Self-Supervised Learning - Theory
and Practice | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Neural architecture search (NAS) has fostered various fields of machine
learning. Despite its prominent dedications, many have criticized the intrinsic
limitations of high computational cost. We aim to ameliorate this by proposing
a pretraining scheme that can be generally applied to controller-based NAS. Our
method,... | [
{
"created": "Mon, 15 Mar 2021 06:30:36 GMT",
"version": "v1"
}
] | 2021-03-16 | [
[
"Choi",
"Kwanghee",
""
],
[
"Choe",
"Minyoung",
""
],
[
"Lee",
"Hyelee",
""
]
] | Neural architecture search (NAS) has fostered various fields of machine learning. Despite its prominent dedications, many have criticized the intrinsic limitations of high computational cost. We aim to ameliorate this by proposing a pretraining scheme that can be generally applied to controller-based NAS. Our method, l... |
1907.03285 | Konstantin Chukharev | Konstantin Chukharev and Daniil Chivilikhin | fbSAT: Automatic Inference of Minimal Finite-State Models of Function
Blocks Using SAT Solver | 21 pages (16 paper, 2 refs, 3 appendix); 9 figures; submitted without
an appendix to TAP 2020. Keywords: SAT, Finite-state automata, LTL, Model
checking, Counterexample-guided inductive synthesis, Function blocks, IEC
61499 | null | null | null | cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Finite-state models are widely used in software engineering, especially in
control systems development. Commonly, in control applications such models are
developed manually, hence, keeping them up-to-date requires extra effort. To
simplify the maintenance process, an automatic approach may be used, allowing
to infer ... | [
{
"created": "Sun, 7 Jul 2019 13:34:31 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Oct 2019 00:30:40 GMT",
"version": "v2"
},
{
"created": "Tue, 4 Feb 2020 11:22:06 GMT",
"version": "v3"
}
] | 2020-02-05 | [
[
"Chukharev",
"Konstantin",
""
],
[
"Chivilikhin",
"Daniil",
""
]
] | Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence, keeping them up-to-date requires extra effort. To simplify the maintenance process, an automatic approach may be used, allowing to infer mo... |
1304.0872 | David Doty | David Doty | Timing in chemical reaction networks | null | null | null | null | cs.CC cs.DC cs.DS q-bio.MN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Chemical reaction networks (CRNs) formally model chemistry in a well-mixed
solution. CRNs are widely used to describe information processing occurring in
natural cellular regulatory networks, and with upcoming advances in synthetic
biology, CRNs are a promising programming language for the design of artificial
molecu... | [
{
"created": "Wed, 3 Apr 2013 08:50:30 GMT",
"version": "v1"
}
] | 2013-04-17 | [
[
"Doty",
"David",
""
]
] | Chemical reaction networks (CRNs) formally model chemistry in a well-mixed solution. CRNs are widely used to describe information processing occurring in natural cellular regulatory networks, and with upcoming advances in synthetic biology, CRNs are a promising programming language for the design of artificial molecula... |
1407.2774 | Will Perkins | Vitaly Feldman, Will Perkins, Santosh Vempala | Subsampled Power Iteration: a Unified Algorithm for Block Models and
Planted CSP's | null | null | null | null | cs.DS math.CO math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present an algorithm for recovering planted solutions in two well-known
models, the stochastic block model and planted constraint satisfaction
problems, via a common generalization in terms of random bipartite graphs. Our
algorithm matches up to a constant factor the best-known bounds for the number
of edges (or c... | [
{
"created": "Thu, 10 Jul 2014 13:12:38 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Nov 2014 06:54:15 GMT",
"version": "v2"
},
{
"created": "Tue, 28 Apr 2015 21:01:03 GMT",
"version": "v3"
}
] | 2015-04-30 | [
[
"Feldman",
"Vitaly",
""
],
[
"Perkins",
"Will",
""
],
[
"Vempala",
"Santosh",
""
]
] | We present an algorithm for recovering planted solutions in two well-known models, the stochastic block model and planted constraint satisfaction problems, via a common generalization in terms of random bipartite graphs. Our algorithm matches up to a constant factor the best-known bounds for the number of edges (or con... |
1810.03393 | Ye Zhu PhD | Ye Zhu, Kai Ming Ting, Yuan Jin, Maia Angelova | Hierarchical clustering that takes advantage of both density-peak and
density-connectivity | null | Zhu, Y., Ting, K. M., Jin, Y., & Angelova, M. (2022). Hierarchical
clustering that takes advantage of both density-peak and
density-connectivity. Information Systems, 103, 101871 | 10.1016/j.is.2021.101871 | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper focuses on density-based clustering, particularly the Density Peak
(DP) algorithm and the one based on density-connectivity DBSCAN; and proposes a
new method which takes advantage of the individual strengths of these two
methods to yield a density-based hierarchical clustering algorithm. Our
investigation ... | [
{
"created": "Mon, 8 Oct 2018 12:12:42 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Sep 2021 04:08:41 GMT",
"version": "v2"
}
] | 2024-01-30 | [
[
"Zhu",
"Ye",
""
],
[
"Ting",
"Kai Ming",
""
],
[
"Jin",
"Yuan",
""
],
[
"Angelova",
"Maia",
""
]
] | This paper focuses on density-based clustering, particularly the Density Peak (DP) algorithm and the one based on density-connectivity DBSCAN; and proposes a new method which takes advantage of the individual strengths of these two methods to yield a density-based hierarchical clustering algorithm. Our investigation be... |
2306.04170 | Zhibin Chen | Zhibin Chen, Yansong Feng, Dongyan Zhao | From the One, Judge of the Whole: Typed Entailment Graph Construction
with Predicate Generation | 9 pages, 3 figures, accepted to ACL 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Entailment Graphs (EGs) have been constructed based on extracted corpora as a
strong and explainable form to indicate context-independent entailment
relations in natural languages. However, EGs built by previous methods often
suffer from the severe sparsity issues, due to limited corpora available and
the long-tail p... | [
{
"created": "Wed, 7 Jun 2023 05:46:19 GMT",
"version": "v1"
}
] | 2023-06-08 | [
[
"Chen",
"Zhibin",
""
],
[
"Feng",
"Yansong",
""
],
[
"Zhao",
"Dongyan",
""
]
] | Entailment Graphs (EGs) have been constructed based on extracted corpora as a strong and explainable form to indicate context-independent entailment relations in natural languages. However, EGs built by previous methods often suffer from the severe sparsity issues, due to limited corpora available and the long-tail phe... |
1501.03610 | Tom Z. J. Fu | Tom Z. J. Fu, Jianbing Ding, Richard T. B. Ma, Marianne Winslett, Yin
Yang, Zhenjie Zhang | DRS: Dynamic Resource Scheduling for Real-Time Analytics over Fast
Streams | This is the our latest version with certain modification | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a data stream management system (DSMS), users register continuous queries,
and receive result updates as data arrive and expire. We focus on applications
with real-time constraints, in which the user must receive each result update
within a given period after the update occurs. To handle fast data, the DSMS is
com... | [
{
"created": "Thu, 15 Jan 2015 09:37:32 GMT",
"version": "v1"
},
{
"created": "Sat, 31 Jan 2015 07:59:22 GMT",
"version": "v2"
},
{
"created": "Thu, 23 Apr 2015 09:48:22 GMT",
"version": "v3"
}
] | 2015-04-24 | [
[
"Fu",
"Tom Z. J.",
""
],
[
"Ding",
"Jianbing",
""
],
[
"Ma",
"Richard T. B.",
""
],
[
"Winslett",
"Marianne",
""
],
[
"Yang",
"Yin",
""
],
[
"Zhang",
"Zhenjie",
""
]
] | In a data stream management system (DSMS), users register continuous queries, and receive result updates as data arrive and expire. We focus on applications with real-time constraints, in which the user must receive each result update within a given period after the update occurs. To handle fast data, the DSMS is commo... |
2405.17120 | Bogdan Chornomaz | Zachary Chase and Bogdan Chornomaz and Steve Hanneke and Shay Moran
and Amir Yehudayoff | Dual VC Dimension Obstructs Sample Compression by Embeddings | null | null | null | null | cs.DM cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | This work studies embedding of arbitrary VC classes in well-behaved VC
classes, focusing particularly on extremal classes. Our main result expresses
an impossibility: such embeddings necessarily require a significant increase in
dimension. In particular, we prove that for every $d$ there is a class with VC
dimension ... | [
{
"created": "Mon, 27 May 2024 12:38:25 GMT",
"version": "v1"
}
] | 2024-05-28 | [
[
"Chase",
"Zachary",
""
],
[
"Chornomaz",
"Bogdan",
""
],
[
"Hanneke",
"Steve",
""
],
[
"Moran",
"Shay",
""
],
[
"Yehudayoff",
"Amir",
""
]
] | This work studies embedding of arbitrary VC classes in well-behaved VC classes, focusing particularly on extremal classes. Our main result expresses an impossibility: such embeddings necessarily require a significant increase in dimension. In particular, we prove that for every $d$ there is a class with VC dimension $d... |
2205.15731 | Udo Schlegel | Udo Schlegel, Samuel Schiegg, Daniel A. Keim | ViNNPruner: Visual Interactive Pruning for Deep Learning | MLVis Short Paper; 4 pages, 1 page references, 3 figures | null | null | null | cs.LG cs.HC | http://creativecommons.org/licenses/by/4.0/ | Neural networks grow vastly in size to tackle more sophisticated tasks. In
many cases, such large networks are not deployable on particular hardware and
need to be reduced in size. Pruning techniques help to shrink deep neural
networks to smaller sizes by only decreasing their performance as little as
possible. Howev... | [
{
"created": "Tue, 31 May 2022 12:21:38 GMT",
"version": "v1"
}
] | 2022-06-01 | [
[
"Schlegel",
"Udo",
""
],
[
"Schiegg",
"Samuel",
""
],
[
"Keim",
"Daniel A.",
""
]
] | Neural networks grow vastly in size to tackle more sophisticated tasks. In many cases, such large networks are not deployable on particular hardware and need to be reduced in size. Pruning techniques help to shrink deep neural networks to smaller sizes by only decreasing their performance as little as possible. However... |
1507.04405 | Ryan McCune | Robert Ryan McCune, Tim Weninger, Gregory Madey | Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for
Distributed Graph Processing | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The vertex-centric programming model is an established computational paradigm
recently incorporated into distributed processing frameworks to address
challenges in large-scale graph processing. Billion-node graphs that exceed the
memory capacity of standard machines are not well-supported by popular Big Data
tools li... | [
{
"created": "Wed, 15 Jul 2015 22:14:23 GMT",
"version": "v1"
}
] | 2015-07-17 | [
[
"McCune",
"Robert Ryan",
""
],
[
"Weninger",
"Tim",
""
],
[
"Madey",
"Gregory",
""
]
] | The vertex-centric programming model is an established computational paradigm recently incorporated into distributed processing frameworks to address challenges in large-scale graph processing. Billion-node graphs that exceed the memory capacity of standard machines are not well-supported by popular Big Data tools like... |
2404.13504 | Tao Feng | Tao Feng, Lizhen Qu, Zhuang Li, Haolan Zhan, Yuncheng Hua, Gholamreza
Haffari | IMO: Greedy Layer-Wise Sparse Representation Learning for
Out-of-Distribution Text Classification with Pre-trained Models | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning models have made incredible progress, but they still
struggle when applied to examples from unseen domains. This study focuses on a
specific problem of domain generalization, where a model is trained on one
source domain and tested on multiple target domains that are unseen during
training. We propos... | [
{
"created": "Sun, 21 Apr 2024 02:15:59 GMT",
"version": "v1"
}
] | 2024-04-23 | [
[
"Feng",
"Tao",
""
],
[
"Qu",
"Lizhen",
""
],
[
"Li",
"Zhuang",
""
],
[
"Zhan",
"Haolan",
""
],
[
"Hua",
"Yuncheng",
""
],
[
"Haffari",
"Gholamreza",
""
]
] | Machine learning models have made incredible progress, but they still struggle when applied to examples from unseen domains. This study focuses on a specific problem of domain generalization, where a model is trained on one source domain and tested on multiple target domains that are unseen during training. We propose ... |
2208.01148 | Ben London | Ben London, Levi Lu, Ted Sandler, Thorsten Joachims | Boosted Off-Policy Learning | Final version as appeared in AISTATS 2023 | null | null | null | cs.LG cs.IR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose the first boosting algorithm for off-policy learning from logged
bandit feedback. Unlike existing boosting methods for supervised learning, our
algorithm directly optimizes an estimate of the policy's expected reward. We
analyze this algorithm and prove that the excess empirical risk decreases
(possibly ex... | [
{
"created": "Mon, 1 Aug 2022 21:43:02 GMT",
"version": "v1"
},
{
"created": "Tue, 2 May 2023 17:30:59 GMT",
"version": "v2"
}
] | 2023-05-03 | [
[
"London",
"Ben",
""
],
[
"Lu",
"Levi",
""
],
[
"Sandler",
"Ted",
""
],
[
"Joachims",
"Thorsten",
""
]
] | We propose the first boosting algorithm for off-policy learning from logged bandit feedback. Unlike existing boosting methods for supervised learning, our algorithm directly optimizes an estimate of the policy's expected reward. We analyze this algorithm and prove that the excess empirical risk decreases (possibly expo... |
2310.01403 | Size Wu | Size Wu and Wenwei Zhang and Lumin Xu and Sheng Jin and Xiangtai Li
and Wentao Liu and Chen Change Loy | CLIPSelf: Vision Transformer Distills Itself for Open-Vocabulary Dense
Prediction | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Open-vocabulary dense prediction tasks including object detection and image
segmentation have been advanced by the success of Contrastive Language-Image
Pre-training (CLIP). CLIP models, particularly those incorporating vision
transformers (ViTs), have exhibited remarkable generalization ability in
zero-shot image cl... | [
{
"created": "Mon, 2 Oct 2023 17:58:52 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Jan 2024 18:11:53 GMT",
"version": "v2"
}
] | 2024-01-25 | [
[
"Wu",
"Size",
""
],
[
"Zhang",
"Wenwei",
""
],
[
"Xu",
"Lumin",
""
],
[
"Jin",
"Sheng",
""
],
[
"Li",
"Xiangtai",
""
],
[
"Liu",
"Wentao",
""
],
[
"Loy",
"Chen Change",
""
]
] | Open-vocabulary dense prediction tasks including object detection and image segmentation have been advanced by the success of Contrastive Language-Image Pre-training (CLIP). CLIP models, particularly those incorporating vision transformers (ViTs), have exhibited remarkable generalization ability in zero-shot image clas... |
1808.00714 | Elena Kirshanova | Elena Kirshanova | Improved Quantum Information Set Decoding | This is a full and corrected version of the paper appeared in
PQCrypto2018 | null | 10.1007/978-3-319-79063-3_24 | null | cs.IT math.IT quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present quantum information set decoding (ISD) algorithms
for binary linear codes. First, we give an alternative view on the quantum walk
based algorithms proposed by Kachigar and Tillich (PQCrypto'17). It is more
general and allows to consider any ISD algorithm that has certain properties.
The algor... | [
{
"created": "Thu, 2 Aug 2018 09:04:26 GMT",
"version": "v1"
}
] | 2018-08-03 | [
[
"Kirshanova",
"Elena",
""
]
] | In this paper we present quantum information set decoding (ISD) algorithms for binary linear codes. First, we give an alternative view on the quantum walk based algorithms proposed by Kachigar and Tillich (PQCrypto'17). It is more general and allows to consider any ISD algorithm that has certain properties. The algorit... |
2208.11099 | Mirko Marras | Andrea Atzori, Gianni Fenu, Mirko Marras | Explaining Bias in Deep Face Recognition via Image Characteristics | Accepted as a full paper at IJCB 2022: 2022 International Joint
Conference on Biometrics | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a novel explanatory framework aimed to provide a
better understanding of how face recognition models perform as the underlying
data characteristics (protected attributes: gender, ethnicity, age;
non-protected attributes: facial hair, makeup, accessories, face orientation
and occlusion, image... | [
{
"created": "Tue, 23 Aug 2022 17:18:23 GMT",
"version": "v1"
}
] | 2022-08-24 | [
[
"Atzori",
"Andrea",
""
],
[
"Fenu",
"Gianni",
""
],
[
"Marras",
"Mirko",
""
]
] | In this paper, we propose a novel explanatory framework aimed to provide a better understanding of how face recognition models perform as the underlying data characteristics (protected attributes: gender, ethnicity, age; non-protected attributes: facial hair, makeup, accessories, face orientation and occlusion, image d... |
0901.1906 | Jan Cie\'sli\'nski L. | Jan L. Cieslinski, Boguslaw Ratkiewicz | How to improve the accuracy of the discrete gradient method in the
one-dimensional case | 7 pages plus 7 figures | null | 10.1103/PhysRevE.81.016704 | null | cs.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a new numerical scheme for one dimensional dynamical systems. This
is a modification of the discrete gradient method and keeps its advantages,
including the stability and the conservation of the energy integral. However,
its accuracy is higher by several orders of magnitude.
| [
{
"created": "Tue, 13 Jan 2009 23:16:12 GMT",
"version": "v1"
}
] | 2015-05-13 | [
[
"Cieslinski",
"Jan L.",
""
],
[
"Ratkiewicz",
"Boguslaw",
""
]
] | We present a new numerical scheme for one dimensional dynamical systems. This is a modification of the discrete gradient method and keeps its advantages, including the stability and the conservation of the energy integral. However, its accuracy is higher by several orders of magnitude. |
2108.11535 | Matheus Pereira | Matheus Barros Pereira, Jefersson Alex dos Santos | ChessMix: Spatial Context Data Augmentation for Remote Sensing Semantic
Segmentation | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Labeling semantic segmentation datasets is a costly and laborious process if
compared with tasks like image classification and object detection. This is
especially true for remote sensing applications that not only work with
extremely high spatial resolution data but also commonly require the knowledge
of experts of ... | [
{
"created": "Thu, 26 Aug 2021 01:01:43 GMT",
"version": "v1"
}
] | 2021-08-27 | [
[
"Pereira",
"Matheus Barros",
""
],
[
"Santos",
"Jefersson Alex dos",
""
]
] | Labeling semantic segmentation datasets is a costly and laborious process if compared with tasks like image classification and object detection. This is especially true for remote sensing applications that not only work with extremely high spatial resolution data but also commonly require the knowledge of experts of th... |
1604.00942 | Emanuel Laci\'c | Emanuel Lacic, Dominik Kowald, Elisabeth Lex | High Enough? Explaining and Predicting Traveler Satisfaction Using
Airline Review | 5 pages + references, 2 tables, 7 figures | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Air travel is one of the most frequently used means of transportation in our
every-day life. Thus, it is not surprising that an increasing number of
travelers share their experiences with airlines and airports in form of online
reviews on the Web. In this work, we thrive to explain and uncover the features
of airline... | [
{
"created": "Mon, 4 Apr 2016 16:44:00 GMT",
"version": "v1"
}
] | 2016-04-05 | [
[
"Lacic",
"Emanuel",
""
],
[
"Kowald",
"Dominik",
""
],
[
"Lex",
"Elisabeth",
""
]
] | Air travel is one of the most frequently used means of transportation in our every-day life. Thus, it is not surprising that an increasing number of travelers share their experiences with airlines and airports in form of online reviews on the Web. In this work, we thrive to explain and uncover the features of airline r... |
1612.05832 | Leslie Ann Goldberg | Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic | Implementations and the independent set polynomial below the Shearer
threshold | To appear in TCS | null | null | null | cs.CC cs.DM | http://creativecommons.org/licenses/by/4.0/ | The independent set polynomial is important in many areas. For every integer
$\Delta\geq 2$, the Shearer threshold is the value
$\lambda^*(\Delta)=(\Delta-1)^{\Delta-1}/\Delta^{\Delta}$ . It is known that
for $\lambda < - \lambda^*(\Delta)$, there are graphs~$G$ with maximum
degree~$\Delta$ whose independent set poly... | [
{
"created": "Sat, 17 Dec 2016 22:33:15 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Apr 2017 17:36:52 GMT",
"version": "v2"
},
{
"created": "Wed, 21 Jun 2017 16:22:35 GMT",
"version": "v3"
},
{
"created": "Fri, 10 Jul 2020 08:47:57 GMT",
"version": "v4"
},
{
"c... | 2022-10-25 | [
[
"Galanis",
"Andreas",
""
],
[
"Goldberg",
"Leslie Ann",
""
],
[
"Stefankovic",
"Daniel",
""
]
] | The independent set polynomial is important in many areas. For every integer $\Delta\geq 2$, the Shearer threshold is the value $\lambda^*(\Delta)=(\Delta-1)^{\Delta-1}/\Delta^{\Delta}$ . It is known that for $\lambda < - \lambda^*(\Delta)$, there are graphs~$G$ with maximum degree~$\Delta$ whose independent set polyno... |
2403.11150 | Jing Zhang | Jing Zhang, Liang Zheng, Meng Wang, and Dan Guo | Training A Small Emotional Vision Language Model for Visual Art
Comprehension | 16 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper develops small vision language models to understand visual art,
which, given an art work, aims to identify its emotion category and explain
this prediction with natural language. While small models are computationally
efficient, their capacity is much limited compared with large models. To break
this trade... | [
{
"created": "Sun, 17 Mar 2024 09:01:02 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Jul 2024 13:26:48 GMT",
"version": "v2"
}
] | 2024-07-11 | [
[
"Zhang",
"Jing",
""
],
[
"Zheng",
"Liang",
""
],
[
"Wang",
"Meng",
""
],
[
"Guo",
"Dan",
""
]
] | This paper develops small vision language models to understand visual art, which, given an art work, aims to identify its emotion category and explain this prediction with natural language. While small models are computationally efficient, their capacity is much limited compared with large models. To break this trade-o... |
1608.03677 | Paul Cuff | Paul Cuff and Lanqing Yu | Differential Privacy as a Mutual Information Constraint | ACM CCS 2016, 12 pages | null | 10.1145/2976749.2978308 | null | cs.IT cs.CR math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Differential privacy is a precise mathematical constraint meant to ensure
privacy of individual pieces of information in a database even while queries
are being answered about the aggregate. Intuitively, one must come to terms
with what differential privacy does and does not guarantee. For example, the
definition pre... | [
{
"created": "Fri, 12 Aug 2016 05:03:14 GMT",
"version": "v1"
}
] | 2016-08-15 | [
[
"Cuff",
"Paul",
""
],
[
"Yu",
"Lanqing",
""
]
] | Differential privacy is a precise mathematical constraint meant to ensure privacy of individual pieces of information in a database even while queries are being answered about the aggregate. Intuitively, one must come to terms with what differential privacy does and does not guarantee. For example, the definition preve... |
2302.02931 | Amrith Setlur | Amrith Setlur, Don Dennis, Benjamin Eysenbach, Aditi Raghunathan,
Chelsea Finn, Virginia Smith, Sergey Levine | Bitrate-Constrained DRO: Beyond Worst Case Robustness To Unknown Group
Shifts | null | ICLR 2023 | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Training machine learning models robust to distribution shifts is critical
for real-world applications. Some robust training algorithms (e.g., Group DRO)
specialize to group shifts and require group information on all training
points. Other methods (e.g., CVaR DRO) that do not need group annotations can
be overly con... | [
{
"created": "Mon, 6 Feb 2023 17:07:16 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Oct 2023 03:47:00 GMT",
"version": "v2"
}
] | 2023-10-13 | [
[
"Setlur",
"Amrith",
""
],
[
"Dennis",
"Don",
""
],
[
"Eysenbach",
"Benjamin",
""
],
[
"Raghunathan",
"Aditi",
""
],
[
"Finn",
"Chelsea",
""
],
[
"Smith",
"Virginia",
""
],
[
"Levine",
"Sergey",
""
]
] | Training machine learning models robust to distribution shifts is critical for real-world applications. Some robust training algorithms (e.g., Group DRO) specialize to group shifts and require group information on all training points. Other methods (e.g., CVaR DRO) that do not need group annotations can be overly conse... |
2103.04428 | Christoph Capellaro | Christoph Capellaro | Design of Ciphers based on the Geometric Structure of the Laguerre and
Minkowski Planes | 20 pages, 5 figures. arXiv admin note: text overlap with
arXiv:2102.10321 | null | null | null | cs.CR math.CO | http://creativecommons.org/licenses/by/4.0/ | Till now geometric structures don't play a major role in cryptography.
Gilbert, MacWilliams and Sloane introduced an authentication scheme in the
projective plane and showed its perfectness in the sense of Shannon. In
arXiv:2102.10321 we introduced an encryption scheme in the M\"obius plane and
showed that it fulfill... | [
{
"created": "Sun, 7 Mar 2021 18:59:30 GMT",
"version": "v1"
}
] | 2021-03-09 | [
[
"Capellaro",
"Christoph",
""
]
] | Till now geometric structures don't play a major role in cryptography. Gilbert, MacWilliams and Sloane introduced an authentication scheme in the projective plane and showed its perfectness in the sense of Shannon. In arXiv:2102.10321 we introduced an encryption scheme in the M\"obius plane and showed that it fulfills ... |
0708.1116 | Florian Simatos | Florian Simatos | A variant of the Recoil Growth algorithm to generate multi-polymer
systems | Title changed | null | null | null | cs.CE cond-mat.stat-mech | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the
most efficient algorithm available in the literature to sample from a
multi-polymer system. Such problems are closely related to the generation of
self-avoiding paths. In this paper, we study a variant of the original Recoil
Growth algorith... | [
{
"created": "Wed, 8 Aug 2007 15:07:53 GMT",
"version": "v1"
},
{
"created": "Fri, 12 Sep 2008 10:02:19 GMT",
"version": "v2"
},
{
"created": "Thu, 2 Jul 2009 12:31:15 GMT",
"version": "v3"
}
] | 2009-07-02 | [
[
"Simatos",
"Florian",
""
]
] | The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. Such problems are closely related to the generation of self-avoiding paths. In this paper, we study a variant of the original Recoil Growth algorithm,... |
2108.11014 | Huiqun Wang | Huiqun Wang, Ruijie Yang, Di Huang and Yunhong Wang | iDARTS: Improving DARTS by Node Normalization and Decorrelation
Discretization | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Differentiable ARchiTecture Search (DARTS) uses a continuous relaxation of
network representation and dramatically accelerates Neural Architecture Search
(NAS) by almost thousands of times in GPU-day. However, the searching process
of DARTS is unstable, which suffers severe degradation when training epochs
become lar... | [
{
"created": "Wed, 25 Aug 2021 02:23:30 GMT",
"version": "v1"
}
] | 2021-08-26 | [
[
"Wang",
"Huiqun",
""
],
[
"Yang",
"Ruijie",
""
],
[
"Huang",
"Di",
""
],
[
"Wang",
"Yunhong",
""
]
] | Differentiable ARchiTecture Search (DARTS) uses a continuous relaxation of network representation and dramatically accelerates Neural Architecture Search (NAS) by almost thousands of times in GPU-day. However, the searching process of DARTS is unstable, which suffers severe degradation when training epochs become large... |
1611.06694 | Akshayvarun Subramanya | Suraj Srinivas, Akshayvarun Subramanya, R. Venkatesh Babu | Training Sparse Neural Networks | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks with lots of parameters are typically used for
large-scale computer vision tasks such as image classification. This is a
result of using dense matrix multiplications and convolutions. However, sparse
computations are known to be much more efficient. In this work, we train and
build neural network... | [
{
"created": "Mon, 21 Nov 2016 09:24:24 GMT",
"version": "v1"
}
] | 2016-11-22 | [
[
"Srinivas",
"Suraj",
""
],
[
"Subramanya",
"Akshayvarun",
""
],
[
"Babu",
"R. Venkatesh",
""
]
] | Deep neural networks with lots of parameters are typically used for large-scale computer vision tasks such as image classification. This is a result of using dense matrix multiplications and convolutions. However, sparse computations are known to be much more efficient. In this work, we train and build neural networks ... |
1209.2890 | Giulio Manzonetto | Thomas Ehrhard (CNRS), Antonio Bucciarelli (Universite Paris Diderot),
Alberto Carraro (Universita Ca' Foscari), Giulio Manzonetto (Universite Paris
Nord) | Full Abstraction for the Resource Lambda Calculus with Tests, through
Taylor Expansion | null | Logical Methods in Computer Science, Volume 8, Issue 4 (October
10, 2012) lmcs:1047 | 10.2168/LMCS-8(4:3)2012 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the semantics of a resource-sensitive extension of the lambda
calculus in a canonical reflexive object of a category of sets and relations, a
relational version of Scott's original model of the pure lambda calculus. This
calculus is related to Boudol's resource calculus and is derived from Ehrhard
and Regnie... | [
{
"created": "Thu, 13 Sep 2012 13:45:55 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Oct 2012 20:21:59 GMT",
"version": "v2"
}
] | 2015-07-01 | [
[
"Ehrhard",
"Thomas",
"",
"CNRS"
],
[
"Bucciarelli",
"Antonio",
"",
"Universite Paris Diderot"
],
[
"Carraro",
"Alberto",
"",
"Universita Ca' Foscari"
],
[
"Manzonetto",
"Giulio",
"",
"Universite Paris\n Nord"
]
] | We study the semantics of a resource-sensitive extension of the lambda calculus in a canonical reflexive object of a category of sets and relations, a relational version of Scott's original model of the pure lambda calculus. This calculus is related to Boudol's resource calculus and is derived from Ehrhard and Regnier'... |
1902.02256 | Kaveh Fathian | Kaveh Fathian, Kasra Khosoussi, Yulun Tian, Parker Lusk, Jonathan P.
How | CLEAR: A Consistent Lifting, Embedding, and Alignment Rectification
Algorithm for Multi-View Data Association | null | null | null | null | cs.RO cs.CV cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many robotics applications require alignment and fusion of observations
obtained at multiple views to form a global model of the environment. Multi-way
data association methods provide a mechanism to improve alignment accuracy of
pairwise associations and ensure their consistency. However, existing methods
that solve... | [
{
"created": "Wed, 6 Feb 2019 16:12:57 GMT",
"version": "v1"
},
{
"created": "Wed, 31 Jul 2019 21:39:56 GMT",
"version": "v2"
},
{
"created": "Wed, 4 Mar 2020 23:08:51 GMT",
"version": "v3"
}
] | 2020-03-06 | [
[
"Fathian",
"Kaveh",
""
],
[
"Khosoussi",
"Kasra",
""
],
[
"Tian",
"Yulun",
""
],
[
"Lusk",
"Parker",
""
],
[
"How",
"Jonathan P.",
""
]
] | Many robotics applications require alignment and fusion of observations obtained at multiple views to form a global model of the environment. Multi-way data association methods provide a mechanism to improve alignment accuracy of pairwise associations and ensure their consistency. However, existing methods that solve t... |
2307.13510 | Xi Li | Yiming Wu, Ruixiang Li, Zequn Qin, Xinhai Zhao, Xi Li | HeightFormer: Explicit Height Modeling without Extra Data for
Camera-only 3D Object Detection in Bird's Eye View | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Vision-based Bird's Eye View (BEV) representation is an emerging perception
formulation for autonomous driving. The core challenge is to construct BEV
space with multi-camera features, which is a one-to-many ill-posed problem.
Diving into all previous BEV representation generation methods, we found that
most of them ... | [
{
"created": "Tue, 25 Jul 2023 14:02:02 GMT",
"version": "v1"
},
{
"created": "Wed, 13 Mar 2024 04:09:04 GMT",
"version": "v2"
},
{
"created": "Tue, 16 Jul 2024 02:10:46 GMT",
"version": "v3"
}
] | 2024-07-17 | [
[
"Wu",
"Yiming",
""
],
[
"Li",
"Ruixiang",
""
],
[
"Qin",
"Zequn",
""
],
[
"Zhao",
"Xinhai",
""
],
[
"Li",
"Xi",
""
]
] | Vision-based Bird's Eye View (BEV) representation is an emerging perception formulation for autonomous driving. The core challenge is to construct BEV space with multi-camera features, which is a one-to-many ill-posed problem. Diving into all previous BEV representation generation methods, we found that most of them fa... |
2309.11276 | Jun Zhang | Kuan Tian, Yonghang Guan, Jinxi Xiang, Jun Zhang, Xiao Han, Wei Yang | Towards Real-Time Neural Video Codec for Cross-Platform Application
Using Calibration Information | 14 pages | null | 10.1145/3581783.3611955 | null | cs.CV eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The state-of-the-art neural video codecs have outperformed the most
sophisticated traditional codecs in terms of RD performance in certain cases.
However, utilizing them for practical applications is still challenging for two
major reasons. 1) Cross-platform computational errors resulting from floating
point operatio... | [
{
"created": "Wed, 20 Sep 2023 13:01:15 GMT",
"version": "v1"
}
] | 2023-09-21 | [
[
"Tian",
"Kuan",
""
],
[
"Guan",
"Yonghang",
""
],
[
"Xiang",
"Jinxi",
""
],
[
"Zhang",
"Jun",
""
],
[
"Han",
"Xiao",
""
],
[
"Yang",
"Wei",
""
]
] | The state-of-the-art neural video codecs have outperformed the most sophisticated traditional codecs in terms of RD performance in certain cases. However, utilizing them for practical applications is still challenging for two major reasons. 1) Cross-platform computational errors resulting from floating point operations... |
1906.07029 | Jan Quenzel | Radu Alexandru Rosu and Jan Quenzel and Sven Behnke | Semi-Supervised Semantic Mapping through Label Propagation with Semantic
Texture Meshes | This is a pre-print of an article published in International Journal
of Computer Vision (IJCV, 2019) | null | 10.1007/s11263-019-01187-z | null | cs.CV cs.LG cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Scene understanding is an important capability for robots acting in
unstructured environments. While most SLAM approaches provide a geometrical
representation of the scene, a semantic map is necessary for more complex
interactions with the surroundings. Current methods treat the semantic map as
part of the geometry w... | [
{
"created": "Mon, 17 Jun 2019 13:36:21 GMT",
"version": "v1"
}
] | 2019-06-18 | [
[
"Rosu",
"Radu Alexandru",
""
],
[
"Quenzel",
"Jan",
""
],
[
"Behnke",
"Sven",
""
]
] | Scene understanding is an important capability for robots acting in unstructured environments. While most SLAM approaches provide a geometrical representation of the scene, a semantic map is necessary for more complex interactions with the surroundings. Current methods treat the semantic map as part of the geometry whi... |
2003.02287 | Thodoris Lykouris | Thodoris Lykouris, Vahab Mirrokni, Renato Paes Leme | Bandits with adversarial scaling | Appeared in ICML 2020 | null | null | null | cs.LG cs.GT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study "adversarial scaling", a multi-armed bandit model where rewards have
a stochastic and an adversarial component. Our model captures display
advertising where the "click-through-rate" can be decomposed to a (fixed across
time) arm-quality component and a non-stochastic user-relevance component
(fixed across ar... | [
{
"created": "Wed, 4 Mar 2020 19:03:23 GMT",
"version": "v1"
},
{
"created": "Sat, 29 Aug 2020 03:07:22 GMT",
"version": "v2"
}
] | 2020-09-01 | [
[
"Lykouris",
"Thodoris",
""
],
[
"Mirrokni",
"Vahab",
""
],
[
"Leme",
"Renato Paes",
""
]
] | We study "adversarial scaling", a multi-armed bandit model where rewards have a stochastic and an adversarial component. Our model captures display advertising where the "click-through-rate" can be decomposed to a (fixed across time) arm-quality component and a non-stochastic user-relevance component (fixed across arms... |
1707.08752 | EPTCS | Wesley H. Holliday (University of California, Berkeley), Thomas F.
Icard III (Stanford University) | Indicative Conditionals and Dynamic Epistemic Logic | In Proceedings TARK 2017, arXiv:1707.08250 | EPTCS 251, 2017, pp. 337-351 | 10.4204/EPTCS.251.24 | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent ideas about epistemic modals and indicative conditionals in formal
semantics have significant overlap with ideas in modal logic and dynamic
epistemic logic. The purpose of this paper is to show how greater interaction
between formal semantics and dynamic epistemic logic in this area can be of
mutual benefit. I... | [
{
"created": "Thu, 27 Jul 2017 07:51:12 GMT",
"version": "v1"
}
] | 2017-08-07 | [
[
"Holliday",
"Wesley H.",
"",
"University of California, Berkeley"
],
[
"Icard",
"Thomas F.",
"III",
"Stanford University"
]
] | Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal semantics and dynamic epistemic logic in this area can be of mutual benefit. In ... |
2307.09416 | Lorenzo Baraldi | Federico Betti, Jacopo Staiano, Lorenzo Baraldi, Lorenzo Baraldi, Rita
Cucchiara, Nicu Sebe | Let's ViCE! Mimicking Human Cognitive Behavior in Image Generation
Evaluation | Accepted as oral at ACM MultiMedia 2023 (Brave New Ideas track) | null | null | null | cs.CV cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Research in Image Generation has recently made significant progress,
particularly boosted by the introduction of Vision-Language models which are
able to produce high-quality visual content based on textual inputs. Despite
ongoing advancements in terms of generation quality and realism, no methodical
frameworks have ... | [
{
"created": "Tue, 18 Jul 2023 16:33:30 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Jul 2023 08:27:50 GMT",
"version": "v2"
}
] | 2023-07-20 | [
[
"Betti",
"Federico",
""
],
[
"Staiano",
"Jacopo",
""
],
[
"Baraldi",
"Lorenzo",
""
],
[
"Baraldi",
"Lorenzo",
""
],
[
"Cucchiara",
"Rita",
""
],
[
"Sebe",
"Nicu",
""
]
] | Research in Image Generation has recently made significant progress, particularly boosted by the introduction of Vision-Language models which are able to produce high-quality visual content based on textual inputs. Despite ongoing advancements in terms of generation quality and realism, no methodical frameworks have be... |
1709.02699 | Aditya Shukla | Aditya Shukla and Udayan Ganguly | An On-chip Trainable and Clock-less Spiking Neural Network with 1R
Memristive Synapses | null | null | 10.1109/TBCAS.2018.2831618 | null | cs.NE cs.ET | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spiking neural networks (SNNs) are being explored in an attempt to mimic
brain's capability to learn and recognize at low power. Crossbar architecture
with highly scalable Resistive RAM or RRAM array serving as synaptic weights
and neuronal drivers in the periphery is an attractive option for SNN.
Recognition (akin t... | [
{
"created": "Fri, 8 Sep 2017 13:38:44 GMT",
"version": "v1"
},
{
"created": "Fri, 3 Nov 2017 13:20:29 GMT",
"version": "v2"
}
] | 2018-08-08 | [
[
"Shukla",
"Aditya",
""
],
[
"Ganguly",
"Udayan",
""
]
] | Spiking neural networks (SNNs) are being explored in an attempt to mimic brain's capability to learn and recognize at low power. Crossbar architecture with highly scalable Resistive RAM or RRAM array serving as synaptic weights and neuronal drivers in the periphery is an attractive option for SNN. Recognition (akin to ... |
1601.03461 | Nasim Ferdosian | Nasim Ferdosian, Mohamed Othman, Borhanuddin Mohd Ali, Kweh Yeah Lun | Greedy-Knapsack Algorithm for Optimal Downlink Resource Allocation in
LTE Networks | Wireless Networks, 2015 | null | 10.1007/s11276-015-1042-9 | null | cs.NI cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Long Term Evolution (LTE) as a mobile broadband technology supports a
wide domain of communication services with different requirements. Therefore,
scheduling of all flows from various applications in overload states in which
the requested amount of bandwidth exceeds the limited available spectrum
resources is a ... | [
{
"created": "Thu, 14 Jan 2016 01:33:21 GMT",
"version": "v1"
}
] | 2016-01-15 | [
[
"Ferdosian",
"Nasim",
""
],
[
"Othman",
"Mohamed",
""
],
[
"Ali",
"Borhanuddin Mohd",
""
],
[
"Lun",
"Kweh Yeah",
""
]
] | The Long Term Evolution (LTE) as a mobile broadband technology supports a wide domain of communication services with different requirements. Therefore, scheduling of all flows from various applications in overload states in which the requested amount of bandwidth exceeds the limited available spectrum resources is a ch... |
2110.08378 | Jun Luo | Jun Luo, Shandong Wu | FedSLD: Federated Learning with Shared Label Distribution for Medical
Image Classification | 10 pages | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine learning in medical research, by nature, needs careful attention on
obeying the regulations of data privacy, making it difficult to train a machine
learning model over gathered data from different medical centers. Failure of
leveraging data of the same kind may result in poor generalizability for the
trained ... | [
{
"created": "Fri, 15 Oct 2021 21:38:25 GMT",
"version": "v1"
}
] | 2021-10-19 | [
[
"Luo",
"Jun",
""
],
[
"Wu",
"Shandong",
""
]
] | Machine learning in medical research, by nature, needs careful attention on obeying the regulations of data privacy, making it difficult to train a machine learning model over gathered data from different medical centers. Failure of leveraging data of the same kind may result in poor generalizability for the trained mo... |
1503.07463 | Alexander Barvinok | Alexander Barvinok | Computing the partition function of a polynomial on the Boolean cube | The final version of this paper is due to be published in the
collection of papers "A Journey through Discrete Mathematics. A Tribute to
Jiri Matousek" edited by Martin Loebl, Jaroslav Nesetril and Robin Thomas, to
be published by Springer | null | null | null | cs.DS math.CO math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For a polynomial f: {-1, 1}^n --> C, we define the partition function as the
average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is
a parameter. We present a quasi-polynomial algorithm, which, given such f,
lambda and epsilon >0 approximates the partition function within a relative
error of e... | [
{
"created": "Wed, 25 Mar 2015 17:08:37 GMT",
"version": "v1"
},
{
"created": "Tue, 19 May 2015 23:16:38 GMT",
"version": "v2"
},
{
"created": "Wed, 11 May 2016 18:18:29 GMT",
"version": "v3"
},
{
"created": "Tue, 29 Nov 2016 02:22:00 GMT",
"version": "v4"
}
] | 2016-11-30 | [
[
"Barvinok",
"Alexander",
""
]
] | For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda and epsilon >0 approximates the partition function within a relative error of eps... |
2310.15910 | Qinan Yu | Qinan Yu, Jack Merullo, Ellie Pavlick | Characterizing Mechanisms for Factual Recall in Language Models | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Language Models (LMs) often must integrate facts they memorized in
pretraining with new information that appears in a given context. These two
sources can disagree, causing competition within the model, and it is unclear
how an LM will resolve the conflict. On a dataset that queries for knowledge of
world capitals, w... | [
{
"created": "Tue, 24 Oct 2023 15:15:18 GMT",
"version": "v1"
}
] | 2023-10-25 | [
[
"Yu",
"Qinan",
""
],
[
"Merullo",
"Jack",
""
],
[
"Pavlick",
"Ellie",
""
]
] | Language Models (LMs) often must integrate facts they memorized in pretraining with new information that appears in a given context. These two sources can disagree, causing competition within the model, and it is unclear how an LM will resolve the conflict. On a dataset that queries for knowledge of world capitals, we ... |
2305.04926 | Amy Lin | Amy Lin, Jason Y. Zhang, Deva Ramanan, Shubham Tulsiani | RelPose++: Recovering 6D Poses from Sparse-view Observations | Project webpage: https://amyxlase.github.io/relpose-plus-plus
(Accepted to 3DV 2024) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the task of estimating 6D camera poses from sparse-view image sets
(2-8 images). This task is a vital pre-processing stage for nearly all
contemporary (neural) reconstruction algorithms but remains challenging given
sparse views, especially for objects with visual symmetries and texture-less
surfaces. We b... | [
{
"created": "Mon, 8 May 2023 17:59:58 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Dec 2023 15:49:22 GMT",
"version": "v2"
}
] | 2023-12-19 | [
[
"Lin",
"Amy",
""
],
[
"Zhang",
"Jason Y.",
""
],
[
"Ramanan",
"Deva",
""
],
[
"Tulsiani",
"Shubham",
""
]
] | We address the task of estimating 6D camera poses from sparse-view image sets (2-8 images). This task is a vital pre-processing stage for nearly all contemporary (neural) reconstruction algorithms but remains challenging given sparse views, especially for objects with visual symmetries and texture-less surfaces. We bui... |
2107.09443 | Christopher Rackauckas | Kirill Zubov, Zoe McCarthy, Yingbo Ma, Francesco Calisto, Valerio
Pagliarino, Simone Azeglio, Luca Bottero, Emmanuel Luj\'an, Valentin Sulzer,
Ashutosh Bharambe, Nand Vinchhi, Kaushik Balakrishnan, Devesh Upadhyay, Chris
Rackauckas | NeuralPDE: Automating Physics-Informed Neural Networks (PINNs) with
Error Approximations | 74 pages, 20+ figures, 20+ tables | null | null | null | cs.MS cs.SC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Physics-informed neural networks (PINNs) are an increasingly powerful way to
solve partial differential equations, generate digital twins, and create neural
surrogates of physical models. In this manuscript we detail the inner workings
of NeuralPDE.jl and show how a formulation structured around numerical
quadrature ... | [
{
"created": "Mon, 19 Jul 2021 12:38:31 GMT",
"version": "v1"
}
] | 2021-07-21 | [
[
"Zubov",
"Kirill",
""
],
[
"McCarthy",
"Zoe",
""
],
[
"Ma",
"Yingbo",
""
],
[
"Calisto",
"Francesco",
""
],
[
"Pagliarino",
"Valerio",
""
],
[
"Azeglio",
"Simone",
""
],
[
"Bottero",
"Luca",
""
],
[
... | Physics-informed neural networks (PINNs) are an increasingly powerful way to solve partial differential equations, generate digital twins, and create neural surrogates of physical models. In this manuscript we detail the inner workings of NeuralPDE.jl and show how a formulation structured around numerical quadrature gi... |
1905.08041 | Rui Portocarrero Sarmento MSc | Rui Portocarrero Sarmento | Inventory Management - A Case Study with NetLogo | null | null | null | null | cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-Agent Systems (MAS) have been applied to several areas or tasks ranging
from energy networks controlling to robot soccer teams. MAS are the ideal
solution when they provide decision support in situations where human decision
and actions are not feasible to operate the system in control and in real-time.
Thus, w... | [
{
"created": "Wed, 10 Apr 2019 09:33:03 GMT",
"version": "v1"
}
] | 2019-05-21 | [
[
"Sarmento",
"Rui Portocarrero",
""
]
] | Multi-Agent Systems (MAS) have been applied to several areas or tasks ranging from energy networks controlling to robot soccer teams. MAS are the ideal solution when they provide decision support in situations where human decision and actions are not feasible to operate the system in control and in real-time. Thus, we ... |
2304.12521 | Keunwoo Choi Mr | Keunwoo Choi, Jaekwon Im, Laurie Heller, Brian McFee, Keisuke Imoto,
Yuki Okamoto, Mathieu Lagrange, Shinosuke Takamichi | Foley Sound Synthesis at the DCASE 2023 Challenge | DCASE 2023 Challenge - Task 7 - Technical Report (Submitted to DCASE
2023 Workshop) | null | null | null | cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | The addition of Foley sound effects during post-production is a common
technique used to enhance the perceived acoustic properties of multimedia
content. Traditionally, Foley sound has been produced by human Foley artists,
which involves manual recording and mixing of sound. However, recent advances
in sound synthesi... | [
{
"created": "Tue, 25 Apr 2023 02:28:32 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Apr 2023 03:25:11 GMT",
"version": "v2"
},
{
"created": "Thu, 15 Jun 2023 04:35:03 GMT",
"version": "v3"
},
{
"created": "Thu, 28 Sep 2023 18:38:21 GMT",
"version": "v4"
}
] | 2023-10-02 | [
[
"Choi",
"Keunwoo",
""
],
[
"Im",
"Jaekwon",
""
],
[
"Heller",
"Laurie",
""
],
[
"McFee",
"Brian",
""
],
[
"Imoto",
"Keisuke",
""
],
[
"Okamoto",
"Yuki",
""
],
[
"Lagrange",
"Mathieu",
""
],
[
"Takam... | The addition of Foley sound effects during post-production is a common technique used to enhance the perceived acoustic properties of multimedia content. Traditionally, Foley sound has been produced by human Foley artists, which involves manual recording and mixing of sound. However, recent advances in sound synthesis ... |
2305.19497 | Keisuke Shirai | Keisuke Shirai, Hirotaka Kameko, Shinsuke Mori | Towards Flow Graph Prediction of Open-Domain Procedural Texts | RepL4NLP 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine comprehension of procedural texts is essential for reasoning about
the steps and automating the procedures. However, this requires identifying
entities within a text and resolving the relationships between the entities.
Previous work focused on the cooking domain and proposed a framework to convert
a recipe t... | [
{
"created": "Wed, 31 May 2023 02:15:15 GMT",
"version": "v1"
}
] | 2023-06-01 | [
[
"Shirai",
"Keisuke",
""
],
[
"Kameko",
"Hirotaka",
""
],
[
"Mori",
"Shinsuke",
""
]
] | Machine comprehension of procedural texts is essential for reasoning about the steps and automating the procedures. However, this requires identifying entities within a text and resolving the relationships between the entities. Previous work focused on the cooking domain and proposed a framework to convert a recipe tex... |
1204.2201 | Chris Thachuk | Anne Condon, J\'an Ma\v{n}uch and Chris Thachuk | The complexity of string partitioning | 14 pages main text + 13 pages appendix. Full version with proofs of
an article appearing in the Proceedings of the 23rd Annual Symposium on
Combinatorial Pattern Matching (CPM 2012), Helsinki, Finland, July 2012 | null | null | null | cs.CC cs.FL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a string $w$ over a finite alphabet $\Sigma$ and an integer $K$, can
$w$ be partitioned into strings of length at most $K$, such that there are no
\emph{collisions}? We refer to this question as the \emph{string partition}
problem and show it is \NP-complete for various definitions of collision and
for a number... | [
{
"created": "Tue, 10 Apr 2012 16:00:02 GMT",
"version": "v1"
}
] | 2012-04-11 | [
[
"Condon",
"Anne",
""
],
[
"Maňuch",
"Ján",
""
],
[
"Thachuk",
"Chris",
""
]
] | Given a string $w$ over a finite alphabet $\Sigma$ and an integer $K$, can $w$ be partitioned into strings of length at most $K$, such that there are no \emph{collisions}? We refer to this question as the \emph{string partition} problem and show it is \NP-complete for various definitions of collision and for a number o... |
1812.00877 | Glib Kechyn | Glib Kechyn | Automatic lesion boundary detection in dermoscopy | null | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This manuscript addresses the problem of the automatic lesion boundary
detection in dermoscopy, using deep neural networks. An approach is based on
the adaptation of the U-net convolutional neural network with skip connections
for lesion boundary segmentation task. I hope this paper could serve, to some
extent, as an... | [
{
"created": "Fri, 23 Nov 2018 22:36:36 GMT",
"version": "v1"
}
] | 2018-12-04 | [
[
"Kechyn",
"Glib",
""
]
] | This manuscript addresses the problem of the automatic lesion boundary detection in dermoscopy, using deep neural networks. An approach is based on the adaptation of the U-net convolutional neural network with skip connections for lesion boundary segmentation task. I hope this paper could serve, to some extent, as an e... |
2008.01323 | Pengqian Yu | Xinhan Di, Pengqian Yu, Hong Zhu, Lei Cai, Qiuyan Sheng, Changyu Sun | Structural Plan of Indoor Scenes with Personalized Preferences | Accepted by the 8th International Workshop on Assistive Computer
Vision and Robotics (ACVR) in Conjunction with ECCV 2020 | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose an assistive model that supports professional
interior designers to produce industrial interior decoration solutions and to
meet the personalized preferences of the property owners. The proposed model is
able to automatically produce the layout of objects of a particular indoor
scene accordi... | [
{
"created": "Tue, 4 Aug 2020 04:46:19 GMT",
"version": "v1"
},
{
"created": "Wed, 5 Aug 2020 13:30:45 GMT",
"version": "v2"
}
] | 2020-08-06 | [
[
"Di",
"Xinhan",
""
],
[
"Yu",
"Pengqian",
""
],
[
"Zhu",
"Hong",
""
],
[
"Cai",
"Lei",
""
],
[
"Sheng",
"Qiuyan",
""
],
[
"Sun",
"Changyu",
""
]
] | In this paper, we propose an assistive model that supports professional interior designers to produce industrial interior decoration solutions and to meet the personalized preferences of the property owners. The proposed model is able to automatically produce the layout of objects of a particular indoor scene according... |
1304.0589 | Meryem Kassou | Meryem Kassou and Laila Kjiri | A Goal Question Metric Approach for Evaluating Security in a Service
Oriented Architecture Context | 12 pages | IJCSI(International Journal of Computer Science Issues)Journal,
Volume 9, Issue 4, No 1, July 2012 | null | null | cs.SE cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For interactions to be possible within the Service Oriented Architecture
(SOA) ecosystem, each actor must be enough confident of other actors to engage
safely in the interactions. Therefore, the establishing of objective metrics
tailored to the context of SOA that show security of a system and lead to
enhancements is... | [
{
"created": "Tue, 2 Apr 2013 11:22:22 GMT",
"version": "v1"
}
] | 2013-04-03 | [
[
"Kassou",
"Meryem",
""
],
[
"Kjiri",
"Laila",
""
]
] | For interactions to be possible within the Service Oriented Architecture (SOA) ecosystem, each actor must be enough confident of other actors to engage safely in the interactions. Therefore, the establishing of objective metrics tailored to the context of SOA that show security of a system and lead to enhancements is v... |
1604.06976 | Mahyuddin K. M. Nasution | Mahyuddin K. M. Nasution | Extracted Social Network Mining | 6 pages. Proceeding of International Conference on Information
Technology and Engineering Application (5-th ICIBA), 86-91, February 19-20,
2016 | null | null | null | cs.SI cs.AI | http://creativecommons.org/publicdomain/zero/1.0/ | In this paper we study the relationship between the resources of social
networks by exploring the Web as big data based on a simple search engine. We
have used set theory by utilizing the occurrence and co-occurrence for defining
the singleton or doubleton spaces of event in a search engine model, and then
provided t... | [
{
"created": "Sun, 24 Apr 2016 02:39:16 GMT",
"version": "v1"
}
] | 2016-04-26 | [
[
"Nasution",
"Mahyuddin K. M.",
""
]
] | In this paper we study the relationship between the resources of social networks by exploring the Web as big data based on a simple search engine. We have used set theory by utilizing the occurrence and co-occurrence for defining the singleton or doubleton spaces of event in a search engine model, and then provided the... |
2007.04842 | Jim Mainprice | Jim Mainprice and Nathan Ratliff and Marc Toussaint and Stefan Schaal | An Interior Point Method Solving Motion Planning Problems with Narrow
Passages | IEEE RO-MAN 2020, 6 pages | null | null | null | cs.RO cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Algorithmic solutions for the motion planning problem have been investigated
for five decades. Since the development of A* in 1969 many approaches have been
investigated, traditionally classified as either grid decomposition, potential
fields or sampling-based. In this work, we focus on using numerical
optimization, ... | [
{
"created": "Thu, 9 Jul 2020 14:44:19 GMT",
"version": "v1"
},
{
"created": "Fri, 24 Jul 2020 15:49:53 GMT",
"version": "v2"
}
] | 2020-07-27 | [
[
"Mainprice",
"Jim",
""
],
[
"Ratliff",
"Nathan",
""
],
[
"Toussaint",
"Marc",
""
],
[
"Schaal",
"Stefan",
""
]
] | Algorithmic solutions for the motion planning problem have been investigated for five decades. Since the development of A* in 1969 many approaches have been investigated, traditionally classified as either grid decomposition, potential fields or sampling-based. In this work, we focus on using numerical optimization, wh... |
2406.08160 | Shoujie Li | Shoujie Li, Yan Huang, Changqing Guo, Tong Wu, Jiawei Zhang, Linrui
Zhang, Wenbo Ding | Chemistry3D: Robotic Interaction Benchmark for Chemistry Experiments | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The advent of simulation engines has revolutionized learning and operational
efficiency for robots, offering cost-effective and swift pipelines. However,
the lack of a universal simulation platform tailored for chemical scenarios
impedes progress in robotic manipulation and visualization of reaction
processes. Addres... | [
{
"created": "Wed, 12 Jun 2024 12:51:20 GMT",
"version": "v1"
}
] | 2024-06-13 | [
[
"Li",
"Shoujie",
""
],
[
"Huang",
"Yan",
""
],
[
"Guo",
"Changqing",
""
],
[
"Wu",
"Tong",
""
],
[
"Zhang",
"Jiawei",
""
],
[
"Zhang",
"Linrui",
""
],
[
"Ding",
"Wenbo",
""
]
] | The advent of simulation engines has revolutionized learning and operational efficiency for robots, offering cost-effective and swift pipelines. However, the lack of a universal simulation platform tailored for chemical scenarios impedes progress in robotic manipulation and visualization of reaction processes. Addressi... |
2303.03633 | Kazuma Kobayashi | Kazuma Kobayashi, Lin Gu, Ryuichiro Hataya, Takaaki Mizuno, Mototaka
Miyake, Hirokazu Watanabe, Masamichi Takahashi, Yasuyuki Takamizawa, Yukihiro
Yoshida, Satoshi Nakamura, Nobuji Kouno, Amina Bolatkan, Yusuke Kurose,
Tatsuya Harada, Ryuji Hamamoto | Sketch-based Medical Image Retrieval | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The amount of medical images stored in hospitals is increasing faster than
ever; however, utilizing the accumulated medical images has been limited. This
is because existing content-based medical image retrieval (CBMIR) systems
usually require example images to construct query vectors; nevertheless,
example images ca... | [
{
"created": "Tue, 7 Mar 2023 03:41:13 GMT",
"version": "v1"
}
] | 2023-03-08 | [
[
"Kobayashi",
"Kazuma",
""
],
[
"Gu",
"Lin",
""
],
[
"Hataya",
"Ryuichiro",
""
],
[
"Mizuno",
"Takaaki",
""
],
[
"Miyake",
"Mototaka",
""
],
[
"Watanabe",
"Hirokazu",
""
],
[
"Takahashi",
"Masamichi",
""
]... | The amount of medical images stored in hospitals is increasing faster than ever; however, utilizing the accumulated medical images has been limited. This is because existing content-based medical image retrieval (CBMIR) systems usually require example images to construct query vectors; nevertheless, example images cann... |
2205.06002 | Simon St{\aa}hlberg | Simon St{\aa}hlberg, Blai Bonet, Hector Geffner | Learning Generalized Policies Without Supervision Using GNNs | Proceedings of the 19th International Conference on Principles of
Knowledge Representation and Reasoning (KR-22) | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | We consider the problem of learning generalized policies for classical
planning domains using graph neural networks from small instances represented
in lifted STRIPS. The problem has been considered before but the proposed
neural architectures are complex and the results are often mixed. In this work,
we use a simple... | [
{
"created": "Thu, 12 May 2022 10:28:46 GMT",
"version": "v1"
}
] | 2022-05-13 | [
[
"Ståhlberg",
"Simon",
""
],
[
"Bonet",
"Blai",
""
],
[
"Geffner",
"Hector",
""
]
] | We consider the problem of learning generalized policies for classical planning domains using graph neural networks from small instances represented in lifted STRIPS. The problem has been considered before but the proposed neural architectures are complex and the results are often mixed. In this work, we use a simple a... |
2010.02686 | Aina Gar\'i Soler | Aina Gar\'i Soler, Marianna Apidianaki | BERT Knows Punta Cana is not just beautiful, it's gorgeous: Ranking
Scalar Adjectives with Contextualised Representations | EMNLP 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Adjectives like pretty, beautiful and gorgeous describe positive properties
of the nouns they modify but with different intensity. These differences are
important for natural language understanding and reasoning. We propose a novel
BERT-based approach to intensity detection for scalar adjectives. We model
intensity b... | [
{
"created": "Tue, 6 Oct 2020 13:05:47 GMT",
"version": "v1"
}
] | 2020-10-07 | [
[
"Soler",
"Aina Garí",
""
],
[
"Apidianaki",
"Marianna",
""
]
] | Adjectives like pretty, beautiful and gorgeous describe positive properties of the nouns they modify but with different intensity. These differences are important for natural language understanding and reasoning. We propose a novel BERT-based approach to intensity detection for scalar adjectives. We model intensity by ... |
2005.02605 | Hamed Nemati | Hamed Nemati | Secure System Virtualization: End-to-End Verification of Memory
Isolation | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Over the last years, security kernels have played a promising role in
reshaping the landscape of platform security on today's ubiquitous embedded
devices. Security kernels, such as separation kernels, enable constructing
high-assurance mixed-criticality execution platforms. They reduce the software
portion of the sys... | [
{
"created": "Wed, 6 May 2020 06:03:04 GMT",
"version": "v1"
}
] | 2020-05-07 | [
[
"Nemati",
"Hamed",
""
]
] | Over the last years, security kernels have played a promising role in reshaping the landscape of platform security on today's ubiquitous embedded devices. Security kernels, such as separation kernels, enable constructing high-assurance mixed-criticality execution platforms. They reduce the software portion of the syste... |
2009.05257 | Charlene Yang | Charlene Yang, Yunsong Wang, Steven Farrell, Thorsten Kurth, Samuel
Williams | Hierarchical Roofline Performance Analysis for Deep Learning
Applications | 9 pages | null | null | null | cs.DC cs.LG cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a practical methodology for collecting performance data
necessary to conduct hierarchical Roofline analysis on NVIDIA GPUs. It
discusses the extension of the Empirical Roofline Toolkit for broader support
of a range of data precisions and Tensor Core support and introduces a Nsight
Compute based m... | [
{
"created": "Fri, 11 Sep 2020 07:16:55 GMT",
"version": "v1"
},
{
"created": "Wed, 16 Sep 2020 07:14:16 GMT",
"version": "v2"
},
{
"created": "Tue, 22 Sep 2020 21:57:58 GMT",
"version": "v3"
},
{
"created": "Wed, 25 Nov 2020 02:52:41 GMT",
"version": "v4"
}
] | 2020-11-26 | [
[
"Yang",
"Charlene",
""
],
[
"Wang",
"Yunsong",
""
],
[
"Farrell",
"Steven",
""
],
[
"Kurth",
"Thorsten",
""
],
[
"Williams",
"Samuel",
""
]
] | This paper presents a practical methodology for collecting performance data necessary to conduct hierarchical Roofline analysis on NVIDIA GPUs. It discusses the extension of the Empirical Roofline Toolkit for broader support of a range of data precisions and Tensor Core support and introduces a Nsight Compute based met... |
2205.10226 | Oliver Eberle | Stephanie Brandl, Oliver Eberle, Jonas Pilot, Anders S{\o}gaard | Do Transformer Models Show Similar Attention Patterns to Task-Specific
Human Gaze? | Accepted to ACL 2022 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Learned self-attention functions in state-of-the-art NLP models often
correlate with human attention. We investigate whether self-attention in
large-scale pre-trained language models is as predictive of human eye fixation
patterns during task-reading as classical cognitive models of human attention.
We compare attent... | [
{
"created": "Mon, 25 Apr 2022 08:23:13 GMT",
"version": "v1"
}
] | 2022-05-23 | [
[
"Brandl",
"Stephanie",
""
],
[
"Eberle",
"Oliver",
""
],
[
"Pilot",
"Jonas",
""
],
[
"Søgaard",
"Anders",
""
]
] | Learned self-attention functions in state-of-the-art NLP models often correlate with human attention. We investigate whether self-attention in large-scale pre-trained language models is as predictive of human eye fixation patterns during task-reading as classical cognitive models of human attention. We compare attentio... |
1801.05574 | Ying Lu | Ying Lu, Liming Chen, Alexandre Saidi, Xianfeng Gu | Brenier approach for optimal transportation between a quasi-discrete
measure and a discrete measure | null | null | null | null | cs.CV cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Correctly estimating the discrepancy between two data distributions has
always been an important task in Machine Learning. Recently, Cuturi proposed
the Sinkhorn distance which makes use of an approximate Optimal Transport cost
between two distributions as a distance to describe distribution discrepancy.
Although it ... | [
{
"created": "Wed, 17 Jan 2018 07:06:21 GMT",
"version": "v1"
}
] | 2018-01-18 | [
[
"Lu",
"Ying",
""
],
[
"Chen",
"Liming",
""
],
[
"Saidi",
"Alexandre",
""
],
[
"Gu",
"Xianfeng",
""
]
] | Correctly estimating the discrepancy between two data distributions has always been an important task in Machine Learning. Recently, Cuturi proposed the Sinkhorn distance which makes use of an approximate Optimal Transport cost between two distributions as a distance to describe distribution discrepancy. Although it ha... |
2204.07454 | Nikolai Kudasov | Nikolai Kudasov and Violetta Sim | Formalizing $\varphi$-calculus: a purely object-oriented calculus of
decorated objects | null | null | null | null | cs.PL cs.LO | http://creativecommons.org/licenses/by/4.0/ | Many calculi exist for modelling various features of object-oriented
languages. Many of them are based on $\lambda$-calculus and focus either on
statically typed class-based languages or dynamic prototype-based languages. We
formalize untyped calculus of decorated objects, informally presented by
Bugayenko, which is ... | [
{
"created": "Fri, 15 Apr 2022 13:25:01 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Dec 2022 10:55:15 GMT",
"version": "v2"
}
] | 2022-12-05 | [
[
"Kudasov",
"Nikolai",
""
],
[
"Sim",
"Violetta",
""
]
] | Many calculi exist for modelling various features of object-oriented languages. Many of them are based on $\lambda$-calculus and focus either on statically typed class-based languages or dynamic prototype-based languages. We formalize untyped calculus of decorated objects, informally presented by Bugayenko, which is de... |
2407.05293 | Xiaoling Hu | Xiaowei Qian, Xiaoling Hu, Chenxi Liu, Mugen Peng | Wideband Beamforming with RIS: A Unified Framework via Space-Frequency
Transformation | 13 pages, 16 figures | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The spectrum shift from the sub-6G band to the high-frequency band has posed
an ever-increasing demand on the paradigm shift from narrowband beamforming to
wideband beamforming. Despite recent research efforts, the problem of wideband
beamforming design is particularly challenging in reconfigurable intelligent
surfac... | [
{
"created": "Sun, 7 Jul 2024 07:23:22 GMT",
"version": "v1"
}
] | 2024-07-09 | [
[
"Qian",
"Xiaowei",
""
],
[
"Hu",
"Xiaoling",
""
],
[
"Liu",
"Chenxi",
""
],
[
"Peng",
"Mugen",
""
]
] | The spectrum shift from the sub-6G band to the high-frequency band has posed an ever-increasing demand on the paradigm shift from narrowband beamforming to wideband beamforming. Despite recent research efforts, the problem of wideband beamforming design is particularly challenging in reconfigurable intelligent surface ... |
2002.04397 | Yuxiang Ren | Yuxiang Ren, Jiawei Zhang | Fake News Detection on News-Oriented Heterogeneous Information Networks
through Hierarchical Graph Attention | null | null | null | null | cs.SI cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The viral spread of fake news has caused great social harm, making fake news
detection an urgent task. Current fake news detection methods rely heavily on
text information by learning the extracted news content or writing style of
internal knowledge. However, deliberate rumors can mask writing style,
bypassing langua... | [
{
"created": "Wed, 5 Feb 2020 19:09:13 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Feb 2021 03:16:22 GMT",
"version": "v2"
}
] | 2021-02-16 | [
[
"Ren",
"Yuxiang",
""
],
[
"Zhang",
"Jiawei",
""
]
] | The viral spread of fake news has caused great social harm, making fake news detection an urgent task. Current fake news detection methods rely heavily on text information by learning the extracted news content or writing style of internal knowledge. However, deliberate rumors can mask writing style, bypassing language... |
2404.17017 | Jeremy Harper | Jeremy Harper | AutoGenesisAgent: Self-Generating Multi-Agent Systems for Complex Tasks | null | null | null | null | cs.MA | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The proliferation of large language models (LLMs) and their integration into
multi-agent systems has paved the way for sophisticated automation in various
domains. This paper introduces AutoGenesisAgent, a multi-agent system that
autonomously designs and deploys other multi-agent systems tailored for
specific tasks. ... | [
{
"created": "Thu, 25 Apr 2024 20:20:51 GMT",
"version": "v1"
}
] | 2024-04-29 | [
[
"Harper",
"Jeremy",
""
]
] | The proliferation of large language models (LLMs) and their integration into multi-agent systems has paved the way for sophisticated automation in various domains. This paper introduces AutoGenesisAgent, a multi-agent system that autonomously designs and deploys other multi-agent systems tailored for specific tasks. Au... |
2012.02453 | Samhita Varambally | B. Samhita Varambally, Naman Sehgal | Optimising Design Verification Using Machine Learning: An Open Source
Solution | null | null | null | null | cs.LG cs.AR | http://creativecommons.org/licenses/by-nc-sa/4.0/ | With the complexity of Integrated Circuits increasing, design verification
has become the most time consuming part of the ASIC design flow. Nearly 70% of
the SoC design cycle is consumed by verification. The most commonly used
approach to test all corner cases is through the use of Constrained Random
Verification. Ra... | [
{
"created": "Fri, 4 Dec 2020 08:18:05 GMT",
"version": "v1"
}
] | 2020-12-07 | [
[
"Varambally",
"B. Samhita",
""
],
[
"Sehgal",
"Naman",
""
]
] | With the complexity of Integrated Circuits increasing, design verification has become the most time consuming part of the ASIC design flow. Nearly 70% of the SoC design cycle is consumed by verification. The most commonly used approach to test all corner cases is through the use of Constrained Random Verification. Rand... |
2202.00537 | Yuan Wu | Yuan Wu, Diana Inkpen, Ahmed El-Roby | Maximum Batch Frobenius Norm for Multi-Domain Text Classification | 5 pages, ICASSP 2022 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-domain text classification (MDTC) has obtained remarkable achievements
due to the advent of deep learning. Recently, many endeavors are devoted to
applying adversarial learning to extract domain-invariant features to yield
state-of-the-art results. However, these methods still face one challenge:
transforming o... | [
{
"created": "Sat, 29 Jan 2022 14:37:56 GMT",
"version": "v1"
}
] | 2022-02-02 | [
[
"Wu",
"Yuan",
""
],
[
"Inkpen",
"Diana",
""
],
[
"El-Roby",
"Ahmed",
""
]
] | Multi-domain text classification (MDTC) has obtained remarkable achievements due to the advent of deep learning. Recently, many endeavors are devoted to applying adversarial learning to extract domain-invariant features to yield state-of-the-art results. However, these methods still face one challenge: transforming ori... |
1508.05488 | Gang Mei | Gang Mei | CudaChain: A Practical GPU-accelerated 2D Convex Hull Algorithm | null | SpringerPlus 2016:2284 | 10.1186/s40064-016-2284-4 | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a practical GPU-accelerated convex hull algorithm and a
novel Sorting-based Preprocessing Approach (SPA) for planar point sets. The
proposed algorithm consists of two stages: (1) two rounds of preprocessing
performed on the GPU and (2) the finalization of calculating the expected
convex hull on th... | [
{
"created": "Sat, 22 Aug 2015 09:32:11 GMT",
"version": "v1"
}
] | 2016-05-24 | [
[
"Mei",
"Gang",
""
]
] | This paper presents a practical GPU-accelerated convex hull algorithm and a novel Sorting-based Preprocessing Approach (SPA) for planar point sets. The proposed algorithm consists of two stages: (1) two rounds of preprocessing performed on the GPU and (2) the finalization of calculating the expected convex hull on the ... |
2210.07453 | Jonathan Pilault | Jonathan Pilault, Michael Galkin, Bahare Fatemi, Perouz Taslakian,
David Vasquez, Christopher Pal | Using Graph Algorithms to Pretrain Graph Completion Transformers | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Recent work on Graph Neural Networks has demonstrated that self-supervised
pretraining can further enhance performance on downstream graph, link, and node
classification tasks. However, the efficacy of pretraining tasks has not been
fully investigated for downstream large knowledge graph completion tasks. Using
a con... | [
{
"created": "Fri, 14 Oct 2022 01:41:10 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Mar 2023 15:04:30 GMT",
"version": "v2"
}
] | 2023-03-28 | [
[
"Pilault",
"Jonathan",
""
],
[
"Galkin",
"Michael",
""
],
[
"Fatemi",
"Bahare",
""
],
[
"Taslakian",
"Perouz",
""
],
[
"Vasquez",
"David",
""
],
[
"Pal",
"Christopher",
""
]
] | Recent work on Graph Neural Networks has demonstrated that self-supervised pretraining can further enhance performance on downstream graph, link, and node classification tasks. However, the efficacy of pretraining tasks has not been fully investigated for downstream large knowledge graph completion tasks. Using a conte... |
1912.00320 | Dongrui Wu | Wen Zhang and Dongrui Wu | Discriminative Joint Probability Maximum Mean Discrepancy (DJP-MMD) for
Domain Adaptation | Int'l Joint Conf. on Neural Networks (IJCNN), Glasgow, UK, July 2020 | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Maximum mean discrepancy (MMD) has been widely adopted in domain adaptation
to measure the discrepancy between the source and target domain distributions.
Many existing domain adaptation approaches are based on the joint MMD, which is
computed as the (weighted) sum of the marginal distribution discrepancy and the
con... | [
{
"created": "Sun, 1 Dec 2019 04:52:41 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Jan 2020 19:47:44 GMT",
"version": "v2"
},
{
"created": "Thu, 26 Mar 2020 08:04:37 GMT",
"version": "v3"
},
{
"created": "Fri, 10 Apr 2020 15:13:57 GMT",
"version": "v4"
}
] | 2020-04-13 | [
[
"Zhang",
"Wen",
""
],
[
"Wu",
"Dongrui",
""
]
] | Maximum mean discrepancy (MMD) has been widely adopted in domain adaptation to measure the discrepancy between the source and target domain distributions. Many existing domain adaptation approaches are based on the joint MMD, which is computed as the (weighted) sum of the marginal distribution discrepancy and the condi... |
1708.07810 | I\~naki Esnaola | Ke Sun, Inaki Esnaola, Samir M. Perlaza and H. Vincent Poor | Information-Theoretic Attacks in the Smart Grid | 2017 IEEE International Conference on Smart Grid Communications
(SmartGridComm) | in Proc. IEEE Int. Conf. on Smart Grid Commun., Dresden, Germany,
Oct. 2017, pp. 455-460 | null | null | cs.IT cs.SY math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Gaussian random attacks that jointly minimize the amount of information
obtained by the operator from the grid and the probability of attack detection
are presented. The construction of the attack is posed as an optimization
problem with a utility function that captures two effects: firstly, minimizing
the mutual inf... | [
{
"created": "Fri, 25 Aug 2017 17:03:10 GMT",
"version": "v1"
}
] | 2020-04-08 | [
[
"Sun",
"Ke",
""
],
[
"Esnaola",
"Inaki",
""
],
[
"Perlaza",
"Samir M.",
""
],
[
"Poor",
"H. Vincent",
""
]
] | Gaussian random attacks that jointly minimize the amount of information obtained by the operator from the grid and the probability of attack detection are presented. The construction of the attack is posed as an optimization problem with a utility function that captures two effects: firstly, minimizing the mutual infor... |
2407.14302 | Yurong Zhang | Yurong Zhang, Honghao Chen, Xinyu Zhang, Xiangxiang Chu, Li Song | Dyn-Adapter: Towards Disentangled Representation for Efficient Visual
Recognition | ECCV 2024 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Parameter-efficient transfer learning (PETL) is a promising task, aiming to
adapt the large-scale pre-trained model to downstream tasks with a relatively
modest cost. However, current PETL methods struggle in compressing
computational complexity and bear a heavy inference burden due to the complete
forward process. T... | [
{
"created": "Fri, 19 Jul 2024 13:33:38 GMT",
"version": "v1"
},
{
"created": "Tue, 23 Jul 2024 07:57:17 GMT",
"version": "v2"
}
] | 2024-07-24 | [
[
"Zhang",
"Yurong",
""
],
[
"Chen",
"Honghao",
""
],
[
"Zhang",
"Xinyu",
""
],
[
"Chu",
"Xiangxiang",
""
],
[
"Song",
"Li",
""
]
] | Parameter-efficient transfer learning (PETL) is a promising task, aiming to adapt the large-scale pre-trained model to downstream tasks with a relatively modest cost. However, current PETL methods struggle in compressing computational complexity and bear a heavy inference burden due to the complete forward process. Thi... |
2210.04150 | Feng Liang | Feng Liang, Bichen Wu, Xiaoliang Dai, Kunpeng Li, Yinan Zhao, Hang
Zhang, Peizhao Zhang, Peter Vajda, Diana Marculescu | Open-Vocabulary Semantic Segmentation with Mask-adapted CLIP | CVPR 2023. Project page: https://jeff-liangf.github.io/projects/ovseg | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Open-vocabulary semantic segmentation aims to segment an image into semantic
regions according to text descriptions, which may not have been seen during
training. Recent two-stage methods first generate class-agnostic mask proposals
and then leverage pre-trained vision-language models, e.g., CLIP, to classify
masked ... | [
{
"created": "Sun, 9 Oct 2022 02:57:32 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Mar 2023 02:48:42 GMT",
"version": "v2"
},
{
"created": "Sat, 1 Apr 2023 19:00:47 GMT",
"version": "v3"
}
] | 2023-04-04 | [
[
"Liang",
"Feng",
""
],
[
"Wu",
"Bichen",
""
],
[
"Dai",
"Xiaoliang",
""
],
[
"Li",
"Kunpeng",
""
],
[
"Zhao",
"Yinan",
""
],
[
"Zhang",
"Hang",
""
],
[
"Zhang",
"Peizhao",
""
],
[
"Vajda",
"Pete... | Open-vocabulary semantic segmentation aims to segment an image into semantic regions according to text descriptions, which may not have been seen during training. Recent two-stage methods first generate class-agnostic mask proposals and then leverage pre-trained vision-language models, e.g., CLIP, to classify masked re... |
2012.14456 | Shiv Ram Dubey | Jayendra Kantipudi, Shiv Ram Dubey, Soumendu Chakraborty | Color Channel Perturbation Attacks for Fooling Convolutional Neural
Networks and A Defense Against Such Attacks | Accepted in IEEE Transactions on Artificial Intelligence | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Convolutional Neural Networks (CNNs) have emerged as a very powerful data
dependent hierarchical feature extraction method. It is widely used in several
computer vision problems. The CNNs learn the important visual features from
training samples automatically. It is observed that the network overfits the
training... | [
{
"created": "Sun, 20 Dec 2020 11:35:29 GMT",
"version": "v1"
}
] | 2021-01-01 | [
[
"Kantipudi",
"Jayendra",
""
],
[
"Dubey",
"Shiv Ram",
""
],
[
"Chakraborty",
"Soumendu",
""
]
] | The Convolutional Neural Networks (CNNs) have emerged as a very powerful data dependent hierarchical feature extraction method. It is widely used in several computer vision problems. The CNNs learn the important visual features from training samples automatically. It is observed that the network overfits the training s... |
2007.11643 | Andrej Sajenko | Frank Kammer and Andrej Sajenko | Space-Efficient Graph Kernelizations | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $n$ be the size of a parameterized problem and $k$ the parameter. We
present kernels for Feedback Vertex Set, Path Contraction and Cluster
Editing/Deletion whose sizes are all polynomial in $k$ and that are computable
in polynomial time and with $O(\rm{poly}(k) \log n)$ bits (of working memory).
By using kernel c... | [
{
"created": "Wed, 22 Jul 2020 19:39:05 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Mar 2021 11:09:09 GMT",
"version": "v2"
},
{
"created": "Tue, 12 Sep 2023 17:51:12 GMT",
"version": "v3"
},
{
"created": "Tue, 20 Feb 2024 15:43:26 GMT",
"version": "v4"
}
] | 2024-02-21 | [
[
"Kammer",
"Frank",
""
],
[
"Sajenko",
"Andrej",
""
]
] | Let $n$ be the size of a parameterized problem and $k$ the parameter. We present kernels for Feedback Vertex Set, Path Contraction and Cluster Editing/Deletion whose sizes are all polynomial in $k$ and that are computable in polynomial time and with $O(\rm{poly}(k) \log n)$ bits (of working memory). By using kernel cas... |
2005.06123 | Ming-Chang Chiu | Ming-Chang Chiu, Tiantian Feng, Xiang Ren, Shrikanth Narayanan | Screenplay Quality Assessment: Can We Predict Who Gets Nominated? | 4 pages, 3 figures, accepted to ACL NUSE workshop 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deciding which scripts to turn into movies is a costly and time-consuming
process for filmmakers. Thus, building a tool to aid script selection, an
initial phase in movie production, can be very beneficial. Toward that goal, in
this work, we present a method to evaluate the quality of a screenplay based on
linguistic... | [
{
"created": "Wed, 13 May 2020 02:39:56 GMT",
"version": "v1"
}
] | 2020-05-14 | [
[
"Chiu",
"Ming-Chang",
""
],
[
"Feng",
"Tiantian",
""
],
[
"Ren",
"Xiang",
""
],
[
"Narayanan",
"Shrikanth",
""
]
] | Deciding which scripts to turn into movies is a costly and time-consuming process for filmmakers. Thus, building a tool to aid script selection, an initial phase in movie production, can be very beneficial. Toward that goal, in this work, we present a method to evaluate the quality of a screenplay based on linguistic c... |
1703.07952 | Fei Wen | Fei Wen, Yuan Yang, Ling Pei, Wenxian Yu, and Peilin Liu | Efficient and Robust Recovery of Sparse Signal and Image Using
Generalized Nonconvex Regularization | 13 pages, 5 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work addresses the robust reconstruction problem of a sparse signal from
compressed measurements. We propose a robust formulation for sparse
reconstruction which employs the $\ell_1$-norm as the loss function for the
residual error and utilizes a generalized nonconvex penalty for sparsity
inducing. The $\ell_1$-... | [
{
"created": "Thu, 23 Mar 2017 07:36:45 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Mar 2017 08:39:43 GMT",
"version": "v2"
}
] | 2017-03-30 | [
[
"Wen",
"Fei",
""
],
[
"Yang",
"Yuan",
""
],
[
"Pei",
"Ling",
""
],
[
"Yu",
"Wenxian",
""
],
[
"Liu",
"Peilin",
""
]
] | This work addresses the robust reconstruction problem of a sparse signal from compressed measurements. We propose a robust formulation for sparse reconstruction which employs the $\ell_1$-norm as the loss function for the residual error and utilizes a generalized nonconvex penalty for sparsity inducing. The $\ell_1$-lo... |
2012.01925 | Tatiana L\'opez-Guevara | Tatiana Lopez-Guevara, Michael Burke, Nicholas K. Taylor, Kartic Subr | IV-Posterior: Inverse Value Estimation for Interpretable Policy
Certificates | null | null | null | null | cs.LG cs.AI cs.RO | http://creativecommons.org/licenses/by/4.0/ | Model-free reinforcement learning (RL) is a powerful tool to learn a broad
range of robot skills and policies. However, a lack of policy interpretability
can inhibit their successful deployment in downstream applications,
particularly when differences in environmental conditions may result in
unpredictable behaviour ... | [
{
"created": "Mon, 30 Nov 2020 21:45:49 GMT",
"version": "v1"
}
] | 2020-12-04 | [
[
"Lopez-Guevara",
"Tatiana",
""
],
[
"Burke",
"Michael",
""
],
[
"Taylor",
"Nicholas K.",
""
],
[
"Subr",
"Kartic",
""
]
] | Model-free reinforcement learning (RL) is a powerful tool to learn a broad range of robot skills and policies. However, a lack of policy interpretability can inhibit their successful deployment in downstream applications, particularly when differences in environmental conditions may result in unpredictable behaviour or... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.