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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2108.12363 | Zohreh Shaghaghian | Fatemeh Shahsavari, Zohreh Shaghaghian | Application of Classification and Feature Selection in Building Energy
Simulations | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Building energy performance is one of the key features in performance-based
building design decision making. Building envelope materials can play a key
role in improving building energy performance. The thermal properties of
building materials determine the level of heat transfer through building
envelope, thus the a... | [
{
"created": "Fri, 27 Aug 2021 15:55:00 GMT",
"version": "v1"
}
] | 2021-08-30 | [
[
"Shahsavari",
"Fatemeh",
""
],
[
"Shaghaghian",
"Zohreh",
""
]
] | Building energy performance is one of the key features in performance-based building design decision making. Building envelope materials can play a key role in improving building energy performance. The thermal properties of building materials determine the level of heat transfer through building envelope, thus the ann... |
1909.13873 | Zhuqing Jia | Zhuqing Jia and Syed A. Jafar | Cross Subspace Alignment Codes for Coded Distributed Batch Computation | Improved recovery threshold for GCSA codes and added discussion of
server latency constraints | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Coded distributed batch computation distributes a computation task, such as
matrix multiplication, $N$-linear computation, or multivariate polynomial
evaluation, across $S$ servers through a coding scheme, such that the response
from any $R$ servers ($R$ is called the recovery threshold) is sufficient for
the user to... | [
{
"created": "Mon, 30 Sep 2019 17:54:53 GMT",
"version": "v1"
},
{
"created": "Sun, 27 Oct 2019 19:30:28 GMT",
"version": "v2"
},
{
"created": "Fri, 15 Nov 2019 00:15:34 GMT",
"version": "v3"
}
] | 2019-11-18 | [
[
"Jia",
"Zhuqing",
""
],
[
"Jafar",
"Syed A.",
""
]
] | Coded distributed batch computation distributes a computation task, such as matrix multiplication, $N$-linear computation, or multivariate polynomial evaluation, across $S$ servers through a coding scheme, such that the response from any $R$ servers ($R$ is called the recovery threshold) is sufficient for the user to r... |
2011.09315 | Peng Gao | Minghang Zheng, Peng Gao, Renrui Zhang, Kunchang Li, Xiaogang Wang,
Hongsheng Li, Hao Dong | End-to-End Object Detection with Adaptive Clustering Transformer | BMVC 2021 Oral | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | End-to-end Object Detection with Transformer (DETR)proposes to perform object
detection with Transformer and achieve comparable performance with two-stage
object detection like Faster-RCNN. However, DETR needs huge computational
resources for training and inference due to the high-resolution spatial input.
In this pa... | [
{
"created": "Wed, 18 Nov 2020 14:36:37 GMT",
"version": "v1"
},
{
"created": "Mon, 18 Oct 2021 07:15:55 GMT",
"version": "v2"
}
] | 2021-10-19 | [
[
"Zheng",
"Minghang",
""
],
[
"Gao",
"Peng",
""
],
[
"Zhang",
"Renrui",
""
],
[
"Li",
"Kunchang",
""
],
[
"Wang",
"Xiaogang",
""
],
[
"Li",
"Hongsheng",
""
],
[
"Dong",
"Hao",
""
]
] | End-to-end Object Detection with Transformer (DETR)proposes to perform object detection with Transformer and achieve comparable performance with two-stage object detection like Faster-RCNN. However, DETR needs huge computational resources for training and inference due to the high-resolution spatial input. In this pape... |
2004.08546 | Chaoyang He | Chaoyang He, Murali Annavaram, Salman Avestimehr | Towards Non-I.I.D. and Invisible Data with FedNAS: Federated Deep
Learning via Neural Architecture Search | accepted to CVPR 2020 workshop on neural architecture search and
beyond for representation learning. Code is released at https://fedml.ai | null | null | null | cs.LG cs.CV cs.DC cs.MA stat.ML | http://creativecommons.org/licenses/by/4.0/ | Federated Learning (FL) has been proved to be an effective learning framework
when data cannot be centralized due to privacy, communication costs, and
regulatory restrictions. When training deep learning models under an FL
setting, people employ the predefined model architecture discovered in the
centralized environm... | [
{
"created": "Sat, 18 Apr 2020 08:04:44 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Jul 2020 23:59:20 GMT",
"version": "v2"
},
{
"created": "Mon, 2 Nov 2020 18:47:25 GMT",
"version": "v3"
},
{
"created": "Mon, 4 Jan 2021 02:18:08 GMT",
"version": "v4"
}
] | 2021-01-05 | [
[
"He",
"Chaoyang",
""
],
[
"Annavaram",
"Murali",
""
],
[
"Avestimehr",
"Salman",
""
]
] | Federated Learning (FL) has been proved to be an effective learning framework when data cannot be centralized due to privacy, communication costs, and regulatory restrictions. When training deep learning models under an FL setting, people employ the predefined model architecture discovered in the centralized environmen... |
1410.1127 | Xianwen Wang | Xianwen Wang, Shenmeng Xu, Zhi Wang, Lian Peng, Chuanli Wang | International Scientific Collaboration of China: Collaborating
Countries, Institutions and Individuals | 11 pages,3 figures | Scientometrics 95.3 (2013): 885-894 | 10.1007/s11192-012-0877-4 | null | cs.DL physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Using bibliometric methods, we investigate China's international scientific
collaboration from 3 levels of collaborating countries, institutions and
individuals. We design a database in SQL Server, and make analysis of Chinese
SCI papers based on the corresponding author field. We find that China's
international scie... | [
{
"created": "Sun, 5 Oct 2014 06:41:02 GMT",
"version": "v1"
}
] | 2014-10-07 | [
[
"Wang",
"Xianwen",
""
],
[
"Xu",
"Shenmeng",
""
],
[
"Wang",
"Zhi",
""
],
[
"Peng",
"Lian",
""
],
[
"Wang",
"Chuanli",
""
]
] | Using bibliometric methods, we investigate China's international scientific collaboration from 3 levels of collaborating countries, institutions and individuals. We design a database in SQL Server, and make analysis of Chinese SCI papers based on the corresponding author field. We find that China's international scient... |
1901.10773 | Thorsten Wissmann | J\"org Endrullis, Jan Willem Klop, Roy Overbeek | Decreasing Diagrams for Confluence and Commutation | null | Logical Methods in Computer Science, Volume 16, Issue 1 (February
20, 2020) lmcs:5145 | 10.23638/LMCS-16(1:23)2020 | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | Like termination, confluence is a central property of rewrite systems. Unlike
for termination, however, there exists no known complexity hierarchy for
confluence. In this paper we investigate whether the decreasing diagrams
technique can be used to obtain such a hierarchy. The decreasing diagrams
technique is one of ... | [
{
"created": "Wed, 30 Jan 2019 11:43:20 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Jul 2019 21:59:33 GMT",
"version": "v2"
},
{
"created": "Fri, 18 Oct 2019 12:42:15 GMT",
"version": "v3"
},
{
"created": "Wed, 19 Feb 2020 15:00:24 GMT",
"version": "v4"
}
] | 2023-06-22 | [
[
"Endrullis",
"Jörg",
""
],
[
"Klop",
"Jan Willem",
""
],
[
"Overbeek",
"Roy",
""
]
] | Like termination, confluence is a central property of rewrite systems. Unlike for termination, however, there exists no known complexity hierarchy for confluence. In this paper we investigate whether the decreasing diagrams technique can be used to obtain such a hierarchy. The decreasing diagrams technique is one of th... |
1901.04623 | Rafael Felix | Rafael Felix and Michele Sasdelli and Ian Reid and Gustavo Carneiro | Multi-modal Ensemble Classification for Generalized Zero Shot Learning | 10 pages, 3 Figures, 4 Tables | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Generalized zero shot learning (GZSL) is defined by a training process
containing a set of visual samples from seen classes and a set of semantic
samples from seen and unseen classes, while the testing process consists of the
classification of visual samples from seen and unseen classes. Current
approaches are based ... | [
{
"created": "Tue, 15 Jan 2019 00:50:58 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Feb 2019 03:55:33 GMT",
"version": "v2"
}
] | 2019-02-07 | [
[
"Felix",
"Rafael",
""
],
[
"Sasdelli",
"Michele",
""
],
[
"Reid",
"Ian",
""
],
[
"Carneiro",
"Gustavo",
""
]
] | Generalized zero shot learning (GZSL) is defined by a training process containing a set of visual samples from seen classes and a set of semantic samples from seen and unseen classes, while the testing process consists of the classification of visual samples from seen and unseen classes. Current approaches are based on... |
1501.01728 | Yong Zeng | Yong Zeng and Rui Zhang | Optimized Training for Net Energy Maximization in Multi-Antenna Wireless
Energy Transfer over Frequency-Selective Channel | to appear in IEEE Transactions on Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies the training design problem for multiple-input
single-output (MISO) wireless energy transfer (WET) systems in
frequency-selective channels, where the frequency-diversity and
energy-beamforming gains can be both reaped to maximize the transferred energy
by efficiently learning the channel state info... | [
{
"created": "Thu, 8 Jan 2015 04:41:23 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Apr 2015 16:51:49 GMT",
"version": "v2"
}
] | 2015-04-15 | [
[
"Zeng",
"Yong",
""
],
[
"Zhang",
"Rui",
""
]
] | This paper studies the training design problem for multiple-input single-output (MISO) wireless energy transfer (WET) systems in frequency-selective channels, where the frequency-diversity and energy-beamforming gains can be both reaped to maximize the transferred energy by efficiently learning the channel state inform... |
2009.00858 | Gadekallu Thippa Reddy | Natarajan Deepa, Quoc-Viet Pham, Dinh C. Nguyen, Sweta Bhattacharya, B
Prabadevi, Thippa Reddy Gadekallu, Praveen Kumar Reddy Maddikunta, Fang Fang,
Pubudu N. Pathirana | A Survey on Blockchain for Big Data: Approaches, Opportunities, and
Future Directions | null | null | null | null | cs.CR cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Big data has generated strong interest in various scientific and engineering
domains over the last few years. Despite many advantages and applications,
there are many challenges in big data to be tackled for better quality of
service, e.g., big data analytics, big data management, and big data privacy
and security. B... | [
{
"created": "Wed, 2 Sep 2020 07:14:45 GMT",
"version": "v1"
},
{
"created": "Fri, 5 Feb 2021 06:14:13 GMT",
"version": "v2"
}
] | 2021-02-08 | [
[
"Deepa",
"Natarajan",
""
],
[
"Pham",
"Quoc-Viet",
""
],
[
"Nguyen",
"Dinh C.",
""
],
[
"Bhattacharya",
"Sweta",
""
],
[
"Prabadevi",
"B",
""
],
[
"Gadekallu",
"Thippa Reddy",
""
],
[
"Maddikunta",
"Praveen Kum... | Big data has generated strong interest in various scientific and engineering domains over the last few years. Despite many advantages and applications, there are many challenges in big data to be tackled for better quality of service, e.g., big data analytics, big data management, and big data privacy and security. Blo... |
2306.15749 | Fabrizio Ottati | Fabrizio Ottati, Chang Gao, Qinyu Chen, Giovanni Brignone, Mario R.
Casu, Jason K. Eshraghian, Luciano Lavagno | To Spike or Not To Spike: A Digital Hardware Perspective on Deep
Learning Acceleration | Fixed error in bio | null | null | null | cs.NE cs.AI cs.AR cs.LG | http://creativecommons.org/licenses/by/4.0/ | As deep learning models scale, they become increasingly competitive from
domains spanning from computer vision to natural language processing; however,
this happens at the expense of efficiency since they require increasingly more
memory and computing power. The power efficiency of the biological brain
outperforms an... | [
{
"created": "Tue, 27 Jun 2023 19:04:00 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Aug 2023 05:24:48 GMT",
"version": "v2"
},
{
"created": "Mon, 9 Oct 2023 06:01:33 GMT",
"version": "v3"
},
{
"created": "Wed, 1 Nov 2023 09:54:10 GMT",
"version": "v4"
},
{
"cre... | 2024-01-30 | [
[
"Ottati",
"Fabrizio",
""
],
[
"Gao",
"Chang",
""
],
[
"Chen",
"Qinyu",
""
],
[
"Brignone",
"Giovanni",
""
],
[
"Casu",
"Mario R.",
""
],
[
"Eshraghian",
"Jason K.",
""
],
[
"Lavagno",
"Luciano",
""
]
] | As deep learning models scale, they become increasingly competitive from domains spanning from computer vision to natural language processing; however, this happens at the expense of efficiency since they require increasingly more memory and computing power. The power efficiency of the biological brain outperforms any ... |
2310.16335 | Sixiao Zhang | Sixiao Zhang, Hongzhi Yin, Hongxu Chen, Cheng Long | Defense Against Model Extraction Attacks on Recommender Systems | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The robustness of recommender systems has become a prominent topic within the
research community. Numerous adversarial attacks have been proposed, but most
of them rely on extensive prior knowledge, such as all the white-box attacks or
most of the black-box attacks which assume that certain external knowledge is
avai... | [
{
"created": "Wed, 25 Oct 2023 03:30:42 GMT",
"version": "v1"
}
] | 2023-10-26 | [
[
"Zhang",
"Sixiao",
""
],
[
"Yin",
"Hongzhi",
""
],
[
"Chen",
"Hongxu",
""
],
[
"Long",
"Cheng",
""
]
] | The robustness of recommender systems has become a prominent topic within the research community. Numerous adversarial attacks have been proposed, but most of them rely on extensive prior knowledge, such as all the white-box attacks or most of the black-box attacks which assume that certain external knowledge is availa... |
1701.06989 | Thach Bui V. | Thach V. Bui, Minoru Kuribayashi, and Isao Echizen | Non-Adaptive Group Testing Framework based on Concatenation Code | Some proofs of this paper were incorrect. I do not know when I can
find the correct proofs for them. Therefore, it's better to withdraw this
version | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider an efficiently decodable non-adaptive group testing (NAGT)
problem that meets theoretical bounds. The problem is to find a few specific
items (at most $d$) satisfying certain characteristics in a colossal number of
$N$ items as quickly as possible. Those $d$ specific items are called
\textit{defective ite... | [
{
"created": "Tue, 24 Jan 2017 17:31:20 GMT",
"version": "v1"
},
{
"created": "Wed, 25 Jan 2017 06:58:39 GMT",
"version": "v2"
},
{
"created": "Wed, 1 Feb 2017 08:32:32 GMT",
"version": "v3"
},
{
"created": "Fri, 17 Nov 2017 06:09:21 GMT",
"version": "v4"
}
] | 2017-11-20 | [
[
"Bui",
"Thach V.",
""
],
[
"Kuribayashi",
"Minoru",
""
],
[
"Echizen",
"Isao",
""
]
] | We consider an efficiently decodable non-adaptive group testing (NAGT) problem that meets theoretical bounds. The problem is to find a few specific items (at most $d$) satisfying certain characteristics in a colossal number of $N$ items as quickly as possible. Those $d$ specific items are called \textit{defective items... |
2407.05365 | Xiyuan Zhou | Xiyuan Zhou, Huan Zhao, Yuheng Cheng, Yuji Cao, Gaoqi Liang, Guolong
Liu, Wenxuan Liu, Yan Xu, Junhua Zhao | ElecBench: a Power Dispatch Evaluation Benchmark for Large Language
Models | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In response to the urgent demand for grid stability and the complex
challenges posed by renewable energy integration and electricity market
dynamics, the power sector increasingly seeks innovative technological
solutions. In this context, large language models (LLMs) have become a key
technology to improve efficiency... | [
{
"created": "Sun, 7 Jul 2024 13:38:05 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Aug 2024 11:11:32 GMT",
"version": "v2"
}
] | 2024-08-13 | [
[
"Zhou",
"Xiyuan",
""
],
[
"Zhao",
"Huan",
""
],
[
"Cheng",
"Yuheng",
""
],
[
"Cao",
"Yuji",
""
],
[
"Liang",
"Gaoqi",
""
],
[
"Liu",
"Guolong",
""
],
[
"Liu",
"Wenxuan",
""
],
[
"Xu",
"Yan",
... | In response to the urgent demand for grid stability and the complex challenges posed by renewable energy integration and electricity market dynamics, the power sector increasingly seeks innovative technological solutions. In this context, large language models (LLMs) have become a key technology to improve efficiency a... |
2401.01089 | Xianjun Yang | Xianjun Yang, Stephen D. Wilson, Linda Petzold | Quokka: An Open-source Large Language Model ChatBot for Material Science | Work in progress | null | null | null | cs.CL cs.AI cs.CE | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper presents the development of a specialized chatbot for materials
science, leveraging the Llama-2 language model, and continuing pre-training on
the expansive research articles in the materials science domain from the S2ORC
dataset. The methodology involves an initial pretraining phase on over one
million do... | [
{
"created": "Tue, 2 Jan 2024 08:14:48 GMT",
"version": "v1"
}
] | 2024-01-03 | [
[
"Yang",
"Xianjun",
""
],
[
"Wilson",
"Stephen D.",
""
],
[
"Petzold",
"Linda",
""
]
] | This paper presents the development of a specialized chatbot for materials science, leveraging the Llama-2 language model, and continuing pre-training on the expansive research articles in the materials science domain from the S2ORC dataset. The methodology involves an initial pretraining phase on over one million doma... |
2207.04007 | Shintaro Shiba | Shintaro Shiba, Yoshimitsu Aoki, Guillermo Gallego | Event Collapse in Contrast Maximization Frameworks | 19 pages, 8 figures, 3 tables | Sensors 2022, 22(14), 5190 | 10.3390/s22145190 | null | cs.CV cs.RO math.DG | http://creativecommons.org/licenses/by/4.0/ | Contrast maximization (CMax) is a framework that provides state-of-the-art
results on several event-based computer vision tasks, such as ego-motion or
optical flow estimation. However, it may suffer from a problem called event
collapse, which is an undesired solution where events are warped into too few
pixels. As pr... | [
{
"created": "Fri, 8 Jul 2022 16:52:35 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Jul 2022 12:56:57 GMT",
"version": "v2"
}
] | 2024-03-05 | [
[
"Shiba",
"Shintaro",
""
],
[
"Aoki",
"Yoshimitsu",
""
],
[
"Gallego",
"Guillermo",
""
]
] | Contrast maximization (CMax) is a framework that provides state-of-the-art results on several event-based computer vision tasks, such as ego-motion or optical flow estimation. However, it may suffer from a problem called event collapse, which is an undesired solution where events are warped into too few pixels. As prio... |
1910.03157 | Alan Wu | Alan Wu, AJ Piergiovanni, Michael S. Ryoo | Model-based Behavioral Cloning with Future Image Similarity Learning | null | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a visual imitation learning framework that enables learning of
robot action policies solely based on expert samples without any robot trials.
Robot exploration and on-policy trials in a real-world environment could often
be expensive/dangerous. We present a new approach to address this problem by
learning ... | [
{
"created": "Tue, 8 Oct 2019 01:32:54 GMT",
"version": "v1"
}
] | 2019-10-09 | [
[
"Wu",
"Alan",
""
],
[
"Piergiovanni",
"AJ",
""
],
[
"Ryoo",
"Michael S.",
""
]
] | We present a visual imitation learning framework that enables learning of robot action policies solely based on expert samples without any robot trials. Robot exploration and on-policy trials in a real-world environment could often be expensive/dangerous. We present a new approach to address this problem by learning a ... |
1710.02869 | Isaac Sledge | Isaac J. Sledge, Jose C. Principe | An Analysis of the Value of Information when Exploring Stochastic,
Discrete Multi-Armed Bandits | Entropy | null | 10.3390/e20030155 | null | cs.AI cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose an information-theoretic exploration strategy for
stochastic, discrete multi-armed bandits that achieves optimal regret. Our
strategy is based on the value of information criterion. This criterion
measures the trade-off between policy information and obtainable rewards. High
amounts of polic... | [
{
"created": "Sun, 8 Oct 2017 18:48:48 GMT",
"version": "v1"
},
{
"created": "Sat, 3 Mar 2018 21:01:57 GMT",
"version": "v2"
}
] | 2018-03-06 | [
[
"Sledge",
"Isaac J.",
""
],
[
"Principe",
"Jose C.",
""
]
] | In this paper, we propose an information-theoretic exploration strategy for stochastic, discrete multi-armed bandits that achieves optimal regret. Our strategy is based on the value of information criterion. This criterion measures the trade-off between policy information and obtainable rewards. High amounts of policy ... |
1611.04353 | Ece Ozkan | Ece Ozkan, Gemma Roig, Orcun Goksel and Xavier Boix | Herding Generalizes Diverse M -Best Solutions | 8 pages, 2 algorithms, 3 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We show that the algorithm to extract diverse M -solutions from a Conditional
Random Field (called divMbest [1]) takes exactly the form of a Herding
procedure [2], i.e. a deterministic dynamical system that produces a sequence
of hypotheses that respect a set of observed moment constraints. This
generalization enable... | [
{
"created": "Mon, 14 Nov 2016 12:13:58 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Jan 2017 13:40:12 GMT",
"version": "v2"
}
] | 2017-01-31 | [
[
"Ozkan",
"Ece",
""
],
[
"Roig",
"Gemma",
""
],
[
"Goksel",
"Orcun",
""
],
[
"Boix",
"Xavier",
""
]
] | We show that the algorithm to extract diverse M -solutions from a Conditional Random Field (called divMbest [1]) takes exactly the form of a Herding procedure [2], i.e. a deterministic dynamical system that produces a sequence of hypotheses that respect a set of observed moment constraints. This generalization enables ... |
1405.7076 | Vilem Vychodil | Vilem Vychodil | On minimal sets of graded attribute implications | null | Information Sciences 294 (2015), 478-488 | 10.1016/j.ins.2014.09.059 | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore the structure of non-redundant and minimal sets consisting of
graded if-then rules. The rules serve as graded attribute implications in
object-attribute incidence data and as similarity-based functional dependencies
in a similarity-based generalization of the relational model of data. Based on
our observat... | [
{
"created": "Tue, 27 May 2014 22:00:35 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Aug 2014 19:07:05 GMT",
"version": "v2"
}
] | 2014-12-09 | [
[
"Vychodil",
"Vilem",
""
]
] | We explore the structure of non-redundant and minimal sets consisting of graded if-then rules. The rules serve as graded attribute implications in object-attribute incidence data and as similarity-based functional dependencies in a similarity-based generalization of the relational model of data. Based on our observatio... |
2006.11648 | Binghui Peng | Jan van den Brand, Binghui Peng, Zhao Song, Omri Weinstein | Training (Overparametrized) Neural Networks in Near-Linear Time | null | null | null | null | cs.LG cs.DS stat.ML | http://creativecommons.org/licenses/by-sa/4.0/ | The slow convergence rate and pathological curvature issues of first-order
gradient methods for training deep neural networks, initiated an ongoing effort
for developing faster $\mathit{second}$-$\mathit{order}$ optimization
algorithms beyond SGD, without compromising the generalization error. Despite
their remarkabl... | [
{
"created": "Sat, 20 Jun 2020 20:26:14 GMT",
"version": "v1"
},
{
"created": "Wed, 9 Dec 2020 02:02:10 GMT",
"version": "v2"
}
] | 2020-12-10 | [
[
"Brand",
"Jan van den",
""
],
[
"Peng",
"Binghui",
""
],
[
"Song",
"Zhao",
""
],
[
"Weinstein",
"Omri",
""
]
] | The slow convergence rate and pathological curvature issues of first-order gradient methods for training deep neural networks, initiated an ongoing effort for developing faster $\mathit{second}$-$\mathit{order}$ optimization algorithms beyond SGD, without compromising the generalization error. Despite their remarkable ... |
1912.12164 | Arthur Pajot | Arthur Pajot, Emmanuel de Bezenac, Patrick Gallinari | Unsupervised Adversarial Image Inpainting | null | null | null | null | cs.CV cs.LG eess.IV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider inpainting in an unsupervised setting where there is neither
access to paired nor unpaired training data. The only available information is
provided by the uncomplete observations and the inpainting process statistics.
In this context, an observation should give rise to several plausible
reconstructions w... | [
{
"created": "Wed, 18 Dec 2019 16:06:34 GMT",
"version": "v1"
}
] | 2019-12-30 | [
[
"Pajot",
"Arthur",
""
],
[
"de Bezenac",
"Emmanuel",
""
],
[
"Gallinari",
"Patrick",
""
]
] | We consider inpainting in an unsupervised setting where there is neither access to paired nor unpaired training data. The only available information is provided by the uncomplete observations and the inpainting process statistics. In this context, an observation should give rise to several plausible reconstructions whi... |
1906.02849 | Jose Dolz | Ashish Sinha and Jose Dolz | Multi-scale self-guided attention for medical image segmentation | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Even though convolutional neural networks (CNNs) are driving progress in
medical image segmentation, standard models still have some drawbacks. First,
the use of multi-scale approaches, i.e., encoder-decoder architectures, leads
to a redundant use of information, where similar low-level features are
extracted multipl... | [
{
"created": "Fri, 7 Jun 2019 00:54:05 GMT",
"version": "v1"
},
{
"created": "Sun, 27 Oct 2019 01:34:12 GMT",
"version": "v2"
},
{
"created": "Fri, 14 Feb 2020 20:23:08 GMT",
"version": "v3"
}
] | 2020-02-18 | [
[
"Sinha",
"Ashish",
""
],
[
"Dolz",
"Jose",
""
]
] | Even though convolutional neural networks (CNNs) are driving progress in medical image segmentation, standard models still have some drawbacks. First, the use of multi-scale approaches, i.e., encoder-decoder architectures, leads to a redundant use of information, where similar low-level features are extracted multiple ... |
1312.2244 | Tao Wang | Rumeng Li, Tao Wang, Xun Wang | Time-dependent Hierarchical Dirichlet Model for Timeline Generation | null | SDM(2015)p550-558 | 10.1137/1.9781611974010.62 | null | cs.CL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Timeline Generation aims at summarizing news from different epochs and
telling readers how an event evolves. It is a new challenge that combines
salience ranking with novelty detection. For long-term public events, the main
topic usually includes various aspects across different epochs and each aspect
has its own evo... | [
{
"created": "Sun, 8 Dec 2013 19:15:15 GMT",
"version": "v1"
},
{
"created": "Mon, 21 Apr 2014 11:44:47 GMT",
"version": "v2"
},
{
"created": "Tue, 14 Mar 2017 01:34:50 GMT",
"version": "v3"
}
] | 2017-03-16 | [
[
"Li",
"Rumeng",
""
],
[
"Wang",
"Tao",
""
],
[
"Wang",
"Xun",
""
]
] | Timeline Generation aims at summarizing news from different epochs and telling readers how an event evolves. It is a new challenge that combines salience ranking with novelty detection. For long-term public events, the main topic usually includes various aspects across different epochs and each aspect has its own evolv... |
1803.06503 | Guanbin Li | Guanbin Li, Yuan Xie, Liang Lin | Weakly Supervised Salient Object Detection Using Image Labels | Accept by AAAI2018 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep learning based salient object detection has recently achieved great
success with its performance greatly outperforms any other unsupervised
methods. However, annotating per-pixel saliency masks is a tedious and
inefficient procedure. In this paper, we note that superior salient object
detection can be obtained b... | [
{
"created": "Sat, 17 Mar 2018 13:40:00 GMT",
"version": "v1"
}
] | 2018-03-20 | [
[
"Li",
"Guanbin",
""
],
[
"Xie",
"Yuan",
""
],
[
"Lin",
"Liang",
""
]
] | Deep learning based salient object detection has recently achieved great success with its performance greatly outperforms any other unsupervised methods. However, annotating per-pixel saliency masks is a tedious and inefficient procedure. In this paper, we note that superior salient object detection can be obtained by ... |
1704.07133 | Stephan Holzer | Stephan Holzer and Nancy Lynch | Beeping a Maximal Independent Set Fast | Full version of a brief announcement with the same title that
appeared at the 30th International Symposium on Distributed Computing (DISC),
Paris, France, September 2016. 17 pages | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We adapt a recent algorithm by Ghaffari [SODA'16] for computing a Maximal
Independent Set in the LOCAL model, so that it works in the significantly
weaker BEEP model. For networks with maximum degree $\Delta$, our algorithm
terminates locally within time $O((\log \Delta + \log (1/\epsilon)) \cdot
\log(1/\epsilon))$, ... | [
{
"created": "Mon, 24 Apr 2017 10:42:37 GMT",
"version": "v1"
}
] | 2017-04-25 | [
[
"Holzer",
"Stephan",
""
],
[
"Lynch",
"Nancy",
""
]
] | We adapt a recent algorithm by Ghaffari [SODA'16] for computing a Maximal Independent Set in the LOCAL model, so that it works in the significantly weaker BEEP model. For networks with maximum degree $\Delta$, our algorithm terminates locally within time $O((\log \Delta + \log (1/\epsilon)) \cdot \log(1/\epsilon))$, wi... |
1511.05389 | Imran Sheikh | Imran Sheikh, Irina Illina, Dominique Fohr, Georges Linar\`es | Learning to retrieve out-of-vocabulary words in speech recognition | Updated references, added appendix discussing more results; added
more discussion, replaced simple phone search results with KWS results; added
KWS results for both training phase, probably last update | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many Proper Names (PNs) are Out-Of-Vocabulary (OOV) words for speech
recognition systems used to process diachronic audio data. To help recovery of
the PNs missed by the system, relevant OOV PNs can be retrieved out of the many
OOVs by exploiting semantic context of the spoken content. In this paper, we
propose two n... | [
{
"created": "Tue, 17 Nov 2015 13:18:07 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Dec 2015 09:39:29 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Jan 2016 19:32:55 GMT",
"version": "v3"
},
{
"created": "Tue, 1 Mar 2016 14:03:44 GMT",
"version": "v4"
}
] | 2016-03-02 | [
[
"Sheikh",
"Imran",
""
],
[
"Illina",
"Irina",
""
],
[
"Fohr",
"Dominique",
""
],
[
"Linarès",
"Georges",
""
]
] | Many Proper Names (PNs) are Out-Of-Vocabulary (OOV) words for speech recognition systems used to process diachronic audio data. To help recovery of the PNs missed by the system, relevant OOV PNs can be retrieved out of the many OOVs by exploiting semantic context of the spoken content. In this paper, we propose two neu... |
2407.08328 | Georgina Cosma Professor | Georgina Cosma, Mohit Kumar Singh, Patrick Waterson, Gyuchan Thomas
Jun, and Jonathan Back | Unveiling Disparities in Maternity Care: A Topic Modelling Approach to
Analysing Maternity Incident Investigation Reports | null | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | This study applies Natural Language Processing techniques, including Latent
Dirichlet Allocation, to analyse anonymised maternity incident investigation
reports from the Healthcare Safety Investigation Branch. The reports underwent
preprocessing, annotation using the Safety Intelligence Research taxonomy, and
topic m... | [
{
"created": "Thu, 11 Jul 2024 09:26:05 GMT",
"version": "v1"
}
] | 2024-07-12 | [
[
"Cosma",
"Georgina",
""
],
[
"Singh",
"Mohit Kumar",
""
],
[
"Waterson",
"Patrick",
""
],
[
"Jun",
"Gyuchan Thomas",
""
],
[
"Back",
"Jonathan",
""
]
] | This study applies Natural Language Processing techniques, including Latent Dirichlet Allocation, to analyse anonymised maternity incident investigation reports from the Healthcare Safety Investigation Branch. The reports underwent preprocessing, annotation using the Safety Intelligence Research taxonomy, and topic mod... |
2004.10887 | Apoorv Shukla | Apoorv Shukla, Kevin Hudemann, Zsolt V\'agi, Lily H\"ugerich, Georgios
Smaragdakis, Stefan Schmid, Artur Hecker, Anja Feldmann | Towards Runtime Verification of Programmable Switches | added a missing author name to a reference | null | null | null | cs.SE cs.LG cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Is it possible to patch software bugs in P4 programs without human
involvement? We show that this is partially possible in many cases due to
advances in software testing and the structure of P4 programs. Our insight is
that runtime verification can detect bugs, even those that are not detected at
compile-time, with m... | [
{
"created": "Wed, 22 Apr 2020 22:22:32 GMT",
"version": "v1"
},
{
"created": "Sun, 26 Apr 2020 13:34:57 GMT",
"version": "v2"
}
] | 2020-04-28 | [
[
"Shukla",
"Apoorv",
""
],
[
"Hudemann",
"Kevin",
""
],
[
"Vági",
"Zsolt",
""
],
[
"Hügerich",
"Lily",
""
],
[
"Smaragdakis",
"Georgios",
""
],
[
"Schmid",
"Stefan",
""
],
[
"Hecker",
"Artur",
""
],
[
... | Is it possible to patch software bugs in P4 programs without human involvement? We show that this is partially possible in many cases due to advances in software testing and the structure of P4 programs. Our insight is that runtime verification can detect bugs, even those that are not detected at compile-time, with mac... |
1207.0120 | Nihar Shah | Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran | Distributed Secret Dissemination Across a Network | Extended version of a paper presented at the International Symposium
on Information Theory (ISIT) 2013 | null | null | null | cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Shamir's (n, k) threshold secret sharing is an important component of several
cryptographic protocols, such as those for secure multiparty-computation and
key management. These protocols typically assume the presence of direct
communication links from the dealer to all participants, in which case the
dealer can direc... | [
{
"created": "Sat, 30 Jun 2012 18:01:31 GMT",
"version": "v1"
},
{
"created": "Thu, 12 Jul 2012 18:56:51 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Nov 2012 00:30:05 GMT",
"version": "v3"
},
{
"created": "Thu, 4 Jul 2013 01:17:41 GMT",
"version": "v4"
},
{
"cr... | 2014-10-23 | [
[
"Shah",
"Nihar B.",
""
],
[
"Rashmi",
"K. V.",
""
],
[
"Ramchandran",
"Kannan",
""
]
] | Shamir's (n, k) threshold secret sharing is an important component of several cryptographic protocols, such as those for secure multiparty-computation and key management. These protocols typically assume the presence of direct communication links from the dealer to all participants, in which case the dealer can directl... |
1806.09301 | Harishchandra Dubey | Harishchandra Dubey, Abhijeet Sangwan, John H. L. Hansen | Robust Feature Clustering for Unsupervised Speech Activity Detection | 5 Pages, 4 Tables, 1 Figure | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In certain applications such as zero-resource speech processing or very-low
resource speech-language systems, it might not be feasible to collect speech
activity detection (SAD) annotations. However, the state-of-the-art supervised
SAD techniques based on neural networks or other machine learning methods
require anno... | [
{
"created": "Mon, 25 Jun 2018 06:53:54 GMT",
"version": "v1"
}
] | 2018-06-26 | [
[
"Dubey",
"Harishchandra",
""
],
[
"Sangwan",
"Abhijeet",
""
],
[
"Hansen",
"John H. L.",
""
]
] | In certain applications such as zero-resource speech processing or very-low resource speech-language systems, it might not be feasible to collect speech activity detection (SAD) annotations. However, the state-of-the-art supervised SAD techniques based on neural networks or other machine learning methods require annota... |
2012.15788 | James Thorne | James Thorne, Andreas Vlachos | Evidence-based Factual Error Correction | Accepted at ACL2021 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper introduces the task of factual error correction: performing edits
to a claim so that the generated rewrite is better supported by evidence. This
extends the well-studied task of fact verification by providing a mechanism to
correct written texts that are refuted or only partially supported by evidence.
We ... | [
{
"created": "Thu, 31 Dec 2020 18:11:26 GMT",
"version": "v1"
},
{
"created": "Fri, 11 Jun 2021 16:23:26 GMT",
"version": "v2"
}
] | 2021-06-17 | [
[
"Thorne",
"James",
""
],
[
"Vlachos",
"Andreas",
""
]
] | This paper introduces the task of factual error correction: performing edits to a claim so that the generated rewrite is better supported by evidence. This extends the well-studied task of fact verification by providing a mechanism to correct written texts that are refuted or only partially supported by evidence. We de... |
2406.07315 | Adri\`a Molina Rodr\'iguez | Adri\`a Molina, Oriol Ramos Terrades, Josep Llad\'os | Fetch-A-Set: A Large-Scale OCR-Free Benchmark for Historical Document
Retrieval | Preprint for the manuscript accepted for publication in the DAS2024
LNCS proceedings | null | null | null | cs.IR cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper introduces Fetch-A-Set (FAS), a comprehensive benchmark tailored
for legislative historical document analysis systems, addressing the challenges
of large-scale document retrieval in historical contexts. The benchmark
comprises a vast repository of documents dating back to the XVII century,
serving both as ... | [
{
"created": "Tue, 11 Jun 2024 14:45:00 GMT",
"version": "v1"
},
{
"created": "Sun, 16 Jun 2024 16:59:29 GMT",
"version": "v2"
}
] | 2024-06-18 | [
[
"Molina",
"Adrià",
""
],
[
"Terrades",
"Oriol Ramos",
""
],
[
"Lladós",
"Josep",
""
]
] | This paper introduces Fetch-A-Set (FAS), a comprehensive benchmark tailored for legislative historical document analysis systems, addressing the challenges of large-scale document retrieval in historical contexts. The benchmark comprises a vast repository of documents dating back to the XVII century, serving both as a ... |
2101.11859 | Meiqi Zhu | Meiqi Zhu, Xiao Wang, Chuan Shi, Houye Ji, Peng Cui | Interpreting and Unifying Graph Neural Networks with An Optimization
Framework | WWW2021, 12 pages | null | null | null | cs.LG cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Neural Networks (GNNs) have received considerable attention on
graph-structured data learning for a wide variety of tasks. The well-designed
propagation mechanism which has been demonstrated effective is the most
fundamental part of GNNs. Although most of GNNs basically follow a message
passing manner, litter e... | [
{
"created": "Thu, 28 Jan 2021 08:06:02 GMT",
"version": "v1"
}
] | 2021-01-29 | [
[
"Zhu",
"Meiqi",
""
],
[
"Wang",
"Xiao",
""
],
[
"Shi",
"Chuan",
""
],
[
"Ji",
"Houye",
""
],
[
"Cui",
"Peng",
""
]
] | Graph Neural Networks (GNNs) have received considerable attention on graph-structured data learning for a wide variety of tasks. The well-designed propagation mechanism which has been demonstrated effective is the most fundamental part of GNNs. Although most of GNNs basically follow a message passing manner, litter eff... |
1307.6658 | Ruchir Gupta | Ruchir Gupta, Yatindra Nath singh | A Reputation Based Framework to Avoid Free-riding in Unstructured
Peer-to-Peer network | null | null | 10.1007/s12083-015-0389-0 | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Free riding is a major problem in peer-to-peer networks. Reputation
management systems are generally proposed to overcome this problem. In this
paper we have discussed a possible way of resource allocation on the basis of
reputation management system i.e. probabilistic allocation based on reputation.
This seems to be... | [
{
"created": "Thu, 25 Jul 2013 08:19:30 GMT",
"version": "v1"
}
] | 2015-07-21 | [
[
"Gupta",
"Ruchir",
""
],
[
"singh",
"Yatindra Nath",
""
]
] | Free riding is a major problem in peer-to-peer networks. Reputation management systems are generally proposed to overcome this problem. In this paper we have discussed a possible way of resource allocation on the basis of reputation management system i.e. probabilistic allocation based on reputation. This seems to be a... |
2108.05997 | Junjie Ke | Junjie Ke, Qifei Wang, Yilin Wang, Peyman Milanfar, Feng Yang | MUSIQ: Multi-scale Image Quality Transformer | ICCV 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image quality assessment (IQA) is an important research topic for
understanding and improving visual experience. The current state-of-the-art IQA
methods are based on convolutional neural networks (CNNs). The performance of
CNN-based models is often compromised by the fixed shape constraint in batch
training. To acco... | [
{
"created": "Thu, 12 Aug 2021 23:36:22 GMT",
"version": "v1"
}
] | 2021-08-16 | [
[
"Ke",
"Junjie",
""
],
[
"Wang",
"Qifei",
""
],
[
"Wang",
"Yilin",
""
],
[
"Milanfar",
"Peyman",
""
],
[
"Yang",
"Feng",
""
]
] | Image quality assessment (IQA) is an important research topic for understanding and improving visual experience. The current state-of-the-art IQA methods are based on convolutional neural networks (CNNs). The performance of CNN-based models is often compromised by the fixed shape constraint in batch training. To accomm... |
2103.04136 | Kailun Yang | Yingzhi Zhang, Haoye Chen, Kailun Yang, Jiaming Zhang, Rainer
Stiefelhagen | Perception Framework through Real-Time Semantic Segmentation and Scene
Recognition on a Wearable System for the Visually Impaired | 6 pages, 7 figures, 2 tables | null | null | null | cs.CV cs.RO eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As the scene information, including objectness and scene type, are important
for people with visual impairment, in this work we present a multi-task
efficient perception system for the scene parsing and recognition tasks.
Building on the compact ResNet backbone, our designed network architecture has
two paths with sh... | [
{
"created": "Sat, 6 Mar 2021 15:07:17 GMT",
"version": "v1"
}
] | 2021-03-09 | [
[
"Zhang",
"Yingzhi",
""
],
[
"Chen",
"Haoye",
""
],
[
"Yang",
"Kailun",
""
],
[
"Zhang",
"Jiaming",
""
],
[
"Stiefelhagen",
"Rainer",
""
]
] | As the scene information, including objectness and scene type, are important for people with visual impairment, in this work we present a multi-task efficient perception system for the scene parsing and recognition tasks. Building on the compact ResNet backbone, our designed network architecture has two paths with shar... |
1904.13142 | Chien-Feng Liao | Chien-Feng Liao, Yu Tsao, Xugang Lu, Hisashi Kawai | Incorporating Symbolic Sequential Modeling for Speech Enhancement | Accepted to Interspeech 2019 | null | null | null | cs.LG cs.SD eess.AS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a noisy environment, a lossy speech signal can be automatically restored
by a listener if he/she knows the language well. That is, with the built-in
knowledge of a "language model", a listener may effectively suppress noise
interference and retrieve the target speech signals. Accordingly, we argue that
familiarity... | [
{
"created": "Tue, 30 Apr 2019 10:31:22 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Jul 2019 15:04:02 GMT",
"version": "v2"
},
{
"created": "Tue, 2 Jul 2019 02:38:05 GMT",
"version": "v3"
}
] | 2019-07-03 | [
[
"Liao",
"Chien-Feng",
""
],
[
"Tsao",
"Yu",
""
],
[
"Lu",
"Xugang",
""
],
[
"Kawai",
"Hisashi",
""
]
] | In a noisy environment, a lossy speech signal can be automatically restored by a listener if he/she knows the language well. That is, with the built-in knowledge of a "language model", a listener may effectively suppress noise interference and retrieve the target speech signals. Accordingly, we argue that familiarity w... |
2007.00737 | Robert Leishman | Kyung Kim, Robert C. Leishman, and Scott L. Nykl | Virtual Testbed for Monocular Visual Navigation of Small Unmanned
Aircraft Systems | null | The Journal of Defense Modeling and Simulation: Applications,
Methodology, Technology 2020 | 10.1177/1548512920954545 | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Monocular visual navigation methods have seen significant advances in the
last decade, recently producing several real-time solutions for autonomously
navigating small unmanned aircraft systems without relying on GPS. This is
critical for military operations which may involve environments where GPS
signals are degrad... | [
{
"created": "Wed, 1 Jul 2020 20:35:26 GMT",
"version": "v1"
}
] | 2020-09-24 | [
[
"Kim",
"Kyung",
""
],
[
"Leishman",
"Robert C.",
""
],
[
"Nykl",
"Scott L.",
""
]
] | Monocular visual navigation methods have seen significant advances in the last decade, recently producing several real-time solutions for autonomously navigating small unmanned aircraft systems without relying on GPS. This is critical for military operations which may involve environments where GPS signals are degraded... |
2106.02550 | Friedrich Slivovsky | Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider | Certified DQBF Solving by Definition Extraction | null | null | null | null | cs.LO | http://creativecommons.org/licenses/by/4.0/ | We propose a new decision procedure for dependency quantified Boolean
formulas (DQBF) that uses interpolation-based definition extraction to compute
Skolem functions in a counter-example guided inductive synthesis (CEGIS) loop.
In each iteration, a family of candidate Skolem functions is tested for
correctness using ... | [
{
"created": "Fri, 4 Jun 2021 15:30:11 GMT",
"version": "v1"
}
] | 2021-06-07 | [
[
"Reichl",
"Franz-Xaver",
""
],
[
"Slivovsky",
"Friedrich",
""
],
[
"Szeider",
"Stefan",
""
]
] | We propose a new decision procedure for dependency quantified Boolean formulas (DQBF) that uses interpolation-based definition extraction to compute Skolem functions in a counter-example guided inductive synthesis (CEGIS) loop. In each iteration, a family of candidate Skolem functions is tested for correctness using a ... |
1807.09384 | Aysegul Dundar | Aysegul Dundar, Ming-Yu Liu, Ting-Chun Wang, John Zedlewski, Jan Kautz | Domain Stylization: A Strong, Simple Baseline for Synthetic to Real
Image Domain Adaptation | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep neural networks have largely failed to effectively utilize synthetic
data when applied to real images due to the covariate shift problem. In this
paper, we show that by applying a straightforward modification to an existing
photorealistic style transfer algorithm, we achieve state-of-the-art
synthetic-to-real do... | [
{
"created": "Tue, 24 Jul 2018 23:06:49 GMT",
"version": "v1"
}
] | 2018-07-26 | [
[
"Dundar",
"Aysegul",
""
],
[
"Liu",
"Ming-Yu",
""
],
[
"Wang",
"Ting-Chun",
""
],
[
"Zedlewski",
"John",
""
],
[
"Kautz",
"Jan",
""
]
] | Deep neural networks have largely failed to effectively utilize synthetic data when applied to real images due to the covariate shift problem. In this paper, we show that by applying a straightforward modification to an existing photorealistic style transfer algorithm, we achieve state-of-the-art synthetic-to-real doma... |
1309.2869 | Muhammad Rizwan Asghar | Muhammad Rizwan Asghar and Giovanni Russello | ACTORS: A Goal-driven Approach for Capturing and Managing Consent in
e-Health Systems | The final version of this paper has been published at POLICY 2012 | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The notion of patient's consent plays a major role in granting access to
medical data. In typical healthcare systems, consent is captured by a form that
the patient has to fill in and sign. In e-Health systems, the paper-form
consent is being replaced by the integration of the notion of consent in the
mechanisms that... | [
{
"created": "Wed, 11 Sep 2013 15:49:32 GMT",
"version": "v1"
}
] | 2013-09-12 | [
[
"Asghar",
"Muhammad Rizwan",
""
],
[
"Russello",
"Giovanni",
""
]
] | The notion of patient's consent plays a major role in granting access to medical data. In typical healthcare systems, consent is captured by a form that the patient has to fill in and sign. In e-Health systems, the paper-form consent is being replaced by the integration of the notion of consent in the mechanisms that r... |
2202.05517 | Jyoti Narwariya | Jyoti Narwariya, Chetan Verma, Pankaj Malhotra, Lovekesh Vig, Easwara
Subramanian, Sanjay Bhat | Electricity Consumption Forecasting for Out-of-distribution Time-of-Use
Tariffs | Accepted paper at AAAI workshop AIBSD 2022 | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In electricity markets, retailers or brokers want to maximize profits by
allocating tariff profiles to end consumers. One of the objectives of such
demand response management is to incentivize the consumers to adjust their
consumption so that the overall electricity procurement in the wholesale
markets is minimized, ... | [
{
"created": "Fri, 11 Feb 2022 09:13:55 GMT",
"version": "v1"
}
] | 2022-02-14 | [
[
"Narwariya",
"Jyoti",
""
],
[
"Verma",
"Chetan",
""
],
[
"Malhotra",
"Pankaj",
""
],
[
"Vig",
"Lovekesh",
""
],
[
"Subramanian",
"Easwara",
""
],
[
"Bhat",
"Sanjay",
""
]
] | In electricity markets, retailers or brokers want to maximize profits by allocating tariff profiles to end consumers. One of the objectives of such demand response management is to incentivize the consumers to adjust their consumption so that the overall electricity procurement in the wholesale markets is minimized, e.... |
2403.15516 | Wang Yufeng | Wang Yufeng, Chen Chao, Yang Zhou, Wang Shuhui, Liao Xiangwen | CTSM: Combining Trait and State Emotions for Empathetic Response Model | 9 pages, 3 figures. Has been accepted by LREC-COLING2024 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Empathetic response generation endeavors to empower dialogue systems to
perceive speakers' emotions and generate empathetic responses accordingly.
Psychological research demonstrates that emotion, as an essential factor in
empathy, encompasses trait emotions, which are static and context-independent,
and state emotio... | [
{
"created": "Fri, 22 Mar 2024 10:45:13 GMT",
"version": "v1"
}
] | 2024-03-26 | [
[
"Yufeng",
"Wang",
""
],
[
"Chao",
"Chen",
""
],
[
"Zhou",
"Yang",
""
],
[
"Shuhui",
"Wang",
""
],
[
"Xiangwen",
"Liao",
""
]
] | Empathetic response generation endeavors to empower dialogue systems to perceive speakers' emotions and generate empathetic responses accordingly. Psychological research demonstrates that emotion, as an essential factor in empathy, encompasses trait emotions, which are static and context-independent, and state emotions... |
0812.0283 | Sven Kosub | Christopher M. Homan and Sven Kosub | Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems | 16 pages, extended abstract presented at 10th Italian Conference on
Theoretical Computer Science (ICTCS'2007) | null | null | revised version of TR No. TUM-I0706, Institut fuer Informatik, TU
Muenchen | cs.CC cond-mat.dis-nn cs.DM nlin.AO nlin.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present dichotomy theorems regarding the computational complexity of
counting fixed points in boolean (discrete) dynamical systems, i.e., finite
discrete dynamical systems over the domain {0,1}. For a class F of boolean
functions and a class G of graphs, an (F,G)-system is a boolean dynamical
system with local tra... | [
{
"created": "Mon, 1 Dec 2008 12:56:42 GMT",
"version": "v1"
}
] | 2008-12-02 | [
[
"Homan",
"Christopher M.",
""
],
[
"Kosub",
"Sven",
""
]
] | We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over the domain {0,1}. For a class F of boolean functions and a class G of graphs, an (F,G)-system is a boolean dynamical system with local trans... |
1811.07889 | Sung Ho Kang | Sung Ho Kang, Kiwan Jeon, Hak-Jin Kim, Jin Keun Seo, and Sang-Hwy Lee | Automatic Three-Dimensional Cephalometric Annotation System Using
Three-Dimensional Convolutional Neural Networks | null | null | 10.1080/21681163.2019.1674696 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Background: Three-dimensional (3D) cephalometric analysis using computerized
tomography data has been rapidly adopted for dysmorphosis and anthropometry.
Several different approaches to automatic 3D annotation have been proposed to
overcome the limitations of traditional cephalometry. The purpose of this study
was to... | [
{
"created": "Mon, 19 Nov 2018 05:47:34 GMT",
"version": "v1"
}
] | 2023-07-27 | [
[
"Kang",
"Sung Ho",
""
],
[
"Jeon",
"Kiwan",
""
],
[
"Kim",
"Hak-Jin",
""
],
[
"Seo",
"Jin Keun",
""
],
[
"Lee",
"Sang-Hwy",
""
]
] | Background: Three-dimensional (3D) cephalometric analysis using computerized tomography data has been rapidly adopted for dysmorphosis and anthropometry. Several different approaches to automatic 3D annotation have been proposed to overcome the limitations of traditional cephalometry. The purpose of this study was to e... |
1901.02055 | Molka Tounsi Dhouib | C\'edric Lopez (TEXTE), Molka Dhouib (I3S, WIMMICS), Elena Cabrio
(WIMMICS), Catherine Faron Zucker (I3S, WIMMICS), Fabien Gandon (UCA,
WIMMICS), Fr\'ed\'erique Segond | SMILK, linking natural language and data from the web | in French | RIA - Revue d'Intelligence Artificielle, 2018 | 10.3166/RIA.32.287-312 | null | cs.IR cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As part of the SMILK Joint Lab, we studied the use of Natural Language
Processing to: (1) enrich knowledge bases and link data on the web, and
conversely (2) use this linked data to contribute to the improvement of text
analysis and the annotation of textual content, and to support knowledge
extraction. The evaluatio... | [
{
"created": "Thu, 20 Dec 2018 12:35:19 GMT",
"version": "v1"
}
] | 2019-01-09 | [
[
"Lopez",
"Cédric",
"",
"TEXTE"
],
[
"Dhouib",
"Molka",
"",
"I3S, WIMMICS"
],
[
"Cabrio",
"Elena",
"",
"WIMMICS"
],
[
"Zucker",
"Catherine Faron",
"",
"I3S, WIMMICS"
],
[
"Gandon",
"Fabien",
"",
"UCA,\n WIMMICS"
],
... | As part of the SMILK Joint Lab, we studied the use of Natural Language Processing to: (1) enrich knowledge bases and link data on the web, and conversely (2) use this linked data to contribute to the improvement of text analysis and the annotation of textual content, and to support knowledge extraction. The evaluation ... |
2405.06681 | Sven Jacobs | Sven Jacobs, Steffen Jaschke | Leveraging Lecture Content for Improved Feedback: Explorations with
GPT-4 and Retrieval Augmented Generation | accepted at CSEE&T 2024: 36th International Conference on Software
Engineering Education and Training, W\"urzburg, Germany | null | null | null | cs.CL cs.AI cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents the use of Retrieval Augmented Generation (RAG) to
improve the feedback generated by Large Language Models for programming tasks.
For this purpose, corresponding lecture recordings were transcribed and made
available to the Large Language Model GPT-4 as external knowledge source
together with time... | [
{
"created": "Sun, 5 May 2024 18:32:06 GMT",
"version": "v1"
}
] | 2024-05-14 | [
[
"Jacobs",
"Sven",
""
],
[
"Jaschke",
"Steffen",
""
]
] | This paper presents the use of Retrieval Augmented Generation (RAG) to improve the feedback generated by Large Language Models for programming tasks. For this purpose, corresponding lecture recordings were transcribed and made available to the Large Language Model GPT-4 as external knowledge source together with timest... |
1811.12459 | Ariel Schvartzman | Christos-Alexandros Psomas, Ariel Schvartzman, S. Matthew Weinberg | Smoothed Analysis of Multi-Item Auctions with Correlated Values | null | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consider a seller with m heterogeneous items for sale to a single additive
buyer whose values for the items are arbitrarily correlated. It was previously
shown that, in such settings, distributions exist for which the seller's
optimal revenue is infinite, but the best "simple" mechanism achieves revenue
at most one (... | [
{
"created": "Thu, 29 Nov 2018 20:00:27 GMT",
"version": "v1"
}
] | 2018-12-03 | [
[
"Psomas",
"Christos-Alexandros",
""
],
[
"Schvartzman",
"Ariel",
""
],
[
"Weinberg",
"S. Matthew",
""
]
] | Consider a seller with m heterogeneous items for sale to a single additive buyer whose values for the items are arbitrarily correlated. It was previously shown that, in such settings, distributions exist for which the seller's optimal revenue is infinite, but the best "simple" mechanism achieves revenue at most one ([B... |
2109.14715 | George Eskandar | George Eskandar, Mohamed Abdelsamad, Karim Armanious, Bin Yang | USIS: Unsupervised Semantic Image Synthesis | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Semantic Image Synthesis (SIS) is a subclass of image-to-image translation
where a photorealistic image is synthesized from a segmentation mask. SIS has
mostly been addressed as a supervised problem. However, state-of-the-art
methods depend on a huge amount of labeled data and cannot be applied in an
unpaired setting... | [
{
"created": "Wed, 29 Sep 2021 20:48:41 GMT",
"version": "v1"
}
] | 2021-10-01 | [
[
"Eskandar",
"George",
""
],
[
"Abdelsamad",
"Mohamed",
""
],
[
"Armanious",
"Karim",
""
],
[
"Yang",
"Bin",
""
]
] | Semantic Image Synthesis (SIS) is a subclass of image-to-image translation where a photorealistic image is synthesized from a segmentation mask. SIS has mostly been addressed as a supervised problem. However, state-of-the-art methods depend on a huge amount of labeled data and cannot be applied in an unpaired setting. ... |
2305.10210 | Benjamin Th\'erien | Benjamin Th\'erien, Chengjie Huang, Adrian Chow, Krzysztof Czarnecki | Object Re-Identification from Point Clouds | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Object re-identification (ReID) from images plays a critical role in
application domains of image retrieval (surveillance, retail analytics, etc.)
and multi-object tracking (autonomous driving, robotics, etc.). However,
systems that additionally or exclusively perceive the world from depth sensors
are becoming more c... | [
{
"created": "Wed, 17 May 2023 13:43:03 GMT",
"version": "v1"
},
{
"created": "Fri, 30 Jun 2023 20:26:53 GMT",
"version": "v2"
},
{
"created": "Fri, 11 Aug 2023 20:09:56 GMT",
"version": "v3"
}
] | 2023-08-15 | [
[
"Thérien",
"Benjamin",
""
],
[
"Huang",
"Chengjie",
""
],
[
"Chow",
"Adrian",
""
],
[
"Czarnecki",
"Krzysztof",
""
]
] | Object re-identification (ReID) from images plays a critical role in application domains of image retrieval (surveillance, retail analytics, etc.) and multi-object tracking (autonomous driving, robotics, etc.). However, systems that additionally or exclusively perceive the world from depth sensors are becoming more com... |
1306.4134 | Suket Arora | Suket Arora, Kamaljeet Batra, Sarabjit Singh | Dialogue System: A Brief Review | 4 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A Dialogue System is a system which interacts with human in natural language.
At present many universities are developing the dialogue system in their
regional language. This paper will discuss about dialogue system, its
components, challenges and its evaluation. This paper helps the researchers for
getting info rega... | [
{
"created": "Tue, 18 Jun 2013 10:32:43 GMT",
"version": "v1"
}
] | 2013-06-19 | [
[
"Arora",
"Suket",
""
],
[
"Batra",
"Kamaljeet",
""
],
[
"Singh",
"Sarabjit",
""
]
] | A Dialogue System is a system which interacts with human in natural language. At present many universities are developing the dialogue system in their regional language. This paper will discuss about dialogue system, its components, challenges and its evaluation. This paper helps the researchers for getting info regard... |
2106.03310 | Zi Wang | Zi Wang | Zero-Shot Knowledge Distillation from a Decision-Based Black-Box Model | Accepted to ICML 2021 | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Knowledge distillation (KD) is a successful approach for deep neural network
acceleration, with which a compact network (student) is trained by mimicking
the softmax output of a pre-trained high-capacity network (teacher). In
tradition, KD usually relies on access to the training samples and the
parameters of the whi... | [
{
"created": "Mon, 7 Jun 2021 02:46:31 GMT",
"version": "v1"
}
] | 2021-06-08 | [
[
"Wang",
"Zi",
""
]
] | Knowledge distillation (KD) is a successful approach for deep neural network acceleration, with which a compact network (student) is trained by mimicking the softmax output of a pre-trained high-capacity network (teacher). In tradition, KD usually relies on access to the training samples and the parameters of the white... |
2401.02646 | Aritra Mukherjee | Aritra Mukherjee, Abhijit Das | Recent Advancement in 3D Biometrics using Monocular Camera | Accepted and presented in IJCB 2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent literature has witnessed significant interest towards 3D biometrics
employing monocular vision for robust authentication methods. Motivated by
this, in this work we seek to provide insight on recent development in the area
of 3D biometrics employing monocular vision. We present the similarity and
dissimilarity... | [
{
"created": "Fri, 5 Jan 2024 05:32:37 GMT",
"version": "v1"
}
] | 2024-01-08 | [
[
"Mukherjee",
"Aritra",
""
],
[
"Das",
"Abhijit",
""
]
] | Recent literature has witnessed significant interest towards 3D biometrics employing monocular vision for robust authentication methods. Motivated by this, in this work we seek to provide insight on recent development in the area of 3D biometrics employing monocular vision. We present the similarity and dissimilarity o... |
2204.06558 | Aram Davtyan | Aram Davtyan and Paolo Favaro | Controllable Video Generation through Global and Local Motion Dynamics | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | We present GLASS, a method for Global and Local Action-driven Sequence
Synthesis. GLASS is a generative model that is trained on video sequences in an
unsupervised manner and that can animate an input image at test time. The
method learns to segment frames into foreground-background layers and to
generate transitions... | [
{
"created": "Wed, 13 Apr 2022 17:57:53 GMT",
"version": "v1"
}
] | 2022-04-14 | [
[
"Davtyan",
"Aram",
""
],
[
"Favaro",
"Paolo",
""
]
] | We present GLASS, a method for Global and Local Action-driven Sequence Synthesis. GLASS is a generative model that is trained on video sequences in an unsupervised manner and that can animate an input image at test time. The method learns to segment frames into foreground-background layers and to generate transitions o... |
2312.13536 | Zhenghan Chen | Siyang Luo, Ziyi Jiang, Zhenghan Chen, Xiaoxuan Liang | Domain Adaptive Graph Classification | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Despite the remarkable accomplishments of graph neural networks (GNNs), they
typically rely on task-specific labels, posing potential challenges in terms of
their acquisition. Existing work have been made to address this issue through
the lens of unsupervised domain adaptation, wherein labeled source graphs are
utili... | [
{
"created": "Thu, 21 Dec 2023 02:37:56 GMT",
"version": "v1"
}
] | 2023-12-22 | [
[
"Luo",
"Siyang",
""
],
[
"Jiang",
"Ziyi",
""
],
[
"Chen",
"Zhenghan",
""
],
[
"Liang",
"Xiaoxuan",
""
]
] | Despite the remarkable accomplishments of graph neural networks (GNNs), they typically rely on task-specific labels, posing potential challenges in terms of their acquisition. Existing work have been made to address this issue through the lens of unsupervised domain adaptation, wherein labeled source graphs are utilize... |
2008.00701 | Kaustav Bose | Archak Das, Kaustav Bose, Buddhadeb Sau | Memory Optimal Dispersion by Anonymous Mobile Robots | This is the full version of the paper, with the same title and
authors, that was accepted in the 7th Annual International Conference on
Algorithms and Discrete Applied Mathematics (CALDAM 2021), February 11-13,
2021, Ropar, India | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Consider a team of $k \leq n$ autonomous mobile robots initially placed at a
node of an arbitrary graph $G$ with $n$ nodes. The dispersion problem asks for
a distributed algorithm that allows the robots to reach a configuration in
which each robot is at a distinct node of the graph. If the robots are
anonymous, i.e.,... | [
{
"created": "Mon, 3 Aug 2020 08:12:20 GMT",
"version": "v1"
},
{
"created": "Fri, 4 Dec 2020 17:42:09 GMT",
"version": "v2"
}
] | 2020-12-07 | [
[
"Das",
"Archak",
""
],
[
"Bose",
"Kaustav",
""
],
[
"Sau",
"Buddhadeb",
""
]
] | Consider a team of $k \leq n$ autonomous mobile robots initially placed at a node of an arbitrary graph $G$ with $n$ nodes. The dispersion problem asks for a distributed algorithm that allows the robots to reach a configuration in which each robot is at a distinct node of the graph. If the robots are anonymous, i.e., t... |
1101.3348 | Wei Dai | Wei Dai, Olgica Milenkovic and Hoa Vin Pham | Structured sublinear compressive sensing via belief propagation | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressive sensing (CS) is a sampling technique designed for reducing the
complexity of sparse data acquisition. One of the major obstacles for practical
deployment of CS techniques is the signal reconstruction time and the high
storage cost of random sensing matrices. We propose a new structured
compressive sensing... | [
{
"created": "Mon, 17 Jan 2011 23:02:32 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Jul 2011 16:02:00 GMT",
"version": "v2"
}
] | 2011-07-12 | [
[
"Dai",
"Wei",
""
],
[
"Milenkovic",
"Olgica",
""
],
[
"Pham",
"Hoa Vin",
""
]
] | Compressive sensing (CS) is a sampling technique designed for reducing the complexity of sparse data acquisition. One of the major obstacles for practical deployment of CS techniques is the signal reconstruction time and the high storage cost of random sensing matrices. We propose a new structured compressive sensing s... |
cs/0409021 | Vita Hinze-Hoare | Vita Hinze-Hoare | Should Cyberspace Chat Rooms be closed to protect Children? | null | null | null | null | cs.CY | null | The explosion of people networking in cyberspace, disseminating terabytes of
information, is being promoted through the use of broadband, bluetooth
technology, and wireless mobile computing facilities. New communities within
such venues as virtual chat rooms discussion groups, newsgroups etc are being
created daily a... | [
{
"created": "Sat, 11 Sep 2004 19:23:21 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Hinze-Hoare",
"Vita",
""
]
] | The explosion of people networking in cyberspace, disseminating terabytes of information, is being promoted through the use of broadband, bluetooth technology, and wireless mobile computing facilities. New communities within such venues as virtual chat rooms discussion groups, newsgroups etc are being created daily and... |
2408.03303 | Jonggi Hong | Jonggi Hong and Hernisa Kacorri | Understanding How Blind Users Handle Object Recognition Errors:
Strategies and Challenges | null | null | 10.1145/3663548.3675635 | null | cs.HC cs.AI | http://creativecommons.org/licenses/by/4.0/ | Object recognition technologies hold the potential to support blind and
low-vision people in navigating the world around them. However, the gap between
benchmark performances and practical usability remains a significant challenge.
This paper presents a study aimed at understanding blind users' interaction
with objec... | [
{
"created": "Tue, 6 Aug 2024 17:09:56 GMT",
"version": "v1"
}
] | 2024-08-07 | [
[
"Hong",
"Jonggi",
""
],
[
"Kacorri",
"Hernisa",
""
]
] | Object recognition technologies hold the potential to support blind and low-vision people in navigating the world around them. However, the gap between benchmark performances and practical usability remains a significant challenge. This paper presents a study aimed at understanding blind users' interaction with object ... |
2001.05068 | Aaron Tucker | Aaron D. Tucker, Markus Anderljung, and Allan Dafoe | Social and Governance Implications of Improved Data Efficiency | 7 pages, 2 figures, accepted to Artificial Intelligence Ethics and
Society 2020 | null | 10.1145/3375627.3375863 | null | cs.CY cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Many researchers work on improving the data efficiency of machine learning.
What would happen if they succeed? This paper explores the social-economic
impact of increased data efficiency. Specifically, we examine the intuition
that data efficiency will erode the barriers to entry protecting incumbent
data-rich AI fir... | [
{
"created": "Tue, 14 Jan 2020 22:26:12 GMT",
"version": "v1"
}
] | 2020-01-16 | [
[
"Tucker",
"Aaron D.",
""
],
[
"Anderljung",
"Markus",
""
],
[
"Dafoe",
"Allan",
""
]
] | Many researchers work on improving the data efficiency of machine learning. What would happen if they succeed? This paper explores the social-economic impact of increased data efficiency. Specifically, we examine the intuition that data efficiency will erode the barriers to entry protecting incumbent data-rich AI firms... |
2212.13768 | Tiziano De Matteis | Johannes de Fine Licht, Tiziano De Matteis, Tal Ben-Nun, Andreas
Kuster, Oliver Rausch, Manuel Burger, Carl-Johannes Johnsen, Torsten Hoefler | Python FPGA Programming with Data-Centric Multi-Level Design | null | null | null | null | cs.DC cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Although high-level synthesis (HLS) tools have significantly improved
programmer productivity over hardware description languages, developing for
FPGAs remains tedious and error prone. Programmers must learn and implement a
large set of vendor-specific syntax, patterns, and tricks to optimize (or even
successfully co... | [
{
"created": "Wed, 28 Dec 2022 10:15:51 GMT",
"version": "v1"
}
] | 2022-12-29 | [
[
"Licht",
"Johannes de Fine",
""
],
[
"De Matteis",
"Tiziano",
""
],
[
"Ben-Nun",
"Tal",
""
],
[
"Kuster",
"Andreas",
""
],
[
"Rausch",
"Oliver",
""
],
[
"Burger",
"Manuel",
""
],
[
"Johnsen",
"Carl-Johannes",
... | Although high-level synthesis (HLS) tools have significantly improved programmer productivity over hardware description languages, developing for FPGAs remains tedious and error prone. Programmers must learn and implement a large set of vendor-specific syntax, patterns, and tricks to optimize (or even successfully comp... |
1605.01584 | Yongchao Liu | Yongchao Liu, Tony Pan, Srinivas Aluru | Parallel Pairwise Correlation Computation On Intel Xeon Phi Clusters | 9 pages, 2 figures, 2 tables, accepted by the SBAC-PAD 2016
conference | null | null | null | cs.DC q-bio.GN | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Co-expression network is a critical technique for the identification of
inter-gene interactions, which usually relies on all-pairs correlation (or
similar measure) computation between gene expression profiles across multiple
samples. Pearson's correlation coefficient (PCC) is one widely used technique
for gene co-exp... | [
{
"created": "Thu, 5 May 2016 13:30:28 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Jun 2016 13:35:27 GMT",
"version": "v2"
},
{
"created": "Tue, 27 Sep 2016 00:15:44 GMT",
"version": "v3"
}
] | 2016-09-28 | [
[
"Liu",
"Yongchao",
""
],
[
"Pan",
"Tony",
""
],
[
"Aluru",
"Srinivas",
""
]
] | Co-expression network is a critical technique for the identification of inter-gene interactions, which usually relies on all-pairs correlation (or similar measure) computation between gene expression profiles across multiple samples. Pearson's correlation coefficient (PCC) is one widely used technique for gene co-expre... |
2302.02178 | Leonie Weissweiler | Leonie Weissweiler, Taiqi He, Naoki Otani, David R. Mortensen, Lori
Levin, Hinrich Sch\"utze | Construction Grammar Provides Unique Insight into Neural Language Models | GURT 2023 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Construction Grammar (CxG) has recently been used as the basis for probing
studies that have investigated the performance of large pretrained language
models (PLMs) with respect to the structure and meaning of constructions. In
this position paper, we make suggestions for the continuation and augmentation
of this lin... | [
{
"created": "Sat, 4 Feb 2023 15:06:26 GMT",
"version": "v1"
}
] | 2023-02-07 | [
[
"Weissweiler",
"Leonie",
""
],
[
"He",
"Taiqi",
""
],
[
"Otani",
"Naoki",
""
],
[
"Mortensen",
"David R.",
""
],
[
"Levin",
"Lori",
""
],
[
"Schütze",
"Hinrich",
""
]
] | Construction Grammar (CxG) has recently been used as the basis for probing studies that have investigated the performance of large pretrained language models (PLMs) with respect to the structure and meaning of constructions. In this position paper, we make suggestions for the continuation and augmentation of this line ... |
0903.4366 | Dimitri Hendriks | Joerg Endrullis, Clemens Grabmayer, Dimitri Hendriks | Complexity of Fractran and Productivity | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In functional programming languages the use of infinite structures is common
practice. For total correctness of programs dealing with infinite structures
one must guarantee that every finite part of the result can be evaluated in
finitely many steps. This is known as productivity. For programming with
infinite struct... | [
{
"created": "Wed, 25 Mar 2009 15:14:00 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Jun 2009 10:05:41 GMT",
"version": "v2"
},
{
"created": "Fri, 31 Jul 2009 18:33:42 GMT",
"version": "v3"
}
] | 2009-07-31 | [
[
"Endrullis",
"Joerg",
""
],
[
"Grabmayer",
"Clemens",
""
],
[
"Hendriks",
"Dimitri",
""
]
] | In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarantee that every finite part of the result can be evaluated in finitely many steps. This is known as productivity. For programming with infinite structur... |
1706.02932 | James Thewlis | James Thewlis and Hakan Bilen and Andrea Vedaldi | Unsupervised learning of object frames by dense equivariant image
labelling | NIPS 2017 | null | null | null | cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the key challenges of visual perception is to extract abstract models
of 3D objects and object categories from visual measurements, which are
affected by complex nuisance factors such as viewpoint, occlusion, motion, and
deformations. Starting from the recent idea of viewpoint factorization, we
propose a new a... | [
{
"created": "Fri, 9 Jun 2017 12:49:36 GMT",
"version": "v1"
},
{
"created": "Sat, 18 Nov 2017 02:36:48 GMT",
"version": "v2"
}
] | 2017-11-21 | [
[
"Thewlis",
"James",
""
],
[
"Bilen",
"Hakan",
""
],
[
"Vedaldi",
"Andrea",
""
]
] | One of the key challenges of visual perception is to extract abstract models of 3D objects and object categories from visual measurements, which are affected by complex nuisance factors such as viewpoint, occlusion, motion, and deformations. Starting from the recent idea of viewpoint factorization, we propose a new app... |
2312.13105 | Preetha Chatterjee | Shyamal Mishra, Preetha Chatterjee | Exploring ChatGPT for Toxicity Detection in GitHub | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Fostering a collaborative and inclusive environment is crucial for the
sustained progress of open source development. However, the prevalence of
negative discourse, often manifested as toxic comments, poses significant
challenges to developer well-being and productivity. To identify such
negativity in project communi... | [
{
"created": "Wed, 20 Dec 2023 15:23:00 GMT",
"version": "v1"
}
] | 2023-12-21 | [
[
"Mishra",
"Shyamal",
""
],
[
"Chatterjee",
"Preetha",
""
]
] | Fostering a collaborative and inclusive environment is crucial for the sustained progress of open source development. However, the prevalence of negative discourse, often manifested as toxic comments, poses significant challenges to developer well-being and productivity. To identify such negativity in project communica... |
2309.14845 | Xingrong Diao | Xingrong Diao, Wenzheng Chi, Jiankun Wang | Graph Neural Network Based Method for Path Planning Problem | null | null | null | null | cs.RO cs.SY eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sampling-based path planning is a widely used method in robotics,
particularly in high-dimensional state space. Among the whole process of the
path planning, collision detection is the most time-consuming operation. In
this paper, we propose a learning-based path planning method that aims to
reduce the number of coll... | [
{
"created": "Tue, 26 Sep 2023 11:20:57 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Nov 2023 11:59:15 GMT",
"version": "v2"
}
] | 2023-11-23 | [
[
"Diao",
"Xingrong",
""
],
[
"Chi",
"Wenzheng",
""
],
[
"Wang",
"Jiankun",
""
]
] | Sampling-based path planning is a widely used method in robotics, particularly in high-dimensional state space. Among the whole process of the path planning, collision detection is the most time-consuming operation. In this paper, we propose a learning-based path planning method that aims to reduce the number of collis... |
2404.05621 | Matteo Farina | Matteo Farina, Massimiliano Mancini, Elia Cunegatti, Gaowen Liu,
Giovanni Iacca and Elisa Ricci | MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning | CVPR 2024 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | While excellent in transfer learning, Vision-Language models (VLMs) come with
high computational costs due to their large number of parameters. To address
this issue, removing parameters via model pruning is a viable solution.
However, existing techniques for VLMs are task-specific, and thus require
pruning the netwo... | [
{
"created": "Mon, 8 Apr 2024 15:51:21 GMT",
"version": "v1"
}
] | 2024-04-09 | [
[
"Farina",
"Matteo",
""
],
[
"Mancini",
"Massimiliano",
""
],
[
"Cunegatti",
"Elia",
""
],
[
"Liu",
"Gaowen",
""
],
[
"Iacca",
"Giovanni",
""
],
[
"Ricci",
"Elisa",
""
]
] | While excellent in transfer learning, Vision-Language models (VLMs) come with high computational costs due to their large number of parameters. To address this issue, removing parameters via model pruning is a viable solution. However, existing techniques for VLMs are task-specific, and thus require pruning the network... |
1703.01485 | Sreelekha S | Sreelekha S, Pushpak Bhattacharyya | Lexical Resources for Hindi Marathi MT | 9 tables | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we describe some ways to utilize various lexical resources to
improve the quality of statistical machine translation system. We have
augmented the training corpus with various lexical resources such as
IndoWordnet semantic relation set, function words, kridanta pairs and verb
phrases etc. Our research o... | [
{
"created": "Sat, 4 Mar 2017 15:55:01 GMT",
"version": "v1"
}
] | 2017-03-07 | [
[
"S",
"Sreelekha",
""
],
[
"Bhattacharyya",
"Pushpak",
""
]
] | In this paper we describe some ways to utilize various lexical resources to improve the quality of statistical machine translation system. We have augmented the training corpus with various lexical resources such as IndoWordnet semantic relation set, function words, kridanta pairs and verb phrases etc. Our research on ... |
2109.13209 | Quentin Heinrich | Quentin Heinrich, Gautier Viaud, Wacim Belblidia | FQuAD2.0: French Question Answering and knowing that you know nothing | 12 pages, 2 figures | null | null | null | cs.CL cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Question Answering, including Reading Comprehension, is one of the NLP
research areas that has seen significant scientific breakthroughs over the past
few years, thanks to the concomitant advances in Language Modeling. Most of
these breakthroughs, however, are centered on the English language. In 2020, as
a first str... | [
{
"created": "Mon, 27 Sep 2021 17:30:46 GMT",
"version": "v1"
}
] | 2021-09-28 | [
[
"Heinrich",
"Quentin",
""
],
[
"Viaud",
"Gautier",
""
],
[
"Belblidia",
"Wacim",
""
]
] | Question Answering, including Reading Comprehension, is one of the NLP research areas that has seen significant scientific breakthroughs over the past few years, thanks to the concomitant advances in Language Modeling. Most of these breakthroughs, however, are centered on the English language. In 2020, as a first stron... |
cs/0509036 | Shujun Li Dr. | Shujun Li and Kwok-Tung Lo | Security Problems with Improper Implementations of Improved FEA-M | 8 pages, elsart.cls | Journal of Systems and Software, vol. 80, no. 5, pp. 791-794, 2007 | 10.1016/j.jss.2006.05.002 | null | cs.CR cs.MM | null | This paper reports security problems with improper implementations of an
improved version of FEA-M (fast encryption algorithm for multimedia). It is
found that an implementation-dependent differential chosen-plaintext attack or
its chosen-ciphertext counterpart can reveal the secret key of the
cryptosystem, if the in... | [
{
"created": "Tue, 13 Sep 2005 10:35:52 GMT",
"version": "v1"
},
{
"created": "Sun, 25 Jun 2006 12:20:53 GMT",
"version": "v2"
}
] | 2007-05-23 | [
[
"Li",
"Shujun",
""
],
[
"Lo",
"Kwok-Tung",
""
]
] | This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-dependent differential chosen-plaintext attack or its chosen-ciphertext counterpart can reveal the secret key of the cryptosystem, if the invo... |
1111.4335 | Jyotirmoy Karjee | Jyotirmoy Karjee, H.S Jamadagni | Energy Aware Node Selection for Cluster-based Data Accuracy Estimation
in Wireless Sensor Networks | 11 pages | null | null | null | cs.NI | http://creativecommons.org/licenses/by/3.0/ | The main objective of this paper is to reduce the number of sensor nodes by
estimating a trade off between data accuracy and energy consumption for
selecting nodes in probabilistic approach in distributed networks. Design
Procedure/Approach: Observed data are highly correlated among sensor nodes in
the spatial domain... | [
{
"created": "Fri, 18 Nov 2011 11:21:42 GMT",
"version": "v1"
}
] | 2011-11-21 | [
[
"Karjee",
"Jyotirmoy",
""
],
[
"Jamadagni",
"H. S",
""
]
] | The main objective of this paper is to reduce the number of sensor nodes by estimating a trade off between data accuracy and energy consumption for selecting nodes in probabilistic approach in distributed networks. Design Procedure/Approach: Observed data are highly correlated among sensor nodes in the spatial domain d... |
2405.03039 | Dong Chen | Dong Chen, Arman Hosseini, Arik Smith, Amir Farzin Nikkhah, Arsalan
Heydarian, Omid Shoghli, Bradford Campbell | Performance Evaluation of Real-Time Object Detection for Electric
Scooters | 10 pages, 3 figures | null | null | null | cs.CV cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | Electric scooters (e-scooters) have rapidly emerged as a popular mode of
transportation in urban areas, yet they pose significant safety challenges. In
the United States, the rise of e-scooters has been marked by a concerning
increase in related injuries and fatalities. Recently, while deep-learning
object detection ... | [
{
"created": "Sun, 5 May 2024 20:00:22 GMT",
"version": "v1"
}
] | 2024-05-07 | [
[
"Chen",
"Dong",
""
],
[
"Hosseini",
"Arman",
""
],
[
"Smith",
"Arik",
""
],
[
"Nikkhah",
"Amir Farzin",
""
],
[
"Heydarian",
"Arsalan",
""
],
[
"Shoghli",
"Omid",
""
],
[
"Campbell",
"Bradford",
""
]
] | Electric scooters (e-scooters) have rapidly emerged as a popular mode of transportation in urban areas, yet they pose significant safety challenges. In the United States, the rise of e-scooters has been marked by a concerning increase in related injuries and fatalities. Recently, while deep-learning object detection ho... |
1706.08146 | Vatsal Sharan | Vatsal Sharan, Kai Sheng Tai, Peter Bailis, Gregory Valiant | Compressed Factorization: Fast and Accurate Low-Rank Factorization of
Compressively-Sensed Data | Updates for ICML'19 camera-ready | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | What learning algorithms can be run directly on compressively-sensed data? In
this work, we consider the question of accurately and efficiently computing
low-rank matrix or tensor factorizations given data compressed via random
projections. We examine the approach of first performing factorization in the
compressed d... | [
{
"created": "Sun, 25 Jun 2017 17:47:16 GMT",
"version": "v1"
},
{
"created": "Wed, 30 May 2018 09:13:19 GMT",
"version": "v2"
},
{
"created": "Mon, 27 May 2019 08:27:04 GMT",
"version": "v3"
}
] | 2019-05-28 | [
[
"Sharan",
"Vatsal",
""
],
[
"Tai",
"Kai Sheng",
""
],
[
"Bailis",
"Peter",
""
],
[
"Valiant",
"Gregory",
""
]
] | What learning algorithms can be run directly on compressively-sensed data? In this work, we consider the question of accurately and efficiently computing low-rank matrix or tensor factorizations given data compressed via random projections. We examine the approach of first performing factorization in the compressed dom... |
1907.11762 | Soumya Dutta | Soumya Dutta and Ayan Biswas and James Ahrens | Multivariate Pointwise Information-Driven Data Sampling and
Visualization | 25 pages | Entropy, Volume 21, Issue 7, Year 2019 | 10.3390/e21070699 | null | cs.HC cs.GR cs.IT math.IT stat.AP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With increasing computing capabilities of modern supercomputers, the size of
the data generated from the scientific simulations is growing rapidly. As a
result, application scientists need effective data summarization techniques
that can reduce large-scale multivariate spatiotemporal data sets while
preserving the im... | [
{
"created": "Fri, 26 Jul 2019 19:32:53 GMT",
"version": "v1"
}
] | 2019-07-30 | [
[
"Dutta",
"Soumya",
""
],
[
"Biswas",
"Ayan",
""
],
[
"Ahrens",
"James",
""
]
] | With increasing computing capabilities of modern supercomputers, the size of the data generated from the scientific simulations is growing rapidly. As a result, application scientists need effective data summarization techniques that can reduce large-scale multivariate spatiotemporal data sets while preserving the impo... |
1108.3754 | Morgan Barbier | Morgan Barbier (INRIA Saclay - Ile de France, LIX), Christophe Chabot
(LJK), Guillaume Quintin (INRIA Saclay - Ile de France, LIX) | On Quasi-Cyclic Codes as a Generalization of Cyclic Codes | (18/08/2011) | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this article we see quasi-cyclic codes as block cyclic codes. We
generalize some properties of cyclic codes to quasi-cyclic ones such as
generator polynomials and ideals. Indeed we show a one-to-one correspondence
between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m-1). This
permits to construct ... | [
{
"created": "Thu, 18 Aug 2011 14:02:57 GMT",
"version": "v1"
},
{
"created": "Fri, 25 May 2012 14:29:36 GMT",
"version": "v2"
}
] | 2012-05-30 | [
[
"Barbier",
"Morgan",
"",
"INRIA Saclay - Ile de France, LIX"
],
[
"Chabot",
"Christophe",
"",
"LJK"
],
[
"Quintin",
"Guillaume",
"",
"INRIA Saclay - Ile de France, LIX"
]
] | In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length m and ideals of M_l(Fq)[X]/(X^m-1). This permits to construct ne... |
2007.06392 | Mahdi Rezaei | Amir Sharifi, Ahmadreza Zibaei, Mahdi Rezaei | DeepHAZMAT: Hazardous Materials Sign Detection and Segmentation with
Restricted Computational Resources | null | null | null | null | cs.CV cs.LG cs.RO cs.SY eess.IV eess.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most challenging and non-trivial tasks in robot-based rescue
operations is the Hazardous Materials or HAZMATs sign detection in the
operation field, to prevent further unexpected disasters. Each Hazmat sign has
a specific meaning that the rescue robot should detect and interpret it to take
a safe action, a... | [
{
"created": "Mon, 13 Jul 2020 14:15:37 GMT",
"version": "v1"
},
{
"created": "Sat, 18 Jul 2020 12:12:55 GMT",
"version": "v2"
}
] | 2020-07-21 | [
[
"Sharifi",
"Amir",
""
],
[
"Zibaei",
"Ahmadreza",
""
],
[
"Rezaei",
"Mahdi",
""
]
] | One of the most challenging and non-trivial tasks in robot-based rescue operations is the Hazardous Materials or HAZMATs sign detection in the operation field, to prevent further unexpected disasters. Each Hazmat sign has a specific meaning that the rescue robot should detect and interpret it to take a safe action, acc... |
2012.15211 | Claudia Flores-Saviaga | Claudia Flores-Saviaga, Yuwen Li, Benjamin V. Hanrahan, Jeffrey
Bigham, Saiph Savage | The Challenges of Crowd Workers in Rural and Urban America | null | Proceedings of the AAAI Conference on Human Computation and
Crowdsourcing 2020 | null | null | cs.HC | http://creativecommons.org/licenses/by/4.0/ | Crowd work has the potential of helping the financial recovery of regions
traditionally plagued by a lack of economic opportunities, e.g., rural areas.
However, we currently have limited information about the challenges facing
crowd work-ers from rural and super rural areas as they struggle to make a
living through c... | [
{
"created": "Wed, 30 Dec 2020 16:08:11 GMT",
"version": "v1"
}
] | 2021-01-01 | [
[
"Flores-Saviaga",
"Claudia",
""
],
[
"Li",
"Yuwen",
""
],
[
"Hanrahan",
"Benjamin V.",
""
],
[
"Bigham",
"Jeffrey",
""
],
[
"Savage",
"Saiph",
""
]
] | Crowd work has the potential of helping the financial recovery of regions traditionally plagued by a lack of economic opportunities, e.g., rural areas. However, we currently have limited information about the challenges facing crowd work-ers from rural and super rural areas as they struggle to make a living through cro... |
0901.0824 | Micha{\l} Kaliszan | S{\l}awomir Sta\'nczak and Micha{\l} Kaliszan and Nicholas Bambos and
Marcin Wiczanowski | A Characterization of Max-Min SIR-Balanced Power Allocation with
Applications | 21 pages (onecolumn), 2 figures; changed (extended) content | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider a power-controlled wireless network with an established network
topology in which the communication links (transmitter-receiver pairs) are
corrupted by the co-channel interference and background noise. We have fairly
general power constraints since the vector of transmit powers is confined to
belong to an... | [
{
"created": "Wed, 7 Jan 2009 16:23:04 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jul 2009 13:07:11 GMT",
"version": "v2"
}
] | 2009-07-21 | [
[
"Stańczak",
"Sławomir",
""
],
[
"Kaliszan",
"Michał",
""
],
[
"Bambos",
"Nicholas",
""
],
[
"Wiczanowski",
"Marcin",
""
]
] | We consider a power-controlled wireless network with an established network topology in which the communication links (transmitter-receiver pairs) are corrupted by the co-channel interference and background noise. We have fairly general power constraints since the vector of transmit powers is confined to belong to an a... |
2210.11948 | Mitchell Wortsman | Mitchell Wortsman, Suchin Gururangan, Shen Li, Ali Farhadi, Ludwig
Schmidt, Michael Rabbat, Ari S. Morcos | lo-fi: distributed fine-tuning without communication | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | When fine-tuning large neural networks, it is common to use multiple nodes
and to communicate gradients at each optimization step. By contrast, we
investigate completely local fine-tuning, which we refer to as lo-fi. During
lo-fi, each node is fine-tuned independently without any communication. Then,
the weights are ... | [
{
"created": "Wed, 19 Oct 2022 20:15:18 GMT",
"version": "v1"
},
{
"created": "Sat, 12 Nov 2022 21:59:57 GMT",
"version": "v2"
}
] | 2022-11-17 | [
[
"Wortsman",
"Mitchell",
""
],
[
"Gururangan",
"Suchin",
""
],
[
"Li",
"Shen",
""
],
[
"Farhadi",
"Ali",
""
],
[
"Schmidt",
"Ludwig",
""
],
[
"Rabbat",
"Michael",
""
],
[
"Morcos",
"Ari S.",
""
]
] | When fine-tuning large neural networks, it is common to use multiple nodes and to communicate gradients at each optimization step. By contrast, we investigate completely local fine-tuning, which we refer to as lo-fi. During lo-fi, each node is fine-tuned independently without any communication. Then, the weights are av... |
1810.10703 | Pramod Kaushik Mudrakarta | Pramod Kaushik Mudrakarta, Mark Sandler, Andrey Zhmoginov, Andrew
Howard | K for the Price of 1: Parameter-efficient Multi-task and Transfer
Learning | published at ICLR 2019 | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a novel method that enables parameter-efficient transfer and
multi-task learning with deep neural networks. The basic approach is to learn a
model patch - a small set of parameters - that will specialize to each task,
instead of fine-tuning the last layer or the entire network. For instance, we
show that... | [
{
"created": "Thu, 25 Oct 2018 03:12:37 GMT",
"version": "v1"
},
{
"created": "Sun, 24 Feb 2019 02:03:00 GMT",
"version": "v2"
}
] | 2019-02-26 | [
[
"Mudrakarta",
"Pramod Kaushik",
""
],
[
"Sandler",
"Mark",
""
],
[
"Zhmoginov",
"Andrey",
""
],
[
"Howard",
"Andrew",
""
]
] | We introduce a novel method that enables parameter-efficient transfer and multi-task learning with deep neural networks. The basic approach is to learn a model patch - a small set of parameters - that will specialize to each task, instead of fine-tuning the last layer or the entire network. For instance, we show that l... |
2404.12942 | Nicolas Ugrinovic | Nicolas Ugrinovic and Thomas Lucas and Fabien Baradel and Philippe
Weinzaepfel and Gregory Rogez and Francesc Moreno-Noguer | Purposer: Putting Human Motion Generation in Context | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We present a novel method to generate human motion to populate 3D indoor
scenes. It can be controlled with various combinations of conditioning signals
such as a path in a scene, target poses, past motions, and scenes represented
as 3D point clouds. State-of-the-art methods are either models specialized to
one single... | [
{
"created": "Fri, 19 Apr 2024 15:16:04 GMT",
"version": "v1"
}
] | 2024-04-22 | [
[
"Ugrinovic",
"Nicolas",
""
],
[
"Lucas",
"Thomas",
""
],
[
"Baradel",
"Fabien",
""
],
[
"Weinzaepfel",
"Philippe",
""
],
[
"Rogez",
"Gregory",
""
],
[
"Moreno-Noguer",
"Francesc",
""
]
] | We present a novel method to generate human motion to populate 3D indoor scenes. It can be controlled with various combinations of conditioning signals such as a path in a scene, target poses, past motions, and scenes represented as 3D point clouds. State-of-the-art methods are either models specialized to one single s... |
1004.4710 | Richard Brent | Richard P. Brent and Paul Zimmermann | Modern Computer Arithmetic (version 0.5.1) | Preliminary version of a book to be published by Cambridge University
Press. xvi+247 pages. Cite as "Modern Computer Arithmetic, Version 0.5.1, 5
March 2010". For further details, updates and errata see
http://wwwmaths.anu.edu.au/~brent/pub/pub226.html or
http://www.loria.fr/~zimmerma/mca/pub226.html | Cambridge Monographs on Computational and Applied Mathematics (No.
18), Cambridge University Press, November 2010, 236 pages | 10.1017/cbo9780511921698.001 | null | cs.DS cs.NA math.NA math.NT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This is a draft of a book about algorithms for performing arithmetic, and
their implementation on modern computers. We are concerned with software more
than hardware - we do not cover computer architecture or the design of computer
hardware. Instead we focus on algorithms for efficiently performing arithmetic
operati... | [
{
"created": "Tue, 27 Apr 2010 04:42:33 GMT",
"version": "v1"
}
] | 2021-06-28 | [
[
"Brent",
"Richard P.",
""
],
[
"Zimmermann",
"Paul",
""
]
] | This is a draft of a book about algorithms for performing arithmetic, and their implementation on modern computers. We are concerned with software more than hardware - we do not cover computer architecture or the design of computer hardware. Instead we focus on algorithms for efficiently performing arithmetic operation... |
1610.08030 | Georg B\"ocherer | Georg B\"ocherer, Tobias Prinz, Peihong Yuan, Fabian Steiner | Efficient Polar Code Construction for Higher-Order Modulation | 11 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | An efficient algorithm for the construction of polar codes for higher-order
modulation is presented based on information-theoretic principles. The bit
reliabilities after successive demapping are estimated using the LM-rate, an
achievable rate for mismatched decoding. The successive demapper bit channels
are then rep... | [
{
"created": "Tue, 25 Oct 2016 19:33:02 GMT",
"version": "v1"
}
] | 2016-10-26 | [
[
"Böcherer",
"Georg",
""
],
[
"Prinz",
"Tobias",
""
],
[
"Yuan",
"Peihong",
""
],
[
"Steiner",
"Fabian",
""
]
] | An efficient algorithm for the construction of polar codes for higher-order modulation is presented based on information-theoretic principles. The bit reliabilities after successive demapping are estimated using the LM-rate, an achievable rate for mismatched decoding. The successive demapper bit channels are then repla... |
1904.09947 | Nicholas Turner | Nicholas Turner, Kisuk Lee, Ran Lu, Jingpeng Wu, Dodam Ih, H.
Sebastian Seung | Synaptic Partner Assignment Using Attentional Voxel Association Networks | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Connectomics aims to recover a complete set of synaptic connections within a
dataset imaged by volume electron microscopy. Many systems have been proposed
for locating synapses, and recent research has included a way to identify the
synaptic partners that communicate at a synaptic cleft. We re-frame the problem
of id... | [
{
"created": "Mon, 22 Apr 2019 16:49:41 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Nov 2019 01:39:03 GMT",
"version": "v2"
}
] | 2019-11-25 | [
[
"Turner",
"Nicholas",
""
],
[
"Lee",
"Kisuk",
""
],
[
"Lu",
"Ran",
""
],
[
"Wu",
"Jingpeng",
""
],
[
"Ih",
"Dodam",
""
],
[
"Seung",
"H. Sebastian",
""
]
] | Connectomics aims to recover a complete set of synaptic connections within a dataset imaged by volume electron microscopy. Many systems have been proposed for locating synapses, and recent research has included a way to identify the synaptic partners that communicate at a synaptic cleft. We re-frame the problem of iden... |
2006.08792 | Emiel Van Miltenburg | Emiel van Miltenburg | On the use of human reference data for evaluating automatic image
descriptions | Originally presented as a (non-archival) poster at the VizWiz 2020
workshop, collocated with CVPR 2020. See:
https://vizwiz.org/workshops/2020-workshop/ | null | null | null | cs.CL cs.CV cs.HC | http://creativecommons.org/licenses/by/4.0/ | Automatic image description systems are commonly trained and evaluated using
crowdsourced, human-generated image descriptions. The best-performing system is
then determined using some measure of similarity to the reference data (BLEU,
Meteor, CIDER, etc). Thus, both the quality of the systems as well as the
quality o... | [
{
"created": "Mon, 15 Jun 2020 21:57:27 GMT",
"version": "v1"
}
] | 2020-06-17 | [
[
"van Miltenburg",
"Emiel",
""
]
] | Automatic image description systems are commonly trained and evaluated using crowdsourced, human-generated image descriptions. The best-performing system is then determined using some measure of similarity to the reference data (BLEU, Meteor, CIDER, etc). Thus, both the quality of the systems as well as the quality of ... |
2405.01524 | Luciano Dyballa | Luciano Dyballa, Evan Gerritz, Steven W. Zucker | A separability-based approach to quantifying generalization: which layer
is best? | 6, pages, 6 figures | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | Generalization to unseen data remains poorly understood for deep learning
classification and foundation models. How can one assess the ability of
networks to adapt to new or extended versions of their input space in the
spirit of few-shot learning, out-of-distribution generalization, and domain
adaptation? Which laye... | [
{
"created": "Thu, 2 May 2024 17:54:35 GMT",
"version": "v1"
},
{
"created": "Fri, 3 May 2024 16:03:57 GMT",
"version": "v2"
}
] | 2024-05-06 | [
[
"Dyballa",
"Luciano",
""
],
[
"Gerritz",
"Evan",
""
],
[
"Zucker",
"Steven W.",
""
]
] | Generalization to unseen data remains poorly understood for deep learning classification and foundation models. How can one assess the ability of networks to adapt to new or extended versions of their input space in the spirit of few-shot learning, out-of-distribution generalization, and domain adaptation? Which layers... |
1905.02304 | Justin Chen | Justin Chen, Edward Gan, Kexin Rong, Sahaana Suri, Peter Bailis | CrossTrainer: Practical Domain Adaptation with Loss Reweighting | null | null | 10.1145/3329486.3329491 | null | cs.LG cs.DB stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Domain adaptation provides a powerful set of model training techniques given
domain-specific training data and supplemental data with unknown relevance. The
techniques are useful when users need to develop models with data from varying
sources, of varying quality, or from different time ranges. We build
CrossTrainer,... | [
{
"created": "Tue, 7 May 2019 00:48:48 GMT",
"version": "v1"
}
] | 2019-05-08 | [
[
"Chen",
"Justin",
""
],
[
"Gan",
"Edward",
""
],
[
"Rong",
"Kexin",
""
],
[
"Suri",
"Sahaana",
""
],
[
"Bailis",
"Peter",
""
]
] | Domain adaptation provides a powerful set of model training techniques given domain-specific training data and supplemental data with unknown relevance. The techniques are useful when users need to develop models with data from varying sources, of varying quality, or from different time ranges. We build CrossTrainer, a... |
2105.13817 | Marco Scutari | Marco Scutari and Francesca Panero and Manuel Proissl | Achieving Fairness with a Simple Ridge Penalty | 16 pages, 9 figures | Statistics and Computing (2022), 32, 77 | null | null | cs.LG stat.ME | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we present a general framework for estimating regression models
subject to a user-defined level of fairness. We enforce fairness as a model
selection step in which we choose the value of a ridge penalty to control the
effect of sensitive attributes. We then estimate the parameters of the model
condition... | [
{
"created": "Tue, 18 May 2021 15:43:57 GMT",
"version": "v1"
},
{
"created": "Mon, 16 Aug 2021 09:30:03 GMT",
"version": "v2"
},
{
"created": "Mon, 29 Aug 2022 21:05:11 GMT",
"version": "v3"
}
] | 2022-11-16 | [
[
"Scutari",
"Marco",
""
],
[
"Panero",
"Francesca",
""
],
[
"Proissl",
"Manuel",
""
]
] | In this paper we present a general framework for estimating regression models subject to a user-defined level of fairness. We enforce fairness as a model selection step in which we choose the value of a ridge penalty to control the effect of sensitive attributes. We then estimate the parameters of the model conditional... |
2402.07369 | Tonglong Wei | Tonglong Wei, Youfang Lin, Shengnan Guo, Yan Lin, Yiheng Huang,
Chenyang Xiang, Yuqing Bai, Menglu Ya, Huaiyu Wan | Diff-RNTraj: A Structure-aware Diffusion Model for Road
Network-constrained Trajectory Generation | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Trajectory data is essential for various applications as it records the
movement of vehicles. However, publicly available trajectory datasets remain
limited in scale due to privacy concerns, which hinders the development of
trajectory data mining and trajectory-based applications. To address this
issue, some methods ... | [
{
"created": "Mon, 12 Feb 2024 01:59:51 GMT",
"version": "v1"
}
] | 2024-02-13 | [
[
"Wei",
"Tonglong",
""
],
[
"Lin",
"Youfang",
""
],
[
"Guo",
"Shengnan",
""
],
[
"Lin",
"Yan",
""
],
[
"Huang",
"Yiheng",
""
],
[
"Xiang",
"Chenyang",
""
],
[
"Bai",
"Yuqing",
""
],
[
"Ya",
"Meng... | Trajectory data is essential for various applications as it records the movement of vehicles. However, publicly available trajectory datasets remain limited in scale due to privacy concerns, which hinders the development of trajectory data mining and trajectory-based applications. To address this issue, some methods fo... |
1812.09954 | Arvind Krishna Sridhar | Anees Kazi (1), S.Arvind krishna (2), Shayan Shekarforoush (3),
Karsten Kortuem (4), Shadi Albarqouni (1), Nassir Navab (1 and 5) ((1)
Computer Aided Medical Procedures, Technische Universit Munchen, Germany, (2)
National Institute of Technology Tiruchirappalli, India, (3) Sharif
University of Technology, Iran,... | Self-Attention Equipped Graph Convolutions for Disease Prediction | 4 pages, 4 figures, paper accepted in ISBI 2019 | null | null | null | cs.LG eess.IV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-modal data comprising imaging (MRI, fMRI, PET, etc.) and non-imaging
(clinical test, demographics, etc.) data can be collected together and used for
disease prediction. Such diverse data gives complementary information about the
patient\'s condition to make an informed diagnosis. A model capable of
leveraging t... | [
{
"created": "Mon, 24 Dec 2018 16:56:37 GMT",
"version": "v1"
}
] | 2018-12-27 | [
[
"Kazi",
"Anees",
"",
"1 and 5"
],
[
"krishna",
"S. Arvind",
"",
"1 and 5"
],
[
"Shekarforoush",
"Shayan",
"",
"1 and 5"
],
[
"Kortuem",
"Karsten",
"",
"1 and 5"
],
[
"Albarqouni",
"Shadi",
"",
"1 and 5"
],
[
"N... | Multi-modal data comprising imaging (MRI, fMRI, PET, etc.) and non-imaging (clinical test, demographics, etc.) data can be collected together and used for disease prediction. Such diverse data gives complementary information about the patient\'s condition to make an informed diagnosis. A model capable of leveraging the... |
2009.01142 | Yazan Abu Farha | Yazan Abu Farha, Qiuhong Ke, Bernt Schiele, Juergen Gall | Long-Term Anticipation of Activities with Cycle Consistency | GCPR 2020 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the success of deep learning methods in analyzing activities in videos,
more attention has recently been focused towards anticipating future
activities. However, most of the work on anticipation either analyzes a
partially observed activity or predicts the next action class. Recently, new
approaches have been pr... | [
{
"created": "Wed, 2 Sep 2020 15:41:32 GMT",
"version": "v1"
}
] | 2020-09-03 | [
[
"Farha",
"Yazan Abu",
""
],
[
"Ke",
"Qiuhong",
""
],
[
"Schiele",
"Bernt",
""
],
[
"Gall",
"Juergen",
""
]
] | With the success of deep learning methods in analyzing activities in videos, more attention has recently been focused towards anticipating future activities. However, most of the work on anticipation either analyzes a partially observed activity or predicts the next action class. Recently, new approaches have been prop... |
2401.11218 | Elena Chistova | Elena Chistova | End-to-End Argument Mining over Varying Rhetorical Structures | null | Findings of the Association for Computational Linguistics: ACL
2023, 3376-3391 | 10.18653/v1/2023.findings-acl.209 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Rhetorical Structure Theory implies no single discourse interpretation of a
text, and the limitations of RST parsers further exacerbate inconsistent
parsing of similar structures. Therefore, it is important to take into account
that the same argumentative structure can be found in semantically similar
texts with vary... | [
{
"created": "Sat, 20 Jan 2024 12:00:40 GMT",
"version": "v1"
}
] | 2024-01-23 | [
[
"Chistova",
"Elena",
""
]
] | Rhetorical Structure Theory implies no single discourse interpretation of a text, and the limitations of RST parsers further exacerbate inconsistent parsing of similar structures. Therefore, it is important to take into account that the same argumentative structure can be found in semantically similar texts with varyin... |
1407.3286 | Srikanth Sastry | Srikanth Sastry and Josef Widder | Solvability-Based Comparison of Failure Detectors | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Failure detectors are oracles that have been introduced to provide processes
in asynchronous systems with information about faults. This information can
then be used to solve problems otherwise unsolvable in asynchronous systems. A
natural question is on the "minimum amount of information" a failure detector
has to p... | [
{
"created": "Fri, 11 Jul 2014 20:17:12 GMT",
"version": "v1"
}
] | 2014-07-15 | [
[
"Sastry",
"Srikanth",
""
],
[
"Widder",
"Josef",
""
]
] | Failure detectors are oracles that have been introduced to provide processes in asynchronous systems with information about faults. This information can then be used to solve problems otherwise unsolvable in asynchronous systems. A natural question is on the "minimum amount of information" a failure detector has to pro... |
0906.4481 | Pankaj Kohli | Pankaj Kohli | Coarse-grained Dynamic Taint Analysis for Defeating Control and
Non-control Data Attacks | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Memory corruption attacks remain the primary threat for computer security.
Information flow tracking or taint analysis has been proven to be effective
against most memory corruption attacks. However, there are two shortcomings
with current taint analysis based techniques. First, these techniques cause
application slo... | [
{
"created": "Wed, 24 Jun 2009 14:07:35 GMT",
"version": "v1"
},
{
"created": "Wed, 1 Jul 2009 07:18:43 GMT",
"version": "v2"
}
] | 2015-03-13 | [
[
"Kohli",
"Pankaj",
""
]
] | Memory corruption attacks remain the primary threat for computer security. Information flow tracking or taint analysis has been proven to be effective against most memory corruption attacks. However, there are two shortcomings with current taint analysis based techniques. First, these techniques cause application slowd... |
1810.08276 | Rudini Sampaio | Rafael Araujo, Eurinardo Costa, Sulamita Klein, Rudini Sampaio,
Ueverton S. Souza | FPT algorithms to recognize well covered graphs | 15 pages, 2 figures | Discrete Mathematics & Theoretical Computer Science, vol. 21 no.
1, ICGT 2018 (April 2, 2019) dmtcs:4905 | 10.23638/DMTCS-21-1-3 | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a graph $G$, let $vc(G)$ and $vc^+(G)$ be the sizes of a minimum and a
maximum minimal vertex covers of $G$, respectively. We say that $G$ is well
covered if $vc(G)=vc^+(G)$ (that is, all minimal vertex covers have the same
size). Determining if a graph is well covered is a coNP-complete problem. In
this paper,... | [
{
"created": "Thu, 18 Oct 2018 21:01:47 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Oct 2018 03:42:41 GMT",
"version": "v2"
},
{
"created": "Wed, 20 Mar 2019 20:31:28 GMT",
"version": "v3"
},
{
"created": "Mon, 1 Apr 2019 15:23:34 GMT",
"version": "v4"
}
] | 2023-06-22 | [
[
"Araujo",
"Rafael",
""
],
[
"Costa",
"Eurinardo",
""
],
[
"Klein",
"Sulamita",
""
],
[
"Sampaio",
"Rudini",
""
],
[
"Souza",
"Ueverton S.",
""
]
] | Given a graph $G$, let $vc(G)$ and $vc^+(G)$ be the sizes of a minimum and a maximum minimal vertex covers of $G$, respectively. We say that $G$ is well covered if $vc(G)=vc^+(G)$ (that is, all minimal vertex covers have the same size). Determining if a graph is well covered is a coNP-complete problem. In this paper, w... |
2306.14011 | Weicheng Xue | Weicheng Xue, Christohper John Roy | Machine Learning-driven Autotuning of Graphics Processing Unit
Accelerated Computational Fluid Dynamics for Enhanced Performance | null | null | null | null | cs.PF physics.comp-ph | http://creativecommons.org/licenses/by/4.0/ | Optimizing the performance of computational fluid dynamics (CFD) applications
accelerated by graphics processing units (GPUs) is crucial for efficient
simulations. In this study, we employed a machine learning-based autotuning
technique to optimize 14 key parameters related to GPU kernel scheduling,
including the num... | [
{
"created": "Sat, 24 Jun 2023 16:13:01 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Jun 2023 03:08:38 GMT",
"version": "v2"
},
{
"created": "Tue, 20 Feb 2024 12:27:54 GMT",
"version": "v3"
}
] | 2024-02-21 | [
[
"Xue",
"Weicheng",
""
],
[
"Roy",
"Christohper John",
""
]
] | Optimizing the performance of computational fluid dynamics (CFD) applications accelerated by graphics processing units (GPUs) is crucial for efficient simulations. In this study, we employed a machine learning-based autotuning technique to optimize 14 key parameters related to GPU kernel scheduling, including the numbe... |
1009.4574 | S. M. Kamruzzaman | S. M. Kamruzzaman and Farhana Haider | A hybrid learning algorithm for text classification | 4 pages, International Conference | Proc. 3rd International Conference on Electrical & Computer
Engineering (ICECE 2004), Dhaka Bangladesh, pp. 577-580, Dec. 2004 | null | null | cs.NE cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Text classification is the process of classifying documents into predefined
categories based on their content. Existing supervised learning algorithms to
automatically classify text need sufficient documents to learn accurately. This
paper presents a new algorithm for text classification that requires fewer
documents... | [
{
"created": "Thu, 23 Sep 2010 10:50:06 GMT",
"version": "v1"
}
] | 2010-09-27 | [
[
"Kamruzzaman",
"S. M.",
""
],
[
"Haider",
"Farhana",
""
]
] | Text classification is the process of classifying documents into predefined categories based on their content. Existing supervised learning algorithms to automatically classify text need sufficient documents to learn accurately. This paper presents a new algorithm for text classification that requires fewer documents f... |
2203.12257 | Liying Cheng | Liying Cheng, Lidong Bing, Ruidan He, Qian Yu, Yan Zhang, Luo Si | IAM: A Comprehensive and Large-Scale Dataset for Integrated Argument
Mining Tasks | 11 pages, 3 figures, accepted by ACL 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traditionally, a debate usually requires a manual preparation process,
including reading plenty of articles, selecting the claims, identifying the
stances of the claims, seeking the evidence for the claims, etc. As the AI
debate attracts more attention these years, it is worth exploring the methods
to automate the te... | [
{
"created": "Wed, 23 Mar 2022 08:07:32 GMT",
"version": "v1"
},
{
"created": "Thu, 24 Mar 2022 03:27:52 GMT",
"version": "v2"
},
{
"created": "Sat, 16 Jul 2022 05:41:40 GMT",
"version": "v3"
}
] | 2022-07-19 | [
[
"Cheng",
"Liying",
""
],
[
"Bing",
"Lidong",
""
],
[
"He",
"Ruidan",
""
],
[
"Yu",
"Qian",
""
],
[
"Zhang",
"Yan",
""
],
[
"Si",
"Luo",
""
]
] | Traditionally, a debate usually requires a manual preparation process, including reading plenty of articles, selecting the claims, identifying the stances of the claims, seeking the evidence for the claims, etc. As the AI debate attracts more attention these years, it is worth exploring the methods to automate the tedi... |
2408.00876 | Benjie Wang | Benjie Wang and Guy Van den Broeck | On the Relationship Between Monotone and Squared Probabilistic Circuits | 7th Workshop on Tractable Probabilistic Modeling | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Probabilistic circuits are a unifying representation of functions as
computation graphs of weighted sums and products. Their primary application is
in probabilistic modeling, where circuits with non-negative weights (monotone
circuits) can be used to represent and learn density/mass functions, with
tractable marginal... | [
{
"created": "Thu, 1 Aug 2024 18:56:08 GMT",
"version": "v1"
}
] | 2024-08-05 | [
[
"Wang",
"Benjie",
""
],
[
"Broeck",
"Guy Van den",
""
]
] | Probabilistic circuits are a unifying representation of functions as computation graphs of weighted sums and products. Their primary application is in probabilistic modeling, where circuits with non-negative weights (monotone circuits) can be used to represent and learn density/mass functions, with tractable marginal i... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.