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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1612.09251 | Evgenia (Eugenia) Ternovska | Eugenia Ternovska | Lifted Relational Algebra with Recursion and Connections to Modal Logic | null | null | null | null | cs.LO cs.AI cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new formalism for specifying and reasoning about problems that
involve heterogeneous "pieces of information" -- large collections of data,
decision procedures of any kind and complexity and connections between them.
The essence of our proposal is to lift Codd's relational algebra from
operations on relat... | [
{
"created": "Thu, 29 Dec 2016 19:17:31 GMT",
"version": "v1"
}
] | 2016-12-30 | [
[
"Ternovska",
"Eugenia",
""
]
] | We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence of our proposal is to lift Codd's relational algebra from operations on relatio... |
1708.03792 | Debasish Pattanayak | Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal and Stefan
Schmid | Evacuating Two Robots from Two Unknown Exits on the Perimeter of a Disk | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Distributed evacuation of mobile robots is a recent development. We consider
the evacuation problem of two robots which are initially located at the center
of a unit disk. Both the robots have to evacuate the disk through the exits
situated on the perimeter of the disk at an unknown location. The distance
between two... | [
{
"created": "Sat, 12 Aug 2017 16:04:17 GMT",
"version": "v1"
}
] | 2017-08-15 | [
[
"Pattanayak",
"Debasish",
""
],
[
"Ramesh",
"H.",
""
],
[
"Mandal",
"Partha Sarathi",
""
],
[
"Schmid",
"Stefan",
""
]
] | Distributed evacuation of mobile robots is a recent development. We consider the evacuation problem of two robots which are initially located at the center of a unit disk. Both the robots have to evacuate the disk through the exits situated on the perimeter of the disk at an unknown location. The distance between two e... |
2003.05898 | Michael Benedikt | Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, and
Miguel Romero | On monotonic determinacy and rewritability for recursive queries and
views | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A query Q is monotonically determined over a set of views if Q can be
expressed as a monotonic function of the view image. In the case of relational
algebra views and queries, monotonic determinacy coincides with rewritability
as a union of conjunctive queries, and it is decidable in important special
cases, such as ... | [
{
"created": "Thu, 12 Mar 2020 16:56:13 GMT",
"version": "v1"
}
] | 2020-03-13 | [
[
"Benedikt",
"Michael",
""
],
[
"Kikot",
"Stanislav",
""
],
[
"Ostropolski-Nalewaja",
"Piotr",
""
],
[
"Romero",
"Miguel",
""
]
] | A query Q is monotonically determined over a set of views if Q can be expressed as a monotonic function of the view image. In the case of relational algebra views and queries, monotonic determinacy coincides with rewritability as a union of conjunctive queries, and it is decidable in important special cases, such as fo... |
1909.04313 | Quang-Cuong Pham | Hung Pham and Quang-Cuong Pham | Convex Controller Synthesis for Robot Contact | 8 pages, 7 figures | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Controlling contacts is truly challenging, and this has been a major hurdle
to deploying industrial robots into unstructured/human-centric environments.
More specifically, the main challenges are: (i) how to ensure stability at all
times; (ii) how to satisfy task-specific performance specifications; (iii) how
to achi... | [
{
"created": "Tue, 10 Sep 2019 06:26:28 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Jan 2020 04:16:25 GMT",
"version": "v2"
}
] | 2020-01-17 | [
[
"Pham",
"Hung",
""
],
[
"Pham",
"Quang-Cuong",
""
]
] | Controlling contacts is truly challenging, and this has been a major hurdle to deploying industrial robots into unstructured/human-centric environments. More specifically, the main challenges are: (i) how to ensure stability at all times; (ii) how to satisfy task-specific performance specifications; (iii) how to achiev... |
2205.12854 | Liyan Tang | Liyan Tang, Tanya Goyal, Alexander R. Fabbri, Philippe Laban, Jiacheng
Xu, Semih Yavuz, Wojciech Kry\'sci\'nski, Justin F. Rousseau, Greg Durrett | Understanding Factual Errors in Summarization: Errors, Summarizers,
Datasets, Error Detectors | Accepted to ACL 2023 | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The propensity of abstractive summarization models to make factual errors has
been studied extensively, including design of metrics to detect factual errors
and annotation of errors in current systems' outputs. However, the
ever-evolving nature of summarization systems, metrics, and annotated
benchmarks makes factual... | [
{
"created": "Wed, 25 May 2022 15:26:48 GMT",
"version": "v1"
},
{
"created": "Fri, 26 May 2023 00:21:51 GMT",
"version": "v2"
}
] | 2023-05-29 | [
[
"Tang",
"Liyan",
""
],
[
"Goyal",
"Tanya",
""
],
[
"Fabbri",
"Alexander R.",
""
],
[
"Laban",
"Philippe",
""
],
[
"Xu",
"Jiacheng",
""
],
[
"Yavuz",
"Semih",
""
],
[
"Kryściński",
"Wojciech",
""
],
[
... | The propensity of abstractive summarization models to make factual errors has been studied extensively, including design of metrics to detect factual errors and annotation of errors in current systems' outputs. However, the ever-evolving nature of summarization systems, metrics, and annotated benchmarks makes factualit... |
2001.09783 | Priyank Faldu | Priyank Faldu and Jeff Diamond and Boris Grot | Domain-Specialized Cache Management for Graph Analytics | No content changes from the previous version | null | null | null | cs.DC cs.PF | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph analytics power a range of applications in areas as diverse as finance,
networking and business logistics. A common property of graphs used in the
domain of graph analytics is a power-law distribution of vertex connectivity,
wherein a small number of vertices are responsible for a high fraction of all
connectio... | [
{
"created": "Wed, 22 Jan 2020 18:46:26 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Jan 2020 11:40:31 GMT",
"version": "v2"
}
] | 2020-01-29 | [
[
"Faldu",
"Priyank",
""
],
[
"Diamond",
"Jeff",
""
],
[
"Grot",
"Boris",
""
]
] | Graph analytics power a range of applications in areas as diverse as finance, networking and business logistics. A common property of graphs used in the domain of graph analytics is a power-law distribution of vertex connectivity, wherein a small number of vertices are responsible for a high fraction of all connections... |
2301.06474 | Geovana Ramos Sousa Silva | Geovana Ramos Sousa Silva and Edna Dias Canedo | Towards User-Centric Guidelines for Chatbot Conversational Design | International Journal of Human-Computer Interaction (2022) | null | 10.1080/10447318.2022.2118244 | null | cs.HC | http://creativecommons.org/licenses/by-nc-nd/4.0/ | The conversational nature of chatbots poses challenges to designers since
their development is different from other software and requires investigating
new practices in the context of human-AI interaction and their impact on user
experience. Therefore, this work aims to unveil chatbot conversational
practices alongsi... | [
{
"created": "Mon, 16 Jan 2023 15:24:42 GMT",
"version": "v1"
}
] | 2023-01-18 | [
[
"Silva",
"Geovana Ramos Sousa",
""
],
[
"Canedo",
"Edna Dias",
""
]
] | The conversational nature of chatbots poses challenges to designers since their development is different from other software and requires investigating new practices in the context of human-AI interaction and their impact on user experience. Therefore, this work aims to unveil chatbot conversational practices alongside... |
2212.10869 | Ufuk Uyan | Ufuk Uyan, M. Tugberk Isyapar, Mahiye Uluyagmur Ozturk | 5G Long-Term and Large-Scale Mobile Traffic Forecasting | null | null | null | null | cs.LG cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | It is crucial for the service provider to comprehend and forecast mobile
traffic in large-scale cellular networks in order to govern and manage
mechanisms for base station placement, load balancing, and network planning.
The purpose of this article is to extract and simulate traffic patterns from
more than 14,000 cel... | [
{
"created": "Wed, 21 Dec 2022 09:26:33 GMT",
"version": "v1"
}
] | 2022-12-22 | [
[
"Uyan",
"Ufuk",
""
],
[
"Isyapar",
"M. Tugberk",
""
],
[
"Ozturk",
"Mahiye Uluyagmur",
""
]
] | It is crucial for the service provider to comprehend and forecast mobile traffic in large-scale cellular networks in order to govern and manage mechanisms for base station placement, load balancing, and network planning. The purpose of this article is to extract and simulate traffic patterns from more than 14,000 cells... |
1610.07707 | Xiaowang Zhang | Xiaowang Zhang and Jiahui Zhang and Muhammad Qasim Yasin and Wenrui Wu
and Zhiyong Feng | Path discovery by Querying the federation of Relational Database and RDF
Graph | 11 pages | null | null | null | cs.DB | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The class of queries for detecting path is an important as those can extract
implicit binary relations over the nodes of input graphs. Most of the path
querying languages used by the RDF community, like property paths in W3C SPARQL
1.1 and nested regular expressions in nSPARQL are based on the regular
expressions. Fe... | [
{
"created": "Tue, 25 Oct 2016 02:12:45 GMT",
"version": "v1"
}
] | 2016-10-26 | [
[
"Zhang",
"Xiaowang",
""
],
[
"Zhang",
"Jiahui",
""
],
[
"Yasin",
"Muhammad Qasim",
""
],
[
"Wu",
"Wenrui",
""
],
[
"Feng",
"Zhiyong",
""
]
] | The class of queries for detecting path is an important as those can extract implicit binary relations over the nodes of input graphs. Most of the path querying languages used by the RDF community, like property paths in W3C SPARQL 1.1 and nested regular expressions in nSPARQL are based on the regular expressions. Fede... |
1409.6611 | Bernhard Rumpe | Jean B\'ezivin, Bernhard Rumpe, Andy Sch\"urr, Laurence Tratt | Model Transformations in Practice Workshop (MTiP) | 8 pages, 4 figures | Satellite Events at the MoDELS 2005 Conference, MoDELS 2005. J-M
Bruel (Ed.), LNCS 3844. Springer, January 2006 | null | null | cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Model Transformations in Practice (MTiP) 2005 was a workshop which provided a
forum for the model transformation community to discuss practical model
transformation issues. Although many different model transformation approaches
have been proposed and explored in recent years, there has been little work on
comparing ... | [
{
"created": "Mon, 22 Sep 2014 17:12:43 GMT",
"version": "v1"
}
] | 2014-09-24 | [
[
"Bézivin",
"Jean",
""
],
[
"Rumpe",
"Bernhard",
""
],
[
"Schürr",
"Andy",
""
],
[
"Tratt",
"Laurence",
""
]
] | Model Transformations in Practice (MTiP) 2005 was a workshop which provided a forum for the model transformation community to discuss practical model transformation issues. Although many different model transformation approaches have been proposed and explored in recent years, there has been little work on comparing an... |
2110.01183 | Amogh Joshi | Amogh Joshi, Cody Buntain | Examining Similar and Ideologically Correlated Imagery in Online
Political Communication | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by/4.0/ | This paper investigates visual media shared by US national politicians on
Twitter, how a politician's variety of image types shared reflects their
political position, and identifies a hazard in using standard methods for image
characterization in this context. While past work has yielded valuable results
on politicia... | [
{
"created": "Mon, 4 Oct 2021 04:45:10 GMT",
"version": "v1"
},
{
"created": "Sat, 15 Jan 2022 19:03:43 GMT",
"version": "v2"
},
{
"created": "Mon, 31 Jul 2023 15:49:56 GMT",
"version": "v3"
}
] | 2023-08-01 | [
[
"Joshi",
"Amogh",
""
],
[
"Buntain",
"Cody",
""
]
] | This paper investigates visual media shared by US national politicians on Twitter, how a politician's variety of image types shared reflects their political position, and identifies a hazard in using standard methods for image characterization in this context. While past work has yielded valuable results on politicians... |
1111.7088 | Hao Shen | Martin Kleinsteuber and Hao Shen | Uniqueness Analysis of Non-Unitary Matrix Joint Diagonalization | 23 pages | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by-nc-sa/3.0/ | Matrix Joint Diagonalization (MJD) is a powerful approach for solving the
Blind Source Separation (BSS) problem. It relies on the construction of
matrices which are diagonalized by the unknown demixing matrix. Their joint
diagonalizer serves as a correct estimate of this demixing matrix only if it is
uniquely determi... | [
{
"created": "Wed, 30 Nov 2011 09:10:01 GMT",
"version": "v1"
},
{
"created": "Thu, 1 Dec 2011 07:44:15 GMT",
"version": "v2"
},
{
"created": "Wed, 4 Apr 2012 08:51:58 GMT",
"version": "v3"
}
] | 2012-04-05 | [
[
"Kleinsteuber",
"Martin",
""
],
[
"Shen",
"Hao",
""
]
] | Matrix Joint Diagonalization (MJD) is a powerful approach for solving the Blind Source Separation (BSS) problem. It relies on the construction of matrices which are diagonalized by the unknown demixing matrix. Their joint diagonalizer serves as a correct estimate of this demixing matrix only if it is uniquely determine... |
1511.06241 | Aysegul Dundar | Aysegul Dundar, Jonghoon Jin and Eugenio Culurciello | Convolutional Clustering for Unsupervised Learning | 11 pages | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The task of labeling data for training deep neural networks is daunting and
tedious, requiring millions of labels to achieve the current state-of-the-art
results. Such reliance on large amounts of labeled data can be relaxed by
exploiting hierarchical features via unsupervised learning techniques. In this
work, we pr... | [
{
"created": "Thu, 19 Nov 2015 16:31:46 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Feb 2016 16:46:53 GMT",
"version": "v2"
}
] | 2016-02-17 | [
[
"Dundar",
"Aysegul",
""
],
[
"Jin",
"Jonghoon",
""
],
[
"Culurciello",
"Eugenio",
""
]
] | The task of labeling data for training deep neural networks is daunting and tedious, requiring millions of labels to achieve the current state-of-the-art results. Such reliance on large amounts of labeled data can be relaxed by exploiting hierarchical features via unsupervised learning techniques. In this work, we prop... |
2306.15457 | Hong Joo Lee | Hong Joo Lee, Yong Man Ro | Robust Proxy: Improving Adversarial Robustness by Robust Proxy Learning | Accepted at IEEE Transactions on Information Forensics and Security
(TIFS) | null | 10.1109/TIFS.2023.3288672 | null | cs.CV cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, it has been widely known that deep neural networks are highly
vulnerable and easily broken by adversarial attacks. To mitigate the
adversarial vulnerability, many defense algorithms have been proposed.
Recently, to improve adversarial robustness, many works try to enhance feature
representation by imposing ... | [
{
"created": "Tue, 27 Jun 2023 13:22:19 GMT",
"version": "v1"
}
] | 2023-06-28 | [
[
"Lee",
"Hong Joo",
""
],
[
"Ro",
"Yong Man",
""
]
] | Recently, it has been widely known that deep neural networks are highly vulnerable and easily broken by adversarial attacks. To mitigate the adversarial vulnerability, many defense algorithms have been proposed. Recently, to improve adversarial robustness, many works try to enhance feature representation by imposing mo... |
2110.05594 | Dr. Suryansh Kumar | Berk Kaya, Suryansh Kumar, Francesco Sarno, Vittorio Ferrari, Luc Van
Gool | Neural Radiance Fields Approach to Deep Multi-View Photometric Stereo | Accepted for publication at IEEE/CVF WACV 2022. 18 pages | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a modern solution to the multi-view photometric stereo problem
(MVPS). Our work suitably exploits the image formation model in a MVPS
experimental setup to recover the dense 3D reconstruction of an object from
images. We procure the surface orientation using a photometric stereo (PS)
image formation model ... | [
{
"created": "Mon, 11 Oct 2021 20:20:03 GMT",
"version": "v1"
}
] | 2021-10-13 | [
[
"Kaya",
"Berk",
""
],
[
"Kumar",
"Suryansh",
""
],
[
"Sarno",
"Francesco",
""
],
[
"Ferrari",
"Vittorio",
""
],
[
"Van Gool",
"Luc",
""
]
] | We present a modern solution to the multi-view photometric stereo problem (MVPS). Our work suitably exploits the image formation model in a MVPS experimental setup to recover the dense 3D reconstruction of an object from images. We procure the surface orientation using a photometric stereo (PS) image formation model an... |
1309.0719 | David Bryson | David M. Bryson and Charles Ofria | Understanding Evolutionary Potential in Virtual CPU Instruction Set
Architectures | null | PLOS ONE 8(12): e83242. (2013) | 10.1371/journal.pone.0083242 | null | cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate fundamental decisions in the design of instruction set
architectures for linear genetic programs that are used as both model systems
in evolutionary biology and underlying solution representations in evolutionary
computation. We subjected digital organisms with each tested architecture to
seven differe... | [
{
"created": "Tue, 3 Sep 2013 15:17:07 GMT",
"version": "v1"
},
{
"created": "Mon, 28 Oct 2013 17:41:23 GMT",
"version": "v2"
}
] | 2013-12-30 | [
[
"Bryson",
"David M.",
""
],
[
"Ofria",
"Charles",
""
]
] | We investigate fundamental decisions in the design of instruction set architectures for linear genetic programs that are used as both model systems in evolutionary biology and underlying solution representations in evolutionary computation. We subjected digital organisms with each tested architecture to seven different... |
2112.09810 | Kaize Ding | Kaize Ding, Jianling Wang, James Caverlee and Huan Liu | Meta Propagation Networks for Graph Few-shot Semi-supervised Learning | Accepted by AAAI2022 | null | null | null | cs.LG | http://creativecommons.org/licenses/by/4.0/ | Inspired by the extensive success of deep learning, graph neural networks
(GNNs) have been proposed to learn expressive node representations and
demonstrated promising performance in various graph learning tasks. However,
existing endeavors predominately focus on the conventional semi-supervised
setting where relativ... | [
{
"created": "Sat, 18 Dec 2021 00:11:56 GMT",
"version": "v1"
},
{
"created": "Fri, 1 Apr 2022 22:06:43 GMT",
"version": "v2"
}
] | 2022-04-05 | [
[
"Ding",
"Kaize",
""
],
[
"Wang",
"Jianling",
""
],
[
"Caverlee",
"James",
""
],
[
"Liu",
"Huan",
""
]
] | Inspired by the extensive success of deep learning, graph neural networks (GNNs) have been proposed to learn expressive node representations and demonstrated promising performance in various graph learning tasks. However, existing endeavors predominately focus on the conventional semi-supervised setting where relativel... |
1908.07831 | Hong-Ren Mao | Hongren Mao, Hung-yi Lee | Polly Want a Cracker: Analyzing Performance of Parroting on Paraphrase
Generation Datasets | Accepted for EMNLP 2019 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Paraphrase generation is an interesting and challenging NLP task which has
numerous practical applications. In this paper, we analyze datasets commonly
used for paraphrase generation research, and show that simply parroting input
sentences surpasses state-of-the-art models in the literature when evaluated on
standard... | [
{
"created": "Mon, 19 Aug 2019 05:40:42 GMT",
"version": "v1"
}
] | 2019-08-22 | [
[
"Mao",
"Hongren",
""
],
[
"Lee",
"Hung-yi",
""
]
] | Paraphrase generation is an interesting and challenging NLP task which has numerous practical applications. In this paper, we analyze datasets commonly used for paraphrase generation research, and show that simply parroting input sentences surpasses state-of-the-art models in the literature when evaluated on standard m... |
1904.11753 | Naoto Sato | Naoto Sato, Hironobu Kuruma, Yuichiroh Nakagawa, Hideto Ogawa | Formal Verification of Decision-Tree Ensemble Model and Detection of its
Violating-input-value Ranges | null | IEICE Transaction D, Feb, 2020 | 10.1587/transinf.2019EDP7120 | Vol.E103-D, No.02, pp.363-378 | cs.SE cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | As one type of machine-learning model, a "decision-tree ensemble model"
(DTEM) is represented by a set of decision trees. A DTEM is mainly known to be
valid for structured data; however, like other machine-learning models, it is
difficult to train so that it returns the correct output value for any input
value. Accor... | [
{
"created": "Fri, 26 Apr 2019 10:38:01 GMT",
"version": "v1"
}
] | 2020-05-25 | [
[
"Sato",
"Naoto",
""
],
[
"Kuruma",
"Hironobu",
""
],
[
"Nakagawa",
"Yuichiroh",
""
],
[
"Ogawa",
"Hideto",
""
]
] | As one type of machine-learning model, a "decision-tree ensemble model" (DTEM) is represented by a set of decision trees. A DTEM is mainly known to be valid for structured data; however, like other machine-learning models, it is difficult to train so that it returns the correct output value for any input value. Accordi... |
2304.14226 | Yueming Hao | Yueming Hao, Xu Zhao, Bin Bao, David Berard, Will Constable, Adnan
Aziz, Xu Liu | TorchBench: Benchmarking PyTorch with High API Surface Coverage | null | null | null | null | cs.LG cs.AI cs.PF | http://creativecommons.org/licenses/by/4.0/ | Deep learning (DL) has been a revolutionary technique in various domains. To
facilitate the model development and deployment, many deep learning frameworks
are proposed, among which PyTorch is one of the most popular solutions. The
performance of ecosystem around PyTorch is critically important, which saves
the costs... | [
{
"created": "Thu, 27 Apr 2023 14:37:05 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Apr 2023 19:56:19 GMT",
"version": "v2"
},
{
"created": "Sat, 24 Jun 2023 16:57:43 GMT",
"version": "v3"
}
] | 2023-06-27 | [
[
"Hao",
"Yueming",
""
],
[
"Zhao",
"Xu",
""
],
[
"Bao",
"Bin",
""
],
[
"Berard",
"David",
""
],
[
"Constable",
"Will",
""
],
[
"Aziz",
"Adnan",
""
],
[
"Liu",
"Xu",
""
]
] | Deep learning (DL) has been a revolutionary technique in various domains. To facilitate the model development and deployment, many deep learning frameworks are proposed, among which PyTorch is one of the most popular solutions. The performance of ecosystem around PyTorch is critically important, which saves the costs o... |
2111.08774 | Pinelopi Papalampidi | Pinelopi Papalampidi, Frank Keller, Mirella Lapata | Film Trailer Generation via Task Decomposition | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | Movie trailers perform multiple functions: they introduce viewers to the
story, convey the mood and artistic style of the film, and encourage audiences
to see the movie. These diverse functions make automatic trailer generation a
challenging endeavor. We decompose it into two subtasks: narrative structure
identificat... | [
{
"created": "Tue, 16 Nov 2021 20:50:52 GMT",
"version": "v1"
}
] | 2021-11-18 | [
[
"Papalampidi",
"Pinelopi",
""
],
[
"Keller",
"Frank",
""
],
[
"Lapata",
"Mirella",
""
]
] | Movie trailers perform multiple functions: they introduce viewers to the story, convey the mood and artistic style of the film, and encourage audiences to see the movie. These diverse functions make automatic trailer generation a challenging endeavor. We decompose it into two subtasks: narrative structure identificatio... |
2405.13483 | Jiancheng Tang | Jiancheng Tang, Qianqian Yang, Deniz G\"und\"uz | Distributed Indirect Source Coding with Decoder Side Information | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper studies a variant of the rate-distortion problem motivated by
task-oriented semantic communication and distributed learning problems, where
$M$ correlated sources are independently encoded for a central decoder. The
decoder has access to a correlated side information in addition to the messages
received fr... | [
{
"created": "Wed, 22 May 2024 09:48:21 GMT",
"version": "v1"
}
] | 2024-05-24 | [
[
"Tang",
"Jiancheng",
""
],
[
"Yang",
"Qianqian",
""
],
[
"Gündüz",
"Deniz",
""
]
] | This paper studies a variant of the rate-distortion problem motivated by task-oriented semantic communication and distributed learning problems, where $M$ correlated sources are independently encoded for a central decoder. The decoder has access to a correlated side information in addition to the messages received from... |
2312.10212 | Fabian Hinder | Fabian Hinder, Valerie Vaquet, Barbara Hammer | A Remark on Concept Drift for Dependent Data | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Concept drift, i.e., the change of the data generating distribution, can
render machine learning models inaccurate. Several works address the phenomenon
of concept drift in the streaming context usually assuming that consecutive
data points are independent of each other. To generalize to dependent data,
many authors ... | [
{
"created": "Fri, 15 Dec 2023 21:11:46 GMT",
"version": "v1"
}
] | 2023-12-19 | [
[
"Hinder",
"Fabian",
""
],
[
"Vaquet",
"Valerie",
""
],
[
"Hammer",
"Barbara",
""
]
] | Concept drift, i.e., the change of the data generating distribution, can render machine learning models inaccurate. Several works address the phenomenon of concept drift in the streaming context usually assuming that consecutive data points are independent of each other. To generalize to dependent data, many authors li... |
1701.01547 | Arun Singh | Arun Kumar Singh, Sigal Berman and Ilana Nisky | Stochastic Optimal Control for Modeling Reaching Movements in the
Presence of Obstacles: Theory and Simulation | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In many human-in-the-loop robotic applications such as robot-assisted surgery
and remote teleoperation, predicting the intended motion of the human operator
may be useful for successful implementation of shared control, guidance virtual
fixtures, and predictive control. Developing computational models of human
moveme... | [
{
"created": "Fri, 6 Jan 2017 05:27:38 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Mar 2018 20:27:30 GMT",
"version": "v2"
}
] | 2018-03-28 | [
[
"Singh",
"Arun Kumar",
""
],
[
"Berman",
"Sigal",
""
],
[
"Nisky",
"Ilana",
""
]
] | In many human-in-the-loop robotic applications such as robot-assisted surgery and remote teleoperation, predicting the intended motion of the human operator may be useful for successful implementation of shared control, guidance virtual fixtures, and predictive control. Developing computational models of human movement... |
2010.13415 | Yucheng Wang | Yucheng Wang, Bowen Yu, Yueyang Zhang, Tingwen Liu, Hongsong Zhu and
Limin Sun | TPLinker: Single-stage Joint Extraction of Entities and Relations
Through Token Pair Linking | COLING 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Extracting entities and relations from unstructured text has attracted
increasing attention in recent years but remains challenging, due to the
intrinsic difficulty in identifying overlapping relations with shared entities.
Prior works show that joint learning can result in a noticeable performance
gain. However, the... | [
{
"created": "Mon, 26 Oct 2020 08:35:06 GMT",
"version": "v1"
}
] | 2020-10-27 | [
[
"Wang",
"Yucheng",
""
],
[
"Yu",
"Bowen",
""
],
[
"Zhang",
"Yueyang",
""
],
[
"Liu",
"Tingwen",
""
],
[
"Zhu",
"Hongsong",
""
],
[
"Sun",
"Limin",
""
]
] | Extracting entities and relations from unstructured text has attracted increasing attention in recent years but remains challenging, due to the intrinsic difficulty in identifying overlapping relations with shared entities. Prior works show that joint learning can result in a noticeable performance gain. However, they ... |
cs/0404039 | Alexei Kaltchenko | Alexei Kaltchenko | Algorithms for Estimating Information Distance with Application to
Bioinformatics and Linguistics | 4 pages | null | null | null | cs.CC cs.CE q-bio.GN | null | After reviewing unnormalized and normalized information distances based on
incomputable notions of Kolmogorov complexity, we discuss how Kolmogorov
complexity can be approximated by data compression algorithms. We argue that
optimal algorithms for data compression with side information can be
successfully used to app... | [
{
"created": "Tue, 20 Apr 2004 15:18:43 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Kaltchenko",
"Alexei",
""
]
] | After reviewing unnormalized and normalized information distances based on incomputable notions of Kolmogorov complexity, we discuss how Kolmogorov complexity can be approximated by data compression algorithms. We argue that optimal algorithms for data compression with side information can be successfully used to appro... |
2003.09638 | Chuan Chen | Dalong Yang, Chuan Chen, Youhao Zheng, Zibin Zheng, Shih-wei Liao | An Uncoupled Training Architecture for Large Graph Learning | null | null | null | null | cs.LG cs.SI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph Convolutional Network (GCN) has been widely used in graph learning
tasks. However, GCN-based models (GCNs) is an inherently coupled training
framework repetitively conducting the complex neighboring aggregation, which
leads to the limitation of flexibility in processing large-scale graph. With
the depth of laye... | [
{
"created": "Sat, 21 Mar 2020 11:49:16 GMT",
"version": "v1"
},
{
"created": "Wed, 22 Jul 2020 03:32:29 GMT",
"version": "v2"
}
] | 2020-07-23 | [
[
"Yang",
"Dalong",
""
],
[
"Chen",
"Chuan",
""
],
[
"Zheng",
"Youhao",
""
],
[
"Zheng",
"Zibin",
""
],
[
"Liao",
"Shih-wei",
""
]
] | Graph Convolutional Network (GCN) has been widely used in graph learning tasks. However, GCN-based models (GCNs) is an inherently coupled training framework repetitively conducting the complex neighboring aggregation, which leads to the limitation of flexibility in processing large-scale graph. With the depth of layers... |
1702.06398 | Nitish Prajapati | Ayub Khan, Dinesh Khattar, Nitish Prajapati | Dual combination combination multi switching synchronization of eight
chaotic systems | 19 pages, 7 figures | null | 10.1016/j.cjph.2017.06.002 | null | cs.SY math.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, a novel scheme for synchronizing four drive and four response
systems is proposed by the authors. The idea of multi switching and dual
combination synchronization is extended to dual combination-combination multi
switching synchronization involving eight chaotic systems and is a first of its
kind. Due ... | [
{
"created": "Fri, 17 Feb 2017 11:32:47 GMT",
"version": "v1"
}
] | 2017-08-02 | [
[
"Khan",
"Ayub",
""
],
[
"Khattar",
"Dinesh",
""
],
[
"Prajapati",
"Nitish",
""
]
] | In this paper, a novel scheme for synchronizing four drive and four response systems is proposed by the authors. The idea of multi switching and dual combination synchronization is extended to dual combination-combination multi switching synchronization involving eight chaotic systems and is a first of its kind. Due to... |
2108.11309 | Robin Haunschild | Robin Haunschild and Lutz Bornmann | Report on Workshop III "Cited References Analysis Using CRExplorer" at
the 18th International Conference of the International Society for
Scientometrics and Informetrics (ISSI2021) | 6 pages, 1 figure | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We have organized Workshop III entitled "Cited References Analysis Using
CRExplorer" at ISSI2021. Here, we report and reflect on this workshop. The aim
of this workshop was to bring beginners, practitioners, and experts in cited
references analyses together. A mixture of presentations and an interactive
part was inte... | [
{
"created": "Wed, 25 Aug 2021 16:23:26 GMT",
"version": "v1"
}
] | 2021-08-26 | [
[
"Haunschild",
"Robin",
""
],
[
"Bornmann",
"Lutz",
""
]
] | We have organized Workshop III entitled "Cited References Analysis Using CRExplorer" at ISSI2021. Here, we report and reflect on this workshop. The aim of this workshop was to bring beginners, practitioners, and experts in cited references analyses together. A mixture of presentations and an interactive part was intend... |
1907.07509 | Guillaume Noyel | Guillaume Noyel (IPRI, SIGPH@iPRI) | A Link Between the Multiplicative and Additive Functional Asplund's
Metrics | null | 14th International Symposium on Mathematical Morphology, Saarland
University, Jul 2019, Saarbr\"ucken, Germany. pp.41-53 | 10.1007/978-3-030-20867-7_4 | null | cs.CV math.FA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Functional Asplund's metrics were recently introduced to perform pattern
matching robust to lighting changes thanks to double-sided probing in the
Logarithmic Image Processing (LIP) framework. Two metrics were defined, namely
the LIP-multiplicative Asplund's metric which is robust to variations of object
thickness (o... | [
{
"created": "Wed, 17 Jul 2019 13:32:58 GMT",
"version": "v1"
}
] | 2019-07-18 | [
[
"Noyel",
"Guillaume",
"",
"IPRI, SIGPH@iPRI"
]
] | Functional Asplund's metrics were recently introduced to perform pattern matching robust to lighting changes thanks to double-sided probing in the Logarithmic Image Processing (LIP) framework. Two metrics were defined, namely the LIP-multiplicative Asplund's metric which is robust to variations of object thickness (or ... |
2112.10250 | Palash Dey | Arnab Maiti, Palash Dey | Parameterized Algorithms for Kidney Exchange | 20 pages, appeared as an extended abstract in AAMAS 2022 and full
paper in IJCAI 2022 | null | null | null | cs.GT cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In kidney exchange programs, multiple patient-donor pairs each of whom are
otherwise incompatible, exchange their donors to receive compatible kidneys.
The Kidney Exchange problem is typically modelled as a directed graph where
every vertex is either an altruistic donor or a pair of patient and donor;
directed edges ... | [
{
"created": "Sun, 19 Dec 2021 20:32:35 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Jun 2024 10:02:37 GMT",
"version": "v2"
}
] | 2024-06-17 | [
[
"Maiti",
"Arnab",
""
],
[
"Dey",
"Palash",
""
]
] | In kidney exchange programs, multiple patient-donor pairs each of whom are otherwise incompatible, exchange their donors to receive compatible kidneys. The Kidney Exchange problem is typically modelled as a directed graph where every vertex is either an altruistic donor or a pair of patient and donor; directed edges ar... |
2206.09004 | Franz Mayr | Franz Mayr, Sergio Yovine, Federico Pan, Nicolas Basset, Thao Dang | Towards Efficient Active Learning of PDFA | 11 pages, 7 figures, workshop paper | null | null | null | cs.FL cs.AI cs.LG | http://creativecommons.org/licenses/by-sa/4.0/ | We propose a new active learning algorithm for PDFA based on three main
aspects: a congruence over states which takes into account next-symbol
probability distributions, a quantization that copes with differences in
distributions, and an efficient tree-based data structure. Experiments showed
significant performance ... | [
{
"created": "Fri, 17 Jun 2022 20:48:58 GMT",
"version": "v1"
}
] | 2022-06-22 | [
[
"Mayr",
"Franz",
""
],
[
"Yovine",
"Sergio",
""
],
[
"Pan",
"Federico",
""
],
[
"Basset",
"Nicolas",
""
],
[
"Dang",
"Thao",
""
]
] | We propose a new active learning algorithm for PDFA based on three main aspects: a congruence over states which takes into account next-symbol probability distributions, a quantization that copes with differences in distributions, and an efficient tree-based data structure. Experiments showed significant performance ga... |
2402.12315 | Xinran Wang | Xinran Wang and Nicolas Rojas | Cosserat Rod Modeling and Validation for a Soft Continuum Robot with
Self-Controllable Variable Curvature | Accepted for IEEE RoboSoft Conference 2024, April 14-17 | null | 10.1109/RoboSoft60065.2024.10522028 | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | This paper introduces a Cosserat rod based mathematical model for modeling a
self-controllable variable curvature soft continuum robot. This soft continuum
robot has a hollow inner channel and was developed with the ability to perform
variable curvature utilizing a growing spine. The growing spine is able to grow
and... | [
{
"created": "Mon, 19 Feb 2024 17:37:11 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Jun 2024 15:13:09 GMT",
"version": "v2"
}
] | 2024-06-28 | [
[
"Wang",
"Xinran",
""
],
[
"Rojas",
"Nicolas",
""
]
] | This paper introduces a Cosserat rod based mathematical model for modeling a self-controllable variable curvature soft continuum robot. This soft continuum robot has a hollow inner channel and was developed with the ability to perform variable curvature utilizing a growing spine. The growing spine is able to grow and r... |
0806.3799 | Sina Jafarpour | Robert Calderbank, Stephen Howard, Sina Jafarpour | A Sublinear Algorithm for Sparse Reconstruction with l2/l2 Recovery
Guarantees | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressed Sensing aims to capture attributes of a sparse signal using very
few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is
possible if the sensing matrix acts as a near isometry on all
$\boldsymbol{k}$-sparse signals. This property holds with overwhelming
probability if the entries of the m... | [
{
"created": "Tue, 24 Jun 2008 02:16:08 GMT",
"version": "v1"
},
{
"created": "Sat, 17 Oct 2009 22:54:03 GMT",
"version": "v2"
}
] | 2009-10-18 | [
[
"Calderbank",
"Robert",
""
],
[
"Howard",
"Stephen",
""
],
[
"Jafarpour",
"Sina",
""
]
] | Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all $\boldsymbol{k}$-sparse signals. This property holds with overwhelming probability if the entries of the mat... |
1806.08771 | David Feller | David Feller, Joe B. Wells, Fairouz Kamareddine (ULTRA), Sebastien
Carlier | What Does This Notation Mean Anyway? | null | null | null | null | cs.LO cs.FL cs.PL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Following the introduction of BNF notation by Backus for the Algol 60 report
and subsequent notational variants, a metalanguage involving formal "grammars"
has developed for discussing structured objects in Computer Science and
Mathematical Logic. We refer to this offspring of BNF as Math-BNF or MBNF, to
the original... | [
{
"created": "Tue, 12 Jun 2018 13:07:15 GMT",
"version": "v1"
}
] | 2018-06-25 | [
[
"Feller",
"David",
"",
"ULTRA"
],
[
"Wells",
"Joe B.",
"",
"ULTRA"
],
[
"Kamareddine",
"Fairouz",
"",
"ULTRA"
],
[
"Carlier",
"Sebastien",
""
]
] | Following the introduction of BNF notation by Backus for the Algol 60 report and subsequent notational variants, a metalanguage involving formal "grammars" has developed for discussing structured objects in Computer Science and Mathematical Logic. We refer to this offspring of BNF as Math-BNF or MBNF, to the original B... |
1607.08539 | Maciej Halber | Maciej Halber and Thomas Funkhouser | Fine-To-Coarse Global Registration of RGB-D Scans | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | RGB-D scanning of indoor environments is important for many applications,
including real estate, interior design, and virtual reality. However, it is
still challenging to register RGB-D images from a hand-held camera over a long
video sequence into a globally consistent 3D model. Current methods often can
lose tracki... | [
{
"created": "Thu, 28 Jul 2016 17:19:46 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Aug 2016 15:59:00 GMT",
"version": "v2"
},
{
"created": "Wed, 23 Nov 2016 04:55:29 GMT",
"version": "v3"
}
] | 2016-11-24 | [
[
"Halber",
"Maciej",
""
],
[
"Funkhouser",
"Thomas",
""
]
] | RGB-D scanning of indoor environments is important for many applications, including real estate, interior design, and virtual reality. However, it is still challenging to register RGB-D images from a hand-held camera over a long video sequence into a globally consistent 3D model. Current methods often can lose tracking... |
2406.13873 | Yu Song | Yu Song, Haitao Mao, Jiachen Xiao, Jingzhe Liu, Zhikai Chen, Wei Jin,
Carl Yang, Jiliang Tang, Hui Liu | A Pure Transformer Pretraining Framework on Text-attributed Graphs | null | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Pretraining plays a pivotal role in acquiring generalized knowledge from
large-scale data, achieving remarkable successes as evidenced by large models
in CV and NLP. However, progress in the graph domain remains limited due to
fundamental challenges such as feature heterogeneity and structural
heterogeneity. Recently... | [
{
"created": "Wed, 19 Jun 2024 22:30:08 GMT",
"version": "v1"
}
] | 2024-06-21 | [
[
"Song",
"Yu",
""
],
[
"Mao",
"Haitao",
""
],
[
"Xiao",
"Jiachen",
""
],
[
"Liu",
"Jingzhe",
""
],
[
"Chen",
"Zhikai",
""
],
[
"Jin",
"Wei",
""
],
[
"Yang",
"Carl",
""
],
[
"Tang",
"Jiliang",
... | Pretraining plays a pivotal role in acquiring generalized knowledge from large-scale data, achieving remarkable successes as evidenced by large models in CV and NLP. However, progress in the graph domain remains limited due to fundamental challenges such as feature heterogeneity and structural heterogeneity. Recently, ... |
1904.07451 | Yash Goyal | Yash Goyal and Ziyan Wu and Jan Ernst and Dhruv Batra and Devi Parikh
and Stefan Lee | Counterfactual Visual Explanations | null | null | null | null | cs.LG cs.AI cs.CV stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we develop a technique to produce counterfactual visual
explanations. Given a 'query' image $I$ for which a vision system predicts
class $c$, a counterfactual visual explanation identifies how $I$ could change
such that the system would output a different specified class $c'$. To do this,
we select a 'd... | [
{
"created": "Tue, 16 Apr 2019 04:16:11 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Jun 2019 16:49:55 GMT",
"version": "v2"
}
] | 2019-06-12 | [
[
"Goyal",
"Yash",
""
],
[
"Wu",
"Ziyan",
""
],
[
"Ernst",
"Jan",
""
],
[
"Batra",
"Dhruv",
""
],
[
"Parikh",
"Devi",
""
],
[
"Lee",
"Stefan",
""
]
] | In this work, we develop a technique to produce counterfactual visual explanations. Given a 'query' image $I$ for which a vision system predicts class $c$, a counterfactual visual explanation identifies how $I$ could change such that the system would output a different specified class $c'$. To do this, we select a 'dis... |
1309.6838 | Jean Honorio | Jean Honorio, Tommi S. Jaakkola | Inverse Covariance Estimation for High-Dimensional Data in Linear Time
and Space: Spectral Methods for Riccati and Sparse Models | Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty
in Artificial Intelligence (UAI2013) | Uncertainty in Artificial Intelligence (UAI), 2013 | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose maximum likelihood estimation for learning Gaussian graphical
models with a Gaussian (ell_2^2) prior on the parameters. This is in contrast
to the commonly used Laplace (ell_1) prior for encouraging sparseness. We show
that our optimization problem leads to a Riccati matrix equation, which has a
closed for... | [
{
"created": "Thu, 26 Sep 2013 12:41:38 GMT",
"version": "v1"
}
] | 2018-11-16 | [
[
"Honorio",
"Jean",
""
],
[
"Jaakkola",
"Tommi S.",
""
]
] | We propose maximum likelihood estimation for learning Gaussian graphical models with a Gaussian (ell_2^2) prior on the parameters. This is in contrast to the commonly used Laplace (ell_1) prior for encouraging sparseness. We show that our optimization problem leads to a Riccati matrix equation, which has a closed form ... |
1408.0845 | Tao Zhou | Jing Zhao, Lili Miao, Haiyang Fang, Qian-Ming Zhang, Min Nie, Tao Zhou | Predicting missing links and their weights via reliable-route-based
method | 5 pages, 4 tables | Scientific Reports 5 (2015) 12261 | 10.1038/srep12261 | null | cs.SI cs.IR physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Link prediction aims to uncover missing links or predict the emergence of
future relationships according to the current networks structure. Plenty of
algorithms have been developed for link prediction in unweighted networks, with
only a very few of them having been extended to weighted networks. Thus far,
how to pred... | [
{
"created": "Tue, 5 Aug 2014 01:07:41 GMT",
"version": "v1"
}
] | 2015-09-22 | [
[
"Zhao",
"Jing",
""
],
[
"Miao",
"Lili",
""
],
[
"Fang",
"Haiyang",
""
],
[
"Zhang",
"Qian-Ming",
""
],
[
"Nie",
"Min",
""
],
[
"Zhou",
"Tao",
""
]
] | Link prediction aims to uncover missing links or predict the emergence of future relationships according to the current networks structure. Plenty of algorithms have been developed for link prediction in unweighted networks, with only a very few of them having been extended to weighted networks. Thus far, how to predic... |
1911.05702 | Tong Wang | Tong Wang and Fujie Jin and Yu Hu and Yuan Cheng | Early Predictions for Medical Crowdfunding: A Deep Learning Approach
Using Diverse Inputs | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Medical crowdfunding is a popular channel for people needing financial help
paying medical bills to collect donations from large numbers of people.
However, large heterogeneity exists in donations across cases, and fundraisers
face significant uncertainty in whether their crowdfunding campaigns can meet
fundraising g... | [
{
"created": "Sat, 9 Nov 2019 06:08:10 GMT",
"version": "v1"
}
] | 2019-11-25 | [
[
"Wang",
"Tong",
""
],
[
"Jin",
"Fujie",
""
],
[
"Hu",
"Yu",
""
],
[
"Cheng",
"Yuan",
""
]
] | Medical crowdfunding is a popular channel for people needing financial help paying medical bills to collect donations from large numbers of people. However, large heterogeneity exists in donations across cases, and fundraisers face significant uncertainty in whether their crowdfunding campaigns can meet fundraising goa... |
1604.03888 | Mohammad Mohammadi Amiri Mr. | Mohammad Mohammadi Amiri and Deniz Gunduz | Fundamental Limits of Coded Caching: Improved Delivery Rate-Cache
Capacity Trade-off | To appear in IEEE Transactions on Communications | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A centralized coded caching system, consisting of a server delivering N
popular files, each of size F bits, to K users through an error-free shared
link, is considered. It is assumed that each user is equipped with a local
cache memory with capacity MF bits, and contents can be proactively cached into
these caches ov... | [
{
"created": "Wed, 13 Apr 2016 17:55:03 GMT",
"version": "v1"
},
{
"created": "Tue, 13 Dec 2016 22:12:24 GMT",
"version": "v2"
}
] | 2016-12-15 | [
[
"Amiri",
"Mohammad Mohammadi",
""
],
[
"Gunduz",
"Deniz",
""
]
] | A centralized coded caching system, consisting of a server delivering N popular files, each of size F bits, to K users through an error-free shared link, is considered. It is assumed that each user is equipped with a local cache memory with capacity MF bits, and contents can be proactively cached into these caches over... |
2003.00953 | Yueting Chen | Yueting Chen and Xiaohui Yu and Nick Koudas | Evaluating Temporal Queries Over Video Feeds | null | null | null | null | cs.DB cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent advances in Computer Vision and Deep Learning made possible the
efficient extraction of a schema from frames of streaming video. As such, a
stream of objects and their associated classes along with unique object
identifiers derived via object tracking can be generated, providing unique
objects as they are capt... | [
{
"created": "Mon, 2 Mar 2020 14:55:57 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Mar 2020 14:16:18 GMT",
"version": "v2"
},
{
"created": "Thu, 5 Mar 2020 22:22:46 GMT",
"version": "v3"
}
] | 2020-03-09 | [
[
"Chen",
"Yueting",
""
],
[
"Yu",
"Xiaohui",
""
],
[
"Koudas",
"Nick",
""
]
] | Recent advances in Computer Vision and Deep Learning made possible the efficient extraction of a schema from frames of streaming video. As such, a stream of objects and their associated classes along with unique object identifiers derived via object tracking can be generated, providing unique objects as they are captur... |
2211.05077 | Guangyue Xu | Guangyue Xu, Parisa Kordjamshidi, Joyce Chai | Prompting Large Pre-trained Vision-Language Models For Compositional
Concept Learning | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This work explores the zero-shot compositional learning ability of large
pre-trained vision-language models(VLMs) within the prompt-based learning
framework and propose a model (\textit{PromptCompVL}) to solve the compositonal
zero-shot learning (CZSL) problem. \textit{PromptCompVL} makes two design
choices: first, i... | [
{
"created": "Wed, 9 Nov 2022 18:08:53 GMT",
"version": "v1"
}
] | 2022-11-10 | [
[
"Xu",
"Guangyue",
""
],
[
"Kordjamshidi",
"Parisa",
""
],
[
"Chai",
"Joyce",
""
]
] | This work explores the zero-shot compositional learning ability of large pre-trained vision-language models(VLMs) within the prompt-based learning framework and propose a model (\textit{PromptCompVL}) to solve the compositonal zero-shot learning (CZSL) problem. \textit{PromptCompVL} makes two design choices: first, it ... |
2010.08853 | Gilad Yehudai | Gilad Yehudai, Ethan Fetaya, Eli Meirom, Gal Chechik, Haggai Maron | From Local Structures to Size Generalization in Graph Neural Networks | Camera ready version for ICML 2021 | null | null | null | cs.LG cs.NE stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Graph neural networks (GNNs) can process graphs of different sizes, but their
ability to generalize across sizes, specifically from small to large graphs, is
still not well understood. In this paper, we identify an important type of data
where generalization from small to large graphs is challenging: graph
distributi... | [
{
"created": "Sat, 17 Oct 2020 19:36:54 GMT",
"version": "v1"
},
{
"created": "Wed, 17 Feb 2021 14:49:30 GMT",
"version": "v2"
},
{
"created": "Thu, 15 Jul 2021 19:18:06 GMT",
"version": "v3"
}
] | 2021-07-19 | [
[
"Yehudai",
"Gilad",
""
],
[
"Fetaya",
"Ethan",
""
],
[
"Meirom",
"Eli",
""
],
[
"Chechik",
"Gal",
""
],
[
"Maron",
"Haggai",
""
]
] | Graph neural networks (GNNs) can process graphs of different sizes, but their ability to generalize across sizes, specifically from small to large graphs, is still not well understood. In this paper, we identify an important type of data where generalization from small to large graphs is challenging: graph distribution... |
2404.00306 | Yang Hu | Yang Hu | Leveraging Intelligent Recommender system as a first step resilience
measure -- A data-driven supply chain disruption response framework | Manuscript submitted for WSC2024 Conference | null | null | null | cs.CE cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Interests in the value of digital technologies for its potential uses to
increase supply chain resilience (SCRes) are increasing in light to the
industry 4.0 and the global pandemic. Utilization of Recommender systems (RS)
as a supply chain (SC) resilience measure is neglected although RS is a capable
tool to enhance... | [
{
"created": "Sat, 30 Mar 2024 10:07:02 GMT",
"version": "v1"
},
{
"created": "Tue, 7 May 2024 16:09:06 GMT",
"version": "v2"
}
] | 2024-05-08 | [
[
"Hu",
"Yang",
""
]
] | Interests in the value of digital technologies for its potential uses to increase supply chain resilience (SCRes) are increasing in light to the industry 4.0 and the global pandemic. Utilization of Recommender systems (RS) as a supply chain (SC) resilience measure is neglected although RS is a capable tool to enhance S... |
2407.19265 | Riyansha Singh | Riyansha Singh, Parinita Nema, Vinod K Kurmi | Towards Robust Few-shot Class Incremental Learning in Audio
Classification using Contrastive Representation | INTERSPEECH 2024 accepted | null | null | null | cs.SD cs.LG eess.AS | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In machine learning applications, gradual data ingress is common, especially
in audio processing where incremental learning is vital for real-time
analytics. Few-shot class-incremental learning addresses challenges arising
from limited incoming data. Existing methods often integrate additional
trainable components or... | [
{
"created": "Sat, 27 Jul 2024 14:16:25 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Aug 2024 09:16:12 GMT",
"version": "v2"
}
] | 2024-08-08 | [
[
"Singh",
"Riyansha",
""
],
[
"Nema",
"Parinita",
""
],
[
"Kurmi",
"Vinod K",
""
]
] | In machine learning applications, gradual data ingress is common, especially in audio processing where incremental learning is vital for real-time analytics. Few-shot class-incremental learning addresses challenges arising from limited incoming data. Existing methods often integrate additional trainable components or r... |
2302.06199 | Cunjun Yu | Cunjun Yu, Yiqing Xu, Linfeng Li, David Hsu | COACH: Cooperative Robot Teaching | CoRL 2022 | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Knowledge and skills can transfer from human teachers to human students.
However, such direct transfer is often not scalable for physical tasks, as they
require one-to-one interaction, and human teachers are not available in
sufficient numbers. Machine learning enables robots to become experts and play
the role of te... | [
{
"created": "Mon, 13 Feb 2023 09:15:45 GMT",
"version": "v1"
}
] | 2023-02-14 | [
[
"Yu",
"Cunjun",
""
],
[
"Xu",
"Yiqing",
""
],
[
"Li",
"Linfeng",
""
],
[
"Hsu",
"David",
""
]
] | Knowledge and skills can transfer from human teachers to human students. However, such direct transfer is often not scalable for physical tasks, as they require one-to-one interaction, and human teachers are not available in sufficient numbers. Machine learning enables robots to become experts and play the role of teac... |
2009.14721 | Mohamed Abbas Hedjazi | Mohamed Abbas Hedjazi, Yakup Genc | Efficient texture-aware multi-GAN for image inpainting | 25 pages, 15 figures, 11 tables | Knowledge-Based Systems, Volume 217, 6 April 2021, 106789 | 10.1016/j.knosys.2021.106789 | null | cs.CV | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Recent GAN-based (Generative adversarial networks) inpainting methods show
remarkable improvements and generate plausible images using multi-stage
networks or Contextual Attention Modules (CAM). However, these techniques
increase the model complexity limiting their application in low-resource
environments. Furthermor... | [
{
"created": "Wed, 30 Sep 2020 14:58:03 GMT",
"version": "v1"
},
{
"created": "Sat, 13 Feb 2021 15:19:43 GMT",
"version": "v2"
}
] | 2021-02-16 | [
[
"Hedjazi",
"Mohamed Abbas",
""
],
[
"Genc",
"Yakup",
""
]
] | Recent GAN-based (Generative adversarial networks) inpainting methods show remarkable improvements and generate plausible images using multi-stage networks or Contextual Attention Modules (CAM). However, these techniques increase the model complexity limiting their application in low-resource environments. Furthermore,... |
1704.02767 | Manuela Fischer | Manuela Fischer, Mohsen Ghaffari, Fabian Kuhn | Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a deterministic distributed algorithm that computes a
$(2\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph
with maximum degree $\Delta$, in $O(\log^7 \Delta \log n)$ rounds. This answers
one of the long-standing open questions of \emph{distributed graph algorithms}
from the late 1... | [
{
"created": "Mon, 10 Apr 2017 09:03:11 GMT",
"version": "v1"
}
] | 2017-04-11 | [
[
"Fischer",
"Manuela",
""
],
[
"Ghaffari",
"Mohsen",
""
],
[
"Kuhn",
"Fabian",
""
]
] | We present a deterministic distributed algorithm that computes a $(2\Delta-1)$-edge-coloring, or even list-edge-coloring, in any $n$-node graph with maximum degree $\Delta$, in $O(\log^7 \Delta \log n)$ rounds. This answers one of the long-standing open questions of \emph{distributed graph algorithms} from the late 198... |
2110.07103 | Chuong Nguyen | Chuong Nguyen, Dadong Wang, Karl Von Richter, Philip Valencia, Flavio
A. P. Alvarenga, Gregory Bishop-Hurley | Video-based cattle identification and action recognition | 5 pages, 7 figures, DICTA2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We demonstrate a working prototype for the monitoring of cow welfare by
automatically analysing the animal behaviours. Deep learning models have been
developed and tested with videos acquired in a farm, and a precision of 81.2\%
has been achieved for cow identification. An accuracy of 84.4\% has been
achieved for the... | [
{
"created": "Thu, 14 Oct 2021 00:55:56 GMT",
"version": "v1"
}
] | 2021-10-15 | [
[
"Nguyen",
"Chuong",
""
],
[
"Wang",
"Dadong",
""
],
[
"Von Richter",
"Karl",
""
],
[
"Valencia",
"Philip",
""
],
[
"Alvarenga",
"Flavio A. P.",
""
],
[
"Bishop-Hurley",
"Gregory",
""
]
] | We demonstrate a working prototype for the monitoring of cow welfare by automatically analysing the animal behaviours. Deep learning models have been developed and tested with videos acquired in a farm, and a precision of 81.2\% has been achieved for cow identification. An accuracy of 84.4\% has been achieved for the d... |
2008.06570 | Monica Ribero | Peter Kairouz, M\'onica Ribero, Keith Rush, Abhradeep Thakurta | Fast Dimension Independent Private AdaGrad on Publicly Estimated
Subspaces | null | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We revisit the problem of empirical risk minimziation (ERM) with differential
privacy. We show that noisy AdaGrad, given appropriate knowledge and conditions
on the subspace from which gradients can be drawn, achieves a regret comparable
to traditional AdaGrad plus a well-controlled term due to noise. We show a
conve... | [
{
"created": "Fri, 14 Aug 2020 20:46:38 GMT",
"version": "v1"
},
{
"created": "Sat, 30 Jan 2021 23:34:27 GMT",
"version": "v2"
}
] | 2021-02-02 | [
[
"Kairouz",
"Peter",
""
],
[
"Ribero",
"Mónica",
""
],
[
"Rush",
"Keith",
""
],
[
"Thakurta",
"Abhradeep",
""
]
] | We revisit the problem of empirical risk minimziation (ERM) with differential privacy. We show that noisy AdaGrad, given appropriate knowledge and conditions on the subspace from which gradients can be drawn, achieves a regret comparable to traditional AdaGrad plus a well-controlled term due to noise. We show a converg... |
2401.03329 | Zhonghao Shi | Emily Zhou, Zhonghao Shi, Xiaoyang Qiao, Maja J Matari\'c, Ava K
Bittner | Designing a Socially Assistive Robot to Support Older Adults with Low
Vision | Published in Social Robotics: 13th International Conference, ICSR
2021. Springer International Publishing | null | 10.1007/978-3-030-90525-5_38 | null | cs.RO cs.HC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Socially assistive robots (SARs) have shown great promise in supplementing
and augmenting interventions to support the physical and mental well-being of
older adults. However, past work has not yet explored the potential of applying
SAR to lower the barriers of long-term low vision rehabilitation (LVR)
interventions ... | [
{
"created": "Sat, 6 Jan 2024 23:23:02 GMT",
"version": "v1"
}
] | 2024-01-09 | [
[
"Zhou",
"Emily",
""
],
[
"Shi",
"Zhonghao",
""
],
[
"Qiao",
"Xiaoyang",
""
],
[
"Matarić",
"Maja J",
""
],
[
"Bittner",
"Ava K",
""
]
] | Socially assistive robots (SARs) have shown great promise in supplementing and augmenting interventions to support the physical and mental well-being of older adults. However, past work has not yet explored the potential of applying SAR to lower the barriers of long-term low vision rehabilitation (LVR) interventions fo... |
2306.12203 | David Gillsj\"o | David Gillsj\"o, Gabrielle Flood, Kalle {\AA}str\"om | Polygon Detection for Room Layout Estimation using Heterogeneous Graphs
and Wireframes | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a neural network based semantic plane detection method
utilizing polygon representations. The method can for example be used to solve
room layout estimations tasks. The method is built on, combines and further
develops several different modules from previous research. The network takes an
RGB imag... | [
{
"created": "Wed, 21 Jun 2023 11:55:15 GMT",
"version": "v1"
}
] | 2023-06-22 | [
[
"Gillsjö",
"David",
""
],
[
"Flood",
"Gabrielle",
""
],
[
"Åström",
"Kalle",
""
]
] | This paper presents a neural network based semantic plane detection method utilizing polygon representations. The method can for example be used to solve room layout estimations tasks. The method is built on, combines and further develops several different modules from previous research. The network takes an RGB image ... |
2209.03603 | Jinxiang Lai | Jinxiang Lai, Wenlong Liu, Jun Liu | nVFNet-RDC: Replay and Non-Local Distillation Collaboration for
Continual Object Detection | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Continual Learning (CL) focuses on developing algorithms with the ability to
adapt to new environments and learn new skills. This very challenging task has
generated a lot of interest in recent years, with new solutions appearing
rapidly. In this paper, we propose a nVFNet-RDC approach for continual object
detection.... | [
{
"created": "Thu, 8 Sep 2022 06:59:42 GMT",
"version": "v1"
}
] | 2022-09-09 | [
[
"Lai",
"Jinxiang",
""
],
[
"Liu",
"Wenlong",
""
],
[
"Liu",
"Jun",
""
]
] | Continual Learning (CL) focuses on developing algorithms with the ability to adapt to new environments and learn new skills. This very challenging task has generated a lot of interest in recent years, with new solutions appearing rapidly. In this paper, we propose a nVFNet-RDC approach for continual object detection. O... |
cs/0106042 | Judith Beumer | William McCune | MACE 2.0 Reference Manual and Guide | 10 pages | null | null | ANL/MCS-TM-249 | cs.LO cs.SC | null | MACE is a program that searches for finite models of first-order statements.
The statement to be modeled is first translated to clauses, then to relational
clauses; finally for the given domain size, the ground instances are
constructed. A Davis-Putnam-Loveland-Logeman procedure decides the
propositional problem, and... | [
{
"created": "Tue, 19 Jun 2001 16:11:19 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"McCune",
"William",
""
]
] | MACE is a program that searches for finite models of first-order statements. The statement to be modeled is first translated to clauses, then to relational clauses; finally for the given domain size, the ground instances are constructed. A Davis-Putnam-Loveland-Logeman procedure decides the propositional problem, and a... |
1810.08124 | Lina Al-Kanj Dr. | Lina Al-Kanj, Juliana Nascimento and Warren B. Powell | Approximate Dynamic Programming for Planning a Ride-Sharing System using
Autonomous Fleets of Electric Vehicles | null | null | null | null | cs.AI cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Within a decade, almost every major auto company, along with fleet operators
such as Uber, have announced plans to put autonomous vehicles on the road. At
the same time, electric vehicles are quickly emerging as a next-generation
technology that is cost effective, in addition to offering the benefits of
reducing the ... | [
{
"created": "Thu, 18 Oct 2018 15:54:58 GMT",
"version": "v1"
},
{
"created": "Tue, 11 Dec 2018 22:57:04 GMT",
"version": "v2"
}
] | 2018-12-13 | [
[
"Al-Kanj",
"Lina",
""
],
[
"Nascimento",
"Juliana",
""
],
[
"Powell",
"Warren B.",
""
]
] | Within a decade, almost every major auto company, along with fleet operators such as Uber, have announced plans to put autonomous vehicles on the road. At the same time, electric vehicles are quickly emerging as a next-generation technology that is cost effective, in addition to offering the benefits of reducing the ca... |
2009.04614 | Kun Fang | Kun Fang, Fanghui Liu, Xiaolin Huang and Jie Yang | End-to-end Kernel Learning via Generative Random Fourier Features | Accepted by Pattern Recognition | null | 10.1016/j.patcog.2022.109057 | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Random Fourier features (RFFs) provide a promising way for kernel learning in
a spectral case. Current RFFs-based kernel learning methods usually work in a
two-stage way. In the first-stage process, learning the optimal feature map is
often formulated as a target alignment problem, which aims to align the learned
ker... | [
{
"created": "Thu, 10 Sep 2020 00:27:39 GMT",
"version": "v1"
},
{
"created": "Fri, 10 Dec 2021 08:55:10 GMT",
"version": "v2"
},
{
"created": "Tue, 14 Jun 2022 08:02:10 GMT",
"version": "v3"
},
{
"created": "Tue, 22 Nov 2022 07:52:06 GMT",
"version": "v4"
},
{
"c... | 2024-01-17 | [
[
"Fang",
"Kun",
""
],
[
"Liu",
"Fanghui",
""
],
[
"Huang",
"Xiaolin",
""
],
[
"Yang",
"Jie",
""
]
] | Random Fourier features (RFFs) provide a promising way for kernel learning in a spectral case. Current RFFs-based kernel learning methods usually work in a two-stage way. In the first-stage process, learning the optimal feature map is often formulated as a target alignment problem, which aims to align the learned kerne... |
2401.11888 | Junichiro Niimi Dr | Junichiro Niimi | Multimodal Deep Learning of Word-of-Mouth Text and Demographics to
Predict Customer Rating: Handling Consumer Heterogeneity in Marketing | null | null | null | null | cs.CE cs.LG | http://creativecommons.org/licenses/by/4.0/ | In the marketing field, understanding consumer heterogeneity, which is the
internal or psychological difference among consumers that cannot be captured by
behavioral logs, has long been a critical challenge. However, a number of
consumers today usually post their evaluation on the specific product on the
online platf... | [
{
"created": "Mon, 22 Jan 2024 12:28:50 GMT",
"version": "v1"
}
] | 2024-01-23 | [
[
"Niimi",
"Junichiro",
""
]
] | In the marketing field, understanding consumer heterogeneity, which is the internal or psychological difference among consumers that cannot be captured by behavioral logs, has long been a critical challenge. However, a number of consumers today usually post their evaluation on the specific product on the online platfor... |
2012.13137 | Naeha Sharif | Naeha Sharif, Lyndon White, Mohammed Bennamoun, Wei Liu, Syed Afaq Ali
Shah | WEmbSim: A Simple yet Effective Metric for Image Captioning | 7 pages | International Conference on Digital Image Computing: Techniques
and Applications (DICTA), 2020 | null | null | cs.CV cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The area of automatic image caption evaluation is still undergoing intensive
research to address the needs of generating captions which can meet adequacy
and fluency requirements. Based on our past attempts at developing highly
sophisticated learning-based metrics, we have discovered that a simple cosine
similarity m... | [
{
"created": "Thu, 24 Dec 2020 06:39:43 GMT",
"version": "v1"
}
] | 2020-12-25 | [
[
"Sharif",
"Naeha",
""
],
[
"White",
"Lyndon",
""
],
[
"Bennamoun",
"Mohammed",
""
],
[
"Liu",
"Wei",
""
],
[
"Shah",
"Syed Afaq Ali",
""
]
] | The area of automatic image caption evaluation is still undergoing intensive research to address the needs of generating captions which can meet adequacy and fluency requirements. Based on our past attempts at developing highly sophisticated learning-based metrics, we have discovered that a simple cosine similarity mea... |
2212.10556 | Junyang Wu | Junyang Wu, Xianhang Li, Chen Wei, Huiyu Wang, Alan Yuille, Yuyin
Zhou, Cihang Xie | Unleashing the Power of Visual Prompting At the Pixel Level | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents a simple and effective visual prompting method for
adapting pre-trained models to downstream recognition tasks. Our method
includes two key designs. First, rather than directly adding together the
prompt and the image, we treat the prompt as an extra and independent learnable
component. We show th... | [
{
"created": "Tue, 20 Dec 2022 18:57:06 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Mar 2023 06:49:51 GMT",
"version": "v2"
}
] | 2023-03-30 | [
[
"Wu",
"Junyang",
""
],
[
"Li",
"Xianhang",
""
],
[
"Wei",
"Chen",
""
],
[
"Wang",
"Huiyu",
""
],
[
"Yuille",
"Alan",
""
],
[
"Zhou",
"Yuyin",
""
],
[
"Xie",
"Cihang",
""
]
] | This paper presents a simple and effective visual prompting method for adapting pre-trained models to downstream recognition tasks. Our method includes two key designs. First, rather than directly adding together the prompt and the image, we treat the prompt as an extra and independent learnable component. We show that... |
2106.07611 | Santiago Miret | Santiago Miret, Vui Seng Chua, Mattias Marder, Mariano Phielipp,
Nilesh Jain, Somdeb Majumdar | Neuroevolution-Enhanced Multi-Objective Optimization for Mixed-Precision
Quantization | null | null | null | null | cs.NE cs.AI | http://creativecommons.org/licenses/by/4.0/ | Mixed-precision quantization is a powerful tool to enable memory and compute
savings of neural network workloads by deploying different sets of bit-width
precisions on separate compute operations. In this work, we present a flexible
and scalable framework for automated mixed-precision quantization that
concurrently o... | [
{
"created": "Mon, 14 Jun 2021 17:15:15 GMT",
"version": "v1"
},
{
"created": "Sat, 2 Apr 2022 00:10:14 GMT",
"version": "v2"
}
] | 2022-04-05 | [
[
"Miret",
"Santiago",
""
],
[
"Chua",
"Vui Seng",
""
],
[
"Marder",
"Mattias",
""
],
[
"Phielipp",
"Mariano",
""
],
[
"Jain",
"Nilesh",
""
],
[
"Majumdar",
"Somdeb",
""
]
] | Mixed-precision quantization is a powerful tool to enable memory and compute savings of neural network workloads by deploying different sets of bit-width precisions on separate compute operations. In this work, we present a flexible and scalable framework for automated mixed-precision quantization that concurrently opt... |
1509.09188 | Pavel Kolev | Pavel Kolev and Kurt Mehlhorn | Approximate Spectral Clustering: Efficiency and Guarantees | A preliminary version of this paper was presented at the 24th Annual
European Symposium on Algorithms (ESA 2016) | null | null | null | cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Approximate Spectral Clustering (ASC) is a popular and successful heuristic
for partitioning the nodes of a graph $G$ into clusters for which the ratio of
outside connections compared to the volume (sum of degrees) is small. ASC
consists of the following two subroutines: i) compute an approximate Spectral
Embedding v... | [
{
"created": "Wed, 30 Sep 2015 14:20:44 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Jan 2016 00:09:11 GMT",
"version": "v2"
},
{
"created": "Wed, 17 Feb 2016 14:12:31 GMT",
"version": "v3"
},
{
"created": "Thu, 21 Apr 2016 10:17:59 GMT",
"version": "v4"
},
{
"cr... | 2018-07-31 | [
[
"Kolev",
"Pavel",
""
],
[
"Mehlhorn",
"Kurt",
""
]
] | Approximate Spectral Clustering (ASC) is a popular and successful heuristic for partitioning the nodes of a graph $G$ into clusters for which the ratio of outside connections compared to the volume (sum of degrees) is small. ASC consists of the following two subroutines: i) compute an approximate Spectral Embedding via... |
1810.12445 | Alexandre Cunha | Alexandre Cunha | Geometric Median Shapes | Accepted ISBI'19 | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | We present an algorithm to compute the geometric median of shapes which is
based on the extension of median to high dimensions. The median finding problem
is formulated as an optimization over distances and it is solved directly using
the watershed method as an optimizer. We show that computing the geometric
median o... | [
{
"created": "Mon, 29 Oct 2018 22:50:26 GMT",
"version": "v1"
},
{
"created": "Wed, 7 Nov 2018 20:56:04 GMT",
"version": "v2"
},
{
"created": "Mon, 15 Apr 2019 22:52:25 GMT",
"version": "v3"
}
] | 2019-04-17 | [
[
"Cunha",
"Alexandre",
""
]
] | We present an algorithm to compute the geometric median of shapes which is based on the extension of median to high dimensions. The median finding problem is formulated as an optimization over distances and it is solved directly using the watershed method as an optimizer. We show that computing the geometric median of ... |
1309.4962 | Josef Urban | Cezary Kaliszyk and Josef Urban | HOL(y)Hammer: Online ATP Service for HOL Light | null | null | null | null | cs.AI cs.DL cs.LG cs.LO cs.MS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | HOL(y)Hammer is an online AI/ATP service for formal (computer-understandable)
mathematics encoded in the HOL Light system. The service allows its users to
upload and automatically process an arbitrary formal development (project)
based on HOL Light, and to attack arbitrary conjectures that use the concepts
defined in... | [
{
"created": "Thu, 19 Sep 2013 13:22:31 GMT",
"version": "v1"
}
] | 2013-09-20 | [
[
"Kaliszyk",
"Cezary",
""
],
[
"Urban",
"Josef",
""
]
] | HOL(y)Hammer is an online AI/ATP service for formal (computer-understandable) mathematics encoded in the HOL Light system. The service allows its users to upload and automatically process an arbitrary formal development (project) based on HOL Light, and to attack arbitrary conjectures that use the concepts defined in s... |
2009.02961 | Cemre Zor | Sara Atito Ali Ahmed, Cemre Zor, Berrin Yanikoglu, Muhammad Awais,
Josef Kittler | Deep Convolutional Neural Network Ensembles using ECOC | 13 pages double column IEEE transactions style | null | 10.1109/ACCESS.2021.3088717 | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Deep neural networks have enhanced the performance of decision making systems
in many applications including image understanding, and further gains can be
achieved by constructing ensembles. However, designing an ensemble of deep
networks is often not very beneficial since the time needed to train the
networks is ver... | [
{
"created": "Mon, 7 Sep 2020 09:20:24 GMT",
"version": "v1"
},
{
"created": "Sun, 7 Mar 2021 16:39:12 GMT",
"version": "v2"
}
] | 2021-11-16 | [
[
"Ahmed",
"Sara Atito Ali",
""
],
[
"Zor",
"Cemre",
""
],
[
"Yanikoglu",
"Berrin",
""
],
[
"Awais",
"Muhammad",
""
],
[
"Kittler",
"Josef",
""
]
] | Deep neural networks have enhanced the performance of decision making systems in many applications including image understanding, and further gains can be achieved by constructing ensembles. However, designing an ensemble of deep networks is often not very beneficial since the time needed to train the networks is very ... |
2406.17419 | Minzheng Wang | Minzheng Wang, Longze Chen, Cheng Fu, Shengyi Liao, Xinghua Zhang,
Bingli Wu, Haiyang Yu, Nan Xu, Lei Zhang, Run Luo, Yunshui Li, Min Yang, Fei
Huang, Yongbin Li | Leave No Document Behind: Benchmarking Long-Context LLMs with Extended
Multi-Doc QA | We release our code and data publicly at
https://github.com/MozerWang/Loong | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Long-context modeling capabilities have garnered widespread attention,
leading to the emergence of Large Language Models (LLMs) with ultra-context
windows. Meanwhile, benchmarks for evaluating long-context LLMs are gradually
catching up. However, existing benchmarks employ irrelevant noise texts to
artificially exten... | [
{
"created": "Tue, 25 Jun 2024 09:42:56 GMT",
"version": "v1"
}
] | 2024-06-26 | [
[
"Wang",
"Minzheng",
""
],
[
"Chen",
"Longze",
""
],
[
"Fu",
"Cheng",
""
],
[
"Liao",
"Shengyi",
""
],
[
"Zhang",
"Xinghua",
""
],
[
"Wu",
"Bingli",
""
],
[
"Yu",
"Haiyang",
""
],
[
"Xu",
"Nan",
... | Long-context modeling capabilities have garnered widespread attention, leading to the emergence of Large Language Models (LLMs) with ultra-context windows. Meanwhile, benchmarks for evaluating long-context LLMs are gradually catching up. However, existing benchmarks employ irrelevant noise texts to artificially extend ... |
2312.03740 | Prabin Bhandari | Prabin Bhandari | A Survey on Prompting Techniques in LLMs | 10 pages, 4 Figures | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Autoregressive Large Language Models have transformed the landscape of
Natural Language Processing. Pre-train and prompt paradigm has replaced the
conventional approach of pre-training and fine-tuning for many downstream NLP
tasks. This shift has been possible largely due to LLMs and innovative
prompting techniques. ... | [
{
"created": "Tue, 28 Nov 2023 17:56:34 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Apr 2024 22:27:39 GMT",
"version": "v2"
}
] | 2024-04-18 | [
[
"Bhandari",
"Prabin",
""
]
] | Autoregressive Large Language Models have transformed the landscape of Natural Language Processing. Pre-train and prompt paradigm has replaced the conventional approach of pre-training and fine-tuning for many downstream NLP tasks. This shift has been possible largely due to LLMs and innovative prompting techniques. LL... |
2307.05601 | Artem Bituitskii | Artem Bituitskii | Unsupervised Domain Adaptation with Deep Neural-Network | Master's thesis, 34 pages, 13 figures | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This report contributes to the field of unsupervised domain adaptation by
providing an analysis of existing methods, introducing a new approach, and
demonstrating the potential for improving visual recognition tasks across
different domains. The results of this study open up opportunities for further
study and develo... | [
{
"created": "Mon, 10 Jul 2023 20:28:58 GMT",
"version": "v1"
}
] | 2023-07-13 | [
[
"Bituitskii",
"Artem",
""
]
] | This report contributes to the field of unsupervised domain adaptation by providing an analysis of existing methods, introducing a new approach, and demonstrating the potential for improving visual recognition tasks across different domains. The results of this study open up opportunities for further study and developm... |
1607.02641 | Dominik Wurzer Dominik Wurzer | Dominik Wurzer, Miles Osborne, Victor Lavrenko | Randomised Relevance Model | Information Retrieval, Query Expansion, Locality Sensitive Hashing,
Randomized Algorithm, Relevance Model | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Relevance Models are well-known retrieval models and capable of producing
competitive results. However, because they use query expansion they can be very
slow. We address this slowness by incorporating two variants of locality
sensitive hashing (LSH) into the query expansion process. Results on two
document collectio... | [
{
"created": "Sat, 9 Jul 2016 18:10:06 GMT",
"version": "v1"
}
] | 2016-07-12 | [
[
"Wurzer",
"Dominik",
""
],
[
"Osborne",
"Miles",
""
],
[
"Lavrenko",
"Victor",
""
]
] | Relevance Models are well-known retrieval models and capable of producing competitive results. However, because they use query expansion they can be very slow. We address this slowness by incorporating two variants of locality sensitive hashing (LSH) into the query expansion process. Results on two document collections... |
2012.11405 | Sophia Althammer | Sophia Althammer, Sebastian Hofst\"atter, Allan Hanbury | Cross-domain Retrieval in the Legal and Patent Domains: a
Reproducibility Study | Accepted at ECIR 2021 (Reproducibility paper track) | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | Domain specific search has always been a challenging information retrieval
task due to several challenges such as the domain specific language, the unique
task setting, as well as the lack of accessible queries and corresponding
relevance judgements. In the last years, pretrained language models, such as
BERT, revolu... | [
{
"created": "Mon, 21 Dec 2020 15:06:15 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Jan 2021 09:18:44 GMT",
"version": "v2"
}
] | 2021-01-20 | [
[
"Althammer",
"Sophia",
""
],
[
"Hofstätter",
"Sebastian",
""
],
[
"Hanbury",
"Allan",
""
]
] | Domain specific search has always been a challenging information retrieval task due to several challenges such as the domain specific language, the unique task setting, as well as the lack of accessible queries and corresponding relevance judgements. In the last years, pretrained language models, such as BERT, revoluti... |
2106.07504 | Ulrich A\"ivodji | Ulrich A\"ivodji, Hiromi Arai, S\'ebastien Gambs, Satoshi Hara | Characterizing the risk of fairwashing | Accepted to NeurIPS 2021 | null | null | null | cs.LG cs.CY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fairwashing refers to the risk that an unfair black-box model can be
explained by a fairer model through post-hoc explanation manipulation. In this
paper, we investigate the capability of fairwashing attacks by analyzing their
fidelity-unfairness trade-offs. In particular, we show that fairwashed
explanation models c... | [
{
"created": "Mon, 14 Jun 2021 15:33:17 GMT",
"version": "v1"
},
{
"created": "Tue, 2 Nov 2021 14:03:53 GMT",
"version": "v2"
},
{
"created": "Wed, 3 Nov 2021 02:01:22 GMT",
"version": "v3"
}
] | 2021-11-04 | [
[
"Aïvodji",
"Ulrich",
""
],
[
"Arai",
"Hiromi",
""
],
[
"Gambs",
"Sébastien",
""
],
[
"Hara",
"Satoshi",
""
]
] | Fairwashing refers to the risk that an unfair black-box model can be explained by a fairer model through post-hoc explanation manipulation. In this paper, we investigate the capability of fairwashing attacks by analyzing their fidelity-unfairness trade-offs. In particular, we show that fairwashed explanation models can... |
1908.03687 | Zhanat Kappassov | Zhanat Kappassov, Daulet Baimukashev, Zharaskhan Kuanyshuly, Yerzhan
Massalin, Arshat Urazbayev, Huseyin Atakan Varol | Color-Coded Fiber-Optic Tactile Sensor for an Elastomeric Robot Skin | Presented at ICRA2019, Montreal | 2019 International Conference on Robotics and Automation (ICRA),
Montreal, QC, Canada, 2019, pp. 2146-2152 | 10.1109/ICRA.2019.8793262 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The sense of touch is essential for reliable mapping between the environment
and a robot which interacts physically with objects. Presumably, an artificial
tactile skin would facilitate safe interaction of the robots with the
environment. In this work, we present our color-coded tactile sensor,
incorporating plastic ... | [
{
"created": "Sat, 10 Aug 2019 04:35:02 GMT",
"version": "v1"
}
] | 2019-08-21 | [
[
"Kappassov",
"Zhanat",
""
],
[
"Baimukashev",
"Daulet",
""
],
[
"Kuanyshuly",
"Zharaskhan",
""
],
[
"Massalin",
"Yerzhan",
""
],
[
"Urazbayev",
"Arshat",
""
],
[
"Varol",
"Huseyin Atakan",
""
]
] | The sense of touch is essential for reliable mapping between the environment and a robot which interacts physically with objects. Presumably, an artificial tactile skin would facilitate safe interaction of the robots with the environment. In this work, we present our color-coded tactile sensor, incorporating plastic op... |
2305.08350 | Quanquan Gu | Yue Wu and Jiafan He and Quanquan Gu | Uniform-PAC Guarantees for Model-Based RL with Bounded Eluder Dimension | 21 pages, 1 table. To appear in UAI 2023 | null | null | null | cs.LG math.OC stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, there has been remarkable progress in reinforcement learning (RL)
with general function approximation. However, all these works only provide
regret or sample complexity guarantees. It is still an open question if one can
achieve stronger performance guarantees, i.e., the uniform probably approximate
correct... | [
{
"created": "Mon, 15 May 2023 05:07:45 GMT",
"version": "v1"
}
] | 2023-05-16 | [
[
"Wu",
"Yue",
""
],
[
"He",
"Jiafan",
""
],
[
"Gu",
"Quanquan",
""
]
] | Recently, there has been remarkable progress in reinforcement learning (RL) with general function approximation. However, all these works only provide regret or sample complexity guarantees. It is still an open question if one can achieve stronger performance guarantees, i.e., the uniform probably approximate correctne... |
0808.2953 | Paul Tarau | Paul Tarau | Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily
Finite Data Types in Haskell | unpublished draft, revision 3, added various new encodings, with
focus on primes and multisets, now 104 pages | null | null | null | cs.PL cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper is an exploration in a functional programming framework of {\em
isomorphisms} between elementary data types (natural numbers, sets, multisets,
finite functions, permutations binary decision diagrams, graphs, hypergraphs,
parenthesis languages, dyadic rationals, primes, DNA sequences etc.) and their
extensi... | [
{
"created": "Thu, 21 Aug 2008 16:47:38 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Oct 2008 18:47:59 GMT",
"version": "v2"
},
{
"created": "Tue, 9 Dec 2008 01:28:15 GMT",
"version": "v3"
},
{
"created": "Mon, 19 Jan 2009 19:39:51 GMT",
"version": "v4"
}
] | 2009-01-19 | [
[
"Tarau",
"Paul",
""
]
] | This paper is an exploration in a functional programming framework of {\em isomorphisms} between elementary data types (natural numbers, sets, multisets, finite functions, permutations binary decision diagrams, graphs, hypergraphs, parenthesis languages, dyadic rationals, primes, DNA sequences etc.) and their extension... |
1312.6948 | Sourish Dasgupta | Sourish Dasgupta, Rupali KaPatel, Ankur Padia, Kushal Shah | Description Logics based Formalization of Wh-Queries | Natural Language Query Processing, Representation | null | null | null | cs.CL cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The problem of Natural Language Query Formalization (NLQF) is to translate a
given user query in natural language (NL) into a formal language so that the
semantic interpretation has equivalence with the NL interpretation.
Formalization of NL queries enables logic based reasoning during information
retrieval, database... | [
{
"created": "Wed, 25 Dec 2013 09:23:49 GMT",
"version": "v1"
}
] | 2013-12-30 | [
[
"Dasgupta",
"Sourish",
""
],
[
"KaPatel",
"Rupali",
""
],
[
"Padia",
"Ankur",
""
],
[
"Shah",
"Kushal",
""
]
] | The problem of Natural Language Query Formalization (NLQF) is to translate a given user query in natural language (NL) into a formal language so that the semantic interpretation has equivalence with the NL interpretation. Formalization of NL queries enables logic based reasoning during information retrieval, database q... |
1401.0583 | Garrett Warnell | Garrett Warnell, Sourabh Bhattacharya, Rama Chellappa, Tamer Basar | Adaptive-Rate Compressive Sensing Using Side Information | null | null | 10.1109/TIP.2015.2456425 | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide two novel adaptive-rate compressive sensing (CS) strategies for
sparse, time-varying signals using side information. Our first method utilizes
extra cross-validation measurements, and the second one exploits extra
low-resolution measurements. Unlike the majority of current CS techniques, we
do not assume t... | [
{
"created": "Fri, 3 Jan 2014 04:01:29 GMT",
"version": "v1"
}
] | 2023-07-19 | [
[
"Warnell",
"Garrett",
""
],
[
"Bhattacharya",
"Sourabh",
""
],
[
"Chellappa",
"Rama",
""
],
[
"Basar",
"Tamer",
""
]
] | We provide two novel adaptive-rate compressive sensing (CS) strategies for sparse, time-varying signals using side information. Our first method utilizes extra cross-validation measurements, and the second one exploits extra low-resolution measurements. Unlike the majority of current CS techniques, we do not assume tha... |
0902.2853 | Laurent Poinsot | Laurent Poinsot (LIPN), G\'erard Duchamp (LIPN) | A formal calculus on the Riordan near algebra | 29 p | Advances and Applications in Discrete Mathematics 6, 1 (2010)
11-44 | null | null | cs.SC math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Riordan group is the semi-direct product of a multiplicative group of
invertible series and a group, under substitution, of non units. The Riordan
near algebra, as introduced in this paper, is the Cartesian product of the
algebra of formal power series and its principal ideal of non units, equipped
with a product... | [
{
"created": "Tue, 17 Feb 2009 08:13:27 GMT",
"version": "v1"
},
{
"created": "Thu, 5 Mar 2009 11:10:13 GMT",
"version": "v2"
},
{
"created": "Sun, 28 Feb 2010 20:01:23 GMT",
"version": "v3"
},
{
"created": "Thu, 4 Mar 2010 07:28:28 GMT",
"version": "v4"
}
] | 2010-09-30 | [
[
"Poinsot",
"Laurent",
"",
"LIPN"
],
[
"Duchamp",
"Gérard",
"",
"LIPN"
]
] | The Riordan group is the semi-direct product of a multiplicative group of invertible series and a group, under substitution, of non units. The Riordan near algebra, as introduced in this paper, is the Cartesian product of the algebra of formal power series and its principal ideal of non units, equipped with a product t... |
2101.09577 | Bla\v{z} \v{S}krlj | Bla\v{z} \v{S}krlj, Sa\v{s}o D\v{z}eroski, Nada Lavra\v{c} and Matej
Petkovi\'c | ReliefE: Feature Ranking in High-dimensional Spaces via Manifold
Embeddings | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | Feature ranking has been widely adopted in machine learning applications such
as high-throughput biology and social sciences. The approaches of the popular
Relief family of algorithms assign importances to features by iteratively
accounting for nearest relevant and irrelevant instances. Despite their high
utility, th... | [
{
"created": "Sat, 23 Jan 2021 20:23:31 GMT",
"version": "v1"
}
] | 2021-01-26 | [
[
"Škrlj",
"Blaž",
""
],
[
"Džeroski",
"Sašo",
""
],
[
"Lavrač",
"Nada",
""
],
[
"Petković",
"Matej",
""
]
] | Feature ranking has been widely adopted in machine learning applications such as high-throughput biology and social sciences. The approaches of the popular Relief family of algorithms assign importances to features by iteratively accounting for nearest relevant and irrelevant instances. Despite their high utility, thes... |
1212.1763 | Mohammadi Akheela Khanum Mrs | Mohammadi Akheela Khanum, Lamia Mohammed Ketari | Trends in Combating Image Spam E-mails | null | ICFIT 2012 | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the rapid adoption of Internet as an easy way to communicate, the amount
of unsolicited e-mails, known as spam e-mails, has been growing rapidly. The
major problem of spam e-mails is the loss of productivity and a drain on IT
resources. Today, we receive spam more rapidly than the legitimate e-mails.
Initially, ... | [
{
"created": "Sat, 8 Dec 2012 07:32:10 GMT",
"version": "v1"
}
] | 2012-12-11 | [
[
"Khanum",
"Mohammadi Akheela",
""
],
[
"Ketari",
"Lamia Mohammed",
""
]
] | With the rapid adoption of Internet as an easy way to communicate, the amount of unsolicited e-mails, known as spam e-mails, has been growing rapidly. The major problem of spam e-mails is the loss of productivity and a drain on IT resources. Today, we receive spam more rapidly than the legitimate e-mails. Initially, sp... |
1812.04443 | Alexander Span | Alexander Span, Vahid Aref, Henning Buelow, Stephan ten Brink | Time-Bandwidth Product Perspective for Multi-Soliton Phase Modulation | null | null | 10.1109/TCOMM.2019.2913870 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multi-soliton pulses are potential candidates for fiber optical transmission
where the information is modulated and recovered in the so-called nonlinear
Fourier domain. While this is an elegant technique to account for the channel
nonlinearity, the obtained spectral efficiency, so far, is not competitive with
classic... | [
{
"created": "Tue, 11 Dec 2018 14:55:10 GMT",
"version": "v1"
}
] | 2019-06-13 | [
[
"Span",
"Alexander",
""
],
[
"Aref",
"Vahid",
""
],
[
"Buelow",
"Henning",
""
],
[
"Brink",
"Stephan ten",
""
]
] | Multi-soliton pulses are potential candidates for fiber optical transmission where the information is modulated and recovered in the so-called nonlinear Fourier domain. While this is an elegant technique to account for the channel nonlinearity, the obtained spectral efficiency, so far, is not competitive with classic N... |
1811.09556 | Yan Wu | Yan Wu, Greg Wayne, Karol Gregor, Timothy Lillicrap | Learning Attractor Dynamics for Generative Memory | null | null | null | null | cs.LG cs.AI stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A central challenge faced by memory systems is the robust retrieval of a
stored pattern in the presence of interference due to other stored patterns and
noise. A theoretically well-founded solution to robust retrieval is given by
attractor dynamics, which iteratively clean up patterns during recall. However,
incorpor... | [
{
"created": "Fri, 23 Nov 2018 16:49:02 GMT",
"version": "v1"
}
] | 2018-11-26 | [
[
"Wu",
"Yan",
""
],
[
"Wayne",
"Greg",
""
],
[
"Gregor",
"Karol",
""
],
[
"Lillicrap",
"Timothy",
""
]
] | A central challenge faced by memory systems is the robust retrieval of a stored pattern in the presence of interference due to other stored patterns and noise. A theoretically well-founded solution to robust retrieval is given by attractor dynamics, which iteratively clean up patterns during recall. However, incorporat... |
2310.17168 | Carson Eisenach | Sohrab Andaz, Carson Eisenach, Dhruv Madeka, Kari Torkkola, Randy Jia,
Dean Foster, Sham Kakade | Learning an Inventory Control Policy with General Inventory Arrival
Dynamics | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/licenses/by/4.0/ | In this paper we address the problem of learning and backtesting inventory
control policies in the presence of general arrival dynamics -- which we term
as a quantity-over-time arrivals model (QOT). We also allow for order
quantities to be modified as a post-processing step to meet vendor constraints
such as order mi... | [
{
"created": "Thu, 26 Oct 2023 05:49:13 GMT",
"version": "v1"
},
{
"created": "Mon, 22 Jan 2024 00:12:20 GMT",
"version": "v2"
}
] | 2024-01-23 | [
[
"Andaz",
"Sohrab",
""
],
[
"Eisenach",
"Carson",
""
],
[
"Madeka",
"Dhruv",
""
],
[
"Torkkola",
"Kari",
""
],
[
"Jia",
"Randy",
""
],
[
"Foster",
"Dean",
""
],
[
"Kakade",
"Sham",
""
]
] | In this paper we address the problem of learning and backtesting inventory control policies in the presence of general arrival dynamics -- which we term as a quantity-over-time arrivals model (QOT). We also allow for order quantities to be modified as a post-processing step to meet vendor constraints such as order mini... |
1707.05421 | Yeohee Im | Yeohee Im and Sergio Verd\'u | Optimal Universal Lossless Compression with Side Information | 20 Pages, Submitted to IEEE Transactions on Information Theory, Part
of this work was presented in ISIT '17 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents conditional versions of Lempel-Ziv (LZ) algorithm for
settings where compressor and decompressor have access to the same side
information. We propose a fixed-length-parsing LZ algorithm with side
information, motivated by the Willems algorithm, and prove the optimality for
any stationary processes... | [
{
"created": "Tue, 18 Jul 2017 00:44:36 GMT",
"version": "v1"
}
] | 2017-07-19 | [
[
"Im",
"Yeohee",
""
],
[
"Verdú",
"Sergio",
""
]
] | This paper presents conditional versions of Lempel-Ziv (LZ) algorithm for settings where compressor and decompressor have access to the same side information. We propose a fixed-length-parsing LZ algorithm with side information, motivated by the Willems algorithm, and prove the optimality for any stationary processes. ... |
2403.10232 | Sajad Faramarzi | Sajad Faramarzi, Farzan Haddadi, Sajjad Amini, Masoud Ahookhosh | Matrix Completion via Nonsmooth Regularization of Fully Connected Neural
Networks | null | null | null | null | cs.IT cs.LG math.IT | http://creativecommons.org/licenses/by/4.0/ | Conventional matrix completion methods approximate the missing values by
assuming the matrix to be low-rank, which leads to a linear approximation of
missing values. It has been shown that enhanced performance could be attained
by using nonlinear estimators such as deep neural networks. Deep fully
connected neural ne... | [
{
"created": "Fri, 15 Mar 2024 12:00:37 GMT",
"version": "v1"
}
] | 2024-03-18 | [
[
"Faramarzi",
"Sajad",
""
],
[
"Haddadi",
"Farzan",
""
],
[
"Amini",
"Sajjad",
""
],
[
"Ahookhosh",
"Masoud",
""
]
] | Conventional matrix completion methods approximate the missing values by assuming the matrix to be low-rank, which leads to a linear approximation of missing values. It has been shown that enhanced performance could be attained by using nonlinear estimators such as deep neural networks. Deep fully connected neural netw... |
2303.06965 | Bo Qiang | Bo Qiang, Yiran Zhou, Yuheng Ding, Ningfeng Liu, Song Song, Liangren
Zhang, Bo Huang, Zhenming Liu | Bridging the Gap between Chemical Reaction Pretraining and Conditional
Molecule Generation with a Unified Model | null | null | 10.1038/s42256-023-00764-9 | null | cs.LG q-bio.BM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Chemical reactions are the fundamental building blocks of drug design and
organic chemistry research. In recent years, there has been a growing need for
a large-scale deep-learning framework that can efficiently capture the basic
rules of chemical reactions. In this paper, we have proposed a unified
framework that ad... | [
{
"created": "Mon, 13 Mar 2023 10:06:41 GMT",
"version": "v1"
},
{
"created": "Tue, 14 Mar 2023 13:47:14 GMT",
"version": "v2"
},
{
"created": "Thu, 24 Aug 2023 08:33:05 GMT",
"version": "v3"
},
{
"created": "Mon, 26 Feb 2024 14:13:28 GMT",
"version": "v4"
},
{
"c... | 2024-03-08 | [
[
"Qiang",
"Bo",
""
],
[
"Zhou",
"Yiran",
""
],
[
"Ding",
"Yuheng",
""
],
[
"Liu",
"Ningfeng",
""
],
[
"Song",
"Song",
""
],
[
"Zhang",
"Liangren",
""
],
[
"Huang",
"Bo",
""
],
[
"Liu",
"Zhenming"... | Chemical reactions are the fundamental building blocks of drug design and organic chemistry research. In recent years, there has been a growing need for a large-scale deep-learning framework that can efficiently capture the basic rules of chemical reactions. In this paper, we have proposed a unified framework that addr... |
2311.13590 | Katarzyna Paluch | Katarzyna Paluch | Triangle-free 2-matchings | A new version with a simpler definition of an impassable hinge
(previously called intractable). Also, the existence of an augmenting
amenable path is not needed | null | null | null | cs.DS cs.DM | http://creativecommons.org/licenses/by/4.0/ | We consider the problem of finding a maximum size triangle-free 2-matching in
a graph $G$. A 2-matching is any subset of the edges such that each vertex is
incident to at most two edges from the subset. We present a fast combinatorial
algorithm for the problem. Our algorithm and its analysis are dramatically
simpler ... | [
{
"created": "Wed, 22 Nov 2023 18:52:51 GMT",
"version": "v1"
},
{
"created": "Tue, 16 Jan 2024 20:12:38 GMT",
"version": "v2"
},
{
"created": "Mon, 22 Jan 2024 20:14:13 GMT",
"version": "v3"
},
{
"created": "Thu, 1 Feb 2024 18:40:07 GMT",
"version": "v4"
},
{
"cr... | 2024-07-19 | [
[
"Paluch",
"Katarzyna",
""
]
] | We consider the problem of finding a maximum size triangle-free 2-matching in a graph $G$. A 2-matching is any subset of the edges such that each vertex is incident to at most two edges from the subset. We present a fast combinatorial algorithm for the problem. Our algorithm and its analysis are dramatically simpler th... |
1601.08116 | Tiago Azevedo | Tiago Azevedo, Rosaldo J. F. Rossetti, Jorge G. Barbosa | Densifying the sparse cloud SimSaaS: The need of a synergy among
agent-directed simulation, SimSaaS and HLA | null | Proceedings of the 5th International Conference on Simulation and
Modeling Methodologies, Technologies and Applications (2015) 172-177 | 10.5220/0005542801720177 | null | cs.MA cs.DC | http://creativecommons.org/licenses/by/4.0/ | Modelling & Simulation (M&S) is broadly used in real scenarios where making
physical modifications could be highly expensive. With the so-called Simulation
Software-as-a-Service (SimSaaS), researchers could take advantage of the huge
amount of resource that cloud computing provides. Even so, studying and
analysing a ... | [
{
"created": "Fri, 29 Jan 2016 14:11:37 GMT",
"version": "v1"
}
] | 2016-02-01 | [
[
"Azevedo",
"Tiago",
""
],
[
"Rossetti",
"Rosaldo J. F.",
""
],
[
"Barbosa",
"Jorge G.",
""
]
] | Modelling & Simulation (M&S) is broadly used in real scenarios where making physical modifications could be highly expensive. With the so-called Simulation Software-as-a-Service (SimSaaS), researchers could take advantage of the huge amount of resource that cloud computing provides. Even so, studying and analysing a pr... |
1603.06236 | Nik Ruskuc | Tom Bourne and Nik Ruskuc | On the star-height of factor counting languages and their relationship
to Rees zero-matrix semigroups | null | null | null | null | cs.FL math.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Given a word $w$ over a finite alphabet, we consider, in three special cases,
the generalised star-height of the languages in which $w$ occurs as a
contiguous subword (factor) an exact number of times and of the languages in
which $w$ occurs as a contiguous subword modulo a fixed number, and prove that
in each case i... | [
{
"created": "Sun, 20 Mar 2016 16:34:03 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Sep 2016 17:01:02 GMT",
"version": "v2"
}
] | 2016-09-28 | [
[
"Bourne",
"Tom",
""
],
[
"Ruskuc",
"Nik",
""
]
] | Given a word $w$ over a finite alphabet, we consider, in three special cases, the generalised star-height of the languages in which $w$ occurs as a contiguous subword (factor) an exact number of times and of the languages in which $w$ occurs as a contiguous subword modulo a fixed number, and prove that in each case it ... |
2111.01592 | Lu Zhang | Lu Zhang, Peiliang Li, Jing Chen and Shaojie Shen | Trajectory Prediction with Graph-based Dual-scale Context Fusion | Accepted by IEEE/RSJ International Conference on Intelligent Robots
and Systems (IROS) 2022. Code: https://github.com/HKUST-Aerial-Robotics/DSP | null | null | null | cs.RO cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Motion prediction for traffic participants is essential for a safe and robust
automated driving system, especially in cluttered urban environments. However,
it is highly challenging due to the complex road topology as well as the
uncertain intentions of the other agents. In this paper, we present a
graph-based trajec... | [
{
"created": "Tue, 2 Nov 2021 13:42:16 GMT",
"version": "v1"
},
{
"created": "Sat, 30 Jul 2022 15:59:18 GMT",
"version": "v2"
}
] | 2022-08-02 | [
[
"Zhang",
"Lu",
""
],
[
"Li",
"Peiliang",
""
],
[
"Chen",
"Jing",
""
],
[
"Shen",
"Shaojie",
""
]
] | Motion prediction for traffic participants is essential for a safe and robust automated driving system, especially in cluttered urban environments. However, it is highly challenging due to the complex road topology as well as the uncertain intentions of the other agents. In this paper, we present a graph-based trajecto... |
2402.13606 | Boyang Xue | Boyang Xue, Hongru Wang, Rui Wang, Sheng Wang, Zezhong Wang, Yiming
Du, Kam-Fai Wong | A Comprehensive Study of Multilingual Confidence Estimation on Large
Language Models | null | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | The tendency of Large Language Models (LLMs) to generate hallucinations and
exhibit overconfidence in predictions raises concerns regarding their
reliability. Confidence or uncertainty estimations indicating the extent of
trustworthiness of a model's response are essential to developing reliable AI
systems. Current r... | [
{
"created": "Wed, 21 Feb 2024 08:20:06 GMT",
"version": "v1"
},
{
"created": "Sun, 16 Jun 2024 07:28:26 GMT",
"version": "v2"
}
] | 2024-06-18 | [
[
"Xue",
"Boyang",
""
],
[
"Wang",
"Hongru",
""
],
[
"Wang",
"Rui",
""
],
[
"Wang",
"Sheng",
""
],
[
"Wang",
"Zezhong",
""
],
[
"Du",
"Yiming",
""
],
[
"Wong",
"Kam-Fai",
""
]
] | The tendency of Large Language Models (LLMs) to generate hallucinations and exhibit overconfidence in predictions raises concerns regarding their reliability. Confidence or uncertainty estimations indicating the extent of trustworthiness of a model's response are essential to developing reliable AI systems. Current res... |
2008.09697 | Long Chen | Long Chen, Zheheng Jiang, Lei Tong, Zhihua Liu, Aite Zhao, Qianni
Zhang, Junyu Dong, and Huiyu Zhou | Perceptual underwater image enhancement with deep learning and physical
priors | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Underwater image enhancement, as a pre-processing step to improve the
accuracy of the following object detection task, has drawn considerable
attention in the field of underwater navigation and ocean exploration. However,
most of the existing underwater image enhancement strategies tend to consider
enhancement and de... | [
{
"created": "Fri, 21 Aug 2020 22:11:34 GMT",
"version": "v1"
},
{
"created": "Sat, 26 Sep 2020 21:30:53 GMT",
"version": "v2"
}
] | 2020-09-29 | [
[
"Chen",
"Long",
""
],
[
"Jiang",
"Zheheng",
""
],
[
"Tong",
"Lei",
""
],
[
"Liu",
"Zhihua",
""
],
[
"Zhao",
"Aite",
""
],
[
"Zhang",
"Qianni",
""
],
[
"Dong",
"Junyu",
""
],
[
"Zhou",
"Huiyu",
... | Underwater image enhancement, as a pre-processing step to improve the accuracy of the following object detection task, has drawn considerable attention in the field of underwater navigation and ocean exploration. However, most of the existing underwater image enhancement strategies tend to consider enhancement and dete... |
2010.16335 | Roberto Pacheco | Roberto G. Pacheco, Rodrigo S. Couto and Osvaldo Simeone | Calibration-Aided Edge Inference Offloading via Adaptive Model
Partitioning of Deep Neural Networks | to appear in Proc. IEEE International Conference on Communications
(ICC) 2021 | null | null | null | cs.LG cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Mobile devices can offload deep neural network (DNN)-based inference to the
cloud, overcoming local hardware and energy limitations. However, offloading
adds communication delay, thus increasing the overall inference time, and hence
it should be used only when needed. An approach to address this problem
consists of t... | [
{
"created": "Fri, 30 Oct 2020 15:50:12 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Jan 2021 14:05:38 GMT",
"version": "v2"
}
] | 2021-01-29 | [
[
"Pacheco",
"Roberto G.",
""
],
[
"Couto",
"Rodrigo S.",
""
],
[
"Simeone",
"Osvaldo",
""
]
] | Mobile devices can offload deep neural network (DNN)-based inference to the cloud, overcoming local hardware and energy limitations. However, offloading adds communication delay, thus increasing the overall inference time, and hence it should be used only when needed. An approach to address this problem consists of the... |
2007.03377 | Ryan Parker | Paul Wright, Catherine White, Ryan C. Parker, Jean-S\'ebastien Pegon,
Marco Menchetti, Joseph Pearse, Arash Bahrami, Anastasia Moroz, Adrian
Wonfor, Richard V. Penty, Timothy P. Spiller and Andrew Lord | 5G Network Slicing with QKD and Quantum-Safe Security | 9 pages, 7 figures | J. Opt. Commun. Netw. 13, 33-40 (2021) | 10.1364/JOCN.413918 | null | cs.NI quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We demonstrate how the 5G network slicing model can be extended to address
data security requirements. In this work we demonstrate two different slice
configurations, with different encryption requirements, representing two
diverse use-cases for 5G networking: namely, an enterprise application hosted
at a metro netwo... | [
{
"created": "Tue, 7 Jul 2020 12:14:52 GMT",
"version": "v1"
},
{
"created": "Fri, 8 Jan 2021 09:11:33 GMT",
"version": "v2"
}
] | 2021-01-25 | [
[
"Wright",
"Paul",
""
],
[
"White",
"Catherine",
""
],
[
"Parker",
"Ryan C.",
""
],
[
"Pegon",
"Jean-Sébastien",
""
],
[
"Menchetti",
"Marco",
""
],
[
"Pearse",
"Joseph",
""
],
[
"Bahrami",
"Arash",
""
],
... | We demonstrate how the 5G network slicing model can be extended to address data security requirements. In this work we demonstrate two different slice configurations, with different encryption requirements, representing two diverse use-cases for 5G networking: namely, an enterprise application hosted at a metro network... |
2007.03800 | Paul Irofti | Cristian Rusu and Paul Irofti | Efficient and Parallel Separable Dictionary Learning | null | null | null | null | cs.LG cs.NA eess.IV math.NA stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Separable, or Kronecker product, dictionaries provide natural decompositions
for 2D signals, such as images. In this paper, we describe a highly
parallelizable algorithm that learns such dictionaries which reaches sparse
representations competitive with the previous state of the art dictionary
learning algorithms fro... | [
{
"created": "Tue, 7 Jul 2020 21:46:32 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Aug 2020 20:15:43 GMT",
"version": "v2"
},
{
"created": "Thu, 17 Dec 2020 14:44:06 GMT",
"version": "v3"
},
{
"created": "Wed, 1 Dec 2021 22:50:00 GMT",
"version": "v4"
}
] | 2021-12-03 | [
[
"Rusu",
"Cristian",
""
],
[
"Irofti",
"Paul",
""
]
] | Separable, or Kronecker product, dictionaries provide natural decompositions for 2D signals, such as images. In this paper, we describe a highly parallelizable algorithm that learns such dictionaries which reaches sparse representations competitive with the previous state of the art dictionary learning algorithms from ... |
2305.16049 | Lantian Li Mr. | Lantian Li and Xiaolou Li and Haoyu Jiang and Chen Chen and Ruihai Hou
and Dong Wang | CN-Celeb-AV: A Multi-Genre Audio-Visual Dataset for Person Recognition | INTERSPEECH 2023 | null | null | null | cs.CV cs.MM cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Audio-visual person recognition (AVPR) has received extensive attention.
However, most datasets used for AVPR research so far are collected in
constrained environments, and thus cannot reflect the true performance of AVPR
systems in real-world scenarios. To meet the request for research on AVPR in
unconstrained condi... | [
{
"created": "Thu, 25 May 2023 13:31:37 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Jul 2023 15:13:23 GMT",
"version": "v2"
}
] | 2023-07-31 | [
[
"Li",
"Lantian",
""
],
[
"Li",
"Xiaolou",
""
],
[
"Jiang",
"Haoyu",
""
],
[
"Chen",
"Chen",
""
],
[
"Hou",
"Ruihai",
""
],
[
"Wang",
"Dong",
""
]
] | Audio-visual person recognition (AVPR) has received extensive attention. However, most datasets used for AVPR research so far are collected in constrained environments, and thus cannot reflect the true performance of AVPR systems in real-world scenarios. To meet the request for research on AVPR in unconstrained conditi... |
2303.08536 | Yong Man Ro | Joanna Hong, Minsu Kim, Jeongsoo Choi, Yong Man Ro | Watch or Listen: Robust Audio-Visual Speech Recognition with Visual
Corruption Modeling and Reliability Scoring | Accepted at CVPR 2023. Implementation available:
https://github.com/joannahong/AV-RelScore | null | null | null | cs.MM cs.CV cs.LG cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper deals with Audio-Visual Speech Recognition (AVSR) under multimodal
input corruption situations where audio inputs and visual inputs are both
corrupted, which is not well addressed in previous research directions.
Previous studies have focused on how to complement the corrupted audio inputs
with the clean v... | [
{
"created": "Wed, 15 Mar 2023 11:29:36 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Mar 2023 07:01:45 GMT",
"version": "v2"
}
] | 2023-03-21 | [
[
"Hong",
"Joanna",
""
],
[
"Kim",
"Minsu",
""
],
[
"Choi",
"Jeongsoo",
""
],
[
"Ro",
"Yong Man",
""
]
] | This paper deals with Audio-Visual Speech Recognition (AVSR) under multimodal input corruption situations where audio inputs and visual inputs are both corrupted, which is not well addressed in previous research directions. Previous studies have focused on how to complement the corrupted audio inputs with the clean vis... |
1910.04071 | Annika Reinke | Lena Maier-Hein, Annika Reinke, Michal Kozubek, Anne L. Martel, Tal
Arbel, Matthias Eisenmann, Allan Hanbuary, Pierre Jannin, Henning M\"uller,
Sinan Onogur, Julio Saez-Rodriguez, Bram van Ginneken, Annette
Kopp-Schneider, Bennett Landman | BIAS: Transparent reporting of biomedical image analysis challenges | 2 Appendices - Appendix A: BIAS reporting guideline for biomedical
image analysis challenges, Appendix B: Glossary; 2 Supplements - Suppl 1:
Form for summarizing information on challenge organization, Suppl 2:
Structured description of a challenge design | null | null | null | cs.CV cs.CY eess.IV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The number of biomedical image analysis challenges organized per year is
steadily increasing. These international competitions have the purpose of
benchmarking algorithms on common data sets, typically to identify the best
method for a given problem. Recent research, however, revealed that common
practice related to ... | [
{
"created": "Wed, 9 Oct 2019 15:30:33 GMT",
"version": "v1"
},
{
"created": "Wed, 23 Oct 2019 06:27:03 GMT",
"version": "v2"
},
{
"created": "Mon, 25 Nov 2019 12:26:11 GMT",
"version": "v3"
},
{
"created": "Wed, 17 Jun 2020 06:58:41 GMT",
"version": "v4"
},
{
"cr... | 2020-09-01 | [
[
"Maier-Hein",
"Lena",
""
],
[
"Reinke",
"Annika",
""
],
[
"Kozubek",
"Michal",
""
],
[
"Martel",
"Anne L.",
""
],
[
"Arbel",
"Tal",
""
],
[
"Eisenmann",
"Matthias",
""
],
[
"Hanbuary",
"Allan",
""
],
[
... | The number of biomedical image analysis challenges organized per year is steadily increasing. These international competitions have the purpose of benchmarking algorithms on common data sets, typically to identify the best method for a given problem. Recent research, however, revealed that common practice related to ch... |
1903.09106 | Diego Didona Dr | Diego Didona, Panagiota Fatourou, Rachid Guerraoui, Jingjing Wang,
Willy Zwaenepoel | Distributed Transactional Systems Cannot Be Fast | null | null | null | null | cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove that no fully transactional system can provide fast read
transactions (including read-only ones that are considered the most frequent in
practice). Specifically, to achieve fast read transactions, the system has to
give up support of transactions that write more than one object. We prove this
impossibility r... | [
{
"created": "Thu, 21 Mar 2019 16:43:03 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Apr 2019 05:59:22 GMT",
"version": "v2"
}
] | 2019-04-11 | [
[
"Didona",
"Diego",
""
],
[
"Fatourou",
"Panagiota",
""
],
[
"Guerraoui",
"Rachid",
""
],
[
"Wang",
"Jingjing",
""
],
[
"Zwaenepoel",
"Willy",
""
]
] | We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions that write more than one object. We prove this impossibility res... |
1705.10552 | Longquan Dai | Longquan Dai | Interpreting and Extending The Guided Filter Via Cyclic Coordinate
Descent | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we will disclose that the Guided Filter (GF) can be
interpreted as the Cyclic Coordinate Descent (CCD) solver of a Least Square
(LS) objective function. This discovery implies a possible way to extend GF
because we can alter the objective function of GF and define new filters as the
first pass iteratio... | [
{
"created": "Tue, 30 May 2017 11:29:23 GMT",
"version": "v1"
}
] | 2017-05-31 | [
[
"Dai",
"Longquan",
""
]
] | In this paper, we will disclose that the Guided Filter (GF) can be interpreted as the Cyclic Coordinate Descent (CCD) solver of a Least Square (LS) objective function. This discovery implies a possible way to extend GF because we can alter the objective function of GF and define new filters as the first pass iteration ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.