id stringlengths 9 10 | submitter stringlengths 1 64 ⌀ | authors stringlengths 4 20.7k | title stringlengths 4 246 | comments stringlengths 1 523 ⌀ | journal-ref stringlengths 4 404 ⌀ | doi stringlengths 11 153 ⌀ | report-no stringlengths 2 254 ⌀ | categories stringlengths 5 98 | license stringclasses 9
values | orig_abstract stringlengths 14 3.35k | versions listlengths 1 60 | update_date stringlengths 10 10 | authors_parsed listlengths 1 1.35k | abstract stringlengths 11 3.34k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2005.01807 | Nitin Rathi | Nitin Rathi, Gopalakrishnan Srinivasan, Priyadarshini Panda, Kaushik
Roy | Enabling Deep Spiking Neural Networks with Hybrid Conversion and Spike
Timing Dependent Backpropagation | International Conference on Learning Representations (ICLR), 2020
https://openreview.net/forum?id=B1xSperKvH¬eId=B1xSperKvH | null | null | null | cs.LG cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Spiking Neural Networks (SNNs) operate with asynchronous discrete events (or
spikes) which can potentially lead to higher energy-efficiency in neuromorphic
hardware implementations. Many works have shown that an SNN for inference can
be formed by copying the weights from a trained Artificial Neural Network (ANN)
and ... | [
{
"created": "Mon, 4 May 2020 19:30:43 GMT",
"version": "v1"
}
] | 2020-05-06 | [
[
"Rathi",
"Nitin",
""
],
[
"Srinivasan",
"Gopalakrishnan",
""
],
[
"Panda",
"Priyadarshini",
""
],
[
"Roy",
"Kaushik",
""
]
] | Spiking Neural Networks (SNNs) operate with asynchronous discrete events (or spikes) which can potentially lead to higher energy-efficiency in neuromorphic hardware implementations. Many works have shown that an SNN for inference can be formed by copying the weights from a trained Artificial Neural Network (ANN) and se... |
2106.04399 | Emmanuel Bengio | Emmanuel Bengio, Moksh Jain, Maksym Korablyov, Doina Precup, Yoshua
Bengio | Flow Network based Generative Models for Non-Iterative Diverse Candidate
Generation | Accepted at NeurIPS 2021 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | This paper is about the problem of learning a stochastic policy for
generating an object (like a molecular graph) from a sequence of actions, such
that the probability of generating an object is proportional to a given
positive reward for that object. Whereas standard return maximization tends to
converge to a single... | [
{
"created": "Tue, 8 Jun 2021 14:21:10 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Nov 2021 14:50:32 GMT",
"version": "v2"
}
] | 2021-11-22 | [
[
"Bengio",
"Emmanuel",
""
],
[
"Jain",
"Moksh",
""
],
[
"Korablyov",
"Maksym",
""
],
[
"Precup",
"Doina",
""
],
[
"Bengio",
"Yoshua",
""
]
] | This paper is about the problem of learning a stochastic policy for generating an object (like a molecular graph) from a sequence of actions, such that the probability of generating an object is proportional to a given positive reward for that object. Whereas standard return maximization tends to converge to a single r... |
1711.10690 | Yi Gu | Yi Gu and Huaiguang Jiang and Jun Jason Zhang and Yingchen Zhang and
Eduard Muljadi and Francisco J.Solis | Load Forecasting Based Distribution System Network Reconfiguration-A
Distributed Data-Driven Approach | 5 pages, preprint for Asilomar Conference on Signals, Systems, and
Computers 2017 | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a short-term load forecasting approach based network
reconfiguration is proposed in a parallel manner. Specifically, a support
vector regression (SVR) based short-term load forecasting approach is designed
to provide an accurate load prediction and benefit the network reconfiguration.
Because of the no... | [
{
"created": "Wed, 29 Nov 2017 06:01:02 GMT",
"version": "v1"
}
] | 2017-11-30 | [
[
"Gu",
"Yi",
""
],
[
"Jiang",
"Huaiguang",
""
],
[
"Zhang",
"Jun Jason",
""
],
[
"Zhang",
"Yingchen",
""
],
[
"Muljadi",
"Eduard",
""
],
[
"Solis",
"Francisco J.",
""
]
] | In this paper, a short-term load forecasting approach based network reconfiguration is proposed in a parallel manner. Specifically, a support vector regression (SVR) based short-term load forecasting approach is designed to provide an accurate load prediction and benefit the network reconfiguration. Because of the nonc... |
1908.11298 | Tao Wen | Tao Wen and Yong Deng | Identification of influencers in complex networks by local information
dimensionality | null | Information Sciences 2019 | 10.1016/j.ins.2019.10.003 | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The identification of influential spreaders in complex networks is a popular
topic in studies of network characteristics. Many centrality measures have been
proposed to address this problem, but most have limitations. In this paper, a
method for identifying influencers in complex networks via the local
information di... | [
{
"created": "Thu, 29 Aug 2019 15:33:05 GMT",
"version": "v1"
},
{
"created": "Sun, 6 Oct 2019 03:40:09 GMT",
"version": "v2"
}
] | 2019-10-08 | [
[
"Wen",
"Tao",
""
],
[
"Deng",
"Yong",
""
]
] | The identification of influential spreaders in complex networks is a popular topic in studies of network characteristics. Many centrality measures have been proposed to address this problem, but most have limitations. In this paper, a method for identifying influencers in complex networks via the local information dime... |
2009.06573 | Runze Su | Runze Su, Fei Tao, Xudong Liu, Haoran Wei, Xiaorong Mei, Zhiyao Duan,
Lei Yuan, Ji Liu, Yuying Xie | Themes Informed Audio-visual Correspondence Learning | Submitting to ICASSP 2021 | null | null | null | cs.AI cs.MM stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The applications of short-term user-generated video (UGV), such as Snapchat,
and Youtube short-term videos, booms recently, raising lots of multimodal
machine learning tasks. Among them, learning the correspondence between audio
and visual information from videos is a challenging one. Most previous work of
the audio-... | [
{
"created": "Mon, 14 Sep 2020 17:03:04 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Oct 2020 06:40:40 GMT",
"version": "v2"
}
] | 2020-10-20 | [
[
"Su",
"Runze",
""
],
[
"Tao",
"Fei",
""
],
[
"Liu",
"Xudong",
""
],
[
"Wei",
"Haoran",
""
],
[
"Mei",
"Xiaorong",
""
],
[
"Duan",
"Zhiyao",
""
],
[
"Yuan",
"Lei",
""
],
[
"Liu",
"Ji",
""
]... | The applications of short-term user-generated video (UGV), such as Snapchat, and Youtube short-term videos, booms recently, raising lots of multimodal machine learning tasks. Among them, learning the correspondence between audio and visual information from videos is a challenging one. Most previous work of the audio-vi... |
2104.11230 | Jiajie Wu | Jiajie Wu | Literature review on vulnerability detection using NLP technology | null | null | null | null | cs.CR cs.AI cs.SE | http://creativecommons.org/licenses/by/4.0/ | Vulnerability detection has always been the most important task in the field
of software security. With the development of technology, in the face of
massive source code, automated analysis and detection of vulnerabilities has
become a current research hotspot. For special text files such as source code,
using some o... | [
{
"created": "Fri, 23 Apr 2021 03:16:51 GMT",
"version": "v1"
}
] | 2021-04-26 | [
[
"Wu",
"Jiajie",
""
]
] | Vulnerability detection has always been the most important task in the field of software security. With the development of technology, in the face of massive source code, automated analysis and detection of vulnerabilities has become a current research hotspot. For special text files such as source code, using some of ... |
1904.03540 | Rokas Volkovas | Rokas Volkovas, Michael Fairbank, John Woodward, Simon Lucas | Mek: Mechanics Prototyping Tool for 2D Tile-Based Turn-Based
Deterministic Games | null | null | null | null | cs.PL cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There are few digital tools to help designers create game mechanics. A
general language to express game mechanics is necessary for rapid game design
iteration. The first iteration of a mechanics-focused language, together with
its interfacing tool, are introduced in this paper. The language is restricted
to two-dimen... | [
{
"created": "Sat, 6 Apr 2019 22:09:53 GMT",
"version": "v1"
}
] | 2019-04-09 | [
[
"Volkovas",
"Rokas",
""
],
[
"Fairbank",
"Michael",
""
],
[
"Woodward",
"John",
""
],
[
"Lucas",
"Simon",
""
]
] | There are few digital tools to help designers create game mechanics. A general language to express game mechanics is necessary for rapid game design iteration. The first iteration of a mechanics-focused language, together with its interfacing tool, are introduced in this paper. The language is restricted to two-dimensi... |
2102.11822 | Navid Reyhanian | Navid Reyhanian, Jarvis Haupt | Online Stochastic Gradient Descent Learns Linear Dynamical Systems from
A Single Trajectory | null | null | null | null | cs.LG cs.SY eess.SP eess.SY | http://creativecommons.org/licenses/by/4.0/ | This work investigates the problem of estimating the weight matrices of a
stable time-invariant linear dynamical system from a single sequence of noisy
measurements. We show that if the unknown weight matrices describing the system
are in Brunovsky canonical form, we can efficiently estimate the ground truth
unknown ... | [
{
"created": "Tue, 23 Feb 2021 17:48:39 GMT",
"version": "v1"
}
] | 2021-02-24 | [
[
"Reyhanian",
"Navid",
""
],
[
"Haupt",
"Jarvis",
""
]
] | This work investigates the problem of estimating the weight matrices of a stable time-invariant linear dynamical system from a single sequence of noisy measurements. We show that if the unknown weight matrices describing the system are in Brunovsky canonical form, we can efficiently estimate the ground truth unknown ma... |
2403.17479 | Morteza Zakeri-Nasrabadi | Morteza Zakeri-Nasrabadi and Saeed Parsa | Natural Language Requirements Testability Measurement Based on
Requirement Smells | 45 pages, 16 figures, and 13 tables; submitted as a journal paper | null | null | null | cs.SE cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Requirements form the basis for defining software systems' obligations and
tasks. Testable requirements help prevent failures, reduce maintenance costs,
and make it easier to perform acceptance tests. However, despite the importance
of measuring and quantifying requirements testability, no automatic approach
for meas... | [
{
"created": "Tue, 26 Mar 2024 08:19:29 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Zakeri-Nasrabadi",
"Morteza",
""
],
[
"Parsa",
"Saeed",
""
]
] | Requirements form the basis for defining software systems' obligations and tasks. Testable requirements help prevent failures, reduce maintenance costs, and make it easier to perform acceptance tests. However, despite the importance of measuring and quantifying requirements testability, no automatic approach for measur... |
2308.02558 | Vasant Dhar | Vasant Dhar | The Paradigm Shifts in Artificial Intelligence | 14 pages, 1 figure, 1 table | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Kuhn's framework of scientific progress (Kuhn, 1962) provides a useful
framing of the paradigm shifts that have occurred in Artificial Intelligence
over the last 60 years. The framework is also useful in understanding what is
arguably a new paradigm shift in AI, signaled by the emergence of large
pre-trained systems ... | [
{
"created": "Wed, 2 Aug 2023 19:38:24 GMT",
"version": "v1"
}
] | 2023-08-08 | [
[
"Dhar",
"Vasant",
""
]
] | Kuhn's framework of scientific progress (Kuhn, 1962) provides a useful framing of the paradigm shifts that have occurred in Artificial Intelligence over the last 60 years. The framework is also useful in understanding what is arguably a new paradigm shift in AI, signaled by the emergence of large pre-trained systems su... |
2107.11978 | Yuqian Fu | Yuqian Fu, Yanwei Fu, Yu-Gang Jiang | Meta-FDMixup: Cross-Domain Few-Shot Learning Guided by Labeled Target
Data | Accepted by ACM Multimedia 2021 | null | 10.1109/TIP.2022.3219237 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A recent study finds that existing few-shot learning methods, trained on the
source domain, fail to generalize to the novel target domain when a domain gap
is observed. This motivates the task of Cross-Domain Few-Shot Learning
(CD-FSL). In this paper, we realize that the labeled target data in CD-FSL has
not been lev... | [
{
"created": "Mon, 26 Jul 2021 06:15:45 GMT",
"version": "v1"
}
] | 2022-11-30 | [
[
"Fu",
"Yuqian",
""
],
[
"Fu",
"Yanwei",
""
],
[
"Jiang",
"Yu-Gang",
""
]
] | A recent study finds that existing few-shot learning methods, trained on the source domain, fail to generalize to the novel target domain when a domain gap is observed. This motivates the task of Cross-Domain Few-Shot Learning (CD-FSL). In this paper, we realize that the labeled target data in CD-FSL has not been lever... |
2211.09761 | Piotr Nawrot | Piotr Nawrot, Jan Chorowski, Adrian {\L}a\'ncucki, Edoardo M. Ponti | Efficient Transformers with Dynamic Token Pooling | null | Proceedings of the 61st (Toronto 2023) Annual Meeting of the
Association for Computational Linguistics (Volume 1 Long Papers) Pages 6403
to 6417 | 10.18653/v1/2023.acl-long.353 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transformers achieve unrivalled performance in modelling language, but remain
inefficient in terms of memory and time complexity. A possible remedy is to
reduce the sequence length in the intermediate layers by pooling fixed-length
segments of tokens. Nevertheless, natural units of meaning, such as words or
phrases, ... | [
{
"created": "Thu, 17 Nov 2022 18:39:23 GMT",
"version": "v1"
},
{
"created": "Wed, 24 May 2023 17:32:56 GMT",
"version": "v2"
}
] | 2023-10-25 | [
[
"Nawrot",
"Piotr",
""
],
[
"Chorowski",
"Jan",
""
],
[
"Łańcucki",
"Adrian",
""
],
[
"Ponti",
"Edoardo M.",
""
]
] | Transformers achieve unrivalled performance in modelling language, but remain inefficient in terms of memory and time complexity. A possible remedy is to reduce the sequence length in the intermediate layers by pooling fixed-length segments of tokens. Nevertheless, natural units of meaning, such as words or phrases, di... |
2104.08157 | Robin Tu | Robin Tu, Alexander H. Foss, Sihai D. Zhao | Capturing patterns of variation unique to a specific dataset | null | null | null | null | cs.LG stat.ME | http://creativecommons.org/licenses/by/4.0/ | Capturing patterns of variation present in a dataset is important in
exploratory data analysis and unsupervised learning. Contrastive dimension
reduction methods, such as contrastive principal component analysis (cPCA),
find patterns unique to a target dataset of interest by contrasting with a
carefully chosen backgr... | [
{
"created": "Fri, 16 Apr 2021 15:07:32 GMT",
"version": "v1"
}
] | 2021-04-19 | [
[
"Tu",
"Robin",
""
],
[
"Foss",
"Alexander H.",
""
],
[
"Zhao",
"Sihai D.",
""
]
] | Capturing patterns of variation present in a dataset is important in exploratory data analysis and unsupervised learning. Contrastive dimension reduction methods, such as contrastive principal component analysis (cPCA), find patterns unique to a target dataset of interest by contrasting with a carefully chosen backgrou... |
1912.10634 | EPTCS | Julien Brunel (ONERA DTIS and Universit\'e f\'ed\'erale de Toulouse,
France), David Chemouil (ONERA DTIS and Universit\'e f\'ed\'erale de
Toulouse, France), Alcino Cunha (INESC TEC and Universidade do Minho,
Portugal), Nuno Macedo (INESC TEC and Universidade do Minho, Portugal) | Simulation under Arbitrary Temporal Logic Constraints | In Proceedings F-IDE 2019, arXiv:1912.09611 | EPTCS 310, 2019, pp. 63-69 | 10.4204/EPTCS.310.7 | null | cs.SE cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Most model checkers provide a useful simulation mode, that allows users to
explore the set of possible behaviours by interactively picking at each state
which event to execute next. Traditionally this simulation mode cannot take
into consideration additional temporal logic constraints, such as arbitrary
fairness rest... | [
{
"created": "Mon, 23 Dec 2019 05:41:51 GMT",
"version": "v1"
}
] | 2019-12-24 | [
[
"Brunel",
"Julien",
"",
"ONERA DTIS and Université fédérale de Toulouse,\n France"
],
[
"Chemouil",
"David",
"",
"ONERA DTIS and Université fédérale de\n Toulouse, France"
],
[
"Cunha",
"Alcino",
"",
"INESC TEC and Universidade do Minho,\n Portugal"
],
... | Most model checkers provide a useful simulation mode, that allows users to explore the set of possible behaviours by interactively picking at each state which event to execute next. Traditionally this simulation mode cannot take into consideration additional temporal logic constraints, such as arbitrary fairness restri... |
2305.10661 | Yitong Li | Yitong Li, Chang Liu, Jie Ma | Scribble-Supervised Target Extraction Method Based on Inner
Structure-Constraint for Remote Sensing Images | 5 pages, 4 figures, 1 table | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Weakly supervised learning based on scribble annotations in target extraction
of remote sensing images has drawn much interest due to scribbles' flexibility
in denoting winding objects and low cost of manually labeling. However,
scribbles are too sparse to identify object structure and detailed information,
bringing ... | [
{
"created": "Thu, 18 May 2023 02:49:07 GMT",
"version": "v1"
}
] | 2023-05-19 | [
[
"Li",
"Yitong",
""
],
[
"Liu",
"Chang",
""
],
[
"Ma",
"Jie",
""
]
] | Weakly supervised learning based on scribble annotations in target extraction of remote sensing images has drawn much interest due to scribbles' flexibility in denoting winding objects and low cost of manually labeling. However, scribbles are too sparse to identify object structure and detailed information, bringing gr... |
2003.04427 | Yan Zhang | Yan Zhang and Michael M. Zavlanos | Transfer Reinforcement Learning under Unobserved Contextual Information | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study a transfer reinforcement learning problem where the
state transitions and rewards are affected by the environmental context.
Specifically, we consider a demonstrator agent that has access to a
context-aware policy and can generate transition and reward data based on that
policy. These data con... | [
{
"created": "Mon, 9 Mar 2020 22:00:04 GMT",
"version": "v1"
}
] | 2020-03-11 | [
[
"Zhang",
"Yan",
""
],
[
"Zavlanos",
"Michael M.",
""
]
] | In this paper, we study a transfer reinforcement learning problem where the state transitions and rewards are affected by the environmental context. Specifically, we consider a demonstrator agent that has access to a context-aware policy and can generate transition and reward data based on that policy. These data const... |
1301.6231 | Alexander Zeh | Alexander Zeh and Antonia Wachter-Zeh and Maximilien Gadouleau and
Sergey Bezzateev | Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic
Product Codes | 5 pages, no figure, accepted for ISIT2013 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance
of q-ary cyclic codes are proposed. The first one is proven by embedding the
given cyclic code into a cyclic product code. Furthermore, we show that unique
decoding up to this bound is always possible and outline a quadratic-time
syndrome-b... | [
{
"created": "Sat, 26 Jan 2013 10:47:19 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Jun 2013 06:09:51 GMT",
"version": "v2"
}
] | 2013-06-28 | [
[
"Zeh",
"Alexander",
""
],
[
"Wachter-Zeh",
"Antonia",
""
],
[
"Gadouleau",
"Maximilien",
""
],
[
"Bezzateev",
"Sergey",
""
]
] | Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-bas... |
2204.01915 | Peter Washington | Peter Washington, Cezmi Mutlu, Aaron Kline, Cathy Hou, Kaitlyn Dunlap,
Jack Kent, Arman Husic, Nate Stockham, Brianna Chrisman, Kelley Paskov,
Jae-Yoon Jung, Dennis P. Wall | An Exploration of Active Learning for Affective Digital Phenotyping | null | null | null | null | cs.LG cs.CV | http://creativecommons.org/licenses/by/4.0/ | Some of the most severe bottlenecks preventing widespread development of
machine learning models for human behavior include a dearth of labeled training
data and difficulty of acquiring high quality labels. Active learning is a
paradigm for using algorithms to computationally select a useful subset of data
points to ... | [
{
"created": "Tue, 5 Apr 2022 01:01:32 GMT",
"version": "v1"
},
{
"created": "Wed, 6 Apr 2022 18:23:44 GMT",
"version": "v2"
}
] | 2022-04-08 | [
[
"Washington",
"Peter",
""
],
[
"Mutlu",
"Cezmi",
""
],
[
"Kline",
"Aaron",
""
],
[
"Hou",
"Cathy",
""
],
[
"Dunlap",
"Kaitlyn",
""
],
[
"Kent",
"Jack",
""
],
[
"Husic",
"Arman",
""
],
[
"Stockham",
... | Some of the most severe bottlenecks preventing widespread development of machine learning models for human behavior include a dearth of labeled training data and difficulty of acquiring high quality labels. Active learning is a paradigm for using algorithms to computationally select a useful subset of data points to la... |
2207.10941 | Li Shen | Li Shen, Yuning Wei and Yangzhu Wang | Respecting Time Series Properties Makes Deep Time Series Forecasting
Perfect | null | null | null | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | How to handle time features shall be the core question of any time series
forecasting model. Ironically, it is often ignored or misunderstood by
deep-learning based models, even those baselines which are state-of-the-art.
This behavior makes their inefficient, untenable and unstable. In this paper,
we rigorously anal... | [
{
"created": "Fri, 22 Jul 2022 08:34:31 GMT",
"version": "v1"
}
] | 2022-07-25 | [
[
"Shen",
"Li",
""
],
[
"Wei",
"Yuning",
""
],
[
"Wang",
"Yangzhu",
""
]
] | How to handle time features shall be the core question of any time series forecasting model. Ironically, it is often ignored or misunderstood by deep-learning based models, even those baselines which are state-of-the-art. This behavior makes their inefficient, untenable and unstable. In this paper, we rigorously analyz... |
2211.16200 | Mustafa Chasmai Ebrahim | Britty Baby, Daksh Thapar, Mustafa Chasmai, Tamajit Banerjee, Kunal
Dargan, Ashish Suri, Subhashis Banerjee, Chetan Arora | From Forks to Forceps: A New Framework for Instance Segmentation of
Surgical Instruments | WACV 2023 | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Minimally invasive surgeries and related applications demand surgical tool
classification and segmentation at the instance level. Surgical tools are
similar in appearance and are long, thin, and handled at an angle. The
fine-tuning of state-of-the-art (SOTA) instance segmentation models trained on
natural images for ... | [
{
"created": "Sat, 26 Nov 2022 21:26:42 GMT",
"version": "v1"
},
{
"created": "Sat, 11 Mar 2023 07:23:49 GMT",
"version": "v2"
}
] | 2023-03-14 | [
[
"Baby",
"Britty",
""
],
[
"Thapar",
"Daksh",
""
],
[
"Chasmai",
"Mustafa",
""
],
[
"Banerjee",
"Tamajit",
""
],
[
"Dargan",
"Kunal",
""
],
[
"Suri",
"Ashish",
""
],
[
"Banerjee",
"Subhashis",
""
],
[
... | Minimally invasive surgeries and related applications demand surgical tool classification and segmentation at the instance level. Surgical tools are similar in appearance and are long, thin, and handled at an angle. The fine-tuning of state-of-the-art (SOTA) instance segmentation models trained on natural images for in... |
1305.4580 | Manish Gupta | Krishna Gopal Benerjee and Manish K. Gupta and Nikhil Agrawal | Reconstruction and Repair Degree of Fractional Repetition Codes | A one page abstract of this paper appears as a poster in IEEE Netcod
2013 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a Fractional Repetition code, finding the reconstruction and repair
degree in a distributed storage system is an important problem. In this work,
we present algorithms for computing the reconstruction and repair degree of
fractional repetition codes.
| [
{
"created": "Mon, 20 May 2013 17:21:30 GMT",
"version": "v1"
}
] | 2013-05-21 | [
[
"Benerjee",
"Krishna Gopal",
""
],
[
"Gupta",
"Manish K.",
""
],
[
"Agrawal",
"Nikhil",
""
]
] | Given a Fractional Repetition code, finding the reconstruction and repair degree in a distributed storage system is an important problem. In this work, we present algorithms for computing the reconstruction and repair degree of fractional repetition codes. |
2212.12309 | Amrut Kajave | Amrut Kajave and Shazny Ahmed Hussain Nismy | How Cyber Criminal Use Social Engineering To Target Organizations | null | null | null | null | cs.CR | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Social engineering is described as the art of manipulation. Cybercriminal use
manipulation to victims their targets using psychological principles to change
their behavior to make unconscious decisions. This study identifies the attack
and techniques used by cybercriminal to conduct social engineering attacks
within ... | [
{
"created": "Wed, 7 Dec 2022 22:03:58 GMT",
"version": "v1"
}
] | 2022-12-26 | [
[
"Kajave",
"Amrut",
""
],
[
"Nismy",
"Shazny Ahmed Hussain",
""
]
] | Social engineering is described as the art of manipulation. Cybercriminal use manipulation to victims their targets using psychological principles to change their behavior to make unconscious decisions. This study identifies the attack and techniques used by cybercriminal to conduct social engineering attacks within an... |
2112.03386 | Michael McDonald | Michael James McDonald and Dylan Hadfield-Menell | Guided Imitation of Task and Motion Planning | 16 pages, 6 figures, 2 tables, submitted to Conference on Robot
Learning 2021, to be published in Proceedings of Machine Learning Research | null | null | null | cs.RO cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While modern policy optimization methods can do complex manipulation from
sensory data, they struggle on problems with extended time horizons and
multiple sub-goals. On the other hand, task and motion planning (TAMP) methods
scale to long horizons but they are computationally expensive and need to
precisely track wor... | [
{
"created": "Mon, 6 Dec 2021 22:22:37 GMT",
"version": "v1"
}
] | 2021-12-08 | [
[
"McDonald",
"Michael James",
""
],
[
"Hadfield-Menell",
"Dylan",
""
]
] | While modern policy optimization methods can do complex manipulation from sensory data, they struggle on problems with extended time horizons and multiple sub-goals. On the other hand, task and motion planning (TAMP) methods scale to long horizons but they are computationally expensive and need to precisely track world... |
1908.07324 | Bharath Sudharsan Mr | Bharath Sudharsan and Manigandan Chockalingam | A Microphone Array and Voice Algorithm based Smart Hearing Aid | null | null | 10.5120/ijca2019919295 | null | cs.SD eess.AS | http://creativecommons.org/licenses/by/4.0/ | Approximately 6.2% of the world's population (466 million people) suffer from
disabling hearing impairment [1]. Hearing impairment impacts negatively on
one's education, financial success [2][3], cognitive development in childhood
[4], including increased risk of dementia in older adulthood [5]. Lack of or
reduced so... | [
{
"created": "Tue, 20 Aug 2019 13:17:09 GMT",
"version": "v1"
},
{
"created": "Mon, 4 Nov 2019 21:41:06 GMT",
"version": "v2"
},
{
"created": "Thu, 2 Jan 2020 09:42:40 GMT",
"version": "v3"
},
{
"created": "Fri, 5 Jun 2020 21:55:22 GMT",
"version": "v4"
}
] | 2020-06-09 | [
[
"Sudharsan",
"Bharath",
""
],
[
"Chockalingam",
"Manigandan",
""
]
] | Approximately 6.2% of the world's population (466 million people) suffer from disabling hearing impairment [1]. Hearing impairment impacts negatively on one's education, financial success [2][3], cognitive development in childhood [4], including increased risk of dementia in older adulthood [5]. Lack of or reduced soci... |
1910.07394 | Thassilo Gadermaier | Thassilo Gadermaier and Gerhard Widmer | A Study of Annotation and Alignment Accuracy for Performance Comparison
in Complex Orchestral Music | null | Proceedings of the 20th International Society for Music
Information Retrieval Conference, (ISMIR) 2019, Delft, The Netherlands,
November 4-8, 2019, pages: 769--775 | null | null | cs.MM cs.DL cs.IR | http://creativecommons.org/licenses/by/4.0/ | Quantitative analysis of commonalities and differences between recorded music
performances is an increasingly common task in computational musicology. A
typical scenario involves manual annotation of different recordings of the same
piece along the time dimension, for comparative analysis of, e.g., the musical
tempo,... | [
{
"created": "Wed, 16 Oct 2019 14:59:59 GMT",
"version": "v1"
}
] | 2020-09-28 | [
[
"Gadermaier",
"Thassilo",
""
],
[
"Widmer",
"Gerhard",
""
]
] | Quantitative analysis of commonalities and differences between recorded music performances is an increasingly common task in computational musicology. A typical scenario involves manual annotation of different recordings of the same piece along the time dimension, for comparative analysis of, e.g., the musical tempo, o... |
1604.05577 | Nadeem Akhtar | Nadeem Akhtar, Malik M. Saad Missen | Contribution to the Formal Specification and Verification of a
Multi-Agent Robotic System | arXiv admin note: text overlap with arXiv:1501.05120 | European Journal of Scientific Research, ISSN 1450-216X /
1450-202X Vol.117 No.1 January, 2014, pp. 35-55 | null | null | cs.SE cs.AI cs.MA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is important to have multi-agent robotic system specifications that ensure
correctness properties of safety and liveness. As these systems have
concurrency, and often have dynamic environment, the formal specification and
verification of these systems along with step-wise refinement from abstract to
concrete conce... | [
{
"created": "Fri, 2 Oct 2015 13:53:35 GMT",
"version": "v1"
}
] | 2016-04-20 | [
[
"Akhtar",
"Nadeem",
""
],
[
"Missen",
"Malik M. Saad",
""
]
] | It is important to have multi-agent robotic system specifications that ensure correctness properties of safety and liveness. As these systems have concurrency, and often have dynamic environment, the formal specification and verification of these systems along with step-wise refinement from abstract to concrete concept... |
2401.15767 | Fabian Fernando Jurado Lasso Dr. | F. Fernando Jurado-Lasso, J. F. Jurado, and Xenofon Fafoutis | A Centralized Reinforcement Learning Framework for Adaptive Clustering
with Low Control Overhead in IoT Networks | 13 pages, 13 figures, 3 tables, journal | null | null | null | cs.NI cs.LG | http://creativecommons.org/licenses/by/4.0/ | Wireless Sensor Networks (WSNs) play a pivotal role in enabling Internet of
Things (IoT) devices with sensing and actuation capabilities. Operating in
remote and resource-constrained environments, these IoT devices face challenges
related to energy consumption, crucial for network longevity. Clustering
protocols have... | [
{
"created": "Sun, 28 Jan 2024 21:08:45 GMT",
"version": "v1"
}
] | 2024-01-30 | [
[
"Jurado-Lasso",
"F. Fernando",
""
],
[
"Jurado",
"J. F.",
""
],
[
"Fafoutis",
"Xenofon",
""
]
] | Wireless Sensor Networks (WSNs) play a pivotal role in enabling Internet of Things (IoT) devices with sensing and actuation capabilities. Operating in remote and resource-constrained environments, these IoT devices face challenges related to energy consumption, crucial for network longevity. Clustering protocols have e... |
2407.16354 | Jinpeng Chen | Jinpeng Chen, Runmin Cong, Yuxuan Luo, Horace Ho Shing Ip, and Sam
Kwong | Strike a Balance in Continual Panoptic Segmentation | null | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This study explores the emerging area of continual panoptic segmentation,
highlighting three key balances. First, we introduce past-class backtrace
distillation to balance the stability of existing knowledge with the
adaptability to new information. This technique retraces the features
associated with past classes ba... | [
{
"created": "Tue, 23 Jul 2024 09:58:20 GMT",
"version": "v1"
}
] | 2024-07-24 | [
[
"Chen",
"Jinpeng",
""
],
[
"Cong",
"Runmin",
""
],
[
"Luo",
"Yuxuan",
""
],
[
"Ip",
"Horace Ho Shing",
""
],
[
"Kwong",
"Sam",
""
]
] | This study explores the emerging area of continual panoptic segmentation, highlighting three key balances. First, we introduce past-class backtrace distillation to balance the stability of existing knowledge with the adaptability to new information. This technique retraces the features associated with past classes base... |
2310.09360 | Hongchao Zhang | Hongchao Zhang, Junlin Wu, Yevgeniy Vorobeychik, Andrew Clark | Exact Verification of ReLU Neural Control Barrier Functions | null | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Control Barrier Functions (CBFs) are a popular approach for safe control of
nonlinear systems. In CBF-based control, the desired safety properties of the
system are mapped to nonnegativity of a CBF, and the control input is chosen to
ensure that the CBF remains nonnegative for all time. Recently, machine
learning met... | [
{
"created": "Fri, 13 Oct 2023 18:59:04 GMT",
"version": "v1"
}
] | 2023-10-17 | [
[
"Zhang",
"Hongchao",
""
],
[
"Wu",
"Junlin",
""
],
[
"Vorobeychik",
"Yevgeniy",
""
],
[
"Clark",
"Andrew",
""
]
] | Control Barrier Functions (CBFs) are a popular approach for safe control of nonlinear systems. In CBF-based control, the desired safety properties of the system are mapped to nonnegativity of a CBF, and the control input is chosen to ensure that the CBF remains nonnegative for all time. Recently, machine learning metho... |
1808.00878 | Hazrat Ali | Hazrat Ali, Adnan Ali Awan, Sanaullah Khan, Omer Shafique, Atiq ur
Rahman, Shahid Khan | Supervised classification for object identification in urban areas using
satellite imagery | 2018 International Conference on Computing, Mathematics and
Engineering Technologies (iCoMET) | H. Ali et al., 2018 International Conference on Computing,
Mathematics and Engineering Technologies (iCoMET), Sukkur, 2018, pp. 1-4 | 10.1109/ICOMET.2018.8346383 | null | cs.LG cs.CV eess.SP stat.ML | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper presents a useful method to achieve classification in satellite
imagery. The approach is based on pixel level study employing various features
such as correlation, homogeneity, energy and contrast. In this study gray-scale
images are used for training the classification model. For supervised
classification... | [
{
"created": "Thu, 2 Aug 2018 16:00:32 GMT",
"version": "v1"
}
] | 2018-08-03 | [
[
"Ali",
"Hazrat",
""
],
[
"Awan",
"Adnan Ali",
""
],
[
"Khan",
"Sanaullah",
""
],
[
"Shafique",
"Omer",
""
],
[
"Rahman",
"Atiq ur",
""
],
[
"Khan",
"Shahid",
""
]
] | This paper presents a useful method to achieve classification in satellite imagery. The approach is based on pixel level study employing various features such as correlation, homogeneity, energy and contrast. In this study gray-scale images are used for training the classification model. For supervised classification, ... |
1408.4703 | Amelia Carolina Sparavigna | Amelia Carolina Sparavigna | GIMP and Wavelets for Medical Image Processing: Enhancing Images of the
Fundus of the Eye | Keywords: Image processing, Retina, Retina Vessels, GIMP,
AstroFracTool, Iris, Wavelets | ijSciences, 2014, Volume 3, Issue 8, pages 35-47 | 10.18483/ijSci.556 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The visual analysis of retina and of its vascular characteristics is
important in the diagnosis and monitoring of diseases of visual perception. In
the related medical diagnoses, the digital processing of the fundus images is
used to obtain the segmentation of retinal vessels. However, an image
segmentation is often ... | [
{
"created": "Wed, 20 Aug 2014 15:49:17 GMT",
"version": "v1"
}
] | 2015-08-06 | [
[
"Sparavigna",
"Amelia Carolina",
""
]
] | The visual analysis of retina and of its vascular characteristics is important in the diagnosis and monitoring of diseases of visual perception. In the related medical diagnoses, the digital processing of the fundus images is used to obtain the segmentation of retinal vessels. However, an image segmentation is often re... |
1505.03105 | Hossam Ibrahim | Hossam S. Ibrahim, Sherif M. Abdou, Mervat Gheith | Sentiment Analysis For Modern Standard Arabic And Colloquial | International Journal on Natural Language Computing (IJNLC) Vol. 4,
No.2,April 2015 | null | 10.5121/ijnlc.2015.4207 | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rise of social media such as blogs and social networks has fueled
interest in sentiment analysis. With the proliferation of reviews, ratings,
recommendations and other forms of online expression, online opinion has turned
into a kind of virtual currency for businesses looking to market their
products, identify ne... | [
{
"created": "Tue, 12 May 2015 18:10:53 GMT",
"version": "v1"
}
] | 2015-05-13 | [
[
"Ibrahim",
"Hossam S.",
""
],
[
"Abdou",
"Sherif M.",
""
],
[
"Gheith",
"Mervat",
""
]
] | The rise of social media such as blogs and social networks has fueled interest in sentiment analysis. With the proliferation of reviews, ratings, recommendations and other forms of online expression, online opinion has turned into a kind of virtual currency for businesses looking to market their products, identify new ... |
2209.07702 | Xinlin Leng | Xinlin Leng, Chenxu Li, Weifeng Xu, Yuyan Sun, Hongtao Wang | Federated Coordinate Descent for Privacy-Preserving Multiparty Linear
Regression | 14 pages, 19 figures (Under review) | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed privacy-preserving regression schemes have been developed and
extended in various fields, where multiparty collaboratively and privately run
optimization algorithms, e.g., Gradient Descent, to learn a set of optimal
parameters. However, traditional Gradient-Descent based methods fail to solve
problems whi... | [
{
"created": "Fri, 16 Sep 2022 03:53:46 GMT",
"version": "v1"
},
{
"created": "Mon, 19 Sep 2022 08:28:36 GMT",
"version": "v2"
},
{
"created": "Sun, 16 Oct 2022 10:53:11 GMT",
"version": "v3"
}
] | 2022-10-18 | [
[
"Leng",
"Xinlin",
""
],
[
"Li",
"Chenxu",
""
],
[
"Xu",
"Weifeng",
""
],
[
"Sun",
"Yuyan",
""
],
[
"Wang",
"Hongtao",
""
]
] | Distributed privacy-preserving regression schemes have been developed and extended in various fields, where multiparty collaboratively and privately run optimization algorithms, e.g., Gradient Descent, to learn a set of optimal parameters. However, traditional Gradient-Descent based methods fail to solve problems which... |
2312.01680 | Deepika Tiwari | Deepika Tiwari, Tim Toady, Martin Monperrus, Benoit Baudry | With Great Humor Comes Great Developer Engagement | null | Proceedings of International Conference on Software Engineering,
2024 | 10.1145/3639475.3640099 | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The worldwide collaborative effort for the creation of software is
technically and socially demanding. The more engaged developers are, the more
value they impart to the software they create. Engaged developers, such as
Margaret Hamilton programming Apollo 11, can succeed in tackling the most
difficult engineering ta... | [
{
"created": "Mon, 4 Dec 2023 07:06:02 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Jan 2024 12:51:47 GMT",
"version": "v2"
}
] | 2024-01-17 | [
[
"Tiwari",
"Deepika",
""
],
[
"Toady",
"Tim",
""
],
[
"Monperrus",
"Martin",
""
],
[
"Baudry",
"Benoit",
""
]
] | The worldwide collaborative effort for the creation of software is technically and socially demanding. The more engaged developers are, the more value they impart to the software they create. Engaged developers, such as Margaret Hamilton programming Apollo 11, can succeed in tackling the most difficult engineering task... |
1902.03222 | Thirupathi Guggulothu | Thirupathi Guggulothu | Code Smell Detection using Multilabel Classification Approach | 16 pages,2 figures | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Code smells are characteristics of the software that indicates a code or
design problem which can make software hard to understand, evolve, and
maintain. The code smell detection tools proposed in the literature produce
different results, as smells are informally defined or are subjective in
nature. To address the is... | [
{
"created": "Fri, 8 Feb 2019 18:30:33 GMT",
"version": "v1"
}
] | 2019-02-11 | [
[
"Guggulothu",
"Thirupathi",
""
]
] | Code smells are characteristics of the software that indicates a code or design problem which can make software hard to understand, evolve, and maintain. The code smell detection tools proposed in the literature produce different results, as smells are informally defined or are subjective in nature. To address the issu... |
2306.09841 | Fangzhi Xu | Fangzhi Xu, Qika Lin, Jiawei Han, Tianzhe Zhao, Jun Liu, Erik Cambria | Are Large Language Models Really Good Logical Reasoners? A Comprehensive
Evaluation and Beyond | 14 pages, 11 figures | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Logical reasoning consistently plays a fundamental and significant role in
the domains of knowledge engineering and artificial intelligence. Recently,
Large Language Models (LLMs) have emerged as a noteworthy innovation in natural
language processing (NLP), exhibiting impressive achievements across various
classic NL... | [
{
"created": "Fri, 16 Jun 2023 13:39:35 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jul 2023 13:41:20 GMT",
"version": "v2"
},
{
"created": "Tue, 8 Aug 2023 12:57:18 GMT",
"version": "v3"
}
] | 2023-08-09 | [
[
"Xu",
"Fangzhi",
""
],
[
"Lin",
"Qika",
""
],
[
"Han",
"Jiawei",
""
],
[
"Zhao",
"Tianzhe",
""
],
[
"Liu",
"Jun",
""
],
[
"Cambria",
"Erik",
""
]
] | Logical reasoning consistently plays a fundamental and significant role in the domains of knowledge engineering and artificial intelligence. Recently, Large Language Models (LLMs) have emerged as a noteworthy innovation in natural language processing (NLP), exhibiting impressive achievements across various classic NLP ... |
1606.05023 | Christopher Rose | Christopher Rose and Ismat Saira Mian | Inscribed Matter Communication: Part I | 20 pages, 6 figures, 1 Table in revision at IEEE Journal on
Molecular, Biological and Multiscale Communication | null | 10.1109/TMBMC.2017.2655025 | null | cs.ET cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide a fundamental treatment of the molecular communication channel
wherein "inscribed matter" is transmitted across a spatial gap to provide
reliable signaling between a sender and receiver. Inscribed matter is defined
as an ensemble of "tokens" (molecules, objects, and so on) and is inspired, at
least partial... | [
{
"created": "Thu, 16 Jun 2016 01:36:05 GMT",
"version": "v1"
},
{
"created": "Sun, 19 Jun 2016 19:08:35 GMT",
"version": "v2"
},
{
"created": "Mon, 29 Aug 2016 18:31:39 GMT",
"version": "v3"
},
{
"created": "Tue, 22 Nov 2016 17:16:33 GMT",
"version": "v4"
},
{
"c... | 2020-09-22 | [
[
"Rose",
"Christopher",
""
],
[
"Mian",
"Ismat Saira",
""
]
] | We provide a fundamental treatment of the molecular communication channel wherein "inscribed matter" is transmitted across a spatial gap to provide reliable signaling between a sender and receiver. Inscribed matter is defined as an ensemble of "tokens" (molecules, objects, and so on) and is inspired, at least partially... |
1801.02930 | Yoshinari Takeishi | Yoshinari Takeishi and Jun'ichi Takeuchi | An Improved Analysis of Least Squares Superposition Codes with Bernoulli
Dictionary | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For the additive white Gaussian noise channel with average power constraint,
sparse superposition codes, proposed by Barron and Joseph in 2010, achieve the
capacity. While the codewords of the original sparse superposition codes are
made with a dictionary matrix drawn from a Gaussian distribution, we consider
the cas... | [
{
"created": "Tue, 9 Jan 2018 13:42:18 GMT",
"version": "v1"
}
] | 2018-01-10 | [
[
"Takeishi",
"Yoshinari",
""
],
[
"Takeuchi",
"Jun'ichi",
""
]
] | For the additive white Gaussian noise channel with average power constraint, sparse superposition codes, proposed by Barron and Joseph in 2010, achieve the capacity. While the codewords of the original sparse superposition codes are made with a dictionary matrix drawn from a Gaussian distribution, we consider the case ... |
2102.06245 | Kaushik Roy | Kaushik Roy, Qi Zhang, Manas Gaur, and Amit Sheth | Knowledge Infused Policy Gradients for Adaptive Pandemic Control | Accepted at AAAI-MAKE 2021 | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | COVID-19 has impacted nations differently based on their policy
implementations. The effective policy requires taking into account public
information and adaptability to new knowledge. Epidemiological models built to
understand COVID-19 seldom provide the policymaker with the capability for
adaptive pandemic control ... | [
{
"created": "Thu, 11 Feb 2021 20:13:00 GMT",
"version": "v1"
}
] | 2021-02-15 | [
[
"Roy",
"Kaushik",
""
],
[
"Zhang",
"Qi",
""
],
[
"Gaur",
"Manas",
""
],
[
"Sheth",
"Amit",
""
]
] | COVID-19 has impacted nations differently based on their policy implementations. The effective policy requires taking into account public information and adaptability to new knowledge. Epidemiological models built to understand COVID-19 seldom provide the policymaker with the capability for adaptive pandemic control (A... |
1311.6718 | Diego Perea Mr. | Diego Perea-Vega, Jean-Fran\c{c}ois Frigon, Andr\'e Girard | Efficient Heuristic for Resource Allocation in Zero-forcing OFDMA-SDMA
Systems with Minimum Rate Constraints | 8 figures | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | 4G wireless access systems require high spectral efficiency to support the
ever increasing number of users and data rates for real time applications.
Multi-antenna OFDM-SDMA systems can provide the required high spectral
efficiency and dynamic usage of the channel, but the resource allocation
process becomes extremel... | [
{
"created": "Tue, 26 Nov 2013 15:59:11 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Jan 2014 12:45:16 GMT",
"version": "v2"
}
] | 2014-01-09 | [
[
"Perea-Vega",
"Diego",
""
],
[
"Frigon",
"Jean-François",
""
],
[
"Girard",
"André",
""
]
] | 4G wireless access systems require high spectral efficiency to support the ever increasing number of users and data rates for real time applications. Multi-antenna OFDM-SDMA systems can provide the required high spectral efficiency and dynamic usage of the channel, but the resource allocation process becomes extremely ... |
1502.03874 | Zhengbang Zha | Zhengbang Zha, Lei Hu, Siwei Sun, Jinyong Shan | Further results on differentially 4-uniform permutations over
$\F_{2^{2m}}$ | 15 pages. This paper has been accepted for publication in SCIENCE
CHINA Mathematics | null | 10.1007/s11425-015-4996-2 | null | cs.IT math.IT | http://creativecommons.org/licenses/by/3.0/ | In this paper, we present several new constructions of differentially
4-uniform permutations over $\F_{2^{2m}}$ by modifying the values of the
inverse function on some subsets of $\F_{2^{2m}}$. The resulted differentially
4-uniform permutations have high nonlinearities and algebraic degrees, which
provide more choice... | [
{
"created": "Fri, 13 Feb 2015 02:50:59 GMT",
"version": "v1"
}
] | 2023-07-19 | [
[
"Zha",
"Zhengbang",
""
],
[
"Hu",
"Lei",
""
],
[
"Sun",
"Siwei",
""
],
[
"Shan",
"Jinyong",
""
]
] | In this paper, we present several new constructions of differentially 4-uniform permutations over $\F_{2^{2m}}$ by modifying the values of the inverse function on some subsets of $\F_{2^{2m}}$. The resulted differentially 4-uniform permutations have high nonlinearities and algebraic degrees, which provide more choices ... |
2109.05658 | Abigail Jacobs | Abigail Z. Jacobs | Measurement as governance in and for responsible AI | 5 pages, 1 figure; KDD Workshop on Responsible AI 2021 | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | Measurement of social phenomena is everywhere, unavoidably, in sociotechnical
systems. This is not (only) an academic point: Fairness-related harms emerge
when there is a mismatch in the measurement process between the thing we
purport to be measuring and the thing we actually measure. However, the
measurement proces... | [
{
"created": "Mon, 13 Sep 2021 01:04:22 GMT",
"version": "v1"
}
] | 2021-09-14 | [
[
"Jacobs",
"Abigail Z.",
""
]
] | Measurement of social phenomena is everywhere, unavoidably, in sociotechnical systems. This is not (only) an academic point: Fairness-related harms emerge when there is a mismatch in the measurement process between the thing we purport to be measuring and the thing we actually measure. However, the measurement process ... |
1903.10140 | Chunyang Feng | Chunyang Feng, Yufeng Sun, Xin Li | Iris R-CNN: Accurate Iris Segmentation in Non-cooperative Environment | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Despite the significant advances in iris segmentation, accomplishing accurate
iris segmentation in non-cooperative environment remains a grand challenge. In
this paper, we present a deep learning framework, referred to as Iris R-CNN, to
offer superior accuracy for iris segmentation. The proposed framework is
derived ... | [
{
"created": "Mon, 25 Mar 2019 05:33:06 GMT",
"version": "v1"
}
] | 2019-03-26 | [
[
"Feng",
"Chunyang",
""
],
[
"Sun",
"Yufeng",
""
],
[
"Li",
"Xin",
""
]
] | Despite the significant advances in iris segmentation, accomplishing accurate iris segmentation in non-cooperative environment remains a grand challenge. In this paper, we present a deep learning framework, referred to as Iris R-CNN, to offer superior accuracy for iris segmentation. The proposed framework is derived fr... |
1904.09163 | David Sigtermans | David Sigtermans | Transfer Entropy: where Shannon meets Turing | 4 pages, 1 figure | null | null | null | cs.IT cs.LG math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transfer entropy is capable of capturing nonlinear source-destination
relations between multi-variate time series. It is a measure of association
between source data that are transformed into destination data via a set of
linear transformations between their probability mass functions. The resulting
tensor formalism ... | [
{
"created": "Fri, 19 Apr 2019 12:24:44 GMT",
"version": "v1"
},
{
"created": "Fri, 17 May 2019 17:56:03 GMT",
"version": "v2"
},
{
"created": "Sat, 25 May 2019 14:11:24 GMT",
"version": "v3"
}
] | 2019-05-28 | [
[
"Sigtermans",
"David",
""
]
] | Transfer entropy is capable of capturing nonlinear source-destination relations between multi-variate time series. It is a measure of association between source data that are transformed into destination data via a set of linear transformations between their probability mass functions. The resulting tensor formalism is... |
1312.5548 | Juergen Schmidhuber | J\"urgen Schmidhuber | My First Deep Learning System of 1991 + Deep Learning Timeline 1962-2013 | 11 pages. As a machine learning researcher I am obsessed with proper
credit assignment. This draft is the result of an experiment in rapid massive
open online peer review. Since 20 September 2013, subsequent revisions
published under http://www.deeplearning.me have absorbed many suggestions for
improvements by ... | null | null | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Learning has attracted significant attention in recent years. Here I
present a brief overview of my first Deep Learner of 1991, and its historic
context, with a timeline of Deep Learning highlights.
| [
{
"created": "Thu, 19 Dec 2013 13:45:45 GMT",
"version": "v1"
}
] | 2013-12-20 | [
[
"Schmidhuber",
"Jürgen",
""
]
] | Deep Learning has attracted significant attention in recent years. Here I present a brief overview of my first Deep Learner of 1991, and its historic context, with a timeline of Deep Learning highlights. |
2204.00645 | Young-Ho Kim | Christian DeBuy, Florin Ghesu, Reza Langari, Young-Ho Kim | Design and validation of zero-slack separable manipulator for
Intracardiac Echocardiography | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Clinicians require substantial training and experience to become comfortable
with steering Intracardiac echocardiography (ICE) catheter to localize and
measure the area of treatment to watch for complications while device catheters
are deployed in another access. Thus, it is reasonable that a robotic-assist
system to... | [
{
"created": "Fri, 1 Apr 2022 18:17:21 GMT",
"version": "v1"
}
] | 2022-04-05 | [
[
"DeBuy",
"Christian",
""
],
[
"Ghesu",
"Florin",
""
],
[
"Langari",
"Reza",
""
],
[
"Kim",
"Young-Ho",
""
]
] | Clinicians require substantial training and experience to become comfortable with steering Intracardiac echocardiography (ICE) catheter to localize and measure the area of treatment to watch for complications while device catheters are deployed in another access. Thus, it is reasonable that a robotic-assist system to h... |
2110.04452 | Huimin Dong | Huimin Dong, R\'eka Markovich and Leendert van der Torre | Towards AI Logic for Social Reasoning | null | Journal of Zhejiang University, Vol. 5, No. 50 (2020): 31-50 | null | null | cs.AI cs.LO | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Artificial Intelligence (AI) logic formalizes the reasoning of intelligent
agents. In this paper, we discuss how an argumentation-based AI logic could be
used also to formalize important aspects of social reasoning. Besides reasoning
about the knowledge and actions of individual agents, social AI logic can
reason als... | [
{
"created": "Sat, 9 Oct 2021 04:35:23 GMT",
"version": "v1"
}
] | 2021-10-12 | [
[
"Dong",
"Huimin",
""
],
[
"Markovich",
"Réka",
""
],
[
"van der Torre",
"Leendert",
""
]
] | Artificial Intelligence (AI) logic formalizes the reasoning of intelligent agents. In this paper, we discuss how an argumentation-based AI logic could be used also to formalize important aspects of social reasoning. Besides reasoning about the knowledge and actions of individual agents, social AI logic can reason also ... |
1904.01691 | Sangkug Lym | Sangkug Lym, Donghyuk Lee, Mike O'Connor, Niladrish Chatterjee, Mattan
Erez | DeLTA: GPU Performance Model for Deep Learning Applications with
In-depth Memory System Traffic Analysis | null | null | 10.1109/ISPASS.2019.00041 | null | cs.DC cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | Training convolutional neural networks (CNNs) requires intense compute
throughput and high memory bandwidth. Especially, convolution layers account
for the majority of the execution time of CNN training, and GPUs are commonly
used to accelerate these layer workloads. GPU design optimization for efficient
CNN training... | [
{
"created": "Tue, 2 Apr 2019 22:30:06 GMT",
"version": "v1"
}
] | 2020-04-28 | [
[
"Lym",
"Sangkug",
""
],
[
"Lee",
"Donghyuk",
""
],
[
"O'Connor",
"Mike",
""
],
[
"Chatterjee",
"Niladrish",
""
],
[
"Erez",
"Mattan",
""
]
] | Training convolutional neural networks (CNNs) requires intense compute throughput and high memory bandwidth. Especially, convolution layers account for the majority of the execution time of CNN training, and GPUs are commonly used to accelerate these layer workloads. GPU design optimization for efficient CNN training a... |
2303.09001 | Alan Chan | Alan Chan, Herbie Bradley, Nitarshan Rajkumar | Reclaiming the Digital Commons: A Public Data Trust for Training Data | Accepted at AIES 2023 | null | null | null | cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Democratization of AI means not only that people can freely use AI, but also
that people can collectively decide how AI is to be used. In particular,
collective decision-making power is required to redress the negative
externalities from the development of increasingly advanced AI systems,
including degradation of th... | [
{
"created": "Thu, 16 Mar 2023 00:12:43 GMT",
"version": "v1"
},
{
"created": "Sun, 21 May 2023 23:17:19 GMT",
"version": "v2"
}
] | 2023-05-23 | [
[
"Chan",
"Alan",
""
],
[
"Bradley",
"Herbie",
""
],
[
"Rajkumar",
"Nitarshan",
""
]
] | Democratization of AI means not only that people can freely use AI, but also that people can collectively decide how AI is to be used. In particular, collective decision-making power is required to redress the negative externalities from the development of increasingly advanced AI systems, including degradation of the ... |
1603.09601 | Reuben Stephen | Reuben George Stephen, Rui Zhang | Joint Millimeter-Wave Fronthaul and OFDMA Resource Allocation in
Ultra-Dense CRAN | Accepted for publication in IEEE Transactions on Communications | null | 10.1109/TCOMM.2017.2649519 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Ultra-dense (UD) wireless networks and cloud radio access networks (CRAN) are
two promising network architectures for the emerging fifth-generation (5G)
wireless communication systems. By jointly employing them, a new appealing
network solution is proposed in this paper, termed UD-CRAN. In a UD-CRAN,
millimeter-wave ... | [
{
"created": "Thu, 31 Mar 2016 14:25:24 GMT",
"version": "v1"
},
{
"created": "Fri, 17 Jun 2016 15:17:25 GMT",
"version": "v2"
},
{
"created": "Fri, 20 Jan 2017 07:53:07 GMT",
"version": "v3"
},
{
"created": "Wed, 8 Feb 2017 10:11:11 GMT",
"version": "v4"
}
] | 2017-02-09 | [
[
"Stephen",
"Reuben George",
""
],
[
"Zhang",
"Rui",
""
]
] | Ultra-dense (UD) wireless networks and cloud radio access networks (CRAN) are two promising network architectures for the emerging fifth-generation (5G) wireless communication systems. By jointly employing them, a new appealing network solution is proposed in this paper, termed UD-CRAN. In a UD-CRAN, millimeter-wave (m... |
1307.1943 | EPTCS | Carst Tankink (Institute for Computing and Information Science,
Radboud University Nijmegen) | Proof in Context -- Web Editing with Rich, Modeless Contextual Feedback | In Proceedings UITP 2012, arXiv:1307.1528 | EPTCS 118, 2013, pp. 42-56 | 10.4204/EPTCS.118.3 | null | cs.HC cs.LO cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Agora system is a prototypical Wiki for formal mathematics: a web-based
system for collaborating on formal mathematics, intended to support informal
documentation of formal developments. This system requires a reusable proof
editor component, both for collaborative editing of documents, and for
embedding in the r... | [
{
"created": "Mon, 8 Jul 2013 04:41:39 GMT",
"version": "v1"
}
] | 2013-07-09 | [
[
"Tankink",
"Carst",
"",
"Institute for Computing and Information Science,\n Radboud University Nijmegen"
]
] | The Agora system is a prototypical Wiki for formal mathematics: a web-based system for collaborating on formal mathematics, intended to support informal documentation of formal developments. This system requires a reusable proof editor component, both for collaborative editing of documents, and for embedding in the res... |
1806.11269 | Jun Chen | Yang Xiao, Jun Chen, Yancheng Wang, Zhiguo Cao, Joey Tianyi Zhou,
Xiang Bai | Action Recognition for Depth Video using Multi-view Dynamic Images | accepted by Information Sciences | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Dynamic imaging is a recently proposed action description paradigm for
simultaneously capturing motion and temporal evolution information,
particularly in the context of deep convolutional neural networks (CNNs).
Compared with optical flow for motion characterization, dynamic imaging
exhibits superior efficiency and ... | [
{
"created": "Fri, 29 Jun 2018 05:27:26 GMT",
"version": "v1"
},
{
"created": "Sat, 4 Aug 2018 10:40:40 GMT",
"version": "v2"
},
{
"created": "Thu, 27 Dec 2018 16:21:49 GMT",
"version": "v3"
}
] | 2018-12-31 | [
[
"Xiao",
"Yang",
""
],
[
"Chen",
"Jun",
""
],
[
"Wang",
"Yancheng",
""
],
[
"Cao",
"Zhiguo",
""
],
[
"Zhou",
"Joey Tianyi",
""
],
[
"Bai",
"Xiang",
""
]
] | Dynamic imaging is a recently proposed action description paradigm for simultaneously capturing motion and temporal evolution information, particularly in the context of deep convolutional neural networks (CNNs). Compared with optical flow for motion characterization, dynamic imaging exhibits superior efficiency and co... |
2004.08861 | Jie Fu | Jie Fu, Xue Geng, Zhijian Duan, Bohan Zhuang, Xingdi Yuan, Adam
Trischler, Jie Lin, Chris Pal, Hao Dong | Role-Wise Data Augmentation for Knowledge Distillation | null | null | null | null | cs.LG cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Knowledge Distillation (KD) is a common method for transferring the
``knowledge'' learned by one machine learning model (the \textit{teacher}) into
another model (the \textit{student}), where typically, the teacher has a
greater capacity (e.g., more parameters or higher bit-widths). To our
knowledge, existing methods... | [
{
"created": "Sun, 19 Apr 2020 14:22:17 GMT",
"version": "v1"
}
] | 2020-04-21 | [
[
"Fu",
"Jie",
""
],
[
"Geng",
"Xue",
""
],
[
"Duan",
"Zhijian",
""
],
[
"Zhuang",
"Bohan",
""
],
[
"Yuan",
"Xingdi",
""
],
[
"Trischler",
"Adam",
""
],
[
"Lin",
"Jie",
""
],
[
"Pal",
"Chris",
... | Knowledge Distillation (KD) is a common method for transferring the ``knowledge'' learned by one machine learning model (the \textit{teacher}) into another model (the \textit{student}), where typically, the teacher has a greater capacity (e.g., more parameters or higher bit-widths). To our knowledge, existing methods o... |
1908.04812 | Taesun Whang | Taesun Whang, Dongyub Lee, Chanhee Lee, Kisu Yang, Dongsuk Oh,
HeuiSeok Lim | An Effective Domain Adaptive Post-Training Method for BERT in Response
Selection | INTERSPEECH 2020 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We focus on multi-turn response selection in a retrieval-based dialog system.
In this paper, we utilize the powerful pre-trained language model
Bi-directional Encoder Representations from Transformer (BERT) for a multi-turn
dialog system and propose a highly effective post-training method on
domain-specific corpus. A... | [
{
"created": "Tue, 13 Aug 2019 18:24:29 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Jul 2020 02:37:49 GMT",
"version": "v2"
}
] | 2020-07-28 | [
[
"Whang",
"Taesun",
""
],
[
"Lee",
"Dongyub",
""
],
[
"Lee",
"Chanhee",
""
],
[
"Yang",
"Kisu",
""
],
[
"Oh",
"Dongsuk",
""
],
[
"Lim",
"HeuiSeok",
""
]
] | We focus on multi-turn response selection in a retrieval-based dialog system. In this paper, we utilize the powerful pre-trained language model Bi-directional Encoder Representations from Transformer (BERT) for a multi-turn dialog system and propose a highly effective post-training method on domain-specific corpus. Alt... |
1412.3579 | Jan Bergstra | Jan A. Bergstra | Personal Multi-threading | null | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-threading allows agents to pursue a heterogeneous collection of tasks
in an orderly manner. The view of multi-threading that emerges from thread
algebra is applied to the case where a single agent, who may be human,
maintains a hierarchical multithread as an architecture of its own activities.
| [
{
"created": "Thu, 11 Dec 2014 09:06:40 GMT",
"version": "v1"
}
] | 2014-12-12 | [
[
"Bergstra",
"Jan A.",
""
]
] | Multi-threading allows agents to pursue a heterogeneous collection of tasks in an orderly manner. The view of multi-threading that emerges from thread algebra is applied to the case where a single agent, who may be human, maintains a hierarchical multithread as an architecture of its own activities. |
2112.12182 | Duo Wang | Duo Wang, Salah Karout | Fine-grained Multi-Modal Self-Supervised Learning | Accepted at BMVC 2021 | null | null | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-Modal Self-Supervised Learning from videos has been shown to improve
model's performance on various downstream tasks. However, such Self-Supervised
pre-training requires large batch sizes and a large amount of computation
resources due to the noise present in the uncurated data. This is partly due to
the fact t... | [
{
"created": "Wed, 22 Dec 2021 19:17:45 GMT",
"version": "v1"
}
] | 2021-12-24 | [
[
"Wang",
"Duo",
""
],
[
"Karout",
"Salah",
""
]
] | Multi-Modal Self-Supervised Learning from videos has been shown to improve model's performance on various downstream tasks. However, such Self-Supervised pre-training requires large batch sizes and a large amount of computation resources due to the noise present in the uncurated data. This is partly due to the fact tha... |
2203.11795 | Rob Bisseling | Thomas Koopman and Rob H. Bisseling | Minimizing communication in the multidimensional FFT | 23 pages, 3 figures. The new version has mainly added results in
section 4.2 for the package heFFT, following referee comments. Furthermore,
small linguistic changes have been made to render the arXiv version identical
in text to the final published journal version | SIAM Journal on Scientific Computing, Volume 45, Number 6, pp.
C330-C347 (2023) | 10.1137/22M1487242 | null | cs.DC cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a parallel algorithm for the fast Fourier transform (FFT) in
higher dimensions. This algorithm generalizes the cyclic-to-cyclic
one-dimensional parallel algorithm to a cyclic-to-cyclic multidimensional
parallel algorithm while retaining the property of needing only a single
all-to-all communication step. T... | [
{
"created": "Tue, 22 Mar 2022 15:01:35 GMT",
"version": "v1"
},
{
"created": "Mon, 11 Dec 2023 09:36:58 GMT",
"version": "v2"
}
] | 2023-12-12 | [
[
"Koopman",
"Thomas",
""
],
[
"Bisseling",
"Rob H.",
""
]
] | We present a parallel algorithm for the fast Fourier transform (FFT) in higher dimensions. This algorithm generalizes the cyclic-to-cyclic one-dimensional parallel algorithm to a cyclic-to-cyclic multidimensional parallel algorithm while retaining the property of needing only a single all-to-all communication step. Thi... |
2210.04230 | Victor Croisfelt MSc | Victor Croisfelt and Fabio Saggese and Israel Leyva-Mayorga and
Rados{\l}aw Kotaba and Gabriele Gradoni and Petar Popovski | Random Access Protocol with Channel Oracle Enabled by a Reconfigurable
Intelligent Surface | 14 pages, 7 figures, journal paper | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The widespread adoption of Reconfigurable Intelligent Surfaces (RISs) in
future practical wireless systems is critically dependent on the integration of
the RIS into higher-layer protocols beyond the physical (PHY) one, an issue
that has received minimal attention in the research literature. In light of
this, we cons... | [
{
"created": "Sun, 9 Oct 2022 11:23:27 GMT",
"version": "v1"
},
{
"created": "Mon, 17 Apr 2023 14:41:39 GMT",
"version": "v2"
}
] | 2023-04-18 | [
[
"Croisfelt",
"Victor",
""
],
[
"Saggese",
"Fabio",
""
],
[
"Leyva-Mayorga",
"Israel",
""
],
[
"Kotaba",
"Radosław",
""
],
[
"Gradoni",
"Gabriele",
""
],
[
"Popovski",
"Petar",
""
]
] | The widespread adoption of Reconfigurable Intelligent Surfaces (RISs) in future practical wireless systems is critically dependent on the integration of the RIS into higher-layer protocols beyond the physical (PHY) one, an issue that has received minimal attention in the research literature. In light of this, we consid... |
2309.01237 | Alexander Kolpakov | Alexander Kolpakov, A. Alistair Rocke | The Information Geometry of UMAP | 12 pages, 2 figures, 3 tables ; Github repo
(https://github.com/sashakolpakov/info-geometry-umap) ; to appear in Le
Matematiche | null | null | null | cs.CG cs.DM cs.IT math.GT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this note we highlight some connections of UMAP to the basic principles of
Information Geometry. Originally, UMAP was derived from Category Theory
observations. However, we posit that it also has a natural geometric
interpretation.
| [
{
"created": "Sun, 3 Sep 2023 18:10:00 GMT",
"version": "v1"
},
{
"created": "Sat, 9 Sep 2023 09:31:41 GMT",
"version": "v2"
},
{
"created": "Fri, 15 Mar 2024 09:55:54 GMT",
"version": "v3"
},
{
"created": "Tue, 30 Apr 2024 19:35:10 GMT",
"version": "v4"
},
{
"cre... | 2024-07-23 | [
[
"Kolpakov",
"Alexander",
""
],
[
"Rocke",
"A. Alistair",
""
]
] | In this note we highlight some connections of UMAP to the basic principles of Information Geometry. Originally, UMAP was derived from Category Theory observations. However, we posit that it also has a natural geometric interpretation. |
2311.06840 | Bijan Mazaheri | Bijan Mazaheri, Siddharth Jain, Matthew Cook, Jehoshua Bruck | Omitted Labels in Causality: A Study of Paradoxes | null | null | null | null | cs.LG cs.AI cs.IT cs.SI math.IT stat.ME | http://creativecommons.org/licenses/by/4.0/ | We explore what we call ``omitted label contexts,'' in which training data is
limited to a subset of the possible labels. This setting is common among
specialized human experts or specific focused studies. We lean on well-studied
paradoxes (Simpson's and Condorcet) to illustrate the more general difficulties
of causa... | [
{
"created": "Sun, 12 Nov 2023 13:31:53 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Feb 2024 18:53:58 GMT",
"version": "v2"
},
{
"created": "Thu, 23 May 2024 12:58:14 GMT",
"version": "v3"
}
] | 2024-05-24 | [
[
"Mazaheri",
"Bijan",
""
],
[
"Jain",
"Siddharth",
""
],
[
"Cook",
"Matthew",
""
],
[
"Bruck",
"Jehoshua",
""
]
] | We explore what we call ``omitted label contexts,'' in which training data is limited to a subset of the possible labels. This setting is common among specialized human experts or specific focused studies. We lean on well-studied paradoxes (Simpson's and Condorcet) to illustrate the more general difficulties of causal ... |
2407.19160 | Stephan Saalfeld | C\'edric Allier, Magdalena C. Schneider, Michael Innerberger, Larissa
Heinrich, John A. Bogovic, Stephan Saalfeld | Decomposing heterogeneous dynamical systems with graph neural networks | 11 pages, 4 figures, 2 pages appendix, 2 supplementary tables, 18
supplementary figures, 13 videos linked to youtube | null | null | null | cs.LG cs.AI math.DS | http://creativecommons.org/licenses/by/4.0/ | Natural physical, chemical, and biological dynamical systems are often
complex, with heterogeneous components interacting in diverse ways. We show
that graph neural networks can be designed to jointly learn the interaction
rules and the structure of the heterogeneity from data alone. The learned
latent structure and ... | [
{
"created": "Sat, 27 Jul 2024 04:03:12 GMT",
"version": "v1"
}
] | 2024-07-30 | [
[
"Allier",
"Cédric",
""
],
[
"Schneider",
"Magdalena C.",
""
],
[
"Innerberger",
"Michael",
""
],
[
"Heinrich",
"Larissa",
""
],
[
"Bogovic",
"John A.",
""
],
[
"Saalfeld",
"Stephan",
""
]
] | Natural physical, chemical, and biological dynamical systems are often complex, with heterogeneous components interacting in diverse ways. We show that graph neural networks can be designed to jointly learn the interaction rules and the structure of the heterogeneity from data alone. The learned latent structure and dy... |
1711.10467 | Cong Ma | Cong Ma, Kaizheng Wang, Yuejie Chi, Yuxin Chen | Implicit Regularization in Nonconvex Statistical Estimation: Gradient
Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind
Deconvolution | accepted to Foundations of Computational Mathematics (FOCM) | Foundations of Computational Mathematics, vol. 20, no. 3, pp.
451-632, June 2020 | 10.1007/s10208-019-09429-9 | null | cs.LG cs.IT math.IT math.OC math.ST stat.ML stat.TH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent years have seen a flurry of activities in designing provably efficient
nonconvex procedures for solving statistical estimation problems. Due to the
highly nonconvex nature of the empirical loss, state-of-the-art procedures
often require proper regularization (e.g. trimming, regularized cost,
projection) in ord... | [
{
"created": "Tue, 28 Nov 2017 18:53:38 GMT",
"version": "v1"
},
{
"created": "Thu, 14 Dec 2017 10:47:03 GMT",
"version": "v2"
},
{
"created": "Tue, 30 Jul 2019 02:14:54 GMT",
"version": "v3"
}
] | 2020-06-09 | [
[
"Ma",
"Cong",
""
],
[
"Wang",
"Kaizheng",
""
],
[
"Chi",
"Yuejie",
""
],
[
"Chen",
"Yuxin",
""
]
] | Recent years have seen a flurry of activities in designing provably efficient nonconvex procedures for solving statistical estimation problems. Due to the highly nonconvex nature of the empirical loss, state-of-the-art procedures often require proper regularization (e.g. trimming, regularized cost, projection) in order... |
2105.09613 | Aditi Singh | Aditi Singh, Suhas Jayaram Subramanya, Ravishankar Krishnaswamy,
Harsha Vardhan Simhadri | FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming
Similarity Search | 19 pages, 22 figures | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Approximate nearest neighbor search (ANNS) is a fundamental building block in
information retrieval with graph-based indices being the current
state-of-the-art and widely used in the industry. Recent advances in
graph-based indices have made it possible to index and search billion-point
datasets with high recall and ... | [
{
"created": "Thu, 20 May 2021 09:17:13 GMT",
"version": "v1"
}
] | 2021-05-21 | [
[
"Singh",
"Aditi",
""
],
[
"Subramanya",
"Suhas Jayaram",
""
],
[
"Krishnaswamy",
"Ravishankar",
""
],
[
"Simhadri",
"Harsha Vardhan",
""
]
] | Approximate nearest neighbor search (ANNS) is a fundamental building block in information retrieval with graph-based indices being the current state-of-the-art and widely used in the industry. Recent advances in graph-based indices have made it possible to index and search billion-point datasets with high recall and mi... |
1610.02136 | Dan Hendrycks | Dan Hendrycks and Kevin Gimpel | A Baseline for Detecting Misclassified and Out-of-Distribution Examples
in Neural Networks | Published as a conference paper at ICLR 2017. 1 Figure in 1 Appendix.
Minor changes from the previous version | International Conference on Learning Representations 2017 | null | null | cs.NE cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the two related problems of detecting if an example is
misclassified or out-of-distribution. We present a simple baseline that
utilizes probabilities from softmax distributions. Correctly classified
examples tend to have greater maximum softmax probabilities than erroneously
classified and out-of-distribu... | [
{
"created": "Fri, 7 Oct 2016 04:06:01 GMT",
"version": "v1"
},
{
"created": "Thu, 23 Mar 2017 18:11:25 GMT",
"version": "v2"
},
{
"created": "Wed, 3 Oct 2018 07:32:57 GMT",
"version": "v3"
}
] | 2018-10-04 | [
[
"Hendrycks",
"Dan",
""
],
[
"Gimpel",
"Kevin",
""
]
] | We consider the two related problems of detecting if an example is misclassified or out-of-distribution. We present a simple baseline that utilizes probabilities from softmax distributions. Correctly classified examples tend to have greater maximum softmax probabilities than erroneously classified and out-of-distributi... |
2202.00893 | Jaeyeon Ahn | Jaeyeon Ahn, Taehyeon Kim, Seyoung Yun | Mold into a Graph: Efficient Bayesian Optimization over Mixed-Spaces | 14 pages, 10 figures | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Real-world optimization problems are generally not just black-box problems,
but also involve mixed types of inputs in which discrete and continuous
variables coexist. Such mixed-space optimization possesses the primary
challenge of modeling complex interactions between the inputs. In this work, we
propose a novel yet... | [
{
"created": "Wed, 2 Feb 2022 07:12:18 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Feb 2022 06:44:25 GMT",
"version": "v2"
}
] | 2022-02-09 | [
[
"Ahn",
"Jaeyeon",
""
],
[
"Kim",
"Taehyeon",
""
],
[
"Yun",
"Seyoung",
""
]
] | Real-world optimization problems are generally not just black-box problems, but also involve mixed types of inputs in which discrete and continuous variables coexist. Such mixed-space optimization possesses the primary challenge of modeling complex interactions between the inputs. In this work, we propose a novel yet s... |
cs/0604082 | Farhad Meshkati | Farhad Meshkati, H. Vincent Poor, Stuart C. Schwartz and Radu V. Balan | Energy-Efficient Power and Rate Control with QoS Constraints: A
Game-Theoretic Approach | To appear in the proceedings of the 2006 International Wireless
Communications and Mobile Computing Conference (IWCMC'06), Vancouver, BC,
Canada, July 2006 | null | null | null | cs.IT math.IT | null | A game-theoretic model is proposed to study the cross-layer problem of joint
power and rate control with quality of service (QoS) constraints in
multiple-access networks. In the proposed game, each user seeks to choose its
transmit power and rate in a distributed manner in order to maximize its own
utility and at the... | [
{
"created": "Fri, 21 Apr 2006 14:46:14 GMT",
"version": "v1"
},
{
"created": "Fri, 5 May 2006 19:37:13 GMT",
"version": "v2"
}
] | 2007-07-16 | [
[
"Meshkati",
"Farhad",
""
],
[
"Poor",
"H. Vincent",
""
],
[
"Schwartz",
"Stuart C.",
""
],
[
"Balan",
"Radu V.",
""
]
] | A game-theoretic model is proposed to study the cross-layer problem of joint power and rate control with quality of service (QoS) constraints in multiple-access networks. In the proposed game, each user seeks to choose its transmit power and rate in a distributed manner in order to maximize its own utility and at the s... |
2106.11394 | Felix Biessmann | Felix Biessmann and Viktor Treu | A Turing Test for Transparency | Published in Proceedings of the ICML Workshop on Theoretical
Foundations, Criticism, and Application Trends of Explainable AI held in
conjunction with the 38th International Conference on Machine Learning (ICML) | null | null | null | cs.AI cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | A central goal of explainable artificial intelligence (XAI) is to improve the
trust relationship in human-AI interaction. One assumption underlying research
in transparent AI systems is that explanations help to better assess
predictions of machine learning (ML) models, for instance by enabling humans to
identify wro... | [
{
"created": "Mon, 21 Jun 2021 20:09:40 GMT",
"version": "v1"
}
] | 2021-06-23 | [
[
"Biessmann",
"Felix",
""
],
[
"Treu",
"Viktor",
""
]
] | A central goal of explainable artificial intelligence (XAI) is to improve the trust relationship in human-AI interaction. One assumption underlying research in transparent AI systems is that explanations help to better assess predictions of machine learning (ML) models, for instance by enabling humans to identify wrong... |
2112.02129 | Marco Carpentiero | Marco Carpentiero, Vincenzo Matta, Ali H. Sayed | Distributed Adaptive Learning Under Communication Constraints | Submitted for publication | null | null | null | cs.LG cs.IT cs.MA math.IT math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work examines adaptive distributed learning strategies designed to
operate under communication constraints. We consider a network of agents that
must solve an online optimization problem from continual observation of
streaming data. The agents implement a distributed cooperative strategy where
each agent is allo... | [
{
"created": "Fri, 3 Dec 2021 19:23:48 GMT",
"version": "v1"
}
] | 2021-12-07 | [
[
"Carpentiero",
"Marco",
""
],
[
"Matta",
"Vincenzo",
""
],
[
"Sayed",
"Ali H.",
""
]
] | This work examines adaptive distributed learning strategies designed to operate under communication constraints. We consider a network of agents that must solve an online optimization problem from continual observation of streaming data. The agents implement a distributed cooperative strategy where each agent is allowe... |
2404.01184 | Mingxin Yu | Mingxin Yu, Chenning Yu, M-Mahdi Naddaf-Sh, Devesh Upadhyay, Sicun
Gao, and Chuchu Fan | Efficient Motion Planning for Manipulators with Control Barrier
Function-Induced Neural Controller | Accepted by IEEE International Conference on Robotics and Automation
(ICRA2024) | null | null | null | cs.RO cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Sampling-based motion planning methods for manipulators in crowded
environments often suffer from expensive collision checking and high sampling
complexity, which make them difficult to use in real time. To address this
issue, we propose a new generalizable control barrier function (CBF)-based
steering controller to ... | [
{
"created": "Mon, 1 Apr 2024 15:36:39 GMT",
"version": "v1"
}
] | 2024-04-02 | [
[
"Yu",
"Mingxin",
""
],
[
"Yu",
"Chenning",
""
],
[
"Naddaf-Sh",
"M-Mahdi",
""
],
[
"Upadhyay",
"Devesh",
""
],
[
"Gao",
"Sicun",
""
],
[
"Fan",
"Chuchu",
""
]
] | Sampling-based motion planning methods for manipulators in crowded environments often suffer from expensive collision checking and high sampling complexity, which make them difficult to use in real time. To address this issue, we propose a new generalizable control barrier function (CBF)-based steering controller to re... |
0805.1787 | Michael Hilker | Michael Hilker and Christoph Schommer | A Network Protection Framework through Artificial Immunity | 24 pages, 2 figures | null | null | null | cs.MA cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current network protection systems use a collection of intelligent components
- e.g. classifiers or rule-based firewall systems to detect intrusions and
anomalies and to secure a network against viruses, worms, or trojans. However,
these network systems rely on individuality and support an architecture with
less coll... | [
{
"created": "Tue, 13 May 2008 06:51:35 GMT",
"version": "v1"
}
] | 2008-05-14 | [
[
"Hilker",
"Michael",
""
],
[
"Schommer",
"Christoph",
""
]
] | Current network protection systems use a collection of intelligent components - e.g. classifiers or rule-based firewall systems to detect intrusions and anomalies and to secure a network against viruses, worms, or trojans. However, these network systems rely on individuality and support an architecture with less collab... |
1108.2893 | Xuebin Wu | Xuebin Wu and Zhiyuan Yan | Reduced-Complexity Decoder of Long Reed-Solomon Codes Based on Composite
Cyclotomic Fourier Transforms | 7 pages, 1 figure | null | 10.1109/TSP.2012.2192435 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Long Reed-Solomon (RS) codes are desirable for digital communication and
storage systems due to their improved error performance, but the high
computational complexity of their decoders is a key obstacle to their adoption
in practice. As discrete Fourier transforms (DFTs) can evaluate a polynomial at
multiple points,... | [
{
"created": "Sun, 14 Aug 2011 17:41:44 GMT",
"version": "v1"
}
] | 2015-05-30 | [
[
"Wu",
"Xuebin",
""
],
[
"Yan",
"Zhiyuan",
""
]
] | Long Reed-Solomon (RS) codes are desirable for digital communication and storage systems due to their improved error performance, but the high computational complexity of their decoders is a key obstacle to their adoption in practice. As discrete Fourier transforms (DFTs) can evaluate a polynomial at multiple points, e... |
1506.07688 | Snikdho Sworov Haque | Snikdho Sworov Haque, Md. Munjure Mowla | Performance Improvement for Papr Reduction in Lte Downlink System with
Elliptic Filtering | 10 pages, 11 figures, Published in IJCNC. in International Journal of
Computer Networks & Communications (IJCNC) Vol.7, No.1, January 2015 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is concerned with the performance improvement of PAPR reduction of
orthogonal frequency division multiplexing (OFDM) signal using amplitude
clipping & filtering based design. Note that OFDM is one of the well adept
multi-carrier multiplexing transmission scheme which has been implemented in
long term evolu... | [
{
"created": "Thu, 25 Jun 2015 10:17:43 GMT",
"version": "v1"
}
] | 2015-06-26 | [
[
"Haque",
"Snikdho Sworov",
""
],
[
"Mowla",
"Md. Munjure",
""
]
] | This paper is concerned with the performance improvement of PAPR reduction of orthogonal frequency division multiplexing (OFDM) signal using amplitude clipping & filtering based design. Note that OFDM is one of the well adept multi-carrier multiplexing transmission scheme which has been implemented in long term evoluti... |
2309.07103 | William Godoy | Pedro Valero-Lara, Alexis Huante, Mustafa Al Lail, William F. Godoy,
Keita Teranishi, Prasanna Balaprakash, Jeffrey S. Vetter | Comparing Llama-2 and GPT-3 LLMs for HPC kernels generation | Accepted at LCPC 2023, The 36th International Workshop on Languages
and Compilers for Parallel Computing http://www.lcpcworkshop.org/LCPC23/ . 13
pages, 5 figures, 1 table | null | null | null | cs.SE cs.AI cs.DC cs.PL | http://creativecommons.org/licenses/by/4.0/ | We evaluate the use of the open-source Llama-2 model for generating
well-known, high-performance computing kernels (e.g., AXPY, GEMV, GEMM) on
different parallel programming models and languages (e.g., C++: OpenMP, OpenMP
Offload, OpenACC, CUDA, HIP; Fortran: OpenMP, OpenMP Offload, OpenACC; Python:
numpy, Numba, pyC... | [
{
"created": "Tue, 12 Sep 2023 01:19:54 GMT",
"version": "v1"
}
] | 2023-09-14 | [
[
"Valero-Lara",
"Pedro",
""
],
[
"Huante",
"Alexis",
""
],
[
"Lail",
"Mustafa Al",
""
],
[
"Godoy",
"William F.",
""
],
[
"Teranishi",
"Keita",
""
],
[
"Balaprakash",
"Prasanna",
""
],
[
"Vetter",
"Jeffrey S.",
... | We evaluate the use of the open-source Llama-2 model for generating well-known, high-performance computing kernels (e.g., AXPY, GEMV, GEMM) on different parallel programming models and languages (e.g., C++: OpenMP, OpenMP Offload, OpenACC, CUDA, HIP; Fortran: OpenMP, OpenMP Offload, OpenACC; Python: numpy, Numba, pyCUD... |
2204.00762 | Lan Wang | Lan Wang and Vishnu Naresh Boddeti | Do learned representations respect causal relationships? | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Data often has many semantic attributes that are causally associated with
each other. But do attribute-specific learned representations of data also
respect the same causal relations? We answer this question in three steps.
First, we introduce NCINet, an approach for observational causal discovery from
high-dimension... | [
{
"created": "Sat, 2 Apr 2022 04:53:10 GMT",
"version": "v1"
},
{
"created": "Thu, 7 Apr 2022 13:07:41 GMT",
"version": "v2"
}
] | 2022-04-08 | [
[
"Wang",
"Lan",
""
],
[
"Boddeti",
"Vishnu Naresh",
""
]
] | Data often has many semantic attributes that are causally associated with each other. But do attribute-specific learned representations of data also respect the same causal relations? We answer this question in three steps. First, we introduce NCINet, an approach for observational causal discovery from high-dimensional... |
1605.09551 | Vincent Tan | Vincent Y. F. Tan, Masahito Hayashi | Analysis of Remaining Uncertainties and Exponents under Various
Conditional R\'{e}nyi Entropies | 26 pages; 7 figures; To be presented in part at the 2016
International Symposium on Information Theory (ISIT) in Barcelona, Spain | null | null | null | cs.IT cs.CR math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we analyze the asymptotics of the normalized remaining
uncertainty of a source when a compressed or hashed version of it and
correlated side-information is observed. For this system, commonly known as
Slepian-Wolf source coding, we establish the optimal (minimum) rate of
compression of the source to en... | [
{
"created": "Tue, 31 May 2016 10:01:17 GMT",
"version": "v1"
}
] | 2016-06-01 | [
[
"Tan",
"Vincent Y. F.",
""
],
[
"Hayashi",
"Masahito",
""
]
] | In this paper, we analyze the asymptotics of the normalized remaining uncertainty of a source when a compressed or hashed version of it and correlated side-information is observed. For this system, commonly known as Slepian-Wolf source coding, we establish the optimal (minimum) rate of compression of the source to ensu... |
2402.09182 | Benjamin Lee | Xingyao Yu and Benjamin Lee and Michael Sedlmair | Design Space of Visual Feedforward And Corrective Feedback in XR-Based
Motion Guidance Systems | To appear in ACM CHI 2024 | null | 10.1145/3613904.3642143 | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extended reality (XR) technologies are highly suited in assisting individuals
in learning motor skills and movements -- referred to as motion guidance. In
motion guidance, the "feedforward" provides instructional cues of the motions
that are to be performed, whereas the "feedback" provides cues which help
correct mis... | [
{
"created": "Wed, 14 Feb 2024 13:54:34 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Feb 2024 12:52:39 GMT",
"version": "v2"
}
] | 2024-02-19 | [
[
"Yu",
"Xingyao",
""
],
[
"Lee",
"Benjamin",
""
],
[
"Sedlmair",
"Michael",
""
]
] | Extended reality (XR) technologies are highly suited in assisting individuals in learning motor skills and movements -- referred to as motion guidance. In motion guidance, the "feedforward" provides instructional cues of the motions that are to be performed, whereas the "feedback" provides cues which help correct mista... |
2012.01403 | Minke Xiu | Minke Xiu, Ellis E. Eghan, Zhen Ming (Jack) Jiang, Bram Adams | Empirical Study on the Software Engineering Practices in Open Source ML
Package Repositories | null | null | null | null | cs.SE cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recent advances in Artificial Intelligence (AI), especially in Machine
Learning (ML), have introduced various practical applications (e.g., virtual
personal assistants and autonomous cars) that enhance the experience of
everyday users. However, modern ML technologies like Deep Learning require
considerable technical ... | [
{
"created": "Wed, 2 Dec 2020 18:52:56 GMT",
"version": "v1"
},
{
"created": "Tue, 8 Dec 2020 16:02:00 GMT",
"version": "v2"
}
] | 2020-12-09 | [
[
"Xiu",
"Minke",
"",
"Jack"
],
[
"Eghan",
"Ellis E.",
"",
"Jack"
],
[
"Ming",
"Zhen",
"",
"Jack"
],
[
"Jiang",
"",
""
],
[
"Adams",
"Bram",
""
]
] | Recent advances in Artificial Intelligence (AI), especially in Machine Learning (ML), have introduced various practical applications (e.g., virtual personal assistants and autonomous cars) that enhance the experience of everyday users. However, modern ML technologies like Deep Learning require considerable technical ex... |
1708.05095 | Rodrigo Lobos | Rodrigo A. Lobos, Tae Hyung Kim, W. Scott Hoge, Justin P. Haldar | Navigator-free EPI Ghost Correction with Structured Low-Rank Matrix
Models: New Theory and Methods | 13 pages, 9 figures ; Submitted to IEEE Transactions on Medical
Imaging | null | 10.1109/TMI.2018.2822053 | null | cs.CV cs.IT math.IT physics.med-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Structured low-rank matrix models have previously been introduced to enable
calibrationless MR image reconstruction from sub-Nyquist data, and such ideas
have recently been extended to enable navigator-free echo-planar imaging (EPI)
ghost correction. This paper presents novel theoretical analysis which shows
that, be... | [
{
"created": "Wed, 16 Aug 2017 22:11:50 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Nov 2017 02:57:45 GMT",
"version": "v2"
},
{
"created": "Tue, 6 Mar 2018 01:41:59 GMT",
"version": "v3"
}
] | 2019-02-11 | [
[
"Lobos",
"Rodrigo A.",
""
],
[
"Kim",
"Tae Hyung",
""
],
[
"Hoge",
"W. Scott",
""
],
[
"Haldar",
"Justin P.",
""
]
] | Structured low-rank matrix models have previously been introduced to enable calibrationless MR image reconstruction from sub-Nyquist data, and such ideas have recently been extended to enable navigator-free echo-planar imaging (EPI) ghost correction. This paper presents novel theoretical analysis which shows that, beca... |
2302.02754 | Shuche Wang | Shuche Wang, Van Khu Vu, Vincent Y. F. Tan | Codes for Correcting $t$ Limited-Magnitude Sticky Deletions | arXiv admin note: substantial text overlap with arXiv:2301.11680 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Codes for correcting sticky insertions/deletions and limited-magnitude errors
have attracted significant attention due to their applications of flash
memories, racetrack memories, and DNA data storage systems. In this paper, we
first consider the error type of $t$-sticky deletions with
$\ell$-limited-magnitude and pr... | [
{
"created": "Mon, 6 Feb 2023 13:01:51 GMT",
"version": "v1"
}
] | 2023-02-07 | [
[
"Wang",
"Shuche",
""
],
[
"Vu",
"Van Khu",
""
],
[
"Tan",
"Vincent Y. F.",
""
]
] | Codes for correcting sticky insertions/deletions and limited-magnitude errors have attracted significant attention due to their applications of flash memories, racetrack memories, and DNA data storage systems. In this paper, we first consider the error type of $t$-sticky deletions with $\ell$-limited-magnitude and prop... |
2309.05845 | Mengjia Niu | Mengjia Niu, Yuchen Zhao, Hamed Haddadi | Effective Abnormal Activity Detection on Multivariate Time Series
Healthcare Data | Poster accepted by the 29th Annual International Conference On Mobile
Computing And Networking (ACM MobiCom 2023) | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multivariate time series (MTS) data collected from multiple sensors provide
the potential for accurate abnormal activity detection in smart healthcare
scenarios. However, anomalies exhibit diverse patterns and become unnoticeable
in MTS data. Consequently, achieving accurate anomaly detection is challenging
since we ... | [
{
"created": "Mon, 11 Sep 2023 22:08:09 GMT",
"version": "v1"
}
] | 2023-09-13 | [
[
"Niu",
"Mengjia",
""
],
[
"Zhao",
"Yuchen",
""
],
[
"Haddadi",
"Hamed",
""
]
] | Multivariate time series (MTS) data collected from multiple sensors provide the potential for accurate abnormal activity detection in smart healthcare scenarios. However, anomalies exhibit diverse patterns and become unnoticeable in MTS data. Consequently, achieving accurate anomaly detection is challenging since we ha... |
1802.05176 | Paulo Ferreira | Paulo Ferreira | Sampling Superquadric Point Clouds with Normals | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Superquadrics provide a compact representation of common shapes and have been
used both for object/surface modelling in computer graphics and as object-part
representation in computer vision and robotics. Superquadrics refer to a family
of shapes: here we deal with the superellipsoids and superparaboloids. Due to
the... | [
{
"created": "Wed, 14 Feb 2018 16:04:27 GMT",
"version": "v1"
}
] | 2018-02-15 | [
[
"Ferreira",
"Paulo",
""
]
] | Superquadrics provide a compact representation of common shapes and have been used both for object/surface modelling in computer graphics and as object-part representation in computer vision and robotics. Superquadrics refer to a family of shapes: here we deal with the superellipsoids and superparaboloids. Due to the s... |
2107.02826 | Shohin Mukherjee | Shohin Mukherjee, Sandip Aine, Maxim Likhachev | MPLP: Massively Parallelized Lazy Planning | IEEE Robotics and Automation Letters (RA-L) 2022 | in IEEE Robotics and Automation Letters, vol. 7, no. 3, pp.
6067-6074, July 2022 | 10.1109/LRA.2022.3157544 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Lazy search algorithms have been developed to efficiently solve planning
problems in domains where the computational effort is dominated by the cost of
edge evaluation. The existing algorithms operate by intelligently balancing
computational effort between searching the graph and evaluating edges. However,
they are d... | [
{
"created": "Tue, 6 Jul 2021 18:17:02 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Sep 2021 20:44:26 GMT",
"version": "v2"
},
{
"created": "Mon, 28 Feb 2022 21:17:45 GMT",
"version": "v3"
},
{
"created": "Fri, 13 Jan 2023 02:06:23 GMT",
"version": "v4"
}
] | 2023-01-16 | [
[
"Mukherjee",
"Shohin",
""
],
[
"Aine",
"Sandip",
""
],
[
"Likhachev",
"Maxim",
""
]
] | Lazy search algorithms have been developed to efficiently solve planning problems in domains where the computational effort is dominated by the cost of edge evaluation. The existing algorithms operate by intelligently balancing computational effort between searching the graph and evaluating edges. However, they are des... |
1601.00846 | Mohammad Khodaei | Mohammad Khodaei, Hongyu Jin, and Panos Papadimitratos | Towards Deploying a Scalable & Robust Vehicular Identity and Credential
Management Infrastructure | 8 pages, 13 figures, IEEE Vehicular Networking Conference (VNC). IEEE
VNC, Dec. 2014, pp. 33-40 | null | 10.1109/VNC.2014.7013306 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Several years of academic and industrial research efforts have converged to a
common understanding on fundamental security building blocks for the upcoming
Vehicular Communication (VC) systems. There is a growing consensus towards
deploying a Vehicular Public-Key Infrastructure (VPKI) enables pseudonymous
authenticat... | [
{
"created": "Tue, 5 Jan 2016 14:35:24 GMT",
"version": "v1"
}
] | 2016-01-06 | [
[
"Khodaei",
"Mohammad",
""
],
[
"Jin",
"Hongyu",
""
],
[
"Papadimitratos",
"Panos",
""
]
] | Several years of academic and industrial research efforts have converged to a common understanding on fundamental security building blocks for the upcoming Vehicular Communication (VC) systems. There is a growing consensus towards deploying a Vehicular Public-Key Infrastructure (VPKI) enables pseudonymous authenticatio... |
1905.07339 | Hang Zou | Hang Zou, Chao Zhang, Samson Lasaulce, Lucas Saludjian and Patrick
Panciatici | Decision-Oriented Communications: Application to Energy-Efficient
Resource Allocation | null | WINCOM2018 | 10.1109/WINCOM.2018.8629632 | null | cs.LG cs.NI stat.ML | http://creativecommons.org/licenses/by-sa/4.0/ | In this paper, we introduce the problem of decision-oriented communications,
that is, the goal of the source is to send the right amount of information in
order for the intended destination to execute a task. More specifically, we
restrict our attention to how the source should quantize information so that
the destin... | [
{
"created": "Fri, 17 May 2019 15:55:07 GMT",
"version": "v1"
}
] | 2019-05-20 | [
[
"Zou",
"Hang",
""
],
[
"Zhang",
"Chao",
""
],
[
"Lasaulce",
"Samson",
""
],
[
"Saludjian",
"Lucas",
""
],
[
"Panciatici",
"Patrick",
""
]
] | In this paper, we introduce the problem of decision-oriented communications, that is, the goal of the source is to send the right amount of information in order for the intended destination to execute a task. More specifically, we restrict our attention to how the source should quantize information so that the destinat... |
2403.17826 | Marcel Steinmetz | Gregor Behnke, Marcel Steinmetz | On the Computational Complexity of Stackelberg Planning and
Meta-Operator Verification: Technical Report | Presented at ICAPS24 | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | Stackelberg planning is a recently introduced single-turn two-player
adversarial planning model, where two players are acting in a joint classical
planning task, the objective of the first player being hampering the second
player from achieving its goal. This places the Stackelberg planning problem
somewhere between ... | [
{
"created": "Tue, 26 Mar 2024 16:06:33 GMT",
"version": "v1"
}
] | 2024-03-27 | [
[
"Behnke",
"Gregor",
""
],
[
"Steinmetz",
"Marcel",
""
]
] | Stackelberg planning is a recently introduced single-turn two-player adversarial planning model, where two players are acting in a joint classical planning task, the objective of the first player being hampering the second player from achieving its goal. This places the Stackelberg planning problem somewhere between cl... |
2201.02304 | Yan Shipeng | Shipeng Yan, Songyang Zhang, Xuming He | Budget-aware Few-shot Learning via Graph Convolutional Network | null | null | null | null | cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | This paper tackles the problem of few-shot learning, which aims to learn new
visual concepts from a few examples. A common problem setting in few-shot
classification assumes random sampling strategy in acquiring data labels, which
is inefficient in practical applications. In this work, we introduce a new
budget-aware... | [
{
"created": "Fri, 7 Jan 2022 02:46:35 GMT",
"version": "v1"
}
] | 2022-01-10 | [
[
"Yan",
"Shipeng",
""
],
[
"Zhang",
"Songyang",
""
],
[
"He",
"Xuming",
""
]
] | This paper tackles the problem of few-shot learning, which aims to learn new visual concepts from a few examples. A common problem setting in few-shot classification assumes random sampling strategy in acquiring data labels, which is inefficient in practical applications. In this work, we introduce a new budget-aware f... |
2209.09493 | Marek Gagolewski | Marek Gagolewski | A framework for benchmarking clustering algorithms | This preprint includes some minor corrections | SoftwareX 20 (2022) 101270 | 10.1016/j.softx.2022.101270 | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | The evaluation of clustering algorithms can involve running them on a variety
of benchmark problems, and comparing their outputs to the reference,
ground-truth groupings provided by experts. Unfortunately, many research papers
and graduate theses consider only a small number of datasets. Also, the fact
that there can... | [
{
"created": "Tue, 20 Sep 2022 06:10:41 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Dec 2022 22:53:54 GMT",
"version": "v2"
},
{
"created": "Wed, 25 Oct 2023 22:32:18 GMT",
"version": "v3"
}
] | 2023-10-27 | [
[
"Gagolewski",
"Marek",
""
]
] | The evaluation of clustering algorithms can involve running them on a variety of benchmark problems, and comparing their outputs to the reference, ground-truth groupings provided by experts. Unfortunately, many research papers and graduate theses consider only a small number of datasets. Also, the fact that there can b... |
0903.0548 | Li Chia Choo | Li-Chia Choo and Kai-Kit Wong | On the 3-Receiver Broadcast Channel with Degraded Message Sets and
Confidential Messages | Revised version submiitted to IEEE Transactions on Information Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, bounds to the rate-equivocation region for the general
3-receiver broadcast channel (BC) with degraded message sets, are presented for
confidential messages to be kept secret from one of the receivers. This model
is more general than the 2-receiver BCs with confidential messages with an
external wireta... | [
{
"created": "Tue, 3 Mar 2009 14:53:11 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Oct 2009 16:10:28 GMT",
"version": "v2"
}
] | 2009-10-27 | [
[
"Choo",
"Li-Chia",
""
],
[
"Wong",
"Kai-Kit",
""
]
] | In this paper, bounds to the rate-equivocation region for the general 3-receiver broadcast channel (BC) with degraded message sets, are presented for confidential messages to be kept secret from one of the receivers. This model is more general than the 2-receiver BCs with confidential messages with an external wiretapp... |
2304.09677 | Ashkan Mirzaei | Ashkan Mirzaei, Tristan Aumentado-Armstrong, Marcus A. Brubaker,
Jonathan Kelly, Alex Levinshtein, Konstantinos G. Derpanis, Igor
Gilitschenski | Reference-guided Controllable Inpainting of Neural Radiance Fields | Project Page: https://ashmrz.github.io/reference-guided-3d | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The popularity of Neural Radiance Fields (NeRFs) for view synthesis has led
to a desire for NeRF editing tools. Here, we focus on inpainting regions in a
view-consistent and controllable manner. In addition to the typical NeRF inputs
and masks delineating the unwanted region in each view, we require only a
single inp... | [
{
"created": "Wed, 19 Apr 2023 14:11:21 GMT",
"version": "v1"
},
{
"created": "Thu, 20 Apr 2023 15:19:12 GMT",
"version": "v2"
}
] | 2023-04-21 | [
[
"Mirzaei",
"Ashkan",
""
],
[
"Aumentado-Armstrong",
"Tristan",
""
],
[
"Brubaker",
"Marcus A.",
""
],
[
"Kelly",
"Jonathan",
""
],
[
"Levinshtein",
"Alex",
""
],
[
"Derpanis",
"Konstantinos G.",
""
],
[
"Gilitschen... | The popularity of Neural Radiance Fields (NeRFs) for view synthesis has led to a desire for NeRF editing tools. Here, we focus on inpainting regions in a view-consistent and controllable manner. In addition to the typical NeRF inputs and masks delineating the unwanted region in each view, we require only a single inpai... |
2103.07246 | Beomyoung Kim | Beomyoung Kim, Sangeun Han, Junmo Kim | Discriminative Region Suppression for Weakly-Supervised Semantic
Segmentation | AAAI 2021, Accepted | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Weakly-supervised semantic segmentation (WSSS) using image-level labels has
recently attracted much attention for reducing annotation costs. Existing WSSS
methods utilize localization maps from the classification network to generate
pseudo segmentation labels. However, since localization maps obtained from the
classi... | [
{
"created": "Fri, 12 Mar 2021 12:56:06 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Apr 2021 09:09:41 GMT",
"version": "v2"
}
] | 2021-04-06 | [
[
"Kim",
"Beomyoung",
""
],
[
"Han",
"Sangeun",
""
],
[
"Kim",
"Junmo",
""
]
] | Weakly-supervised semantic segmentation (WSSS) using image-level labels has recently attracted much attention for reducing annotation costs. Existing WSSS methods utilize localization maps from the classification network to generate pseudo segmentation labels. However, since localization maps obtained from the classifi... |
0808.4156 | Shirin Jalali | Shirin Jalali, Tsachy Weissman | Rate-Distortion via Markov Chain Monte Carlo | 35 pages, 16 figures, Submitted to IEEE Transactions on Information
Theory | null | 10.1109/ISIT.2008.4595107 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose an approach to lossy source coding, utilizing ideas from Gibbs
sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is
to sample a reconstruction sequence from a Boltzmann distribution associated
with an energy function that incorporates the distortion between the source and
reconst... | [
{
"created": "Fri, 29 Aug 2008 19:23:16 GMT",
"version": "v1"
},
{
"created": "Fri, 7 May 2010 18:02:18 GMT",
"version": "v2"
}
] | 2016-11-17 | [
[
"Jalali",
"Shirin",
""
],
[
"Weissman",
"Tsachy",
""
]
] | We propose an approach to lossy source coding, utilizing ideas from Gibbs sampling, simulated annealing, and Markov Chain Monte Carlo (MCMC). The idea is to sample a reconstruction sequence from a Boltzmann distribution associated with an energy function that incorporates the distortion between the source and reconstru... |
2310.01088 | Kentaro Mitsui | Kentaro Mitsui, Yukiya Hono, Kei Sawada | Towards human-like spoken dialogue generation between AI agents from
written dialogue | 18 pages, 8 figures, 9 tables, audio samples:
https://rinnakk.github.io/research/publications/CHATS/ | null | null | null | cs.CL cs.LG cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The advent of large language models (LLMs) has made it possible to generate
natural written dialogues between two agents. However, generating human-like
spoken dialogues from these written dialogues remains challenging. Spoken
dialogues have several unique characteristics: they frequently include
backchannels and lau... | [
{
"created": "Mon, 2 Oct 2023 11:03:20 GMT",
"version": "v1"
}
] | 2023-10-03 | [
[
"Mitsui",
"Kentaro",
""
],
[
"Hono",
"Yukiya",
""
],
[
"Sawada",
"Kei",
""
]
] | The advent of large language models (LLMs) has made it possible to generate natural written dialogues between two agents. However, generating human-like spoken dialogues from these written dialogues remains challenging. Spoken dialogues have several unique characteristics: they frequently include backchannels and laugh... |
2106.00477 | Antti Koskela | Antti Koskela, Mikko A. Heikkil\"a, Antti Honkela | Tight Accounting in the Shuffle Model of Differential Privacy | 21 pages, 5 figures | null | null | null | cs.CR cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Shuffle model of differential privacy is a novel distributed privacy model
based on a combination of local privacy mechanisms and a secure shuffler. It
has been shown that the additional randomisation provided by the shuffler
improves privacy bounds compared to the purely local mechanisms. Accounting
tight bounds, ho... | [
{
"created": "Tue, 1 Jun 2021 13:30:32 GMT",
"version": "v1"
},
{
"created": "Wed, 3 Nov 2021 14:47:36 GMT",
"version": "v2"
},
{
"created": "Mon, 31 Jan 2022 21:38:37 GMT",
"version": "v3"
}
] | 2022-02-02 | [
[
"Koskela",
"Antti",
""
],
[
"Heikkilä",
"Mikko A.",
""
],
[
"Honkela",
"Antti",
""
]
] | Shuffle model of differential privacy is a novel distributed privacy model based on a combination of local privacy mechanisms and a secure shuffler. It has been shown that the additional randomisation provided by the shuffler improves privacy bounds compared to the purely local mechanisms. Accounting tight bounds, howe... |
2005.11040 | Yuki Ueda | Yuki Ueda, Takashi Ishio, Akinori Ihara, Kenichi Matsumoto | DevReplay: Automatic Repair with Editable Fix Pattern | null | null | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Static analysis tools, or linters, detect violation of source code
conventions to maintain project readability. Those tools automatically fix
specific violations while developers edit the source code. However, existing
tools are designed for the general conventions of programming languages. These
tools do not check t... | [
{
"created": "Fri, 22 May 2020 07:36:08 GMT",
"version": "v1"
}
] | 2020-05-25 | [
[
"Ueda",
"Yuki",
""
],
[
"Ishio",
"Takashi",
""
],
[
"Ihara",
"Akinori",
""
],
[
"Matsumoto",
"Kenichi",
""
]
] | Static analysis tools, or linters, detect violation of source code conventions to maintain project readability. Those tools automatically fix specific violations while developers edit the source code. However, existing tools are designed for the general conventions of programming languages. These tools do not check the... |
1609.00833 | Nan Liu | Tianyu Yang, Nan Liu, Wei Kang, Shlomo Shamai | An Upper Bound on the Sum Capacity of the Downlink Multicell Processing
with Finite Backhaul Capacity | 23 pages, 4 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we study upper bounds on the sum capacity of the downlink
multicell processing model with finite backhaul capacity for the simple case of
2 base stations and 2 mobile users. It is modelled as a two-user multiple
access diamond channel. It consists of a first hop from the central processor
to the base s... | [
{
"created": "Sat, 3 Sep 2016 14:52:21 GMT",
"version": "v1"
}
] | 2016-09-06 | [
[
"Yang",
"Tianyu",
""
],
[
"Liu",
"Nan",
""
],
[
"Kang",
"Wei",
""
],
[
"Shamai",
"Shlomo",
""
]
] | In this paper, we study upper bounds on the sum capacity of the downlink multicell processing model with finite backhaul capacity for the simple case of 2 base stations and 2 mobile users. It is modelled as a two-user multiple access diamond channel. It consists of a first hop from the central processor to the base sta... |
2406.20085 | Yicheng Chen | Yicheng Chen, Xiangtai Li, Yining Li, Yanhong Zeng, Jianzong Wu,
Xiangyu Zhao, Kai Chen | Auto Cherry-Picker: Learning from High-quality Generative Data Driven by
Language | 19 pages, 7 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Diffusion-based models have shown great potential in generating high-quality
images with various layouts, which can benefit downstream perception tasks.
However, a fully automatic layout generation driven only by language and a
suitable metric for measuring multiple generated instances has not been well
explored. In ... | [
{
"created": "Fri, 28 Jun 2024 17:53:18 GMT",
"version": "v1"
}
] | 2024-07-01 | [
[
"Chen",
"Yicheng",
""
],
[
"Li",
"Xiangtai",
""
],
[
"Li",
"Yining",
""
],
[
"Zeng",
"Yanhong",
""
],
[
"Wu",
"Jianzong",
""
],
[
"Zhao",
"Xiangyu",
""
],
[
"Chen",
"Kai",
""
]
] | Diffusion-based models have shown great potential in generating high-quality images with various layouts, which can benefit downstream perception tasks. However, a fully automatic layout generation driven only by language and a suitable metric for measuring multiple generated instances has not been well explored. In th... |
2211.11682 | Xiangyang Zhu | Xiangyang Zhu, Renrui Zhang, Bowei He, Ziyu Guo, Ziyao Zeng, Zipeng
Qin, Shanghang Zhang, Peng Gao | PointCLIP V2: Prompting CLIP and GPT for Powerful 3D Open-world Learning | Code is available at https://github.com/yangyangyang127/PointCLIP_V2 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large-scale pre-trained models have shown promising open-world performance
for both vision and language tasks. However, their transferred capacity on 3D
point clouds is still limited and only constrained to the classification task.
In this paper, we first collaborate CLIP and GPT to be a unified 3D open-world
learner... | [
{
"created": "Mon, 21 Nov 2022 17:52:43 GMT",
"version": "v1"
},
{
"created": "Sat, 26 Aug 2023 16:14:09 GMT",
"version": "v2"
}
] | 2023-08-29 | [
[
"Zhu",
"Xiangyang",
""
],
[
"Zhang",
"Renrui",
""
],
[
"He",
"Bowei",
""
],
[
"Guo",
"Ziyu",
""
],
[
"Zeng",
"Ziyao",
""
],
[
"Qin",
"Zipeng",
""
],
[
"Zhang",
"Shanghang",
""
],
[
"Gao",
"Peng"... | Large-scale pre-trained models have shown promising open-world performance for both vision and language tasks. However, their transferred capacity on 3D point clouds is still limited and only constrained to the classification task. In this paper, we first collaborate CLIP and GPT to be a unified 3D open-world learner, ... |
2007.02370 | Adel Nabli | Adel Nabli, Margarida Carvalho, Pierre Hosteins | Complexity of the Multilevel Critical Node Problem | null | null | null | null | cs.CC cs.DM cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we analyze a sequential game played in a graph called the
Multilevel Critical Node problem (MCN). A defender and an attacker are the
players of this game. The defender starts by preventively interdicting vertices
(vaccination) from being attacked. Then, the attacker infects a subset of
non-vaccinated ve... | [
{
"created": "Sun, 5 Jul 2020 15:54:53 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Oct 2020 14:22:48 GMT",
"version": "v2"
}
] | 2020-10-05 | [
[
"Nabli",
"Adel",
""
],
[
"Carvalho",
"Margarida",
""
],
[
"Hosteins",
"Pierre",
""
]
] | In this work, we analyze a sequential game played in a graph called the Multilevel Critical Node problem (MCN). A defender and an attacker are the players of this game. The defender starts by preventively interdicting vertices (vaccination) from being attacked. Then, the attacker infects a subset of non-vaccinated vert... |
1605.03079 | Wassim Jerbi | Wassim Jerbi, Abderrahmen Guermazi, Hafedh Trabelsi | A novel clustering algorithm for coverage a large scale in WSN | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The applications require coverage of the whole monitored area for long
periods of time. Clustering is a way to reduce communications, minimize energy
consumption and organize messages among the cluster head and their members. The
message exchange of communication and data transmission between the different
sensor nod... | [
{
"created": "Tue, 10 May 2016 16:16:13 GMT",
"version": "v1"
}
] | 2016-05-11 | [
[
"Jerbi",
"Wassim",
""
],
[
"Guermazi",
"Abderrahmen",
""
],
[
"Trabelsi",
"Hafedh",
""
]
] | The applications require coverage of the whole monitored area for long periods of time. Clustering is a way to reduce communications, minimize energy consumption and organize messages among the cluster head and their members. The message exchange of communication and data transmission between the different sensor nodes... |
2011.13200 | Sourav Dutta | Silviu Oprea and Sourav Dutta and Haytham Assem | Unsupervised Word Translation Pairing using Refinement based Point Set
Registration | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Cross-lingual alignment of word embeddings play an important role in
knowledge transfer across languages, for improving machine translation and
other multi-lingual applications. Current unsupervised approaches rely on
similarities in geometric structure of word embedding spaces across languages,
to learn structure-pr... | [
{
"created": "Thu, 26 Nov 2020 09:51:29 GMT",
"version": "v1"
}
] | 2020-11-30 | [
[
"Oprea",
"Silviu",
""
],
[
"Dutta",
"Sourav",
""
],
[
"Assem",
"Haytham",
""
]
] | Cross-lingual alignment of word embeddings play an important role in knowledge transfer across languages, for improving machine translation and other multi-lingual applications. Current unsupervised approaches rely on similarities in geometric structure of word embedding spaces across languages, to learn structure-pres... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.