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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2106.01416 | Absalom Ezugwu | Olaide N. Oyelade and Absalom E. Ezugwu | Ebola Optimization Search Algorithm (EOSA): A new metaheuristic
algorithm based on the propagation model of Ebola virus disease | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Ebola virus and the disease in effect tend to randomly move individuals
in the population around susceptible, infected, quarantined, hospitalized,
recovered, and dead sub-population. Motivated by the effectiveness in
propagating the disease through the virus, a new bio-inspired and
population-based optimization a... | [
{
"created": "Wed, 2 Jun 2021 18:41:56 GMT",
"version": "v1"
},
{
"created": "Sat, 19 Jun 2021 21:02:53 GMT",
"version": "v2"
}
] | 2021-06-22 | [
[
"Oyelade",
"Olaide N.",
""
],
[
"Ezugwu",
"Absalom E.",
""
]
] | The Ebola virus and the disease in effect tend to randomly move individuals in the population around susceptible, infected, quarantined, hospitalized, recovered, and dead sub-population. Motivated by the effectiveness in propagating the disease through the virus, a new bio-inspired and population-based optimization alg... |
1904.02832 | Dacheng Tao | Chen Gong, Tongliang Liu, Yuanyan Tang, Jian Yang, Jie Yang, Dacheng
Tao | A Regularization Approach for Instance-Based Superset Label Learning | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Different from the traditional supervised learning in which each training
example has only one explicit label, superset label learning (SLL) refers to
the problem that a training example can be associated with a set of candidate
labels, and only one of them is correct. Existing SLL methods are either
regularization-b... | [
{
"created": "Fri, 5 Apr 2019 00:22:26 GMT",
"version": "v1"
}
] | 2019-04-08 | [
[
"Gong",
"Chen",
""
],
[
"Liu",
"Tongliang",
""
],
[
"Tang",
"Yuanyan",
""
],
[
"Yang",
"Jian",
""
],
[
"Yang",
"Jie",
""
],
[
"Tao",
"Dacheng",
""
]
] | Different from the traditional supervised learning in which each training example has only one explicit label, superset label learning (SLL) refers to the problem that a training example can be associated with a set of candidate labels, and only one of them is correct. Existing SLL methods are either regularization-bas... |
2402.16479 | Jin Ding | Jin Ding, Jie-Chao Zhao, Yong-Zhi Sun, Ping Tan, Jia-Wei Wang, Ji-En
Ma, You-Tong Fang | Edge Detectors Can Make Deep Convolutional Neural Networks More Robust | 26 pages, 18 figures, 7 tables | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Deep convolutional neural networks (DCNN for short) are vulnerable to
examples with small perturbations. Improving DCNN's robustness is of great
significance to the safety-critical applications, such as autonomous driving
and industry automation. Inspired by the principal way that human eyes
recognize objects, i.e., ... | [
{
"created": "Mon, 26 Feb 2024 10:54:26 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Jul 2024 02:53:00 GMT",
"version": "v2"
}
] | 2024-07-25 | [
[
"Ding",
"Jin",
""
],
[
"Zhao",
"Jie-Chao",
""
],
[
"Sun",
"Yong-Zhi",
""
],
[
"Tan",
"Ping",
""
],
[
"Wang",
"Jia-Wei",
""
],
[
"Ma",
"Ji-En",
""
],
[
"Fang",
"You-Tong",
""
]
] | Deep convolutional neural networks (DCNN for short) are vulnerable to examples with small perturbations. Improving DCNN's robustness is of great significance to the safety-critical applications, such as autonomous driving and industry automation. Inspired by the principal way that human eyes recognize objects, i.e., la... |
2204.08962 | Joshua Mack | Joshua Mack, Sahil Hassan, Nirmal Kumbhare, Miguel Castro-Gonzalez,
Ali Akoglu | CEDR -- A Compiler-integrated, Extensible DSSoC Runtime | 35 pages single column, 16 figures, 7 tables. Accepted for
publication in the ACM Transactions on Embedded and Computing Systems | null | 10.1145/3529257 | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we present CEDR, a Compiler-integrated, Extensible Domain
Specific System on Chip Runtime ecosystem to facilitate research towards
addressing the challenges of architecture, system software and application
development with distinct plug-and-play integration points in a unified compile
time and run time ... | [
{
"created": "Fri, 15 Apr 2022 19:54:39 GMT",
"version": "v1"
}
] | 2022-04-20 | [
[
"Mack",
"Joshua",
""
],
[
"Hassan",
"Sahil",
""
],
[
"Kumbhare",
"Nirmal",
""
],
[
"Castro-Gonzalez",
"Miguel",
""
],
[
"Akoglu",
"Ali",
""
]
] | In this work, we present CEDR, a Compiler-integrated, Extensible Domain Specific System on Chip Runtime ecosystem to facilitate research towards addressing the challenges of architecture, system software and application development with distinct plug-and-play integration points in a unified compile time and run time wo... |
2309.08414 | Bernhard Bermeitinger | Bernhard Bermeitinger, Tomas Hrycej, Siegfried Handschuh | Make Deep Networks Shallow Again | to be published at KDIR2023, Rome | Proceedings of the 15th International Joint Conference on
Knowledge Discovery, Knowledge Engineering and Knowledge Management -
KDIR2023 | 10.5220/0012203800003598 | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Deep neural networks have a good success record and are thus viewed as the
best architecture choice for complex applications. Their main shortcoming has
been, for a long time, the vanishing gradient which prevented the numerical
optimization algorithms from acceptable convergence. A breakthrough has been
achieved by ... | [
{
"created": "Fri, 15 Sep 2023 14:18:21 GMT",
"version": "v1"
}
] | 2024-05-02 | [
[
"Bermeitinger",
"Bernhard",
""
],
[
"Hrycej",
"Tomas",
""
],
[
"Handschuh",
"Siegfried",
""
]
] | Deep neural networks have a good success record and are thus viewed as the best architecture choice for complex applications. Their main shortcoming has been, for a long time, the vanishing gradient which prevented the numerical optimization algorithms from acceptable convergence. A breakthrough has been achieved by th... |
2107.05050 | Ben Hayes | Ben Hayes, Charalampos Saitis, Gy\"orgy Fazekas | Neural Waveshaping Synthesis | Accepted to ISMIR 2021; See online supplement at
https://benhayes.net/projects/nws/ | null | null | null | cs.SD cs.LG eess.AS eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present the Neural Waveshaping Unit (NEWT): a novel, lightweight, fully
causal approach to neural audio synthesis which operates directly in the
waveform domain, with an accompanying optimisation (FastNEWT) for efficient CPU
inference. The NEWT uses time-distributed multilayer perceptrons with periodic
activations... | [
{
"created": "Sun, 11 Jul 2021 13:50:59 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Jul 2021 14:28:39 GMT",
"version": "v2"
}
] | 2021-07-28 | [
[
"Hayes",
"Ben",
""
],
[
"Saitis",
"Charalampos",
""
],
[
"Fazekas",
"György",
""
]
] | We present the Neural Waveshaping Unit (NEWT): a novel, lightweight, fully causal approach to neural audio synthesis which operates directly in the waveform domain, with an accompanying optimisation (FastNEWT) for efficient CPU inference. The NEWT uses time-distributed multilayer perceptrons with periodic activations t... |
1805.08180 | Andrew Levy | Andrew Levy, Robert Platt, Kate Saenko | Hierarchical Reinforcement Learning with Hindsight | Duplicate. See arXiv:1712.00948 "Learning Multi-Level Hierarchies
with Hindsight" for latest version | null | null | null | cs.LG cs.AI cs.NE cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reinforcement Learning (RL) algorithms can suffer from poor sample efficiency
when rewards are delayed and sparse. We introduce a solution that enables
agents to learn temporally extended actions at multiple levels of abstraction
in a sample efficient and automated fashion. Our approach combines universal
value funct... | [
{
"created": "Mon, 21 May 2018 17:02:53 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Mar 2019 17:52:47 GMT",
"version": "v2"
}
] | 2019-03-11 | [
[
"Levy",
"Andrew",
""
],
[
"Platt",
"Robert",
""
],
[
"Saenko",
"Kate",
""
]
] | Reinforcement Learning (RL) algorithms can suffer from poor sample efficiency when rewards are delayed and sparse. We introduce a solution that enables agents to learn temporally extended actions at multiple levels of abstraction in a sample efficient and automated fashion. Our approach combines universal value functio... |
2001.00336 | Thatchaphol Saranurak | Sayan Bhattacharya, Danupon Nanongkai, Thatchaphol Saranurak | Coarse-Grained Complexity for Dynamic Algorithms | Published at SODA 2020. The abstract is truncated | null | null | null | cs.CC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To date, the only way to argue polynomial lower bounds for dynamic algorithms
is via fine-grained complexity arguments. These arguments rely on strong
assumptions about specific problems such as the Strong Exponential Time
Hypothesis (SETH) and the Online Matrix-Vector Multiplication Conjecture (OMv).
While they have... | [
{
"created": "Thu, 2 Jan 2020 06:14:54 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jul 2023 13:55:49 GMT",
"version": "v2"
}
] | 2023-07-27 | [
[
"Bhattacharya",
"Sayan",
""
],
[
"Nanongkai",
"Danupon",
""
],
[
"Saranurak",
"Thatchaphol",
""
]
] | To date, the only way to argue polynomial lower bounds for dynamic algorithms is via fine-grained complexity arguments. These arguments rely on strong assumptions about specific problems such as the Strong Exponential Time Hypothesis (SETH) and the Online Matrix-Vector Multiplication Conjecture (OMv). While they have l... |
2302.00378 | Mohammad Akbar-Tajari | Mohammad Akbar-Tajari, Sara Rajaee, and Mohammad Taher Pilehvar | An Empirical Study on the Transferability of Transformer Modules in
Parameter-Efficient Fine-Tuning | Accepted at EMNLP 2022 (main conference),
https://aclanthology.org/2022.emnlp-main.726 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Parameter-efficient fine-tuning approaches have recently garnered a lot of
attention. Having considerably lower number of trainable weights, these methods
can bring about scalability and computational effectiveness. In this paper, we
look for optimal sub-networks and investigate the capability of different
transforme... | [
{
"created": "Wed, 1 Feb 2023 11:20:18 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Feb 2023 16:56:58 GMT",
"version": "v2"
}
] | 2023-02-23 | [
[
"Akbar-Tajari",
"Mohammad",
""
],
[
"Rajaee",
"Sara",
""
],
[
"Pilehvar",
"Mohammad Taher",
""
]
] | Parameter-efficient fine-tuning approaches have recently garnered a lot of attention. Having considerably lower number of trainable weights, these methods can bring about scalability and computational effectiveness. In this paper, we look for optimal sub-networks and investigate the capability of different transformer ... |
2404.00576 | Rizwan Muhammad | PoTsang B. Huang, Muhammad Rizwan, and Mehboob Ali | Automated Bi-Fold Weighted Ensemble Algorithms and its Application to
Brain Tumor Detection and Classification | null | null | null | null | cs.LG cs.AI cs.CV | http://creativecommons.org/licenses/by/4.0/ | The uncontrolled and unstructured growth of brain cells is known as brain
tumor, which has one of the highest mortality rates among diseases from all
types of cancers. Due to limited diagnostic and treatment capabilities, they
pose significant challenges, especially in third-world countries. Early
diagnosis plays a v... | [
{
"created": "Sun, 31 Mar 2024 06:38:08 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Huang",
"PoTsang B.",
""
],
[
"Rizwan",
"Muhammad",
""
],
[
"Ali",
"Mehboob",
""
]
] | The uncontrolled and unstructured growth of brain cells is known as brain tumor, which has one of the highest mortality rates among diseases from all types of cancers. Due to limited diagnostic and treatment capabilities, they pose significant challenges, especially in third-world countries. Early diagnosis plays a vit... |
1903.01344 | Zhou Fan | Zhou Fan, Rui Su, Weinan Zhang and Yong Yu | Hybrid Actor-Critic Reinforcement Learning in Parameterized Action Space | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we propose a hybrid architecture of actor-critic algorithms for
reinforcement learning in parameterized action space, which consists of
multiple parallel sub-actor networks to decompose the structured action space
into simpler action spaces along with a critic network to guide the training of
all sub-ac... | [
{
"created": "Mon, 4 Mar 2019 16:33:15 GMT",
"version": "v1"
},
{
"created": "Sat, 25 May 2019 08:32:06 GMT",
"version": "v2"
},
{
"created": "Thu, 30 May 2019 13:02:58 GMT",
"version": "v3"
}
] | 2019-05-31 | [
[
"Fan",
"Zhou",
""
],
[
"Su",
"Rui",
""
],
[
"Zhang",
"Weinan",
""
],
[
"Yu",
"Yong",
""
]
] | In this paper we propose a hybrid architecture of actor-critic algorithms for reinforcement learning in parameterized action space, which consists of multiple parallel sub-actor networks to decompose the structured action space into simpler action spaces along with a critic network to guide the training of all sub-acto... |
2302.08783 | Amit Attia | Amit Attia and Tomer Koren | SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to
Unknown Parameters, Unbounded Gradients and Affine Variance | 27 pages | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study Stochastic Gradient Descent with AdaGrad stepsizes: a popular
adaptive (self-tuning) method for first-order stochastic optimization. Despite
being well studied, existing analyses of this method suffer from various
shortcomings: they either assume some knowledge of the problem parameters,
impose strong global... | [
{
"created": "Fri, 17 Feb 2023 09:46:08 GMT",
"version": "v1"
},
{
"created": "Sun, 11 Jun 2023 15:59:35 GMT",
"version": "v2"
}
] | 2023-06-13 | [
[
"Attia",
"Amit",
""
],
[
"Koren",
"Tomer",
""
]
] | We study Stochastic Gradient Descent with AdaGrad stepsizes: a popular adaptive (self-tuning) method for first-order stochastic optimization. Despite being well studied, existing analyses of this method suffer from various shortcomings: they either assume some knowledge of the problem parameters, impose strong global L... |
2101.07172 | Chien-Hsiang Huang | Chien-Hsiang Huang, Hung-Yu Wu, and Youn-Long Lin | HarDNet-MSEG: A Simple Encoder-Decoder Polyp Segmentation Neural Network
that Achieves over 0.9 Mean Dice and 86 FPS | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | We propose a new convolution neural network called HarDNet-MSEG for polyp
segmentation. It achieves SOTA in both accuracy and inference speed on five
popular datasets. For Kvasir-SEG, HarDNet-MSEG delivers 0.904 mean Dice running
at 86.7 FPS on a GeForce RTX 2080 Ti GPU. It consists of a backbone and a
decoder. The b... | [
{
"created": "Mon, 18 Jan 2021 17:20:11 GMT",
"version": "v1"
},
{
"created": "Wed, 20 Jan 2021 15:58:47 GMT",
"version": "v2"
}
] | 2021-01-21 | [
[
"Huang",
"Chien-Hsiang",
""
],
[
"Wu",
"Hung-Yu",
""
],
[
"Lin",
"Youn-Long",
""
]
] | We propose a new convolution neural network called HarDNet-MSEG for polyp segmentation. It achieves SOTA in both accuracy and inference speed on five popular datasets. For Kvasir-SEG, HarDNet-MSEG delivers 0.904 mean Dice running at 86.7 FPS on a GeForce RTX 2080 Ti GPU. It consists of a backbone and a decoder. The bac... |
2303.10888 | Chanjun Park | Chanjun Park, Hyeonseok Moon, Seolhwa Lee, Jaehyung Seo, Sugyeong Eo
and Heuiseok Lim | Self-Improving-Leaderboard(SIL): A Call for Real-World Centric Natural
Language Processing Leaderboards | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Leaderboard systems allow researchers to objectively evaluate Natural
Language Processing (NLP) models and are typically used to identify models that
exhibit superior performance on a given task in a predetermined setting.
However, we argue that evaluation on a given test dataset is just one of many
performance indic... | [
{
"created": "Mon, 20 Mar 2023 06:13:03 GMT",
"version": "v1"
}
] | 2023-03-21 | [
[
"Park",
"Chanjun",
""
],
[
"Moon",
"Hyeonseok",
""
],
[
"Lee",
"Seolhwa",
""
],
[
"Seo",
"Jaehyung",
""
],
[
"Eo",
"Sugyeong",
""
],
[
"Lim",
"Heuiseok",
""
]
] | Leaderboard systems allow researchers to objectively evaluate Natural Language Processing (NLP) models and are typically used to identify models that exhibit superior performance on a given task in a predetermined setting. However, we argue that evaluation on a given test dataset is just one of many performance indicat... |
1706.06246 | Shuling Wang | Dimitar Guelev, Shuling Wang, Naijun Zhan | Compositional Hoare-style Reasoning about Hybrid CSP in the Duration
Calculus | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deductive methods for the verification of hybrid systems vary on the format
of statements in correctness proofs. Building on the example of Hoare
triple-based reasoning, we have investigated several such methods for systems
described in Hybrid CSP, each based on a different assertion language, notation
for time, and ... | [
{
"created": "Tue, 20 Jun 2017 02:44:22 GMT",
"version": "v1"
},
{
"created": "Wed, 28 Jun 2017 02:13:04 GMT",
"version": "v2"
}
] | 2017-06-29 | [
[
"Guelev",
"Dimitar",
""
],
[
"Wang",
"Shuling",
""
],
[
"Zhan",
"Naijun",
""
]
] | Deductive methods for the verification of hybrid systems vary on the format of statements in correctness proofs. Building on the example of Hoare triple-based reasoning, we have investigated several such methods for systems described in Hybrid CSP, each based on a different assertion language, notation for time, and no... |
1803.07180 | Abraham P. Vinod | Abraham P. Vinod and Meeko M. K. Oishi | Probabilistic Occupancy Function and Sets Using Forward Stochastic
Reachability for Rigid-Body Dynamic Obstacles | Updated text for submission to IEEE Transactions on Automatic Control | null | null | null | cs.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present theory and algorithms for the computation of probability-weighted
"keep-out" sets to assure probabilistically safe navigation in the presence of
multiple rigid body obstacles with stochastic dynamics. Our forward stochastic
reachability-based approach characterizes the stochasticity of the future
obstacle ... | [
{
"created": "Mon, 19 Mar 2018 22:15:28 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Sep 2018 04:27:27 GMT",
"version": "v2"
}
] | 2018-09-20 | [
[
"Vinod",
"Abraham P.",
""
],
[
"Oishi",
"Meeko M. K.",
""
]
] | We present theory and algorithms for the computation of probability-weighted "keep-out" sets to assure probabilistically safe navigation in the presence of multiple rigid body obstacles with stochastic dynamics. Our forward stochastic reachability-based approach characterizes the stochasticity of the future obstacle st... |
2101.00433 | Michael Saxon | Michael Saxon, Sharon Levy, Xinyi Wang, Alon Albalak, William Yang
Wang | Modeling Disclosive Transparency in NLP Application Descriptions | To appear at EMNLP 2021. 15 pages, 10 figures, 7 tables | Proceedings of the 2021 Conference on Empirical Methods in Natural
Language Processing, pp 2023-2037 | 10.18653/v1/2021.emnlp-main.153 | null | cs.CL cs.AI cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Broader disclosive transparency$-$truth and clarity in communication
regarding the function of AI systems$-$is widely considered desirable.
Unfortunately, it is a nebulous concept, difficult to both define and quantify.
This is problematic, as previous work has demonstrated possible trade-offs and
negative consequenc... | [
{
"created": "Sat, 2 Jan 2021 11:46:17 GMT",
"version": "v1"
},
{
"created": "Sat, 17 Apr 2021 03:42:18 GMT",
"version": "v2"
},
{
"created": "Fri, 27 Aug 2021 03:30:20 GMT",
"version": "v3"
},
{
"created": "Fri, 10 Sep 2021 17:54:54 GMT",
"version": "v4"
}
] | 2022-05-26 | [
[
"Saxon",
"Michael",
""
],
[
"Levy",
"Sharon",
""
],
[
"Wang",
"Xinyi",
""
],
[
"Albalak",
"Alon",
""
],
[
"Wang",
"William Yang",
""
]
] | Broader disclosive transparency$-$truth and clarity in communication regarding the function of AI systems$-$is widely considered desirable. Unfortunately, it is a nebulous concept, difficult to both define and quantify. This is problematic, as previous work has demonstrated possible trade-offs and negative consequences... |
2012.01411 | Fangjinhua Wang | Fangjinhua Wang, Silvano Galliani, Christoph Vogel, Pablo Speciale,
Marc Pollefeys | PatchmatchNet: Learned Multi-View Patchmatch Stereo | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present PatchmatchNet, a novel and learnable cascade formulation of
Patchmatch for high-resolution multi-view stereo. With high computation speed
and low memory requirement, PatchmatchNet can process higher resolution imagery
and is more suited to run on resource limited devices than competitors that
employ 3D cos... | [
{
"created": "Wed, 2 Dec 2020 18:59:02 GMT",
"version": "v1"
}
] | 2020-12-03 | [
[
"Wang",
"Fangjinhua",
""
],
[
"Galliani",
"Silvano",
""
],
[
"Vogel",
"Christoph",
""
],
[
"Speciale",
"Pablo",
""
],
[
"Pollefeys",
"Marc",
""
]
] | We present PatchmatchNet, a novel and learnable cascade formulation of Patchmatch for high-resolution multi-view stereo. With high computation speed and low memory requirement, PatchmatchNet can process higher resolution imagery and is more suited to run on resource limited devices than competitors that employ 3D cost ... |
2010.02977 | Hirokazu Kameoka | Hirokazu Kameoka, Takuhiro Kaneko, Kou Tanaka, Nobukatsu Hojo, Shogo
Seki | VoiceGrad: Non-Parallel Any-to-Many Voice Conversion with Annealed
Langevin Dynamics | For more details on the baseline method used for comparison, please
refer to our article in arXiv:2008.12604 | null | null | null | cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we propose a non-parallel any-to-many voice conversion (VC)
method termed VoiceGrad. Inspired by WaveGrad, a recently introduced novel
waveform generation method, VoiceGrad is based upon the concepts of score
matching and Langevin dynamics. It uses weighted denoising score matching to
train a score app... | [
{
"created": "Tue, 6 Oct 2020 19:09:37 GMT",
"version": "v1"
},
{
"created": "Sat, 10 Oct 2020 09:59:40 GMT",
"version": "v2"
},
{
"created": "Sat, 9 Mar 2024 16:30:50 GMT",
"version": "v3"
}
] | 2024-03-12 | [
[
"Kameoka",
"Hirokazu",
""
],
[
"Kaneko",
"Takuhiro",
""
],
[
"Tanaka",
"Kou",
""
],
[
"Hojo",
"Nobukatsu",
""
],
[
"Seki",
"Shogo",
""
]
] | In this paper, we propose a non-parallel any-to-many voice conversion (VC) method termed VoiceGrad. Inspired by WaveGrad, a recently introduced novel waveform generation method, VoiceGrad is based upon the concepts of score matching and Langevin dynamics. It uses weighted denoising score matching to train a score appro... |
1803.08394 | Andrey Kuehlkamp | Andrey Kuehlkamp and Kevin Bowyer | Found a good match: should I keep searching? - Accuracy and Performance
in Iris Matching Using 1-to-First Search | null | Image and Vision Computing vol 73, May 2018, pp. 17-27 | 10.1016/j.imavis.2018.03.003 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Iris recognition is used in many applications around the world, with
enrollment sizes as large as over one billion persons in India's Aadhaar
program. Large enrollment sizes can require special optimizations in order to
achieve fast database searches. One such optimization that has been used in
some operational scena... | [
{
"created": "Thu, 22 Mar 2018 15:07:53 GMT",
"version": "v1"
}
] | 2018-04-20 | [
[
"Kuehlkamp",
"Andrey",
""
],
[
"Bowyer",
"Kevin",
""
]
] | Iris recognition is used in many applications around the world, with enrollment sizes as large as over one billion persons in India's Aadhaar program. Large enrollment sizes can require special optimizations in order to achieve fast database searches. One such optimization that has been used in some operational scenari... |
1708.06850 | Enoch Yeung Ph.D. | Enoch Yeung, Soumya Kundu, Nathan Hodas | Learning Deep Neural Network Representations for Koopman Operators of
Nonlinear Dynamical Systems | 16 pages, 5 figures | null | null | null | cs.LG cs.AI math.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Koopman operator has recently garnered much attention for its value in
dynamical systems analysis and data-driven model discovery. However, its
application has been hindered by the computational complexity of extended
dynamic mode decomposition; this requires a combinatorially large basis set to
adequately descri... | [
{
"created": "Tue, 22 Aug 2017 23:32:19 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Nov 2017 19:36:19 GMT",
"version": "v2"
}
] | 2017-12-11 | [
[
"Yeung",
"Enoch",
""
],
[
"Kundu",
"Soumya",
""
],
[
"Hodas",
"Nathan",
""
]
] | The Koopman operator has recently garnered much attention for its value in dynamical systems analysis and data-driven model discovery. However, its application has been hindered by the computational complexity of extended dynamic mode decomposition; this requires a combinatorially large basis set to adequately describe... |
1811.01768 | Isabella Pozzi | Isabella Pozzi, Sander Boht\'e and Pieter Roelfsema | A Biologically Plausible Learning Rule for Deep Learning in the Brain | null | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Researchers have proposed that deep learning, which is providing important
progress in a wide range of high complexity tasks, might inspire new insights
into learning in the brain. However, the methods used for deep learning by
artificial neural networks are biologically unrealistic and would need to be
replaced by b... | [
{
"created": "Mon, 5 Nov 2018 15:01:59 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Jun 2019 07:37:39 GMT",
"version": "v2"
},
{
"created": "Tue, 2 Jul 2019 09:45:26 GMT",
"version": "v3"
}
] | 2019-07-03 | [
[
"Pozzi",
"Isabella",
""
],
[
"Bohté",
"Sander",
""
],
[
"Roelfsema",
"Pieter",
""
]
] | Researchers have proposed that deep learning, which is providing important progress in a wide range of high complexity tasks, might inspire new insights into learning in the brain. However, the methods used for deep learning by artificial neural networks are biologically unrealistic and would need to be replaced by bio... |
2202.05917 | Delaram Kahrobaei | Delaram Kahrobaei, Ram\'on Flores, Marialaura Noce | Group-based Cryptography in the Quantum Era | To appear in the Notices of the American Mathematical Society | null | null | null | cs.CR math.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this expository article we present an overview of the current
state-of-the-art in post-quantum group-based cryptography. We describe several
families of groups that have been proposed as platforms, with special emphasis
in polycyclic groups and graph groups, dealing in particular with their
algorithmic properties ... | [
{
"created": "Fri, 11 Feb 2022 22:01:45 GMT",
"version": "v1"
},
{
"created": "Sat, 19 Feb 2022 17:22:40 GMT",
"version": "v2"
},
{
"created": "Thu, 24 Feb 2022 15:01:28 GMT",
"version": "v3"
},
{
"created": "Tue, 17 Jan 2023 11:52:12 GMT",
"version": "v4"
}
] | 2023-01-18 | [
[
"Kahrobaei",
"Delaram",
""
],
[
"Flores",
"Ramón",
""
],
[
"Noce",
"Marialaura",
""
]
] | In this expository article we present an overview of the current state-of-the-art in post-quantum group-based cryptography. We describe several families of groups that have been proposed as platforms, with special emphasis in polycyclic groups and graph groups, dealing in particular with their algorithmic properties an... |
1811.11992 | Hui Liu Mr | Ruijian He, Bo Yang, Hui Liu, Zhangxin Chen | A New In-Situ Combustion Simulator for Parallel Computers | null | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As a competitive recovery method for heavy oil, In-Situ Combustion (ISC)
shows its great potential accompanied by technological advances in recent
years. Reservoir simulation will play an indispensable role in the prediction
of the implementation of ISC projects. With the computational complexity, it is
imperative to... | [
{
"created": "Thu, 29 Nov 2018 07:25:14 GMT",
"version": "v1"
}
] | 2018-11-30 | [
[
"He",
"Ruijian",
""
],
[
"Yang",
"Bo",
""
],
[
"Liu",
"Hui",
""
],
[
"Chen",
"Zhangxin",
""
]
] | As a competitive recovery method for heavy oil, In-Situ Combustion (ISC) shows its great potential accompanied by technological advances in recent years. Reservoir simulation will play an indispensable role in the prediction of the implementation of ISC projects. With the computational complexity, it is imperative to d... |
1902.04255 | Mumin Cebe | Mumin Cebe, Kemal Akkaya | Communication-efficient Certificate Revocation Management for Advanced
Metering Infrastructure and IoT | null | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Advanced Metering Infrastructure forms a communication network for the
collection of power data from smart meters in Smart Grid. As the communication
between smart meters could be secured utilizing public-key cryptography,
however, public-key cryptography still has certain challenges in terms of
certificate revocatio... | [
{
"created": "Tue, 12 Feb 2019 06:30:17 GMT",
"version": "v1"
},
{
"created": "Tue, 6 Aug 2019 15:49:00 GMT",
"version": "v2"
},
{
"created": "Wed, 5 Aug 2020 22:36:17 GMT",
"version": "v3"
}
] | 2020-08-07 | [
[
"Cebe",
"Mumin",
""
],
[
"Akkaya",
"Kemal",
""
]
] | Advanced Metering Infrastructure forms a communication network for the collection of power data from smart meters in Smart Grid. As the communication between smart meters could be secured utilizing public-key cryptography, however, public-key cryptography still has certain challenges in terms of certificate revocation ... |
2401.14526 | Anna Feldman | Patrick Lee, Alain Chirino Trujillo, Diana Cuevas Plancarte, Olumide
Ebenezer Ojo, Xinyi Liu, Iyanuoluwa Shode, Yuan Zhao, Jing Peng, Anna Feldman | MEDs for PETs: Multilingual Euphemism Disambiguation for Potentially
Euphemistic Terms | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This study investigates the computational processing of euphemisms, a
universal linguistic phenomenon, across multiple languages. We train a
multilingual transformer model (XLM-RoBERTa) to disambiguate potentially
euphemistic terms (PETs) in multilingual and cross-lingual settings. In line
with current trends, we dem... | [
{
"created": "Thu, 25 Jan 2024 21:38:30 GMT",
"version": "v1"
}
] | 2024-01-29 | [
[
"Lee",
"Patrick",
""
],
[
"Trujillo",
"Alain Chirino",
""
],
[
"Plancarte",
"Diana Cuevas",
""
],
[
"Ojo",
"Olumide Ebenezer",
""
],
[
"Liu",
"Xinyi",
""
],
[
"Shode",
"Iyanuoluwa",
""
],
[
"Zhao",
"Yuan",
... | This study investigates the computational processing of euphemisms, a universal linguistic phenomenon, across multiple languages. We train a multilingual transformer model (XLM-RoBERTa) to disambiguate potentially euphemistic terms (PETs) in multilingual and cross-lingual settings. In line with current trends, we demon... |
1211.3169 | Pierre-Olivier Amblard | Pierre-Olivier Amblard and Olivier J. J. Michel | The relation between Granger causality and directed information theory:
a review | null | null | 10.3390/e15010113 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This report reviews the conceptual and theoretical links between Granger
causality and directed information theory. We begin with a short historical
tour of Granger causality, concentrating on its closeness to information
theory. The definitions of Granger causality based on prediction are recalled,
and the importanc... | [
{
"created": "Wed, 14 Nov 2012 00:13:27 GMT",
"version": "v1"
}
] | 2015-06-12 | [
[
"Amblard",
"Pierre-Olivier",
""
],
[
"Michel",
"Olivier J. J.",
""
]
] | This report reviews the conceptual and theoretical links between Granger causality and directed information theory. We begin with a short historical tour of Granger causality, concentrating on its closeness to information theory. The definitions of Granger causality based on prediction are recalled, and the importance ... |
1911.07755 | Alberto Marchesi | Alberto Marchesi, Francesco Trov\`o, Nicola Gatti | Learning Probably Approximately Correct Maximin Strategies in
Simulation-Based Games with Infinite Strategy Spaces | null | null | null | null | cs.GT cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We tackle the problem of learning equilibria in simulation-based games. In
such games, the players' utility functions cannot be described analytically, as
they are given through a black-box simulator that can be queried to obtain
noisy estimates of the utilities. This is the case in many real-world games in
which a c... | [
{
"created": "Mon, 18 Nov 2019 16:37:08 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Feb 2020 15:59:44 GMT",
"version": "v2"
}
] | 2020-02-26 | [
[
"Marchesi",
"Alberto",
""
],
[
"Trovò",
"Francesco",
""
],
[
"Gatti",
"Nicola",
""
]
] | We tackle the problem of learning equilibria in simulation-based games. In such games, the players' utility functions cannot be described analytically, as they are given through a black-box simulator that can be queried to obtain noisy estimates of the utilities. This is the case in many real-world games in which a com... |
2104.07324 | Shayan Hashemi | Shayan Hashemi, Mika M\"antyl\"a | OneLog: Towards End-to-End Training in Software Log Anomaly Detection | null | null | 10.1007/s10515-024-00428-x | null | cs.SE cs.LG | http://creativecommons.org/licenses/by/4.0/ | With the growth of online services, IoT devices, and DevOps-oriented software
development, software log anomaly detection is becoming increasingly important.
Prior works mainly follow a traditional four-staged architecture (Preprocessor,
Parser, Vectorizer, and Classifier). This paper proposes OneLog, which utilizes
... | [
{
"created": "Thu, 15 Apr 2021 09:23:32 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Feb 2024 17:07:34 GMT",
"version": "v2"
}
] | 2024-08-06 | [
[
"Hashemi",
"Shayan",
""
],
[
"Mäntylä",
"Mika",
""
]
] | With the growth of online services, IoT devices, and DevOps-oriented software development, software log anomaly detection is becoming increasingly important. Prior works mainly follow a traditional four-staged architecture (Preprocessor, Parser, Vectorizer, and Classifier). This paper proposes OneLog, which utilizes a ... |
2103.06766 | Jan T\"onshoff | Jan Toenshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld | Stable Tuple Embeddings for Dynamic Databases | null | null | null | null | cs.DB | http://creativecommons.org/licenses/by/4.0/ | We study the problem of computing an embedding of the tuples of a relational
database in a manner that is extensible to dynamic changes of the database. In
this problem, the embedding should be stable in the sense that it should not
change on the existing tuples due to the embedding of newly inserted tuples (as
datab... | [
{
"created": "Thu, 11 Mar 2021 16:23:03 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Sep 2022 16:48:58 GMT",
"version": "v2"
}
] | 2022-09-28 | [
[
"Toenshoff",
"Jan",
""
],
[
"Friedman",
"Neta",
""
],
[
"Grohe",
"Martin",
""
],
[
"Kimelfeld",
"Benny",
""
]
] | We study the problem of computing an embedding of the tuples of a relational database in a manner that is extensible to dynamic changes of the database. In this problem, the embedding should be stable in the sense that it should not change on the existing tuples due to the embedding of newly inserted tuples (as databas... |
2203.09848 | Marcos Faundez-Zanuy | Enric Sesa-Nogueras, Marcos Faundez-Zanuy, Josep Roure-Alcob\'e | Gender classification by means of online uppercase handwriting: A
text-dependent allographic approach | 25 pages, published in Cogn Comput 8, pages 15 to 29, year 2016 | Cognitive computation vol. 8 pages 15-19, 2016 | 10.1007/s12559-015-9332-1 | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This paper presents a gender classification schema based on online
handwriting. Using samples acquired with a digital tablet that captures the
dynamics of the writing, it classifies the writer as a male or a female. The
method proposed is allographic, regarding strokes as the structural units of
handwriting. Strokes ... | [
{
"created": "Fri, 18 Mar 2022 10:37:19 GMT",
"version": "v1"
}
] | 2022-03-21 | [
[
"Sesa-Nogueras",
"Enric",
""
],
[
"Faundez-Zanuy",
"Marcos",
""
],
[
"Roure-Alcobé",
"Josep",
""
]
] | This paper presents a gender classification schema based on online handwriting. Using samples acquired with a digital tablet that captures the dynamics of the writing, it classifies the writer as a male or a female. The method proposed is allographic, regarding strokes as the structural units of handwriting. Strokes pe... |
2208.06092 | Adeilson Silva | Adeilson Antonio da Silva and Mauricio Pamplona Segundo | On deceiving malware classification with section injection | null | null | null | null | cs.CR cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | We investigate how to modify executable files to deceive malware
classification systems. This work's main contribution is a methodology to
inject bytes across a malware file randomly and use it both as an attack to
decrease classification accuracy but also as a defensive method, augmenting the
data available for trai... | [
{
"created": "Fri, 12 Aug 2022 02:43:17 GMT",
"version": "v1"
}
] | 2022-08-15 | [
[
"da Silva",
"Adeilson Antonio",
""
],
[
"Segundo",
"Mauricio Pamplona",
""
]
] | We investigate how to modify executable files to deceive malware classification systems. This work's main contribution is a methodology to inject bytes across a malware file randomly and use it both as an attack to decrease classification accuracy but also as a defensive method, augmenting the data available for traini... |
2107.06219 | Xingxuan Zhang | Xingxuan Zhang, Linjun Zhou, Renzhe Xu, Peng Cui, Zheyan Shen, Haoxin
Liu | Towards Unsupervised Domain Generalization | Accepted by CVPR2022 | null | null | null | cs.CV cs.LG cs.MM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Domain generalization (DG) aims to help models trained on a set of source
domains generalize better on unseen target domains. The performances of current
DG methods largely rely on sufficient labeled data, which are usually costly or
unavailable, however. Since unlabeled data are far more accessible, we seek to
explo... | [
{
"created": "Tue, 13 Jul 2021 16:20:50 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Apr 2022 03:36:35 GMT",
"version": "v2"
}
] | 2022-04-13 | [
[
"Zhang",
"Xingxuan",
""
],
[
"Zhou",
"Linjun",
""
],
[
"Xu",
"Renzhe",
""
],
[
"Cui",
"Peng",
""
],
[
"Shen",
"Zheyan",
""
],
[
"Liu",
"Haoxin",
""
]
] | Domain generalization (DG) aims to help models trained on a set of source domains generalize better on unseen target domains. The performances of current DG methods largely rely on sufficient labeled data, which are usually costly or unavailable, however. Since unlabeled data are far more accessible, we seek to explore... |
2012.14283 | Sarah Schwettmann | Sarah Schwettmann, Hendrik Strobelt, Mauro Martino | Latent Compass: Creation by Navigation | 3 pages, 2 figures, accepted at the 4th Workshop on Machine Learning
for Creativity and Design at NeurIPS 2020 | null | null | null | cs.AI cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In Marius von Senden's Space and Sight, a newly sighted blind patient
describes the experience of a corner as lemon-like, because corners "prick"
sight like lemons prick the tongue. Prickliness, here, is a dimension in the
feature space of sensory experience, an effect of the perceived on the
perceiver that arises wh... | [
{
"created": "Sun, 20 Dec 2020 04:18:23 GMT",
"version": "v1"
}
] | 2020-12-29 | [
[
"Schwettmann",
"Sarah",
""
],
[
"Strobelt",
"Hendrik",
""
],
[
"Martino",
"Mauro",
""
]
] | In Marius von Senden's Space and Sight, a newly sighted blind patient describes the experience of a corner as lemon-like, because corners "prick" sight like lemons prick the tongue. Prickliness, here, is a dimension in the feature space of sensory experience, an effect of the perceived on the perceiver that arises wher... |
2106.10468 | Hou Pong Chan | Hou Pong Chan and Irwin King | A Condense-then-Select Strategy for Text Summarization | Accepted by Knowledge-Based Systems (KBS) journal | null | 10.1016/j.knosys.2021.107235 | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Select-then-compress is a popular hybrid, framework for text summarization
due to its high efficiency. This framework first selects salient sentences and
then independently condenses each of the selected sentences into a concise
version. However, compressing sentences separately ignores the context
information of the... | [
{
"created": "Sat, 19 Jun 2021 10:33:10 GMT",
"version": "v1"
}
] | 2021-06-22 | [
[
"Chan",
"Hou Pong",
""
],
[
"King",
"Irwin",
""
]
] | Select-then-compress is a popular hybrid, framework for text summarization due to its high efficiency. This framework first selects salient sentences and then independently condenses each of the selected sentences into a concise version. However, compressing sentences separately ignores the context information of the d... |
1902.04045 | Panos Giannopoulos | Mikkel Abrahamsen and Panos Giannopoulos and Maarten L\"offler and
G\"unter Rote | Geometric Multicut | 24 pages, 15 figures | Discrete & Computational Geometry 64 (2020), 575-607 | 10.1007/s00454-020-00232-w | null | cs.CG cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the following separation problem: Given a collection of colored
objects in the plane, compute a shortest "fence" $F$, i.e., a union of curves
of minimum total length, that separates every two objects of different colors.
Two objects are separated if $F$ contains a simple closed curve that has one
object in t... | [
{
"created": "Mon, 11 Feb 2019 18:44:40 GMT",
"version": "v1"
}
] | 2021-05-11 | [
[
"Abrahamsen",
"Mikkel",
""
],
[
"Giannopoulos",
"Panos",
""
],
[
"Löffler",
"Maarten",
""
],
[
"Rote",
"Günter",
""
]
] | We study the following separation problem: Given a collection of colored objects in the plane, compute a shortest "fence" $F$, i.e., a union of curves of minimum total length, that separates every two objects of different colors. Two objects are separated if $F$ contains a simple closed curve that has one object in the... |
2401.09180 | Antonio Almud\'evar | Antonio Almud\'evar and Th\'eo Mariotte and Alfonso Ortega and Marie
Tahon | Unsupervised Multiple Domain Translation through Controlled
Disentanglement in Variational Autoencoder | null | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Unsupervised Multiple Domain Translation is the task of transforming data
from one domain to other domains without having paired data to train the
systems. Typically, methods based on Generative Adversarial Networks (GANs) are
used to address this task. However, our proposal exclusively relies on a
modified version o... | [
{
"created": "Wed, 17 Jan 2024 12:43:28 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Jan 2024 09:51:46 GMT",
"version": "v2"
}
] | 2024-01-19 | [
[
"Almudévar",
"Antonio",
""
],
[
"Mariotte",
"Théo",
""
],
[
"Ortega",
"Alfonso",
""
],
[
"Tahon",
"Marie",
""
]
] | Unsupervised Multiple Domain Translation is the task of transforming data from one domain to other domains without having paired data to train the systems. Typically, methods based on Generative Adversarial Networks (GANs) are used to address this task. However, our proposal exclusively relies on a modified version of ... |
2405.13928 | Ivan Damnjanovi\'c | Ivan Sto\v{s}i\'c, Ivan Damnjanovi\'c, \v{Z}arko Ran{\dj}elovi\'c | Counting the number of inequivalent arithmetic expressions on $n$
variables | null | null | null | null | cs.DM math.CO math.NT | http://creativecommons.org/licenses/by-nc-nd/4.0/ | An expression is any mathematical formula that contains certain formal
variables and operations to be executed in a specified order. In computer
science, it is usually convenient to represent each expression in the form of
an expression tree. Here, we consider only arithmetic expressions, i.e., those
that contain onl... | [
{
"created": "Wed, 22 May 2024 18:58:23 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Stošić",
"Ivan",
""
],
[
"Damnjanović",
"Ivan",
""
],
[
"Ranđelović",
"Žarko",
""
]
] | An expression is any mathematical formula that contains certain formal variables and operations to be executed in a specified order. In computer science, it is usually convenient to represent each expression in the form of an expression tree. Here, we consider only arithmetic expressions, i.e., those that contain only ... |
2107.06056 | Prathamesh Kalamkar | Prathamesh Kalamkar, Janani Venugopalan Ph.D., Vivek Raghavan Ph.D | Indian Legal NLP Benchmarks : A Survey | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Availability of challenging benchmarks is the key to advancement of AI in a
specific field.Since Legal Text is significantly different than normal English
text, there is a need to create separate Natural Language Processing benchmarks
for Indian Legal Text which are challenging and focus on tasks specific to
Legal Sy... | [
{
"created": "Tue, 13 Jul 2021 13:10:10 GMT",
"version": "v1"
}
] | 2022-10-11 | [
[
"Kalamkar",
"Prathamesh",
""
],
[
"D.",
"Janani Venugopalan Ph.",
""
],
[
"D",
"Vivek Raghavan Ph.",
""
]
] | Availability of challenging benchmarks is the key to advancement of AI in a specific field.Since Legal Text is significantly different than normal English text, there is a need to create separate Natural Language Processing benchmarks for Indian Legal Text which are challenging and focus on tasks specific to Legal Syst... |
1801.04735 | Alejandro Cohen | Alejandro Cohen, Asaf Cohen and Omer Gurewitz | Secure Adaptive Group Testing | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | \emph{Group Testing} (GT) addresses the problem of identifying a small subset
of defective items from a large population, by grouping items into as few test
pools as possible. In \emph{Adaptive GT} (AGT), outcomes of previous tests can
influence the makeup of future tests. Using an information theoretic point of
view... | [
{
"created": "Mon, 15 Jan 2018 11:07:10 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Aug 2020 17:50:25 GMT",
"version": "v2"
}
] | 2020-08-17 | [
[
"Cohen",
"Alejandro",
""
],
[
"Cohen",
"Asaf",
""
],
[
"Gurewitz",
"Omer",
""
]
] | \emph{Group Testing} (GT) addresses the problem of identifying a small subset of defective items from a large population, by grouping items into as few test pools as possible. In \emph{Adaptive GT} (AGT), outcomes of previous tests can influence the makeup of future tests. Using an information theoretic point of view, ... |
2106.05237 | Xiaohua Zhai | Lucas Beyer, Xiaohua Zhai, Am\'elie Royer, Larisa Markeeva, Rohan
Anil, Alexander Kolesnikov | Knowledge distillation: A good teacher is patient and consistent | Lucas, Xiaohua, Am\'elie, Larisa, and Alex contributed equally; CVPR
2022 | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is a growing discrepancy in computer vision between large-scale models
that achieve state-of-the-art performance and models that are affordable in
practical applications. In this paper we address this issue and significantly
bridge the gap between these two types of models. Throughout our empirical
investigatio... | [
{
"created": "Wed, 9 Jun 2021 17:20:40 GMT",
"version": "v1"
},
{
"created": "Tue, 21 Jun 2022 09:46:14 GMT",
"version": "v2"
}
] | 2022-06-22 | [
[
"Beyer",
"Lucas",
""
],
[
"Zhai",
"Xiaohua",
""
],
[
"Royer",
"Amélie",
""
],
[
"Markeeva",
"Larisa",
""
],
[
"Anil",
"Rohan",
""
],
[
"Kolesnikov",
"Alexander",
""
]
] | There is a growing discrepancy in computer vision between large-scale models that achieve state-of-the-art performance and models that are affordable in practical applications. In this paper we address this issue and significantly bridge the gap between these two types of models. Throughout our empirical investigation ... |
1911.05894 | Aren Jansen | Aren Jansen, Daniel P. W. Ellis, Shawn Hershey, R. Channing Moore,
Manoj Plakal, Ashok C. Popat, Rif A. Saurous | Coincidence, Categorization, and Consolidation: Learning to Recognize
Sounds with Minimal Supervision | This extended version of a ICASSP 2020 submission under same title
has an added figure and additional discussion for easier consumption | null | null | null | cs.SD eess.AS stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Humans do not acquire perceptual abilities in the way we train machines.
While machine learning algorithms typically operate on large collections of
randomly-chosen, explicitly-labeled examples, human acquisition relies more
heavily on multimodal unsupervised learning (as infants) and active learning
(as children). W... | [
{
"created": "Thu, 14 Nov 2019 02:07:47 GMT",
"version": "v1"
}
] | 2019-11-15 | [
[
"Jansen",
"Aren",
""
],
[
"Ellis",
"Daniel P. W.",
""
],
[
"Hershey",
"Shawn",
""
],
[
"Moore",
"R. Channing",
""
],
[
"Plakal",
"Manoj",
""
],
[
"Popat",
"Ashok C.",
""
],
[
"Saurous",
"Rif A.",
""
]
] | Humans do not acquire perceptual abilities in the way we train machines. While machine learning algorithms typically operate on large collections of randomly-chosen, explicitly-labeled examples, human acquisition relies more heavily on multimodal unsupervised learning (as infants) and active learning (as children). Wit... |
2101.07241 | Haoyu Xiong | Haoyu Xiong, Quanzhou Li, Yun-Chun Chen, Homanga Bharadhwaj, Samarth
Sinha, Animesh Garg | Learning by Watching: Physical Imitation of Manipulation Skills from
Human Videos | Project Website: https://www.pair.toronto.edu/lbw-kp/ | IROS 2021 | null | null | cs.RO cs.CV cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | Learning from visual data opens the potential to accrue a large range of
manipulation behaviors by leveraging human demonstrations without specifying
each of them mathematically, but rather through natural task specification. In
this paper, we present Learning by Watching (LbW), an algorithmic framework for
policy le... | [
{
"created": "Mon, 18 Jan 2021 18:50:32 GMT",
"version": "v1"
},
{
"created": "Sun, 14 Nov 2021 15:05:21 GMT",
"version": "v2"
}
] | 2021-11-16 | [
[
"Xiong",
"Haoyu",
""
],
[
"Li",
"Quanzhou",
""
],
[
"Chen",
"Yun-Chun",
""
],
[
"Bharadhwaj",
"Homanga",
""
],
[
"Sinha",
"Samarth",
""
],
[
"Garg",
"Animesh",
""
]
] | Learning from visual data opens the potential to accrue a large range of manipulation behaviors by leveraging human demonstrations without specifying each of them mathematically, but rather through natural task specification. In this paper, we present Learning by Watching (LbW), an algorithmic framework for policy lear... |
1906.07011 | Nees Jan van Eck | Nees Jan van Eck, Ludo Waltman | Accuracy of citation data in Web of Science and Scopus | Paper published in the Proceedings of the 16th International
Conference of the International Society for Scientometrics and Informetrics
(pp. 1087-1092) | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a large-scale analysis of the accuracy of citation data in the Web
of Science and Scopus databases. The analysis is based on citations given in
publications in Elsevier journals. We reveal significant data quality problems
for both databases. Missing and incorrect references are important problems in
Web o... | [
{
"created": "Mon, 17 Jun 2019 13:03:45 GMT",
"version": "v1"
}
] | 2019-06-18 | [
[
"van Eck",
"Nees Jan",
""
],
[
"Waltman",
"Ludo",
""
]
] | We present a large-scale analysis of the accuracy of citation data in the Web of Science and Scopus databases. The analysis is based on citations given in publications in Elsevier journals. We reveal significant data quality problems for both databases. Missing and incorrect references are important problems in Web of ... |
2310.10669 | Zhengmian Hu | Zhengmian Hu, Lichang Chen, Xidong Wu, Yihan Wu, Hongyang Zhang, Heng
Huang | Unbiased Watermark for Large Language Models | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The recent advancements in large language models (LLMs) have sparked a
growing apprehension regarding the potential misuse. One approach to mitigating
this risk is to incorporate watermarking techniques into LLMs, allowing for the
tracking and attribution of model outputs. This study examines a crucial aspect
of wate... | [
{
"created": "Fri, 22 Sep 2023 12:46:38 GMT",
"version": "v1"
},
{
"created": "Wed, 18 Oct 2023 02:02:08 GMT",
"version": "v2"
}
] | 2023-10-19 | [
[
"Hu",
"Zhengmian",
""
],
[
"Chen",
"Lichang",
""
],
[
"Wu",
"Xidong",
""
],
[
"Wu",
"Yihan",
""
],
[
"Zhang",
"Hongyang",
""
],
[
"Huang",
"Heng",
""
]
] | The recent advancements in large language models (LLMs) have sparked a growing apprehension regarding the potential misuse. One approach to mitigating this risk is to incorporate watermarking techniques into LLMs, allowing for the tracking and attribution of model outputs. This study examines a crucial aspect of waterm... |
2108.07047 | Robert Gilles | Subhadip Chakrabarti, Loyimee Gogoi, Robert P Gilles, Surajit
Borkotokey, Rajnish Kumar | Expected Values for Variable Network Games | null | null | null | null | cs.GT econ.TH physics.soc-ph | http://creativecommons.org/licenses/by-nc-sa/4.0/ | A network game assigns a level of collectively generated wealth to every
network that can form on a given set of players. A variable network game
combines a network game with a network formation probability distribution,
describing certain restrictions on network formation. Expected levels of
collectively generated w... | [
{
"created": "Mon, 16 Aug 2021 12:35:40 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Oct 2022 15:48:17 GMT",
"version": "v2"
}
] | 2022-10-31 | [
[
"Chakrabarti",
"Subhadip",
""
],
[
"Gogoi",
"Loyimee",
""
],
[
"Gilles",
"Robert P",
""
],
[
"Borkotokey",
"Surajit",
""
],
[
"Kumar",
"Rajnish",
""
]
] | A network game assigns a level of collectively generated wealth to every network that can form on a given set of players. A variable network game combines a network game with a network formation probability distribution, describing certain restrictions on network formation. Expected levels of collectively generated wea... |
1506.05217 | Mohsin Junaid | Mohsin Junaid, Donggang Liu and David Kung | Dexteroid: Detecting Malicious Behaviors in Android Apps Using
Reverse-Engineered Life Cycle Models | null | Computers & Security, Volume 59,Pages 92-117, ISSN 0167-4048, June
2016 | 10.1016/j.cose.2016.01.008 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The amount of Android malware has increased greatly during the last few
years. Static analysis is widely used in detecting such malware by analyzing
the code without execution. The effectiveness of current tools relies on the
app model as well as the malware detection algorithm which analyzes the app
model. If the mo... | [
{
"created": "Wed, 17 Jun 2015 06:38:37 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Apr 2016 19:38:43 GMT",
"version": "v2"
}
] | 2016-04-11 | [
[
"Junaid",
"Mohsin",
""
],
[
"Liu",
"Donggang",
""
],
[
"Kung",
"David",
""
]
] | The amount of Android malware has increased greatly during the last few years. Static analysis is widely used in detecting such malware by analyzing the code without execution. The effectiveness of current tools relies on the app model as well as the malware detection algorithm which analyzes the app model. If the mode... |
2203.00762 | Biyi Fang | Biyi Fang, Kripa Rajshekhar, Diego Klabjan | Topic Analysis for Text with Side Data | null | null | null | null | cs.LG cs.CL cs.IR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Although latent factor models (e.g., matrix factorization) obtain good
performance in predictions, they suffer from several problems including
cold-start, non-transparency, and suboptimal recommendations. In this paper, we
employ text with side data to tackle these limitations. We introduce a hybrid
generative probab... | [
{
"created": "Tue, 1 Mar 2022 22:06:30 GMT",
"version": "v1"
}
] | 2022-03-03 | [
[
"Fang",
"Biyi",
""
],
[
"Rajshekhar",
"Kripa",
""
],
[
"Klabjan",
"Diego",
""
]
] | Although latent factor models (e.g., matrix factorization) obtain good performance in predictions, they suffer from several problems including cold-start, non-transparency, and suboptimal recommendations. In this paper, we employ text with side data to tackle these limitations. We introduce a hybrid generative probabil... |
2406.00031 | Achuth Chandrasekhar | Achuth Chandrasekhar, Jonathan Chan, Francis Ogoke, Olabode
Ajenifujah, Amir Barati Farimani | AMGPT: a Large Language Model for Contextual Querying in Additive
Manufacturing | 54 pages, 4 figures | null | null | null | cs.CL cs.LG | http://creativecommons.org/licenses/by/4.0/ | Generalized large language models (LLMs) such as GPT-4 may not provide
specific answers to queries formulated by materials science researchers. These
models may produce a high-level outline but lack the capacity to return
detailed instructions on manufacturing and material properties of novel alloys.
Enhancing a smal... | [
{
"created": "Fri, 24 May 2024 20:03:32 GMT",
"version": "v1"
}
] | 2024-06-04 | [
[
"Chandrasekhar",
"Achuth",
""
],
[
"Chan",
"Jonathan",
""
],
[
"Ogoke",
"Francis",
""
],
[
"Ajenifujah",
"Olabode",
""
],
[
"Farimani",
"Amir Barati",
""
]
] | Generalized large language models (LLMs) such as GPT-4 may not provide specific answers to queries formulated by materials science researchers. These models may produce a high-level outline but lack the capacity to return detailed instructions on manufacturing and material properties of novel alloys. Enhancing a smalle... |
2003.05026 | Max Van Kleek | Max Van Kleek | Super-reflective Data: Speculative Imaginings of a World Where Data
Works for People | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It's the year 2020, and every space and place on- and off-line has been
augmented with digital things that observe, record, transmit, and compute, for
the purposes of recording endless data traces of what is happening in the
world. Individually, these things (and the invisible services the power them)
have reached co... | [
{
"created": "Tue, 10 Mar 2020 22:54:10 GMT",
"version": "v1"
}
] | 2020-03-12 | [
[
"Van Kleek",
"Max",
""
]
] | It's the year 2020, and every space and place on- and off-line has been augmented with digital things that observe, record, transmit, and compute, for the purposes of recording endless data traces of what is happening in the world. Individually, these things (and the invisible services the power them) have reached cons... |
2112.13585 | Lanning Wei | Lanning Wei, Huan Zhao, Zhiqiang He | Learn Layer-wise Connections in Graph Neural Networks | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | In recent years, Graph Neural Networks (GNNs) have shown superior performance
on diverse applications on real-world datasets. To improve the model capacity
and alleviate the over-smoothing problem, several methods proposed to
incorporate the intermediate layers by layer-wise connections. However, due to
the highly di... | [
{
"created": "Mon, 27 Dec 2021 09:33:22 GMT",
"version": "v1"
}
] | 2021-12-28 | [
[
"Wei",
"Lanning",
""
],
[
"Zhao",
"Huan",
""
],
[
"He",
"Zhiqiang",
""
]
] | In recent years, Graph Neural Networks (GNNs) have shown superior performance on diverse applications on real-world datasets. To improve the model capacity and alleviate the over-smoothing problem, several methods proposed to incorporate the intermediate layers by layer-wise connections. However, due to the highly dive... |
2102.10290 | Luca Lugini | Luca Lugini, Diane Litman | Contextual Argument Component Classification for Class Discussions | null | In Proceedings of the 28th International Conference on
Computational Linguistics, pp. 1475-1480. 2020 | 10.18653/v1/2020.coling-main.128 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Argument mining systems often consider contextual information, i.e.
information outside of an argumentative discourse unit, when trained to
accomplish tasks such as argument component identification, classification, and
relation extraction. However, prior work has not carefully analyzed the utility
of different conte... | [
{
"created": "Sat, 20 Feb 2021 08:48:07 GMT",
"version": "v1"
}
] | 2021-02-23 | [
[
"Lugini",
"Luca",
""
],
[
"Litman",
"Diane",
""
]
] | Argument mining systems often consider contextual information, i.e. information outside of an argumentative discourse unit, when trained to accomplish tasks such as argument component identification, classification, and relation extraction. However, prior work has not carefully analyzed the utility of different context... |
2108.07854 | Chethan Kumar Anjinappa | Chethan K. Anjinappa and Ismail Guvenc | Coverage Hole Detection for mmWave Networks: An Unsupervised Learning
Approach | This paper appears in: IEEE Communications Letters | null | 10.1109/LCOMM.2021.3106251 | null | cs.LG cs.IT cs.NI math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The utilization of millimeter-wave (mmWave) bands in 5G networks poses new
challenges to network planning. Vulnerability to blockages at mmWave bands can
cause coverage holes (CHs) in the radio environment, leading to radio link
failure when a user enters these CHs. Detection of the CHs carries critical
importance so... | [
{
"created": "Tue, 17 Aug 2021 19:55:36 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Aug 2021 18:58:54 GMT",
"version": "v2"
}
] | 2021-08-24 | [
[
"Anjinappa",
"Chethan K.",
""
],
[
"Guvenc",
"Ismail",
""
]
] | The utilization of millimeter-wave (mmWave) bands in 5G networks poses new challenges to network planning. Vulnerability to blockages at mmWave bands can cause coverage holes (CHs) in the radio environment, leading to radio link failure when a user enters these CHs. Detection of the CHs carries critical importance so t... |
2112.14842 | Irfan Khan | Syed Wali and Irfan Khan | Explainable Signature-based Machine Learning Approach for Identification
of Faults in Grid-Connected Photovoltaic Systems | 6 pages, 9 figures | null | null | null | cs.LG cs.AI cs.SY eess.SY | http://creativecommons.org/licenses/by/4.0/ | The transformation of conventional power networks into smart grids with the
heavy penetration level of renewable energy resources, particularly
grid-connected Photovoltaic (PV) systems, has increased the need for efficient
fault identification systems. Malfunctioning any single component in
grid-connected PV systems ... | [
{
"created": "Sat, 25 Dec 2021 15:11:18 GMT",
"version": "v1"
}
] | 2022-01-03 | [
[
"Wali",
"Syed",
""
],
[
"Khan",
"Irfan",
""
]
] | The transformation of conventional power networks into smart grids with the heavy penetration level of renewable energy resources, particularly grid-connected Photovoltaic (PV) systems, has increased the need for efficient fault identification systems. Malfunctioning any single component in grid-connected PV systems ma... |
1806.02953 | Elahe Sadeghabadi | Elahe Sadeghabadi, Seyed Mohammad Azimi-Abarghouyi, Behrooz Makki,
Masoumeh Nasiri-Kenari | Asynchronous Downlink Massive MIMO Networks: A Stochastic Geometry
Approach | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Massive multiple-input multiple-output (MIMO) is recognized as a promising
technology for the next generation of wireless networks because of its
potential to increase the spectral efficiency. In initial studies of massive
MIMO, the system has been considered to be perfectly synchronized throughout
the entire cells. ... | [
{
"created": "Fri, 8 Jun 2018 02:51:51 GMT",
"version": "v1"
}
] | 2018-06-11 | [
[
"Sadeghabadi",
"Elahe",
""
],
[
"Azimi-Abarghouyi",
"Seyed Mohammad",
""
],
[
"Makki",
"Behrooz",
""
],
[
"Nasiri-Kenari",
"Masoumeh",
""
]
] | Massive multiple-input multiple-output (MIMO) is recognized as a promising technology for the next generation of wireless networks because of its potential to increase the spectral efficiency. In initial studies of massive MIMO, the system has been considered to be perfectly synchronized throughout the entire cells. Ho... |
2312.03293 | Mandar Khoje | Mandar Khoje | Securing Data Platforms: Strategic Masking Techniques for Privacy and
Security for B2B Enterprise Data | null | null | 10.14445/22312803/IJCTT-V71I11P107 | null | cs.CR cs.SE | http://creativecommons.org/licenses/by/4.0/ | In today's digital age, the imperative to protect data privacy and security
is a paramount concern, especially for business-to-business (B2B) enterprises
that handle sensitive information. These enterprises are increasingly
constructing data platforms, which are integrated suites of technology
solutions architected f... | [
{
"created": "Wed, 6 Dec 2023 05:04:37 GMT",
"version": "v1"
}
] | 2023-12-07 | [
[
"Khoje",
"Mandar",
""
]
] | In today's digital age, the imperative to protect data privacy and security is a paramount concern, especially for business-to-business (B2B) enterprises that handle sensitive information. These enterprises are increasingly constructing data platforms, which are integrated suites of technology solutions architected for... |
cs/9809037 | David Eppstein | Nina Amenta, Marshall Bern, David Eppstein, Shang-Hua Teng | Regression Depth and Center Points | 14 pages, 3 figures | Discrete Comput. Geom. 23(3):305-323, 2000 | 10.1007/PL00009502 | null | cs.CG math.CO | null | We show that, for any set of n points in d dimensions, there exists a
hyperplane with regression depth at least ceiling(n/(d+1)). as had been
conjectured by Rousseeuw and Hubert. Dually, for any arrangement of n
hyperplanes in d dimensions there exists a point that cannot escape to infinity
without crossing at least ... | [
{
"created": "Mon, 21 Sep 1998 21:55:49 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Jul 1999 22:00:37 GMT",
"version": "v2"
}
] | 2010-01-21 | [
[
"Amenta",
"Nina",
""
],
[
"Bern",
"Marshall",
""
],
[
"Eppstein",
"David",
""
],
[
"Teng",
"Shang-Hua",
""
]
] | We show that, for any set of n points in d dimensions, there exists a hyperplane with regression depth at least ceiling(n/(d+1)). as had been conjectured by Rousseeuw and Hubert. Dually, for any arrangement of n hyperplanes in d dimensions there exists a point that cannot escape to infinity without crossing at least ce... |
2203.07511 | Robert Wolfe | Robert Wolfe, Aylin Caliskan | Contrastive Visual Semantic Pretraining Magnifies the Semantics of
Natural Language Representations | To be published in ACL 2022 | null | null | null | cs.CL cs.AI cs.CY cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We examine the effects of contrastive visual semantic pretraining by
comparing the geometry and semantic properties of contextualized English
language representations formed by GPT-2 and CLIP, a zero-shot multimodal image
classifier which adapts the GPT-2 architecture to encode image captions. We
find that contrastiv... | [
{
"created": "Mon, 14 Mar 2022 21:42:13 GMT",
"version": "v1"
}
] | 2022-03-16 | [
[
"Wolfe",
"Robert",
""
],
[
"Caliskan",
"Aylin",
""
]
] | We examine the effects of contrastive visual semantic pretraining by comparing the geometry and semantic properties of contextualized English language representations formed by GPT-2 and CLIP, a zero-shot multimodal image classifier which adapts the GPT-2 architecture to encode image captions. We find that contrastive ... |
2305.13991 | Alessandro De Palma | Alessandro De Palma, Rudy Bunel, Krishnamurthy Dvijotham, M. Pawan
Kumar, Robert Stanforth, Alessio Lomuscio | Expressive Losses for Verified Robustness via Convex Combinations | ICLR 2024 | null | null | null | cs.LG cs.CR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to train networks for verified adversarial robustness, it is common
to over-approximate the worst-case loss over perturbation regions, resulting in
networks that attain verifiability at the expense of standard performance. As
shown in recent work, better trade-offs between accuracy and robustness can be
obta... | [
{
"created": "Tue, 23 May 2023 12:20:29 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Mar 2024 16:20:50 GMT",
"version": "v2"
},
{
"created": "Mon, 18 Mar 2024 14:35:21 GMT",
"version": "v3"
}
] | 2024-03-19 | [
[
"De Palma",
"Alessandro",
""
],
[
"Bunel",
"Rudy",
""
],
[
"Dvijotham",
"Krishnamurthy",
""
],
[
"Kumar",
"M. Pawan",
""
],
[
"Stanforth",
"Robert",
""
],
[
"Lomuscio",
"Alessio",
""
]
] | In order to train networks for verified adversarial robustness, it is common to over-approximate the worst-case loss over perturbation regions, resulting in networks that attain verifiability at the expense of standard performance. As shown in recent work, better trade-offs between accuracy and robustness can be obtain... |
2210.02235 | Jialing Liao | Jialing Liao, Zheng Chen, and Erik G. Larsson | Over-the-Air Federated Learning with Privacy Protection via Correlated
Additive Perturbations | 8 pages, 4 figures, Allerton 2022 | null | null | null | cs.LG cs.CR cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider privacy aspects of wireless federated learning
(FL) with Over-the-Air (OtA) transmission of gradient updates from multiple
users/agents to an edge server. By exploiting the waveform superposition
property of multiple access channels, OtA FL enables the users to transmit
their updates simult... | [
{
"created": "Wed, 5 Oct 2022 13:13:35 GMT",
"version": "v1"
}
] | 2022-10-12 | [
[
"Liao",
"Jialing",
""
],
[
"Chen",
"Zheng",
""
],
[
"Larsson",
"Erik G.",
""
]
] | In this paper, we consider privacy aspects of wireless federated learning (FL) with Over-the-Air (OtA) transmission of gradient updates from multiple users/agents to an edge server. By exploiting the waveform superposition property of multiple access channels, OtA FL enables the users to transmit their updates simultan... |
2404.13340 | Kefan Li | Kefan Li, Yuan Yuan | Large Language Models as Test Case Generators: Performance Evaluation
and Enhancement | null | null | null | null | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Code generation with Large Language Models (LLMs) has been extensively
studied and achieved remarkable progress. As a complementary aspect to code
generation, test case generation is of crucial importance in ensuring the
quality and reliability of code. However, using LLMs as test case generators
has been much less e... | [
{
"created": "Sat, 20 Apr 2024 10:27:01 GMT",
"version": "v1"
}
] | 2024-04-23 | [
[
"Li",
"Kefan",
""
],
[
"Yuan",
"Yuan",
""
]
] | Code generation with Large Language Models (LLMs) has been extensively studied and achieved remarkable progress. As a complementary aspect to code generation, test case generation is of crucial importance in ensuring the quality and reliability of code. However, using LLMs as test case generators has been much less exp... |
1811.01544 | Myoungsoo Jung | Donghyun Gouk, Miryeong Kwon, Jie Zhang, Sungjoon Koh, Wonil Choi, Nam
Sung Kim, Mahmut Kandemir and Myoungsoo Jung | Amber: Enabling Precise Full-System Simulation with Detailed Modeling of
All SSD Resources | This paper has been accepted at the 51st Annual IEEE/ACM
International Symposium on Microarchitecture (MICRO '51), 2018. This material
is presented to ensure timely dissemination of scholarly and technical work | null | null | null | cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | SSDs become a major storage component in modern memory hierarchies, and SSD
research demands exploring future simulation-based studies by integrating SSD
subsystems into a full-system environment. However, several challenges exist to
model SSDs under a full-system simulations; SSDs are composed upon their own
complet... | [
{
"created": "Mon, 5 Nov 2018 07:59:34 GMT",
"version": "v1"
}
] | 2018-11-06 | [
[
"Gouk",
"Donghyun",
""
],
[
"Kwon",
"Miryeong",
""
],
[
"Zhang",
"Jie",
""
],
[
"Koh",
"Sungjoon",
""
],
[
"Choi",
"Wonil",
""
],
[
"Kim",
"Nam Sung",
""
],
[
"Kandemir",
"Mahmut",
""
],
[
"Jung",
... | SSDs become a major storage component in modern memory hierarchies, and SSD research demands exploring future simulation-based studies by integrating SSD subsystems into a full-system environment. However, several challenges exist to model SSDs under a full-system simulations; SSDs are composed upon their own complete ... |
1910.03892 | Daan de Geus | Daan de Geus, Panagiotis Meletis, Gijs Dubbelman | Fast Panoptic Segmentation Network | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we present an end-to-end network for fast panoptic
segmentation. This network, called Fast Panoptic Segmentation Network (FPSNet),
does not require computationally costly instance mask predictions or merging
heuristics. This is achieved by casting the panoptic task into a custom dense
pixel-wise classif... | [
{
"created": "Wed, 9 Oct 2019 10:41:28 GMT",
"version": "v1"
}
] | 2019-10-10 | [
[
"de Geus",
"Daan",
""
],
[
"Meletis",
"Panagiotis",
""
],
[
"Dubbelman",
"Gijs",
""
]
] | In this work, we present an end-to-end network for fast panoptic segmentation. This network, called Fast Panoptic Segmentation Network (FPSNet), does not require computationally costly instance mask predictions or merging heuristics. This is achieved by casting the panoptic task into a custom dense pixel-wise classific... |
1508.04278 | Fabian Fuchs | Fabian Fuchs, Matthias Wolf | On the Distributed Computation of Fractional Connected Dominating Set
Packings | null | null | null | null | cs.DC cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most fundamental problems in wireless networks is to achieve high
throughput. Fractional Connected Dominating Set (FCDS) Packings can achieve a
throughput of ${\Theta}(k/\log n)$ messages for networks with node connectivity
$k$, which is optimal regarding routing-based message transmission. FCDS were
propo... | [
{
"created": "Tue, 18 Aug 2015 11:28:39 GMT",
"version": "v1"
}
] | 2015-08-19 | [
[
"Fuchs",
"Fabian",
""
],
[
"Wolf",
"Matthias",
""
]
] | One of the most fundamental problems in wireless networks is to achieve high throughput. Fractional Connected Dominating Set (FCDS) Packings can achieve a throughput of ${\Theta}(k/\log n)$ messages for networks with node connectivity $k$, which is optimal regarding routing-based message transmission. FCDS were propose... |
1907.08865 | Marc Hellmuth | Marc Hellmuth, Manuela Gei{\ss} and Peter F. Stadler | Complexity of Modification Problems for Reciprocal Best Match Graphs | null | null | null | null | cs.CC cs.DS math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reciprocal best match graphs (RBMGs) are vertex colored graphs whose vertices
represent genes and the colors the species where the genes reside. Edges
identify pairs of genes that are most closely related with respect to an
underlying evolutionary tree. In practical applications this tree is unknown
and the edges of ... | [
{
"created": "Sat, 20 Jul 2019 20:22:08 GMT",
"version": "v1"
}
] | 2019-07-23 | [
[
"Hellmuth",
"Marc",
""
],
[
"Geiß",
"Manuela",
""
],
[
"Stadler",
"Peter F.",
""
]
] | Reciprocal best match graphs (RBMGs) are vertex colored graphs whose vertices represent genes and the colors the species where the genes reside. Edges identify pairs of genes that are most closely related with respect to an underlying evolutionary tree. In practical applications this tree is unknown and the edges of th... |
1807.04723 | Iulian Vlad Serban | Iulian Vlad Serban, Chinnadhurai Sankar, Michael Pieper, Joelle
Pineau, Yoshua Bengio | The Bottleneck Simulator: A Model-based Deep Reinforcement Learning
Approach | 26 pages, 2 figures, 4 tables | null | null | null | cs.LG cs.AI cs.CL cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep reinforcement learning has recently shown many impressive successes.
However, one major obstacle towards applying such methods to real-world
problems is their lack of data-efficiency. To this end, we propose the
Bottleneck Simulator: a model-based reinforcement learning method which
combines a learned, factorize... | [
{
"created": "Thu, 12 Jul 2018 16:59:28 GMT",
"version": "v1"
}
] | 2018-07-13 | [
[
"Serban",
"Iulian Vlad",
""
],
[
"Sankar",
"Chinnadhurai",
""
],
[
"Pieper",
"Michael",
""
],
[
"Pineau",
"Joelle",
""
],
[
"Bengio",
"Yoshua",
""
]
] | Deep reinforcement learning has recently shown many impressive successes. However, one major obstacle towards applying such methods to real-world problems is their lack of data-efficiency. To this end, we propose the Bottleneck Simulator: a model-based reinforcement learning method which combines a learned, factorized ... |
1509.06361 | Supartha Podder | Raghav Kulkarni, Supartha Podder | Quantum Query Complexity of Subgraph Isomorphism and Homomorphism | 16 pages, 2 figures | null | null | null | cs.CC quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Let $H$ be a fixed graph on $n$ vertices. Let $f_H(G) = 1$ iff the input
graph $G$ on $n$ vertices contains $H$ as a (not necessarily induced) subgraph.
Let $\alpha_H$ denote the cardinality of a maximum independent set of $H$. In
this paper we show:
\[Q(f_H) = \Omega\left(\sqrt{\alpha_H \cdot n}\right),\] where $Q... | [
{
"created": "Mon, 21 Sep 2015 19:54:51 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Sep 2015 02:53:42 GMT",
"version": "v2"
}
] | 2015-09-23 | [
[
"Kulkarni",
"Raghav",
""
],
[
"Podder",
"Supartha",
""
]
] | Let $H$ be a fixed graph on $n$ vertices. Let $f_H(G) = 1$ iff the input graph $G$ on $n$ vertices contains $H$ as a (not necessarily induced) subgraph. Let $\alpha_H$ denote the cardinality of a maximum independent set of $H$. In this paper we show: \[Q(f_H) = \Omega\left(\sqrt{\alpha_H \cdot n}\right),\] where $Q(f_H... |
2311.11164 | Eleftherios Tsonis | Eleftherios Tsonis, Paraskevi Tzouveli, Athanasios Voulodimos | Mitigating Exposure Bias in Discriminator Guided Diffusion Models | null | null | null | null | cs.CV cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Diffusion Models have demonstrated remarkable performance in image
generation. However, their demanding computational requirements for training
have prompted ongoing efforts to enhance the quality of generated images
through modifications in the sampling process. A recent approach, known as
Discriminator Guidance, se... | [
{
"created": "Sat, 18 Nov 2023 20:49:50 GMT",
"version": "v1"
}
] | 2023-11-21 | [
[
"Tsonis",
"Eleftherios",
""
],
[
"Tzouveli",
"Paraskevi",
""
],
[
"Voulodimos",
"Athanasios",
""
]
] | Diffusion Models have demonstrated remarkable performance in image generation. However, their demanding computational requirements for training have prompted ongoing efforts to enhance the quality of generated images through modifications in the sampling process. A recent approach, known as Discriminator Guidance, seek... |
1406.0062 | Fahem Kebair fk | Fahem Kebair and Fr\'ed\'eric Serin | Towards a Multiagent Decision Support System for crisis Management | 14 pages. arXiv admin note: text overlap with arXiv:0907.0499 | J. Intelligent Systems 20(1): 47-60 (2011) | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Crisis management is a complex problem raised by the scientific community
currently. Decision support systems are a suitable solution for such issues,
they are indeed able to help emergency managers to prevent and to manage crisis
in emergency situations. However, they should be enough flexible and adaptive
in order ... | [
{
"created": "Sat, 31 May 2014 09:57:02 GMT",
"version": "v1"
}
] | 2014-06-03 | [
[
"Kebair",
"Fahem",
""
],
[
"Serin",
"Frédéric",
""
]
] | Crisis management is a complex problem raised by the scientific community currently. Decision support systems are a suitable solution for such issues, they are indeed able to help emergency managers to prevent and to manage crisis in emergency situations. However, they should be enough flexible and adaptive in order to... |
2103.06641 | Aaron Roth | Sergul Aydore, William Brown, Michael Kearns, Krishnaram Kenthapadi,
Luca Melis, Aaron Roth, Ankit Siva | Differentially Private Query Release Through Adaptive Projection | null | null | null | null | cs.LG cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose, implement, and evaluate a new algorithm for releasing answers to
very large numbers of statistical queries like $k$-way marginals, subject to
differential privacy. Our algorithm makes adaptive use of a continuous
relaxation of the Projection Mechanism, which answers queries on the private
dataset using si... | [
{
"created": "Thu, 11 Mar 2021 12:43:18 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Jun 2021 15:44:57 GMT",
"version": "v2"
}
] | 2021-06-24 | [
[
"Aydore",
"Sergul",
""
],
[
"Brown",
"William",
""
],
[
"Kearns",
"Michael",
""
],
[
"Kenthapadi",
"Krishnaram",
""
],
[
"Melis",
"Luca",
""
],
[
"Roth",
"Aaron",
""
],
[
"Siva",
"Ankit",
""
]
] | We propose, implement, and evaluate a new algorithm for releasing answers to very large numbers of statistical queries like $k$-way marginals, subject to differential privacy. Our algorithm makes adaptive use of a continuous relaxation of the Projection Mechanism, which answers queries on the private dataset using simp... |
1908.08908 | Huynh Manh | Manh Huynh and Gita Alaghband | Trajectory Prediction by Coupling Scene-LSTM with Human Movement LSTM | To appear in ISVC 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We develop a novel human trajectory prediction system that incorporates the
scene information (Scene-LSTM) as well as individual pedestrian movement
(Pedestrian-LSTM) trained simultaneously within static crowded scenes. We
superimpose a two-level grid structure (grid cells and subgrids) on the scene
to encode spatial... | [
{
"created": "Fri, 23 Aug 2019 17:31:59 GMT",
"version": "v1"
}
] | 2019-08-26 | [
[
"Huynh",
"Manh",
""
],
[
"Alaghband",
"Gita",
""
]
] | We develop a novel human trajectory prediction system that incorporates the scene information (Scene-LSTM) as well as individual pedestrian movement (Pedestrian-LSTM) trained simultaneously within static crowded scenes. We superimpose a two-level grid structure (grid cells and subgrids) on the scene to encode spatial g... |
1711.07211 | Ilias Diakonikolas | Ilias Diakonikolas and Daniel M. Kane and Alistair Stewart | List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical
Gaussians | null | null | null | null | cs.DS cs.CC cs.IT cs.LG math.IT math.ST stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of list-decodable Gaussian mean estimation and the
related problem of learning mixtures of separated spherical Gaussians. We
develop a set of techniques that yield new efficient algorithms with
significantly improved guarantees for these problems.
{\bf List-Decodable Mean Estimation.} Fix any $... | [
{
"created": "Mon, 20 Nov 2017 09:07:08 GMT",
"version": "v1"
}
] | 2017-11-21 | [
[
"Diakonikolas",
"Ilias",
""
],
[
"Kane",
"Daniel M.",
""
],
[
"Stewart",
"Alistair",
""
]
] | We study the problem of list-decodable Gaussian mean estimation and the related problem of learning mixtures of separated spherical Gaussians. We develop a set of techniques that yield new efficient algorithms with significantly improved guarantees for these problems. {\bf List-Decodable Mean Estimation.} Fix any $d \i... |
2107.11536 | Bingbing Rao | Bingbing Rao, Zixia Liu, Hong Zhang, Siyang Lu, Liqiang Wang | SODA: A Semantics-Aware Optimization Framework for Data-Intensive
Applications Using Hybrid Program Analysis | 2021 IEEE International Conference on Cloud Computing | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | In the era of data explosion, a growing number of data-intensive computing
frameworks, such as Apache Hadoop and Spark, have been proposed to handle the
massive volume of unstructured data in parallel. Since programming models
provided by these frameworks allow users to specify complex and diversified
user-defined fu... | [
{
"created": "Sat, 24 Jul 2021 05:33:05 GMT",
"version": "v1"
}
] | 2021-07-27 | [
[
"Rao",
"Bingbing",
""
],
[
"Liu",
"Zixia",
""
],
[
"Zhang",
"Hong",
""
],
[
"Lu",
"Siyang",
""
],
[
"Wang",
"Liqiang",
""
]
] | In the era of data explosion, a growing number of data-intensive computing frameworks, such as Apache Hadoop and Spark, have been proposed to handle the massive volume of unstructured data in parallel. Since programming models provided by these frameworks allow users to specify complex and diversified user-defined func... |
2004.14983 | Nora Hollenstein | Giuseppe Russo, Nora Hollenstein, Claudiu Musat, Ce Zhang | Control, Generate, Augment: A Scalable Framework for Multi-Attribute
Text Generation | Accepted at Findings of EMNLP 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce CGA, a conditional VAE architecture, to control, generate, and
augment text. CGA is able to generate natural English sentences controlling
multiple semantic and syntactic attributes by combining adversarial learning
with a context-aware loss and a cyclical word dropout routine. We demonstrate
the value o... | [
{
"created": "Thu, 30 Apr 2020 17:31:16 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Oct 2020 12:23:16 GMT",
"version": "v2"
}
] | 2020-10-05 | [
[
"Russo",
"Giuseppe",
""
],
[
"Hollenstein",
"Nora",
""
],
[
"Musat",
"Claudiu",
""
],
[
"Zhang",
"Ce",
""
]
] | We introduce CGA, a conditional VAE architecture, to control, generate, and augment text. CGA is able to generate natural English sentences controlling multiple semantic and syntactic attributes by combining adversarial learning with a context-aware loss and a cyclical word dropout routine. We demonstrate the value of ... |
2305.03378 | Zenghao Chai | Zhengzhuo Xu and Zenghao Chai and Chengyin Xu and Chun Yuan and Haiqin
Yang | Towards Effective Collaborative Learning in Long-Tailed Recognition | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | Real-world data usually suffers from severe class imbalance and long-tailed
distributions, where minority classes are significantly underrepresented
compared to the majority ones. Recent research prefers to utilize multi-expert
architectures to mitigate the model uncertainty on the minority, where
collaborative learn... | [
{
"created": "Fri, 5 May 2023 09:16:06 GMT",
"version": "v1"
}
] | 2023-05-08 | [
[
"Xu",
"Zhengzhuo",
""
],
[
"Chai",
"Zenghao",
""
],
[
"Xu",
"Chengyin",
""
],
[
"Yuan",
"Chun",
""
],
[
"Yang",
"Haiqin",
""
]
] | Real-world data usually suffers from severe class imbalance and long-tailed distributions, where minority classes are significantly underrepresented compared to the majority ones. Recent research prefers to utilize multi-expert architectures to mitigate the model uncertainty on the minority, where collaborative learnin... |
2003.11184 | Haiyang Xu | Haiyang Xu, Junwen Chen, Kun Han, Xiangang Li | Adversarial Multi-Binary Neural Network for Multi-class Classification | null | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-class text classification is one of the key problems in machine
learning and natural language processing. Emerging neural networks deal with
the problem using a multi-output softmax layer and achieve substantial
progress, but they do not explicitly learn the correlation among classes. In
this paper, we use a mu... | [
{
"created": "Wed, 25 Mar 2020 02:19:17 GMT",
"version": "v1"
}
] | 2020-03-26 | [
[
"Xu",
"Haiyang",
""
],
[
"Chen",
"Junwen",
""
],
[
"Han",
"Kun",
""
],
[
"Li",
"Xiangang",
""
]
] | Multi-class text classification is one of the key problems in machine learning and natural language processing. Emerging neural networks deal with the problem using a multi-output softmax layer and achieve substantial progress, but they do not explicitly learn the correlation among classes. In this paper, we use a mult... |
2307.10558 | Hai Wang | Shiyang Li, Jun Yan, Hai Wang, Zheng Tang, Xiang Ren, Vijay
Srinivasan, Hongxia Jin | Instruction-following Evaluation through Verbalizer Manipulation | NAACL 2024 findings | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While instruction-tuned models have shown remarkable success in various
natural language processing tasks, accurately evaluating their ability to
follow instructions remains challenging. Existing benchmarks primarily focus on
common instructions that align well with what the model learned during
training. However, pr... | [
{
"created": "Thu, 20 Jul 2023 03:54:24 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Apr 2024 04:38:21 GMT",
"version": "v2"
}
] | 2024-04-03 | [
[
"Li",
"Shiyang",
""
],
[
"Yan",
"Jun",
""
],
[
"Wang",
"Hai",
""
],
[
"Tang",
"Zheng",
""
],
[
"Ren",
"Xiang",
""
],
[
"Srinivasan",
"Vijay",
""
],
[
"Jin",
"Hongxia",
""
]
] | While instruction-tuned models have shown remarkable success in various natural language processing tasks, accurately evaluating their ability to follow instructions remains challenging. Existing benchmarks primarily focus on common instructions that align well with what the model learned during training. However, prof... |
2211.11386 | Satoshi Ikehata Mr. | Satoshi Ikehata | PS-Transformer: Learning Sparse Photometric Stereo Network using
Self-Attention Mechanism | BMVC2021. Code and Supplementary are available at
https://github.com/satoshi-ikehata/PS-Transformer-BMVC2021 | BMVC. Vol. 2. No. 4. 2021 | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Existing deep calibrated photometric stereo networks basically aggregate
observations under different lights based on the pre-defined operations such as
linear projection and max pooling. While they are effective with the dense
capture, simple first-order operations often fail to capture the high-order
interactions a... | [
{
"created": "Mon, 21 Nov 2022 11:58:25 GMT",
"version": "v1"
}
] | 2022-11-22 | [
[
"Ikehata",
"Satoshi",
""
]
] | Existing deep calibrated photometric stereo networks basically aggregate observations under different lights based on the pre-defined operations such as linear projection and max pooling. While they are effective with the dense capture, simple first-order operations often fail to capture the high-order interactions amo... |
1207.3027 | Reza Khosravi-Farsani | Reza K. Farsani | Fundamental Limits of Communications in Interference Networks-Part II:
Information Flow in Degraded Networks | A table of contents is given | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this second part of our multi-part papers, the information flow in
degraded interference networks is studied. A full characterization of the
sum-rate capacity for the degraded networks with any possible configuration is
established. It is shown that a successive decoding scheme is sum-rate optimal
for these networ... | [
{
"created": "Thu, 12 Jul 2012 17:24:38 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Feb 2013 06:34:25 GMT",
"version": "v2"
}
] | 2013-02-18 | [
[
"Farsani",
"Reza K.",
""
]
] | In this second part of our multi-part papers, the information flow in degraded interference networks is studied. A full characterization of the sum-rate capacity for the degraded networks with any possible configuration is established. It is shown that a successive decoding scheme is sum-rate optimal for these networks... |
2202.10101 | Lisa K\"uhnel | Lisa K\"uhnel, Alexander Schulz, Barbara Hammer and Juliane Fluck | BERT WEAVER: Using WEight AVERaging to enable lifelong learning for
transformer-based models in biomedical semantic search engines | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Recent developments in transfer learning have boosted the advancements in
natural language processing tasks. The performance is, however, dependent on
high-quality, manually annotated training data. Especially in the biomedical
domain, it has been shown that one training corpus is not enough to learn
generic models t... | [
{
"created": "Mon, 21 Feb 2022 10:34:41 GMT",
"version": "v1"
},
{
"created": "Tue, 9 May 2023 12:32:36 GMT",
"version": "v2"
},
{
"created": "Tue, 31 Oct 2023 15:36:12 GMT",
"version": "v3"
}
] | 2023-11-01 | [
[
"Kühnel",
"Lisa",
""
],
[
"Schulz",
"Alexander",
""
],
[
"Hammer",
"Barbara",
""
],
[
"Fluck",
"Juliane",
""
]
] | Recent developments in transfer learning have boosted the advancements in natural language processing tasks. The performance is, however, dependent on high-quality, manually annotated training data. Especially in the biomedical domain, it has been shown that one training corpus is not enough to learn generic models tha... |
2407.10906 | Peng Liang | Zengyang Li, Jiabao Ji, Peng Liang, Ran Mo, Hui Liu | An Exploratory Study on Just-in-Time Multi-Programming-Language Bug
Prediction | Preprint accepted for publication in Information and Software
Technology, 2024 | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Context: An increasing number of software systems are written in multiple
programming languages (PLs), which are called multi-programming-language (MPL)
systems. MPL bugs (MPLBs) refers to the bugs whose resolution involves multiple
PLs. Despite high complexity of MPLB resolution, there lacks MPLB prediction
methods.... | [
{
"created": "Mon, 15 Jul 2024 17:06:18 GMT",
"version": "v1"
}
] | 2024-07-16 | [
[
"Li",
"Zengyang",
""
],
[
"Ji",
"Jiabao",
""
],
[
"Liang",
"Peng",
""
],
[
"Mo",
"Ran",
""
],
[
"Liu",
"Hui",
""
]
] | Context: An increasing number of software systems are written in multiple programming languages (PLs), which are called multi-programming-language (MPL) systems. MPL bugs (MPLBs) refers to the bugs whose resolution involves multiple PLs. Despite high complexity of MPLB resolution, there lacks MPLB prediction methods. O... |
1309.5124 | Brandon Oselio | Brandon Oselio and Alex Kulesza and Alfred O. Hero III | Multi-layer graph analysis for dynamic social networks | 10 pages, 9 figures | null | 10.1109/JSTSP.2014.2328312 | null | cs.SI physics.soc-ph stat.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Modern social networks frequently encompass multiple distinct types of
connectivity information; for instance, explicitly acknowledged friend
relationships might complement behavioral measures that link users according to
their actions or interests. One way to represent these networks is as
multi-layer graphs, where ... | [
{
"created": "Fri, 20 Sep 2013 01:06:43 GMT",
"version": "v1"
},
{
"created": "Mon, 12 May 2014 02:53:41 GMT",
"version": "v2"
}
] | 2015-06-17 | [
[
"Oselio",
"Brandon",
""
],
[
"Kulesza",
"Alex",
""
],
[
"Hero",
"Alfred O.",
"III"
]
] | Modern social networks frequently encompass multiple distinct types of connectivity information; for instance, explicitly acknowledged friend relationships might complement behavioral measures that link users according to their actions or interests. One way to represent these networks is as multi-layer graphs, where ea... |
1910.08102 | Jiacheng Zhu | Jiacheng Zhu, Shenghao Qin, Wenshuo Wang, and Ding Zhao | Probabilistic Trajectory Prediction for Autonomous Vehicles with
Attentive Recurrent Neural Process | 7 pages, 5 figures, submitted to ICRA 2020 | null | null | null | cs.RO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predicting surrounding vehicle behaviors are critical to autonomous vehicles
when negotiating in multi-vehicle interaction scenarios. Most existing
approaches require tedious training process with large amounts of data and may
fail to capture the propagating uncertainty in interaction behaviors. The
multi-vehicle beh... | [
{
"created": "Thu, 17 Oct 2019 18:26:31 GMT",
"version": "v1"
}
] | 2019-10-21 | [
[
"Zhu",
"Jiacheng",
""
],
[
"Qin",
"Shenghao",
""
],
[
"Wang",
"Wenshuo",
""
],
[
"Zhao",
"Ding",
""
]
] | Predicting surrounding vehicle behaviors are critical to autonomous vehicles when negotiating in multi-vehicle interaction scenarios. Most existing approaches require tedious training process with large amounts of data and may fail to capture the propagating uncertainty in interaction behaviors. The multi-vehicle behav... |
2212.08834 | Ajoy Mondal Dr. | Ajoy Mondal, Rohit saluja, and C. V. Jawahar | Towards Robust Handwritten Text Recognition with On-the-fly User
Participation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Long-term OCR services aim to provide high-quality output to their users at
competitive costs. It is essential to upgrade the models because of the complex
data loaded by the users. The service providers encourage the users who provide
data where the OCR model fails by rewarding them based on data complexity,
readabi... | [
{
"created": "Sat, 17 Dec 2022 10:20:39 GMT",
"version": "v1"
}
] | 2022-12-20 | [
[
"Mondal",
"Ajoy",
""
],
[
"saluja",
"Rohit",
""
],
[
"Jawahar",
"C. V.",
""
]
] | Long-term OCR services aim to provide high-quality output to their users at competitive costs. It is essential to upgrade the models because of the complex data loaded by the users. The service providers encourage the users who provide data where the OCR model fails by rewarding them based on data complexity, readabili... |
2008.06048 | Jeff Ens Mr | Jeff Ens, Philippe Pasquier | MMM : Exploring Conditional Multi-Track Music Generation with the
Transformer | null | null | null | null | cs.SD cs.LG cs.MM | http://creativecommons.org/licenses/by/4.0/ | We propose the Multi-Track Music Machine (MMM), a generative system based on
the Transformer architecture that is capable of generating multi-track music.
In contrast to previous work, which represents musical material as a single
time-ordered sequence, where the musical events corresponding to different
tracks are i... | [
{
"created": "Thu, 13 Aug 2020 02:36:34 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Aug 2020 19:13:39 GMT",
"version": "v2"
}
] | 2020-08-24 | [
[
"Ens",
"Jeff",
""
],
[
"Pasquier",
"Philippe",
""
]
] | We propose the Multi-Track Music Machine (MMM), a generative system based on the Transformer architecture that is capable of generating multi-track music. In contrast to previous work, which represents musical material as a single time-ordered sequence, where the musical events corresponding to different tracks are int... |
1704.07647 | Ahmet Cetinkaya | Ahmet Cetinkaya, Hideaki Ishii, Tomohisa Hayakawa | Analysis of Stochastic Switched Systems with Application to Networked
Control Under Jamming Attacks | Change title of Section 3; Resize figures | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the stability problem for discrete-time stochastic switched
linear systems under the specific scenarios where information about the
switching patterns and the probability of switches are not available. Our
analysis focuses on the average number of times each mode becomes active in the
long run and, in ... | [
{
"created": "Tue, 25 Apr 2017 11:54:32 GMT",
"version": "v1"
},
{
"created": "Tue, 17 Oct 2017 07:03:14 GMT",
"version": "v2"
},
{
"created": "Wed, 21 Feb 2018 03:31:15 GMT",
"version": "v3"
},
{
"created": "Fri, 20 Apr 2018 12:45:17 GMT",
"version": "v4"
}
] | 2018-04-23 | [
[
"Cetinkaya",
"Ahmet",
""
],
[
"Ishii",
"Hideaki",
""
],
[
"Hayakawa",
"Tomohisa",
""
]
] | We investigate the stability problem for discrete-time stochastic switched linear systems under the specific scenarios where information about the switching patterns and the probability of switches are not available. Our analysis focuses on the average number of times each mode becomes active in the long run and, in pa... |
1210.1709 | Ravi Murugesan | Ravi Murugesan | Promising outcomes of an online course in research writing at a Rwandan
university | null | European Science Editing, August 2012, 38(3), 60-64 | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Background: Researchers in developing countries often do not have access to
training on research writing. The purpose of this study was to test whether
researchers in Rwanda might complete and benefit from a pilot online course in
research writing. Methods: The pilot course was set up on Moodle, an
open-source online... | [
{
"created": "Fri, 5 Oct 2012 11:14:20 GMT",
"version": "v1"
}
] | 2012-10-08 | [
[
"Murugesan",
"Ravi",
""
]
] | Background: Researchers in developing countries often do not have access to training on research writing. The purpose of this study was to test whether researchers in Rwanda might complete and benefit from a pilot online course in research writing. Methods: The pilot course was set up on Moodle, an open-source online l... |
2008.00811 | Leah Epstein | Janos Balogh and Leah Epstein and Asaf Levin | Truly asymptotic lower bounds for online vector bin packing | Submitted to SODA 2021 | null | null | null | cs.DS cs.DM math.CO math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we consider online vector bin packing. It is known that no
algorithm can have a competitive ratio of $o(d/\log^2 d)$ in the absolute
sense, though upper bounds for this problem were always shown in the asymptotic
sense. Since variants of bin packing are traditionally studied with respect to
the asymptot... | [
{
"created": "Mon, 3 Aug 2020 12:08:43 GMT",
"version": "v1"
}
] | 2020-08-04 | [
[
"Balogh",
"Janos",
""
],
[
"Epstein",
"Leah",
""
],
[
"Levin",
"Asaf",
""
]
] | In this work, we consider online vector bin packing. It is known that no algorithm can have a competitive ratio of $o(d/\log^2 d)$ in the absolute sense, though upper bounds for this problem were always shown in the asymptotic sense. Since variants of bin packing are traditionally studied with respect to the asymptotic... |
1205.5979 | Elham Bahmani | Elham Bahmani and Ghosheh Abed Hodtani | Achievable Rate Regions for the Dirty Multiple Access Channel with
Partial Side Information at the Transmitters | 5 pages, 3 figures, This paper was accepted at IEEE-ISIT2012 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we establish achievable rate regions for the multiple access
channel (MAC) with side information partially known (estimated or sensed
version) at the transmitters. Actually, we extend the lattice strategies used
by Philosof-Zamir for the MAC with full side information at the transmitters to
the partial... | [
{
"created": "Sun, 27 May 2012 15:54:23 GMT",
"version": "v1"
}
] | 2012-05-29 | [
[
"Bahmani",
"Elham",
""
],
[
"Hodtani",
"Ghosheh Abed",
""
]
] | In this paper, we establish achievable rate regions for the multiple access channel (MAC) with side information partially known (estimated or sensed version) at the transmitters. Actually, we extend the lattice strategies used by Philosof-Zamir for the MAC with full side information at the transmitters to the partially... |
2205.04567 | Michael Dikshtein | Michael Dikshtein, Nir Weinberger, and Shlomo Shamai (Shitz) | The Compound Information Bottleneck Outlook | This work has been submitted to the IEEE for possible publication | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We formulate and analyze the compound information bottleneck programming. In
this problem, a Markov chain $ \mathsf{X} \rightarrow \mathsf{Y} \rightarrow
\mathsf{Z} $ is assumed with fixed marginal distributions
$\mathsf{P}_{\mathsf{X}}$ and $\mathsf{P}_{\mathsf{Y}}$, and the mutual
information between $ \mathsf{X} $... | [
{
"created": "Mon, 9 May 2022 21:27:45 GMT",
"version": "v1"
}
] | 2022-05-11 | [
[
"Dikshtein",
"Michael",
"",
"Shitz"
],
[
"Weinberger",
"Nir",
"",
"Shitz"
],
[
"Shamai",
"Shlomo",
"",
"Shitz"
]
] | We formulate and analyze the compound information bottleneck programming. In this problem, a Markov chain $ \mathsf{X} \rightarrow \mathsf{Y} \rightarrow \mathsf{Z} $ is assumed with fixed marginal distributions $\mathsf{P}_{\mathsf{X}}$ and $\mathsf{P}_{\mathsf{Y}}$, and the mutual information between $ \mathsf{X} $ a... |
1302.5997 | EPTCS | Rachid Echahed (CNRS, University of Grenoble, France), Detlef Plump
(University of York, UK) | Proceedings 7th International Workshop on Computing with Terms and
Graphs | null | EPTCS 110, 2013 | 10.4204/EPTCS.110 | null | cs.SC cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This volume contains the proceedings of the Seventh International Workshop on
Computing with Terms and Graphs (TERMGRAPH 2013). The workshop took place in
Rome, Italy, on March 23rd, 2013, as part of the sixteenth edition of the
European Joint Conferences on Theory and Practice of Software (ETAPS 2013).
Research in... | [
{
"created": "Mon, 25 Feb 2013 05:49:14 GMT",
"version": "v1"
}
] | 2013-02-26 | [
[
"Echahed",
"Rachid",
"",
"CNRS, University of Grenoble, France"
],
[
"Plump",
"Detlef",
"",
"University of York, UK"
]
] | This volume contains the proceedings of the Seventh International Workshop on Computing with Terms and Graphs (TERMGRAPH 2013). The workshop took place in Rome, Italy, on March 23rd, 2013, as part of the sixteenth edition of the European Joint Conferences on Theory and Practice of Software (ETAPS 2013). Research in ter... |
2006.01038 | Lei Cui | Minghao Li, Yiheng Xu, Lei Cui, Shaohan Huang, Furu Wei, Zhoujun Li,
Ming Zhou | DocBank: A Benchmark Dataset for Document Layout Analysis | COLING 2020 | null | null | null | cs.CL | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Document layout analysis usually relies on computer vision models to
understand documents while ignoring textual information that is vital to
capture. Meanwhile, high quality labeled datasets with both visual and textual
information are still insufficient. In this paper, we present \textbf{DocBank},
a benchmark datas... | [
{
"created": "Mon, 1 Jun 2020 16:04:30 GMT",
"version": "v1"
},
{
"created": "Wed, 30 Sep 2020 08:05:48 GMT",
"version": "v2"
},
{
"created": "Wed, 11 Nov 2020 05:08:05 GMT",
"version": "v3"
}
] | 2020-11-12 | [
[
"Li",
"Minghao",
""
],
[
"Xu",
"Yiheng",
""
],
[
"Cui",
"Lei",
""
],
[
"Huang",
"Shaohan",
""
],
[
"Wei",
"Furu",
""
],
[
"Li",
"Zhoujun",
""
],
[
"Zhou",
"Ming",
""
]
] | Document layout analysis usually relies on computer vision models to understand documents while ignoring textual information that is vital to capture. Meanwhile, high quality labeled datasets with both visual and textual information are still insufficient. In this paper, we present \textbf{DocBank}, a benchmark dataset... |
2106.07115 | Qi Lyu | Qi Lyu, Xiao Fu, Weiran Wang and Songtao Lu | Understanding Latent Correlation-Based Multiview Learning and
Self-Supervision: An Identifiability Perspective | Accepted to ICLR 2022 Spotlight, 37 pages, 11 figures | null | null | null | cs.LG cs.AI cs.CV stat.ML | http://creativecommons.org/licenses/by/4.0/ | Multiple views of data, both naturally acquired (e.g., image and audio) and
artificially produced (e.g., via adding different noise to data samples), have
proven useful in enhancing representation learning. Natural views are often
handled by multiview analysis tools, e.g., (deep) canonical correlation
analysis [(D)CC... | [
{
"created": "Mon, 14 Jun 2021 00:12:36 GMT",
"version": "v1"
},
{
"created": "Thu, 17 Jun 2021 16:51:29 GMT",
"version": "v2"
},
{
"created": "Fri, 8 Apr 2022 19:37:10 GMT",
"version": "v3"
}
] | 2022-04-12 | [
[
"Lyu",
"Qi",
""
],
[
"Fu",
"Xiao",
""
],
[
"Wang",
"Weiran",
""
],
[
"Lu",
"Songtao",
""
]
] | Multiple views of data, both naturally acquired (e.g., image and audio) and artificially produced (e.g., via adding different noise to data samples), have proven useful in enhancing representation learning. Natural views are often handled by multiview analysis tools, e.g., (deep) canonical correlation analysis [(D)CCA]... |
2401.08095 | Hyung-Seok Oh | Hyung-Seok Oh, Sang-Hoon Lee, Deok-Hyeon Cho, Seong-Whan Lee | DurFlex-EVC: Duration-Flexible Emotional Voice Conversion with Parallel
Generation | 14 pages, 11 figures, 12 tables | null | null | null | cs.SD cs.AI eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Emotional voice conversion involves modifying the pitch, spectral envelope,
and other acoustic characteristics of speech to match a desired emotional state
while maintaining the speaker's identity. Recent advances in EVC involve
simultaneously modeling pitch and duration by exploiting the potential of
sequence-to-seq... | [
{
"created": "Tue, 16 Jan 2024 03:39:35 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Mar 2024 08:40:01 GMT",
"version": "v2"
},
{
"created": "Thu, 8 Aug 2024 23:54:14 GMT",
"version": "v3"
}
] | 2024-08-12 | [
[
"Oh",
"Hyung-Seok",
""
],
[
"Lee",
"Sang-Hoon",
""
],
[
"Cho",
"Deok-Hyeon",
""
],
[
"Lee",
"Seong-Whan",
""
]
] | Emotional voice conversion involves modifying the pitch, spectral envelope, and other acoustic characteristics of speech to match a desired emotional state while maintaining the speaker's identity. Recent advances in EVC involve simultaneously modeling pitch and duration by exploiting the potential of sequence-to-seque... |
1905.04403 | Maximilian Weininger | Pranav Ashok, Jan K\v{r}et\'insk\'y and Maximilian Weininger | PAC Statistical Model Checking for Markov Decision Processes and
Stochastic Games | null | null | 10.1007/978-3-030-25540-4_29 | null | cs.SY cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Statistical model checking (SMC) is a technique for analysis of probabilistic
systems that may be (partially) unknown. We present an SMC algorithm for
(unbounded) reachability yielding probably approximately correct (PAC)
guarantees on the results. We consider both the setting (i) with no knowledge
of the transition ... | [
{
"created": "Fri, 10 May 2019 23:36:05 GMT",
"version": "v1"
},
{
"created": "Fri, 24 May 2019 11:15:44 GMT",
"version": "v2"
},
{
"created": "Mon, 1 Feb 2021 15:00:17 GMT",
"version": "v3"
}
] | 2021-02-02 | [
[
"Ashok",
"Pranav",
""
],
[
"Křetínský",
"Jan",
""
],
[
"Weininger",
"Maximilian",
""
]
] | Statistical model checking (SMC) is a technique for analysis of probabilistic systems that may be (partially) unknown. We present an SMC algorithm for (unbounded) reachability yielding probably approximately correct (PAC) guarantees on the results. We consider both the setting (i) with no knowledge of the transition fu... |
1702.02901 | Dongrui Wu | Dongrui Wu, Vernon J. Lawhern, Stephen Gordon, Brent J. Lance,
Chin-Teng Lin | Driver Drowsiness Estimation from EEG Signals Using Online Weighted
Adaptation Regularization for Regression (OwARR) | in press | IEEE Trans.on Fuzzy Systems, 25(6), pp. 1522-1535, 2017 | 10.1109/TFUZZ.2016.2633379 | null | cs.LG cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One big challenge that hinders the transition of brain-computer interfaces
(BCIs) from laboratory settings to real-life applications is the availability
of high-performance and robust learning algorithms that can effectively handle
individual differences, i.e., algorithms that can be applied to a new subject
with zer... | [
{
"created": "Thu, 9 Feb 2017 17:14:15 GMT",
"version": "v1"
}
] | 2020-02-13 | [
[
"Wu",
"Dongrui",
""
],
[
"Lawhern",
"Vernon J.",
""
],
[
"Gordon",
"Stephen",
""
],
[
"Lance",
"Brent J.",
""
],
[
"Lin",
"Chin-Teng",
""
]
] | One big challenge that hinders the transition of brain-computer interfaces (BCIs) from laboratory settings to real-life applications is the availability of high-performance and robust learning algorithms that can effectively handle individual differences, i.e., algorithms that can be applied to a new subject with zero ... |
2005.05165 | Kwabena Doku-Amponsah | Enoch Sakyi-Yeboah, Charles Kwofie and Kwabena Doku-Amponsah | Large Deviation Principle for Empirical SINR Measure of Critical
Telecommunication Networks | 12 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For a \emph{ powered Poisson process}, we define
\emph{Signal-to-Interference-plus-Noise Ratio}(SINR) and thesinr network as a
Telecommunication Network. We define the Empirical Measures (\emph{empirical
powered measure}, \emph{empirical link measure} and \emph{empirical sinr
measure}) of a class of Telecommunication... | [
{
"created": "Mon, 11 May 2020 14:58:33 GMT",
"version": "v1"
},
{
"created": "Sat, 16 May 2020 16:48:59 GMT",
"version": "v2"
}
] | 2020-05-19 | [
[
"Sakyi-Yeboah",
"Enoch",
""
],
[
"Kwofie",
"Charles",
""
],
[
"Doku-Amponsah",
"Kwabena",
""
]
] | For a \emph{ powered Poisson process}, we define \emph{Signal-to-Interference-plus-Noise Ratio}(SINR) and thesinr network as a Telecommunication Network. We define the Empirical Measures (\emph{empirical powered measure}, \emph{empirical link measure} and \emph{empirical sinr measure}) of a class of Telecommunication N... |
2106.14439 | Yuhao Liu | Yuhao Liu, Jiake Xie, Yu Qiao, Yong Tang and, Xin Yang | Prior-Induced Information Alignment for Image Matting | IEEE TMM | null | 10.1109/TMM.2021.3087007. | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | Image matting is an ill-posed problem that aims to estimate the opacity of
foreground pixels in an image. However, most existing deep learning-based
methods still suffer from the coarse-grained details. In general, these
algorithms are incapable of felicitously distinguishing the degree of
exploration between determi... | [
{
"created": "Mon, 28 Jun 2021 07:46:59 GMT",
"version": "v1"
}
] | 2021-06-29 | [
[
"Liu",
"Yuhao",
""
],
[
"Xie",
"Jiake",
""
],
[
"Qiao",
"Yu",
""
],
[
"and",
"Yong Tang",
""
],
[
"Yang",
"Xin",
""
]
] | Image matting is an ill-posed problem that aims to estimate the opacity of foreground pixels in an image. However, most existing deep learning-based methods still suffer from the coarse-grained details. In general, these algorithms are incapable of felicitously distinguishing the degree of exploration between determini... |
2306.06476 | Abdelhamid Haouhat | Abdelhamid Haouhat, Slimane Bellaouar, Attia Nehar, Hadda Cherroun | Modality Influence in Multimodal Machine Learning | 10 pages | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Multimodal Machine Learning has emerged as a prominent research direction
across various applications such as Sentiment Analysis, Emotion Recognition,
Machine Translation, Hate Speech Recognition, and Movie Genre Classification.
This approach has shown promising results by utilizing modern deep learning
architectures... | [
{
"created": "Sat, 10 Jun 2023 16:28:52 GMT",
"version": "v1"
}
] | 2023-06-13 | [
[
"Haouhat",
"Abdelhamid",
""
],
[
"Bellaouar",
"Slimane",
""
],
[
"Nehar",
"Attia",
""
],
[
"Cherroun",
"Hadda",
""
]
] | Multimodal Machine Learning has emerged as a prominent research direction across various applications such as Sentiment Analysis, Emotion Recognition, Machine Translation, Hate Speech Recognition, and Movie Genre Classification. This approach has shown promising results by utilizing modern deep learning architectures. ... |
2210.08128 | Sergio Ram\'irez | Santiago Quintero, Carlos Pinz\'on, Sergio Ram\'irez, Frank Valencia | On the Computation of Distributed Knowledge as the Greatest Lower Bound
of Knowledge | null | null | null | null | cs.MA | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Let $L$ be a finite lattice and $\mathcal{E}(L)$ be the set of join
endomorphisms of $L$. We consider the problem of given $L$ and $f,g \in
\mathcal{E}(L)$, finding the greatest lower bound $f \sqcap_{{\scriptsize
\mathcal{E}(L)}} g$ in the lattice $\mathcal{E}(L)$. (1) We show that if $L$ is
distributive, the proble... | [
{
"created": "Fri, 14 Oct 2022 21:54:15 GMT",
"version": "v1"
},
{
"created": "Tue, 25 Oct 2022 00:12:24 GMT",
"version": "v2"
}
] | 2022-10-26 | [
[
"Quintero",
"Santiago",
""
],
[
"Pinzón",
"Carlos",
""
],
[
"Ramírez",
"Sergio",
""
],
[
"Valencia",
"Frank",
""
]
] | Let $L$ be a finite lattice and $\mathcal{E}(L)$ be the set of join endomorphisms of $L$. We consider the problem of given $L$ and $f,g \in \mathcal{E}(L)$, finding the greatest lower bound $f \sqcap_{{\scriptsize \mathcal{E}(L)}} g$ in the lattice $\mathcal{E}(L)$. (1) We show that if $L$ is distributive, the problem ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.