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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2311.09498 | Md Mobasshir Rashid | Md Mobasshir Rashid, Rezaur Rahman, Samiul Hasan | Network Wide Evacuation Traffic Prediction in a Rapidly Intensifying
Hurricane from Traffic Detectors and Facebook Movement Data: A Deep Learning
Approach | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Traffic prediction during hurricane evacuation is essential for optimizing
the use of transportation infrastructures. It can reduce evacuation time by
providing information on future congestion in advance. However, evacuation
traffic prediction can be challenging as evacuation traffic patterns is
significantly differ... | [
{
"created": "Thu, 16 Nov 2023 01:50:54 GMT",
"version": "v1"
}
] | 2023-11-17 | [
[
"Rashid",
"Md Mobasshir",
""
],
[
"Rahman",
"Rezaur",
""
],
[
"Hasan",
"Samiul",
""
]
] | Traffic prediction during hurricane evacuation is essential for optimizing the use of transportation infrastructures. It can reduce evacuation time by providing information on future congestion in advance. However, evacuation traffic prediction can be challenging as evacuation traffic patterns is significantly differen... |
2106.14617 | Lucas Cavalcanti | Lucas Cavalcanti, Riei Joaquim, Edna Barros | Optimized Wireless Control and Telemetry Network for Mobile Soccer
Robots | 12 pages, published in RoboCup Symposium 2021 | null | null | null | cs.RO cs.SY eess.SY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | In a diverse set of robotics applications, including RoboCup categories,
mobile robots require control commands to interact with surrounding environment
correctly. These control commands should come wirelessly to not interfere in
robots' movement; also, the communication has a set of requirements, including
low laten... | [
{
"created": "Mon, 28 Jun 2021 12:24:17 GMT",
"version": "v1"
}
] | 2021-06-29 | [
[
"Cavalcanti",
"Lucas",
""
],
[
"Joaquim",
"Riei",
""
],
[
"Barros",
"Edna",
""
]
] | In a diverse set of robotics applications, including RoboCup categories, mobile robots require control commands to interact with surrounding environment correctly. These control commands should come wirelessly to not interfere in robots' movement; also, the communication has a set of requirements, including low latency... |
1304.2728 | Silvio Ursic | Silvio Ursic | Coefficients of Relations for Probabilistic Reasoning | Appears in Proceedings of the Third Conference on Uncertainty in
Artificial Intelligence (UAI1987) | null | null | UAI-P-1987-PG-156-162 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Definitions and notations with historical references are given for some
numerical coefficients commonly used to quantify relations among collections of
objects for the purpose of expressing approximate knowledge and probabilistic
reasoning.
| [
{
"created": "Wed, 27 Mar 2013 19:47:41 GMT",
"version": "v1"
}
] | 2013-04-11 | [
[
"Ursic",
"Silvio",
""
]
] | Definitions and notations with historical references are given for some numerical coefficients commonly used to quantify relations among collections of objects for the purpose of expressing approximate knowledge and probabilistic reasoning. |
2306.04557 | Jens Behley | Jan Weyler and Federico Magistri and Elias Marks and Yue Linn Chong
and Matteo Sodano and Gianmarco Roggiolani and Nived Chebrolu and Cyrill
Stachniss and Jens Behley | PhenoBench -- A Large Dataset and Benchmarks for Semantic Image
Interpretation in the Agricultural Domain | Accepted by IEEE Transactions on Pattern Analysis and Machine
Intelligence (T-PAMI) | null | 10.1109/TPAMI.2024.3419548 | null | cs.CV cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The production of food, feed, fiber, and fuel is a key task of agriculture,
which has to cope with many challenges in the upcoming decades, e.g., a higher
demand, climate change, lack of workers, and the availability of arable land.
Vision systems can support making better and more sustainable field management
decisi... | [
{
"created": "Wed, 7 Jun 2023 16:04:08 GMT",
"version": "v1"
},
{
"created": "Wed, 24 Jul 2024 12:48:47 GMT",
"version": "v2"
}
] | 2024-07-25 | [
[
"Weyler",
"Jan",
""
],
[
"Magistri",
"Federico",
""
],
[
"Marks",
"Elias",
""
],
[
"Chong",
"Yue Linn",
""
],
[
"Sodano",
"Matteo",
""
],
[
"Roggiolani",
"Gianmarco",
""
],
[
"Chebrolu",
"Nived",
""
],
... | The production of food, feed, fiber, and fuel is a key task of agriculture, which has to cope with many challenges in the upcoming decades, e.g., a higher demand, climate change, lack of workers, and the availability of arable land. Vision systems can support making better and more sustainable field management decision... |
1502.03068 | Sean Weerakkody | Sean Weerakkody, Yilin Mo, Bruno Sinopoli, Duo Han, Ling Shi | Multi-Sensor Scheduling for State Estimation with Event-Based,
Stochastic Triggers | 8 pages, 2 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In networked systems, state estimation is hampered by communication limits.
Past approaches, which consider scheduling sensors through deterministic
event-triggers, reduce communication and maintain estimation quality. However,
these approaches destroy the Gaussian property of the state, making it
computationally int... | [
{
"created": "Tue, 10 Feb 2015 20:21:48 GMT",
"version": "v1"
}
] | 2015-02-11 | [
[
"Weerakkody",
"Sean",
""
],
[
"Mo",
"Yilin",
""
],
[
"Sinopoli",
"Bruno",
""
],
[
"Han",
"Duo",
""
],
[
"Shi",
"Ling",
""
]
] | In networked systems, state estimation is hampered by communication limits. Past approaches, which consider scheduling sensors through deterministic event-triggers, reduce communication and maintain estimation quality. However, these approaches destroy the Gaussian property of the state, making it computationally intra... |
2401.02843 | Julia Fabienne Sandk\"uhler | Katja Grace, Harlan Stewart, Julia Fabienne Sandk\"uhler, Stephen
Thomas, Ben Weinstein-Raun, Jan Brauner | Thousands of AI Authors on the Future of AI | The asterisk indicates the corresponding author. The dagger indicates
equal contribution | null | null | null | cs.CY cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | In the largest survey of its kind, 2,778 researchers who had published in
top-tier artificial intelligence (AI) venues gave predictions on the pace of AI
progress and the nature and impacts of advanced AI systems The aggregate
forecasts give at least a 50% chance of AI systems achieving several milestones
by 2028, in... | [
{
"created": "Fri, 5 Jan 2024 14:53:09 GMT",
"version": "v1"
},
{
"created": "Tue, 30 Apr 2024 18:15:42 GMT",
"version": "v2"
}
] | 2024-05-02 | [
[
"Grace",
"Katja",
""
],
[
"Stewart",
"Harlan",
""
],
[
"Sandkühler",
"Julia Fabienne",
""
],
[
"Thomas",
"Stephen",
""
],
[
"Weinstein-Raun",
"Ben",
""
],
[
"Brauner",
"Jan",
""
]
] | In the largest survey of its kind, 2,778 researchers who had published in top-tier artificial intelligence (AI) venues gave predictions on the pace of AI progress and the nature and impacts of advanced AI systems The aggregate forecasts give at least a 50% chance of AI systems achieving several milestones by 2028, incl... |
2302.03976 | Matthew Johnson | Matthew A. Johnson and Stavros Volos and Ken Gordon and Sean T. Allen
and Christoph M. Wintersteiger and Sylvan Clebsch and John Starks and Manuel
Costa | Parma: Confidential Containers via Attested Execution Policies | 12 pages, 6 figures, 2 tables | null | null | null | cs.CR cs.NI cs.OS | http://creativecommons.org/licenses/by/4.0/ | Container-based technologies empower cloud tenants to develop highly portable
software and deploy services in the cloud at a rapid pace. Cloud privacy,
meanwhile, is important as a large number of container deployments operate on
privacy-sensitive data, but challenging due to the increasing frequency and
sophisticati... | [
{
"created": "Wed, 8 Feb 2023 10:15:07 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Feb 2023 10:04:07 GMT",
"version": "v2"
},
{
"created": "Tue, 7 Mar 2023 16:16:33 GMT",
"version": "v3"
}
] | 2023-03-08 | [
[
"Johnson",
"Matthew A.",
""
],
[
"Volos",
"Stavros",
""
],
[
"Gordon",
"Ken",
""
],
[
"Allen",
"Sean T.",
""
],
[
"Wintersteiger",
"Christoph M.",
""
],
[
"Clebsch",
"Sylvan",
""
],
[
"Starks",
"John",
""
... | Container-based technologies empower cloud tenants to develop highly portable software and deploy services in the cloud at a rapid pace. Cloud privacy, meanwhile, is important as a large number of container deployments operate on privacy-sensitive data, but challenging due to the increasing frequency and sophistication... |
2102.00905 | Benno van den Berg | Benno van den Berg and Martijn den Besten | Quadratic type checking for objective type theory | null | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce a modification of standard Martin-Lof type theory in which we
eliminate definitional equality and replace all computation rules by
propositional equalities. We show that type checking for such a system can be
done in quadratic time and that it has a natural homotopy-theoretic semantics.
| [
{
"created": "Mon, 1 Feb 2021 15:28:35 GMT",
"version": "v1"
}
] | 2021-02-02 | [
[
"Berg",
"Benno van den",
""
],
[
"Besten",
"Martijn den",
""
]
] | We introduce a modification of standard Martin-Lof type theory in which we eliminate definitional equality and replace all computation rules by propositional equalities. We show that type checking for such a system can be done in quadratic time and that it has a natural homotopy-theoretic semantics. |
2111.11710 | Sebastian Me\v{z}nar | Sebastian Me\v{z}nar, Matej Bevec, Nada Lavra\v{c}, Bla\v{z} \v{S}krlj | Link Analysis meets Ontologies: Are Embeddings the Answer? | 17 pages, 8 tables, 7 figures | null | null | null | cs.LG cs.AI cs.SI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The increasing amounts of semantic resources offer valuable storage of human
knowledge; however, the probability of wrong entries increases with the
increased size. The development of approaches that identify potentially
spurious parts of a given knowledge base is thus becoming an increasingly
important area of inter... | [
{
"created": "Tue, 23 Nov 2021 08:05:43 GMT",
"version": "v1"
}
] | 2021-11-24 | [
[
"Mežnar",
"Sebastian",
""
],
[
"Bevec",
"Matej",
""
],
[
"Lavrač",
"Nada",
""
],
[
"Škrlj",
"Blaž",
""
]
] | The increasing amounts of semantic resources offer valuable storage of human knowledge; however, the probability of wrong entries increases with the increased size. The development of approaches that identify potentially spurious parts of a given knowledge base is thus becoming an increasingly important area of interes... |
2107.12211 | Yann Fraboni | Yann Fraboni, Richard Vidal, Laetitia Kameni, Marco Lorenzi | A General Theory for Client Sampling in Federated Learning | null | null | null | null | cs.LG cs.AI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | While client sampling is a central operation of current state-of-the-art
federated learning (FL) approaches, the impact of this procedure on the
convergence and speed of FL remains under-investigated. In this work, we
provide a general theoretical framework to quantify the impact of a client
sampling scheme and of th... | [
{
"created": "Mon, 26 Jul 2021 13:36:06 GMT",
"version": "v1"
},
{
"created": "Tue, 26 Oct 2021 12:18:12 GMT",
"version": "v2"
},
{
"created": "Wed, 22 Dec 2021 09:02:13 GMT",
"version": "v3"
},
{
"created": "Tue, 14 Jun 2022 18:59:45 GMT",
"version": "v4"
}
] | 2022-06-16 | [
[
"Fraboni",
"Yann",
""
],
[
"Vidal",
"Richard",
""
],
[
"Kameni",
"Laetitia",
""
],
[
"Lorenzi",
"Marco",
""
]
] | While client sampling is a central operation of current state-of-the-art federated learning (FL) approaches, the impact of this procedure on the convergence and speed of FL remains under-investigated. In this work, we provide a general theoretical framework to quantify the impact of a client sampling scheme and of the ... |
2303.11708 | Gabriel Skantze | Gabriel Skantze, A. Seza Do\u{g}ru\"oz | The Open-domain Paradox for Chatbots: Common Ground as the Basis for
Human-like Dialogue | Accepted at SIGDIAL 2023 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | There is a surge in interest in the development of open-domain chatbots,
driven by the recent advancements of large language models. The "openness" of
the dialogue is expected to be maximized by providing minimal information to
the users about the common ground they can expect, including the presumed joint
activity. ... | [
{
"created": "Tue, 21 Mar 2023 10:01:49 GMT",
"version": "v1"
},
{
"created": "Fri, 28 Jul 2023 09:22:02 GMT",
"version": "v2"
}
] | 2023-07-31 | [
[
"Skantze",
"Gabriel",
""
],
[
"Doğruöz",
"A. Seza",
""
]
] | There is a surge in interest in the development of open-domain chatbots, driven by the recent advancements of large language models. The "openness" of the dialogue is expected to be maximized by providing minimal information to the users about the common ground they can expect, including the presumed joint activity. Ho... |
1301.1275 | Luca Allodi | Luca Allodi, Fabio Massacci | My Software has a Vulnerability, should I worry? | 12 pages, 4 figures | ACM TISSEC Vol 17 Issue 1, 2014 | 10.1145/2630069 | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | (U.S) Rule-based policies to mitigate software risk suggest to use the CVSS
score to measure the individual vulnerability risk and act accordingly: an HIGH
CVSS score according to the NVD (National (U.S.) Vulnerability Database) is
therefore translated into a "Yes". A key issue is whether such rule is
economically se... | [
{
"created": "Mon, 7 Jan 2013 17:32:36 GMT",
"version": "v1"
},
{
"created": "Mon, 5 Aug 2013 21:09:41 GMT",
"version": "v2"
},
{
"created": "Tue, 24 Sep 2013 14:05:27 GMT",
"version": "v3"
}
] | 2015-04-13 | [
[
"Allodi",
"Luca",
""
],
[
"Massacci",
"Fabio",
""
]
] | (U.S) Rule-based policies to mitigate software risk suggest to use the CVSS score to measure the individual vulnerability risk and act accordingly: an HIGH CVSS score according to the NVD (National (U.S.) Vulnerability Database) is therefore translated into a "Yes". A key issue is whether such rule is economically sens... |
2012.03743 | Marcos Baez | Alessandro Pina, Marcos Baez, Florian Daniel | Bringing Cognitive Augmentation to Web Browsing Accessibility | null | null | null | null | cs.CY cs.AI cs.HC cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we explore the opportunities brought by cognitive augmentation
to provide a more natural and accessible web browsing experience. We explore
these opportunities through \textit{conversational web browsing}, an emerging
interaction paradigm for the Web that enables blind and visually impaired users
(BVIP)... | [
{
"created": "Mon, 7 Dec 2020 14:40:52 GMT",
"version": "v1"
}
] | 2020-12-08 | [
[
"Pina",
"Alessandro",
""
],
[
"Baez",
"Marcos",
""
],
[
"Daniel",
"Florian",
""
]
] | In this paper we explore the opportunities brought by cognitive augmentation to provide a more natural and accessible web browsing experience. We explore these opportunities through \textit{conversational web browsing}, an emerging interaction paradigm for the Web that enables blind and visually impaired users (BVIP), ... |
2010.12948 | Mengjin Dong | Mengjin Dong, Long Xie, Sandhitsu R. Das, Jiancong Wang, Laura E.M.
Wisse, Robin deFlores, David A. Wolk, Paul Yushkevich (for the Alzheimer's
Disease Neuroimaging Initiative) | DeepAtrophy: Teaching a Neural Network to Differentiate Progressive
Changes from Noise on Longitudinal MRI in Alzheimer's Disease | Submitted to a journal, IF ~ 6 | null | null | null | cs.LG eess.IV q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Volume change measures derived from longitudinal MRI (e.g. hippocampal
atrophy) are a well-studied biomarker of disease progression in Alzheimer's
Disease (AD) and are used in clinical trials to track the therapeutic efficacy
of disease-modifying treatments. However, longitudinal MRI change measures can
be confounded... | [
{
"created": "Sat, 24 Oct 2020 18:23:02 GMT",
"version": "v1"
}
] | 2020-10-27 | [
[
"Dong",
"Mengjin",
"",
"for the Alzheimer's\n Disease Neuroimaging Initiative"
],
[
"Xie",
"Long",
"",
"for the Alzheimer's\n Disease Neuroimaging Initiative"
],
[
"Das",
"Sandhitsu R.",
"",
"for the Alzheimer's\n Disease Neuroimaging Initiative"
],
[... | Volume change measures derived from longitudinal MRI (e.g. hippocampal atrophy) are a well-studied biomarker of disease progression in Alzheimer's Disease (AD) and are used in clinical trials to track the therapeutic efficacy of disease-modifying treatments. However, longitudinal MRI change measures can be confounded b... |
2208.06828 | Li-Yue Sun | John Chiang | Multinomial Logistic Regression Algorithms via Quadratic Gradient | There is a good chance that the enhanced gradient methods for
multiclass LR could be used in the classisation neural-network training via
the softmax activation and the cross-entropy loss | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Multinomial logistic regression, also known by other names such as multiclass
logistic regression and softmax regression, is a fundamental classification
method that generalizes binary logistic regression to multiclass problems. A
recently work proposed a faster gradient called $\texttt{quadratic gradient}$
that can ... | [
{
"created": "Sun, 14 Aug 2022 11:00:27 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Mar 2023 12:10:09 GMT",
"version": "v2"
}
] | 2023-03-30 | [
[
"Chiang",
"John",
""
]
] | Multinomial logistic regression, also known by other names such as multiclass logistic regression and softmax regression, is a fundamental classification method that generalizes binary logistic regression to multiclass problems. A recently work proposed a faster gradient called $\texttt{quadratic gradient}$ that can ac... |
1507.00385 | Ranjit Jhala | Niki Vazou, Alexander Bakst, Ranjit Jhala | Bounded Refinement Types | 14 pages, International Conference on Functional Programming, ICFP
2015 | null | null | null | cs.PL cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a notion of bounded quantification for refinement types and show
how it expands the expressiveness of refinement typing by using it to develop
typed combinators for: (1) relational algebra and safe database access, (2)
Floyd-Hoare logic within a state transformer monad equipped with combinators
for branchi... | [
{
"created": "Wed, 1 Jul 2015 22:14:45 GMT",
"version": "v1"
}
] | 2015-07-03 | [
[
"Vazou",
"Niki",
""
],
[
"Bakst",
"Alexander",
""
],
[
"Jhala",
"Ranjit",
""
]
] | We present a notion of bounded quantification for refinement types and show how it expands the expressiveness of refinement typing by using it to develop typed combinators for: (1) relational algebra and safe database access, (2) Floyd-Hoare logic within a state transformer monad equipped with combinators for branching... |
1911.10737 | Liangchen Liu | Liangchen Liu, Louis Ly, Colin Macdonald, and Yen-Hsi Richard Tsai | Nearest Neighbor Sampling of Point Sets using Rays | 48 pages, 14 figures, accepted to Communication on Applied
Mathematics and Computation (CAMC), Focused Issue in Honor of Prof. Stanley
Osher on the Occasion of His 80th Birthday. Fixed typos and improved
notations | null | null | null | cs.CV cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a new framework for the sampling, compression, and analysis of
distributions of point sets and other geometric objects embedded in Euclidean
spaces. Our approach involves constructing a tensor called the RaySense sketch,
which captures nearest neighbors from the underlying geometry of points along a
set of... | [
{
"created": "Mon, 25 Nov 2019 07:31:54 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Nov 2019 20:09:42 GMT",
"version": "v2"
},
{
"created": "Thu, 10 Nov 2022 01:24:32 GMT",
"version": "v3"
},
{
"created": "Mon, 29 May 2023 23:16:24 GMT",
"version": "v4"
},
{
"c... | 2023-09-14 | [
[
"Liu",
"Liangchen",
""
],
[
"Ly",
"Louis",
""
],
[
"Macdonald",
"Colin",
""
],
[
"Tsai",
"Yen-Hsi Richard",
""
]
] | We propose a new framework for the sampling, compression, and analysis of distributions of point sets and other geometric objects embedded in Euclidean spaces. Our approach involves constructing a tensor called the RaySense sketch, which captures nearest neighbors from the underlying geometry of points along a set of r... |
2404.02383 | Andrew Eckford | Dongliang Jing, Lin Lin, Andrew W. Eckford | Performance Analysis and ISI Mitigation with Imperfect Transmitter in
Molecular Communication | Accepted for publication in IEEE Transactions on Nanobioscience | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In molecular communication (MC), molecules are released from the transmitter
to convey information. This paper considers a realistic molecule shift keying
(MoSK) scenario with two species of molecule in two reservoirs, where the
molecules are harvested from the environment and placed into different
reservoirs, which ... | [
{
"created": "Wed, 3 Apr 2024 00:55:12 GMT",
"version": "v1"
}
] | 2024-04-04 | [
[
"Jing",
"Dongliang",
""
],
[
"Lin",
"Lin",
""
],
[
"Eckford",
"Andrew W.",
""
]
] | In molecular communication (MC), molecules are released from the transmitter to convey information. This paper considers a realistic molecule shift keying (MoSK) scenario with two species of molecule in two reservoirs, where the molecules are harvested from the environment and placed into different reservoirs, which ar... |
cs/9906027 | Gillian Callaghan | Yorick Wilks and Roberta Catizone | Human-Computer Conversation | 14 pages, 1 figure | null | null | CS-99-04 | cs.CL cs.HC | null | The article surveys a little of the history of the technology, sets out the
main current theoretical approaches in brief, and discusses the on-going
opposition between theoretical and empirical approaches. It illustrates the
situation with some discussion of CONVERSE, a system that won the Loebner prize
in 1997 and w... | [
{
"created": "Fri, 25 Jun 1999 11:44:42 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Wilks",
"Yorick",
""
],
[
"Catizone",
"Roberta",
""
]
] | The article surveys a little of the history of the technology, sets out the main current theoretical approaches in brief, and discusses the on-going opposition between theoretical and empirical approaches. It illustrates the situation with some discussion of CONVERSE, a system that won the Loebner prize in 1997 and whi... |
1207.5774 | Lou Marvin Caraig | Lou Marvin Caraig | A New Training Algorithm for Kanerva's Sparse Distributed Memory | 5 pages, 5 figures | null | null | null | cs.CV cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The Sparse Distributed Memory proposed by Pentii Kanerva (SDM in short) was
thought to be a model of human long term memory. The architecture of the SDM
permits to store binary patterns and to retrieve them using partially matching
patterns. However Kanerva's model is especially efficient only in handling
random data... | [
{
"created": "Sun, 22 Jul 2012 16:30:07 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Jul 2012 05:04:18 GMT",
"version": "v2"
},
{
"created": "Fri, 27 Jul 2012 08:24:51 GMT",
"version": "v3"
}
] | 2012-07-30 | [
[
"Caraig",
"Lou Marvin",
""
]
] | The Sparse Distributed Memory proposed by Pentii Kanerva (SDM in short) was thought to be a model of human long term memory. The architecture of the SDM permits to store binary patterns and to retrieve them using partially matching patterns. However Kanerva's model is especially efficient only in handling random data. ... |
1908.01761 | Shengbin Jia | Shengbin Jia, Yang Xiang | Hybrid Neural Tagging Model for Open Relation Extraction | arXiv admin note: substantial text overlap with arXiv:1809.09408 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Open relation extraction (ORE) remains a challenge to obtain a semantic
representation by discovering arbitrary relation tuples from the unstructured
text. Conventional methods heavily depend on feature engineering or syntactic
parsing, they are inefficient or error-cascading. Recently, leveraging
supervised deep lea... | [
{
"created": "Fri, 26 Jul 2019 11:29:37 GMT",
"version": "v1"
},
{
"created": "Fri, 16 Aug 2019 08:47:24 GMT",
"version": "v2"
},
{
"created": "Thu, 13 Feb 2020 08:59:31 GMT",
"version": "v3"
}
] | 2020-02-14 | [
[
"Jia",
"Shengbin",
""
],
[
"Xiang",
"Yang",
""
]
] | Open relation extraction (ORE) remains a challenge to obtain a semantic representation by discovering arbitrary relation tuples from the unstructured text. Conventional methods heavily depend on feature engineering or syntactic parsing, they are inefficient or error-cascading. Recently, leveraging supervised deep learn... |
cs/0006019 | Frankie James | Manny Rayner, Beth Ann Hockey, Frankie James | A Compact Architecture for Dialogue Management Based on Scripts and
Meta-Outputs | null | Language Technology Joint Conference ANLP-NAACL 2000. 29 April - 4
May 2000, Seattle, WA | null | null | cs.CL | null | We describe an architecture for spoken dialogue interfaces to semi-autonomous
systems that transforms speech signals through successive representations of
linguistic, dialogue, and domain knowledge. Each step produces an output, and a
meta-output describing the transformation, with an executable program in a
simple s... | [
{
"created": "Fri, 9 Jun 2000 21:41:54 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Rayner",
"Manny",
""
],
[
"Hockey",
"Beth Ann",
""
],
[
"James",
"Frankie",
""
]
] | We describe an architecture for spoken dialogue interfaces to semi-autonomous systems that transforms speech signals through successive representations of linguistic, dialogue, and domain knowledge. Each step produces an output, and a meta-output describing the transformation, with an executable program in a simple scr... |
1809.00970 | Laurent Lejeune | Laurent Lejeune, Jan Grossrieder, Raphael Sznitman | Iterative multi-path tracking for video and volume segmentation with
sparse point supervision | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Recent machine learning strategies for segmentation tasks have shown great
ability when trained on large pixel-wise annotated image datasets. It remains a
major challenge however to aggregate such datasets, as the time and monetary
cost associated with collecting extensive annotations is extremely high. This
is parti... | [
{
"created": "Mon, 27 Aug 2018 13:38:50 GMT",
"version": "v1"
}
] | 2021-07-20 | [
[
"Lejeune",
"Laurent",
""
],
[
"Grossrieder",
"Jan",
""
],
[
"Sznitman",
"Raphael",
""
]
] | Recent machine learning strategies for segmentation tasks have shown great ability when trained on large pixel-wise annotated image datasets. It remains a major challenge however to aggregate such datasets, as the time and monetary cost associated with collecting extensive annotations is extremely high. This is particu... |
1601.02379 | Alex Lotz | Alex Lotz, Arne Hamann, Ingo L\"utkebohle, Dennis Stampfer, Matthias
Lutz and Christian Schlegel | Modeling Non-Functional Application Domain Constraints for
Component-Based Robotics Software Systems | Presented at DSLRob 2015 (arXiv:1601.00877) | null | null | DSLRob/2015/01 | cs.RO cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Service robots are complex, heterogeneous, software intensive systems built
from components. Recent robotics research trends mainly address isolated
capabilities on functional level. Non-functional properties, such as
responsiveness or deterministic behavior, are addressed only in isolation (if
at all). We argue that... | [
{
"created": "Mon, 11 Jan 2016 10:14:28 GMT",
"version": "v1"
}
] | 2016-01-12 | [
[
"Lotz",
"Alex",
""
],
[
"Hamann",
"Arne",
""
],
[
"Lütkebohle",
"Ingo",
""
],
[
"Stampfer",
"Dennis",
""
],
[
"Lutz",
"Matthias",
""
],
[
"Schlegel",
"Christian",
""
]
] | Service robots are complex, heterogeneous, software intensive systems built from components. Recent robotics research trends mainly address isolated capabilities on functional level. Non-functional properties, such as responsiveness or deterministic behavior, are addressed only in isolation (if at all). We argue that h... |
2305.07842 | Jasmine Roberts | Jasmine Roberts | The AR/VR Technology Stack: A Central Repository of Software Development
Libraries, Platforms, and Tools | null | null | 10.13140/RG.2.2.10465.17769 | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | A comprehensive repository of software development libraries, platforms, and
tools specifically to the domains of augmented, virtual, and mixed reality.
| [
{
"created": "Sat, 13 May 2023 05:50:26 GMT",
"version": "v1"
}
] | 2023-05-16 | [
[
"Roberts",
"Jasmine",
""
]
] | A comprehensive repository of software development libraries, platforms, and tools specifically to the domains of augmented, virtual, and mixed reality. |
2406.05898 | Mingwei Tang | Mingwei Tang, Meng Liu, Hong Li, Junjie Yang, Chenglin Wei, Boyang Li,
Dai Li, Rengan Xu, Yifan Xu, Zehua Zhang, Xiangyu Wang, Linfeng Liu, Yuelei
Xie, Chengye Liu, Labib Fawaz, Li Li, Hongnan Wang, Bill Zhu, Sri Reddy | Async Learned User Embeddings for Ads Delivery Optimization | Accepted by workshop on Multimodal Representation and Retrieval at
SIGIR 2024, Washington DC | null | null | null | cs.IR cs.AI cs.LG | http://creativecommons.org/licenses/by/4.0/ | In recommendation systems, high-quality user embeddings can capture subtle
preferences, enable precise similarity calculations, and adapt to changing
preferences over time to maintain relevance. The effectiveness of
recommendation systems depends on the quality of user embedding. We propose to
asynchronously learn hi... | [
{
"created": "Sun, 9 Jun 2024 19:35:20 GMT",
"version": "v1"
},
{
"created": "Sun, 23 Jun 2024 05:43:41 GMT",
"version": "v2"
}
] | 2024-06-25 | [
[
"Tang",
"Mingwei",
""
],
[
"Liu",
"Meng",
""
],
[
"Li",
"Hong",
""
],
[
"Yang",
"Junjie",
""
],
[
"Wei",
"Chenglin",
""
],
[
"Li",
"Boyang",
""
],
[
"Li",
"Dai",
""
],
[
"Xu",
"Rengan",
""
... | In recommendation systems, high-quality user embeddings can capture subtle preferences, enable precise similarity calculations, and adapt to changing preferences over time to maintain relevance. The effectiveness of recommendation systems depends on the quality of user embedding. We propose to asynchronously learn high... |
2112.11953 | Xiao Xu | Xiao Xu, Libo Qin, Kaiji Chen, Guoxing Wu, Linlin Li, Wanxiang Che | Text is no more Enough! A Benchmark for Profile-based Spoken Language
Understanding | Accepted by AAAI 2022 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Current researches on spoken language understanding (SLU) heavily are limited
to a simple setting: the plain text-based SLU that takes the user utterance as
input and generates its corresponding semantic frames (e.g., intent and slots).
Unfortunately, such a simple setting may fail to work in complex real-world
scena... | [
{
"created": "Wed, 22 Dec 2021 15:22:17 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Jan 2022 12:26:57 GMT",
"version": "v2"
},
{
"created": "Wed, 12 Jan 2022 15:18:17 GMT",
"version": "v3"
}
] | 2022-01-13 | [
[
"Xu",
"Xiao",
""
],
[
"Qin",
"Libo",
""
],
[
"Chen",
"Kaiji",
""
],
[
"Wu",
"Guoxing",
""
],
[
"Li",
"Linlin",
""
],
[
"Che",
"Wanxiang",
""
]
] | Current researches on spoken language understanding (SLU) heavily are limited to a simple setting: the plain text-based SLU that takes the user utterance as input and generates its corresponding semantic frames (e.g., intent and slots). Unfortunately, such a simple setting may fail to work in complex real-world scenari... |
2004.10700 | Netanel Raviv | Netanel Raviv, Siddharth Jain, Pulakesh Upadhyaya, Jehoshua Bruck, and
Anxiao Jiang | CodNN -- Robust Neural Networks From Coded Classification | To appear in ISIT '20 | null | null | null | cs.LG cs.CR cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Deep Neural Networks (DNNs) are a revolutionary force in the ongoing
information revolution, and yet their intrinsic properties remain a mystery. In
particular, it is widely known that DNNs are highly sensitive to noise, whether
adversarial or random. This poses a fundamental challenge for hardware
implementations of... | [
{
"created": "Wed, 22 Apr 2020 17:07:15 GMT",
"version": "v1"
},
{
"created": "Wed, 29 Apr 2020 22:55:41 GMT",
"version": "v2"
}
] | 2020-05-01 | [
[
"Raviv",
"Netanel",
""
],
[
"Jain",
"Siddharth",
""
],
[
"Upadhyaya",
"Pulakesh",
""
],
[
"Bruck",
"Jehoshua",
""
],
[
"Jiang",
"Anxiao",
""
]
] | Deep Neural Networks (DNNs) are a revolutionary force in the ongoing information revolution, and yet their intrinsic properties remain a mystery. In particular, it is widely known that DNNs are highly sensitive to noise, whether adversarial or random. This poses a fundamental challenge for hardware implementations of D... |
2103.02727 | Sydney Katz | Sydney M. Katz, Amir Maleki, Erdem B{\i}y{\i}k, Mykel J. Kochenderfer | Preference-based Learning of Reward Function Features | 8 pages, 8 figures | null | null | null | cs.RO cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Preference-based learning of reward functions, where the reward function is
learned using comparison data, has been well studied for complex robotic tasks
such as autonomous driving. Existing algorithms have focused on learning reward
functions that are linear in a set of trajectory features. The features are
typical... | [
{
"created": "Wed, 3 Mar 2021 22:32:43 GMT",
"version": "v1"
}
] | 2021-03-05 | [
[
"Katz",
"Sydney M.",
""
],
[
"Maleki",
"Amir",
""
],
[
"Bıyık",
"Erdem",
""
],
[
"Kochenderfer",
"Mykel J.",
""
]
] | Preference-based learning of reward functions, where the reward function is learned using comparison data, has been well studied for complex robotic tasks such as autonomous driving. Existing algorithms have focused on learning reward functions that are linear in a set of trajectory features. The features are typically... |
1401.0708 | Taraka Rama Kasicheyanula | Taraka Rama, Sudheer Kolachina, Lakshmi Bai B | Quantitative methods for Phylogenetic Inference in Historical
Linguistics: An experimental case study of South Central Dravidian | null | Indian Linguistics, Volume 70, 2009 | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/3.0/ | In this paper we examine the usefulness of two classes of algorithms Distance
Methods, Discrete Character Methods (Felsenstein and Felsenstein 2003) widely
used in genetics, for predicting the family relationships among a set of
related languages and therefore, diachronic language change. Applying these
algorithms to... | [
{
"created": "Fri, 3 Jan 2014 20:17:47 GMT",
"version": "v1"
}
] | 2014-01-06 | [
[
"Rama",
"Taraka",
""
],
[
"Kolachina",
"Sudheer",
""
],
[
"B",
"Lakshmi Bai",
""
]
] | In this paper we examine the usefulness of two classes of algorithms Distance Methods, Discrete Character Methods (Felsenstein and Felsenstein 2003) widely used in genetics, for predicting the family relationships among a set of related languages and therefore, diachronic language change. Applying these algorithms to t... |
2309.15268 | Amanda Adkins | Amanda Adkins, Taijing Chen, Joydeep Biswas | ObVi-SLAM: Long-Term Object-Visual SLAM | 8 pages, 7 figures, 1 table plus appendix with 4 figures and 1 table | null | null | null | cs.RO cs.CV | http://creativecommons.org/licenses/by-sa/4.0/ | Robots responsible for tasks over long time scales must be able to localize
consistently and scalably amid geometric, viewpoint, and appearance changes.
Existing visual SLAM approaches rely on low-level feature descriptors that are
not robust to such environmental changes and result in large map sizes that
scale poor... | [
{
"created": "Tue, 26 Sep 2023 20:57:35 GMT",
"version": "v1"
},
{
"created": "Sun, 22 Oct 2023 21:10:47 GMT",
"version": "v2"
}
] | 2023-10-24 | [
[
"Adkins",
"Amanda",
""
],
[
"Chen",
"Taijing",
""
],
[
"Biswas",
"Joydeep",
""
]
] | Robots responsible for tasks over long time scales must be able to localize consistently and scalably amid geometric, viewpoint, and appearance changes. Existing visual SLAM approaches rely on low-level feature descriptors that are not robust to such environmental changes and result in large map sizes that scale poorly... |
2003.11410 | Ana Tanevska | Ana Tanevska, Francesco Rea, Giulio Sandini, Lola Ca\~namero,
Alessandra Sciutti | A Socially Adaptable Framework for Human-Robot Interaction | null | null | 10.3389/frobt.2020.00121 | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In our everyday lives we are accustomed to partake in complex, personalized,
adaptive interactions with our peers. For a social robot to be able to recreate
this same kind of rich, human-like interaction, it should be aware of our needs
and affective states and be capable of continuously adapting its behavior to
them... | [
{
"created": "Wed, 25 Mar 2020 13:53:12 GMT",
"version": "v1"
}
] | 2020-10-26 | [
[
"Tanevska",
"Ana",
""
],
[
"Rea",
"Francesco",
""
],
[
"Sandini",
"Giulio",
""
],
[
"Cañamero",
"Lola",
""
],
[
"Sciutti",
"Alessandra",
""
]
] | In our everyday lives we are accustomed to partake in complex, personalized, adaptive interactions with our peers. For a social robot to be able to recreate this same kind of rich, human-like interaction, it should be aware of our needs and affective states and be capable of continuously adapting its behavior to them. ... |
2407.08349 | Durga R | Yashwanth Rao, Gaurisankar S, Durga R, Aparna Purayath, Vivek Maik,
Manojkumar Lakshmanan, and Mohanasankar Sivaprakasm | Spine Vision X-Ray Image based GUI Planning of Pedicle Screws Using
Enhanced YOLOv5 for Vertebrae Segmentation | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | In this paper, we propose an innovative Graphical User Interface (GUI) aimed
at improving preoperative planning and intra-operative guidance for precise
spinal screw placement through vertebrae segmentation. The methodology
encompasses both front-end and back-end computations. The front end comprises a
GUI that allow... | [
{
"created": "Thu, 11 Jul 2024 09:59:43 GMT",
"version": "v1"
}
] | 2024-07-12 | [
[
"Rao",
"Yashwanth",
""
],
[
"S",
"Gaurisankar",
""
],
[
"R",
"Durga",
""
],
[
"Purayath",
"Aparna",
""
],
[
"Maik",
"Vivek",
""
],
[
"Lakshmanan",
"Manojkumar",
""
],
[
"Sivaprakasm",
"Mohanasankar",
""
]... | In this paper, we propose an innovative Graphical User Interface (GUI) aimed at improving preoperative planning and intra-operative guidance for precise spinal screw placement through vertebrae segmentation. The methodology encompasses both front-end and back-end computations. The front end comprises a GUI that allows ... |
2002.07505 | Hatem Khalloof | Hatem Khalloof, Wilfried Jakob, Shadi Shahoud, Clemens Duepmeier and
Veit Hagenmeyer | A Scalable Method for Scheduling Distributed Energy Resources using
Parallelized Population-based Metaheuristics | null | null | null | null | cs.DC cs.AI cs.SE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recent years have seen an increasing integration of distributed renewable
energy resources into existing electric power grids. Due to the uncertain
nature of renewable energy resources, network operators are faced with new
challenges in balancing load and generation. In order to meet the new
requirements, intelligent... | [
{
"created": "Tue, 18 Feb 2020 11:51:28 GMT",
"version": "v1"
},
{
"created": "Thu, 4 Jun 2020 13:02:27 GMT",
"version": "v2"
}
] | 2020-06-05 | [
[
"Khalloof",
"Hatem",
""
],
[
"Jakob",
"Wilfried",
""
],
[
"Shahoud",
"Shadi",
""
],
[
"Duepmeier",
"Clemens",
""
],
[
"Hagenmeyer",
"Veit",
""
]
] | Recent years have seen an increasing integration of distributed renewable energy resources into existing electric power grids. Due to the uncertain nature of renewable energy resources, network operators are faced with new challenges in balancing load and generation. In order to meet the new requirements, intelligent d... |
2004.13876 | Marcos Vin\'icius Treviso | Marcos V. Treviso and Andr\'e F. T. Martins | The Explanation Game: Towards Prediction Explainability through Sparse
Communication | BlackBoxNLP 2020 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Explainability is a topic of growing importance in NLP. In this work, we
provide a unified perspective of explainability as a communication problem
between an explainer and a layperson about a classifier's decision. We use this
framework to compare several prior approaches for extracting explanations,
including gradi... | [
{
"created": "Tue, 28 Apr 2020 22:27:19 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Oct 2020 08:05:13 GMT",
"version": "v2"
}
] | 2020-10-13 | [
[
"Treviso",
"Marcos V.",
""
],
[
"Martins",
"André F. T.",
""
]
] | Explainability is a topic of growing importance in NLP. In this work, we provide a unified perspective of explainability as a communication problem between an explainer and a layperson about a classifier's decision. We use this framework to compare several prior approaches for extracting explanations, including gradien... |
cs/0603034 | Ivan Jos\'e Varzinczak | Andreas Herzig and Ivan Varzinczak | Metatheory of actions: beyond consistency | null | null | null | null | cs.AI | null | Consistency check has been the only criterion for theory evaluation in
logic-based approaches to reasoning about actions. This work goes beyond that
and contributes to the metatheory of actions by investigating what other
properties a good domain description in reasoning about actions should have. We
state some metat... | [
{
"created": "Thu, 9 Mar 2006 10:07:46 GMT",
"version": "v1"
}
] | 2009-09-29 | [
[
"Herzig",
"Andreas",
""
],
[
"Varzinczak",
"Ivan",
""
]
] | Consistency check has been the only criterion for theory evaluation in logic-based approaches to reasoning about actions. This work goes beyond that and contributes to the metatheory of actions by investigating what other properties a good domain description in reasoning about actions should have. We state some metathe... |
1804.10848 | Abhishta - | C.G.J. Putman, Abhishta, Lambert J.M. Nieuwenhuis | Business Model of a Botnet | Proceedings of 2018, 26th Euromicro International conference on
Parallel, Distributed, and Network-Based Processing (PDP) | null | 10.1109/PDP2018.2018.00077 | null | cs.CY cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Botnets continue to be an active threat against firms or companies and
individuals worldwide. Previous research regarding botnets has unveiled
information on how the system and their stakeholders operate, but an insight on
the economic structure that supports these stakeholders is lacking. The
objective of this resea... | [
{
"created": "Sat, 28 Apr 2018 21:20:57 GMT",
"version": "v1"
}
] | 2018-06-14 | [
[
"Putman",
"C. G. J.",
""
],
[
"Abhishta",
"",
""
],
[
"Nieuwenhuis",
"Lambert J. M.",
""
]
] | Botnets continue to be an active threat against firms or companies and individuals worldwide. Previous research regarding botnets has unveiled information on how the system and their stakeholders operate, but an insight on the economic structure that supports these stakeholders is lacking. The objective of this researc... |
1604.01464 | Mirza Kibria | Mirza Golam Kibria, Fang Yuan and Fumihide Kojima | Feedback Bits Allocation for Interference Minimization in Cognitive
Radio Communications | Feedback Bits Allocation | IEEE Wireless Commun. Lett., vol. 5, no. 1, pp. 104-107, Feb. 2016 | 10.1109/LWC.2015.2503771 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This letter studies the limited feedback cognitive radio system, where the
primary users (PU) are interfered by the secondary transmitter (ST) due to the
imperfect beamforming. We propose to allocate the feedback bits among multiple
PUs to minimize the maximum interference caused by the ST, by exploiting the
heteroge... | [
{
"created": "Wed, 6 Apr 2016 02:09:49 GMT",
"version": "v1"
}
] | 2017-08-16 | [
[
"Kibria",
"Mirza Golam",
""
],
[
"Yuan",
"Fang",
""
],
[
"Kojima",
"Fumihide",
""
]
] | This letter studies the limited feedback cognitive radio system, where the primary users (PU) are interfered by the secondary transmitter (ST) due to the imperfect beamforming. We propose to allocate the feedback bits among multiple PUs to minimize the maximum interference caused by the ST, by exploiting the heterogene... |
1309.3132 | Xiao-Bo Jin | Xiao-Bo Jin, Guang-Gang Geng, Dexian Zhang | Combination of Multiple Bipartite Ranking for Web Content Quality
Evaluation | 17 pages, 8 figures, 2 tables | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Web content quality estimation is crucial to various web content processing
applications. Our previous work applied Bagging + C4.5 to achive the best
results on the ECML/PKDD Discovery Challenge 2010, which is the comibination of
many point-wise rankinig models. In this paper, we combine multiple pair-wise
bipartite ... | [
{
"created": "Thu, 12 Sep 2013 12:15:51 GMT",
"version": "v1"
},
{
"created": "Thu, 26 Jun 2014 03:01:13 GMT",
"version": "v2"
}
] | 2014-06-27 | [
[
"Jin",
"Xiao-Bo",
""
],
[
"Geng",
"Guang-Gang",
""
],
[
"Zhang",
"Dexian",
""
]
] | Web content quality estimation is crucial to various web content processing applications. Our previous work applied Bagging + C4.5 to achive the best results on the ECML/PKDD Discovery Challenge 2010, which is the comibination of many point-wise rankinig models. In this paper, we combine multiple pair-wise bipartite ra... |
2305.12768 | Jae-woong Lee | Jae-woong Lee, Seongmin Park, Mincheol Yoon, and Jongwuk Lee | uCTRL: Unbiased Contrastive Representation Learning via Alignment and
Uniformity for Collaborative Filtering | SIGIR 2023 | null | null | null | cs.IR cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Because implicit user feedback for the collaborative filtering (CF) models is
biased toward popular items, CF models tend to yield recommendation lists with
popularity bias. Previous studies have utilized inverse propensity weighting
(IPW) or causal inference to mitigate this problem. However, they solely employ
poin... | [
{
"created": "Mon, 22 May 2023 06:55:38 GMT",
"version": "v1"
}
] | 2023-05-23 | [
[
"Lee",
"Jae-woong",
""
],
[
"Park",
"Seongmin",
""
],
[
"Yoon",
"Mincheol",
""
],
[
"Lee",
"Jongwuk",
""
]
] | Because implicit user feedback for the collaborative filtering (CF) models is biased toward popular items, CF models tend to yield recommendation lists with popularity bias. Previous studies have utilized inverse propensity weighting (IPW) or causal inference to mitigate this problem. However, they solely employ pointw... |
2210.00131 | Emily McMilin | Emily McMilin | Underspecification in Language Modeling Tasks: A Causality-Informed
Study of Gendered Pronoun Resolution | 24 pages, 41 figures | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | Modern language modeling tasks are often underspecified: for a given token
prediction, many words may satisfy the user's intent of producing natural
language at inference time, however only one word will minimize the task's loss
function at training time. We introduce a simple causal mechanism to describe
the role un... | [
{
"created": "Fri, 30 Sep 2022 23:10:11 GMT",
"version": "v1"
},
{
"created": "Tue, 22 Nov 2022 14:50:04 GMT",
"version": "v2"
},
{
"created": "Mon, 17 Jul 2023 17:56:10 GMT",
"version": "v3"
},
{
"created": "Thu, 22 Feb 2024 18:52:15 GMT",
"version": "v4"
}
] | 2024-02-23 | [
[
"McMilin",
"Emily",
""
]
] | Modern language modeling tasks are often underspecified: for a given token prediction, many words may satisfy the user's intent of producing natural language at inference time, however only one word will minimize the task's loss function at training time. We introduce a simple causal mechanism to describe the role unde... |
1507.06829 | Lisa Posch | Lisa Posch, Arnim Bleier, Philipp Schaer, Markus Strohmaier | The Polylingual Labeled Topic Model | Accepted for publication at KI 2015 (38th edition of the German
Conference on Artificial Intelligence) | null | 10.1007/978-3-319-24489-1_26 | null | cs.CL cs.IR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present the Polylingual Labeled Topic Model, a model which
combines the characteristics of the existing Polylingual Topic Model and
Labeled LDA. The model accounts for multiple languages with separate topic
distributions for each language while restricting the permitted topics of a
document to a set... | [
{
"created": "Fri, 24 Jul 2015 13:01:20 GMT",
"version": "v1"
}
] | 2017-05-03 | [
[
"Posch",
"Lisa",
""
],
[
"Bleier",
"Arnim",
""
],
[
"Schaer",
"Philipp",
""
],
[
"Strohmaier",
"Markus",
""
]
] | In this paper, we present the Polylingual Labeled Topic Model, a model which combines the characteristics of the existing Polylingual Topic Model and Labeled LDA. The model accounts for multiple languages with separate topic distributions for each language while restricting the permitted topics of a document to a set o... |
2303.12241 | Shiqiang Du | Kaiwu Zhang, Shiqiang Du, Baokai Liu, and Shengxia Gao | Preventing Dimensional Collapse of Incomplete Multi-View Clustering via
Direct Contrastive Learning | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Incomplete multi-view clustering (IMVC) is an unsupervised approach, among
which IMVC via contrastive learning has received attention due to its excellent
performance. The previous methods have the following problems: 1) Over-reliance
on additional projection heads when solving the dimensional collapse problem in
whi... | [
{
"created": "Wed, 22 Mar 2023 00:21:50 GMT",
"version": "v1"
}
] | 2023-03-23 | [
[
"Zhang",
"Kaiwu",
""
],
[
"Du",
"Shiqiang",
""
],
[
"Liu",
"Baokai",
""
],
[
"Gao",
"Shengxia",
""
]
] | Incomplete multi-view clustering (IMVC) is an unsupervised approach, among which IMVC via contrastive learning has received attention due to its excellent performance. The previous methods have the following problems: 1) Over-reliance on additional projection heads when solving the dimensional collapse problem in which... |
2001.00003 | Chengyue Jiang | Chengyue Jiang, Zhonglin Nian, Kaihao Guo, Shanbo Chu, Yinggong Zhao,
Libin Shen, Kewei Tu | Learning Numeral Embeddings | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Word embedding is an essential building block for deep learning methods for
natural language processing. Although word embedding has been extensively
studied over the years, the problem of how to effectively embed numerals, a
special subset of words, is still underexplored. Existing word embedding
methods do not lear... | [
{
"created": "Sat, 28 Dec 2019 03:15:43 GMT",
"version": "v1"
},
{
"created": "Wed, 8 Jan 2020 13:57:12 GMT",
"version": "v2"
},
{
"created": "Sat, 11 Jan 2020 14:00:55 GMT",
"version": "v3"
}
] | 2020-01-14 | [
[
"Jiang",
"Chengyue",
""
],
[
"Nian",
"Zhonglin",
""
],
[
"Guo",
"Kaihao",
""
],
[
"Chu",
"Shanbo",
""
],
[
"Zhao",
"Yinggong",
""
],
[
"Shen",
"Libin",
""
],
[
"Tu",
"Kewei",
""
]
] | Word embedding is an essential building block for deep learning methods for natural language processing. Although word embedding has been extensively studied over the years, the problem of how to effectively embed numerals, a special subset of words, is still underexplored. Existing word embedding methods do not learn ... |
2304.04172 | Kfir Levy Yehuda | Kfir Y. Levy | $\mu^2$-SGD: Stable Stochastic Optimization via a Double Momentum
Mechanism | null | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider stochastic convex optimization problems where the objective is an
expectation over smooth functions. For this setting we suggest a novel gradient
estimate that combines two recent mechanism that are related to notion of
momentum. Then, we design an SGD-style algorithm as well as an accelerated
version tha... | [
{
"created": "Sun, 9 Apr 2023 06:18:34 GMT",
"version": "v1"
}
] | 2023-04-11 | [
[
"Levy",
"Kfir Y.",
""
]
] | We consider stochastic convex optimization problems where the objective is an expectation over smooth functions. For this setting we suggest a novel gradient estimate that combines two recent mechanism that are related to notion of momentum. Then, we design an SGD-style algorithm as well as an accelerated version that ... |
2406.05849 | Jianhao Zheng | Jianhao Zheng, Daniel Barath, Marc Pollefeys, Iro Armeni | MAP-ADAPT: Real-Time Quality-Adaptive Semantic 3D Maps | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Creating 3D semantic reconstructions of environments is fundamental to many
applications, especially when related to autonomous agent operation (e.g.,
goal-oriented navigation or object interaction and manipulation). Commonly, 3D
semantic reconstruction systems capture the entire scene in the same level of
detail. Ho... | [
{
"created": "Sun, 9 Jun 2024 16:48:27 GMT",
"version": "v1"
}
] | 2024-06-11 | [
[
"Zheng",
"Jianhao",
""
],
[
"Barath",
"Daniel",
""
],
[
"Pollefeys",
"Marc",
""
],
[
"Armeni",
"Iro",
""
]
] | Creating 3D semantic reconstructions of environments is fundamental to many applications, especially when related to autonomous agent operation (e.g., goal-oriented navigation or object interaction and manipulation). Commonly, 3D semantic reconstruction systems capture the entire scene in the same level of detail. Howe... |
2312.05436 | Xiao Ling | Xiao Ling, Tim Menzies, Christopher Hazard, Jack Shu, Jacob Beel | Trading Off Scalability, Privacy, and Performance in Data Synthesis | 13 pages, 2 figures, 6 tables, submitted to IEEEAccess | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | Synthetic data has been widely applied in the real world recently. One
typical example is the creation of synthetic data for privacy concerned
datasets. In this scenario, synthetic data substitute the real data which
contains the privacy information, and is used to public testing for machine
learning models. Another ... | [
{
"created": "Sat, 9 Dec 2023 02:04:25 GMT",
"version": "v1"
}
] | 2023-12-12 | [
[
"Ling",
"Xiao",
""
],
[
"Menzies",
"Tim",
""
],
[
"Hazard",
"Christopher",
""
],
[
"Shu",
"Jack",
""
],
[
"Beel",
"Jacob",
""
]
] | Synthetic data has been widely applied in the real world recently. One typical example is the creation of synthetic data for privacy concerned datasets. In this scenario, synthetic data substitute the real data which contains the privacy information, and is used to public testing for machine learning models. Another ty... |
1905.10681 | Ahmed Qureshi | Ahmed H. Qureshi, Jacob J. Johnson, Yuzhe Qin, Taylor Henderson, Byron
Boots, Michael C. Yip | Composing Task-Agnostic Policies with Deep Reinforcement Learning | ICLR 2020 | null | null | null | cs.LG cs.AI cs.RO stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The composition of elementary behaviors to solve challenging transfer
learning problems is one of the key elements in building intelligent machines.
To date, there has been plenty of work on learning task-specific policies or
skills but almost no focus on composing necessary, task-agnostic skills to find
a solution t... | [
{
"created": "Sat, 25 May 2019 21:40:38 GMT",
"version": "v1"
},
{
"created": "Mon, 30 Dec 2019 20:32:24 GMT",
"version": "v2"
}
] | 2020-01-01 | [
[
"Qureshi",
"Ahmed H.",
""
],
[
"Johnson",
"Jacob J.",
""
],
[
"Qin",
"Yuzhe",
""
],
[
"Henderson",
"Taylor",
""
],
[
"Boots",
"Byron",
""
],
[
"Yip",
"Michael C.",
""
]
] | The composition of elementary behaviors to solve challenging transfer learning problems is one of the key elements in building intelligent machines. To date, there has been plenty of work on learning task-specific policies or skills but almost no focus on composing necessary, task-agnostic skills to find a solution to ... |
2210.07442 | Minghua Liu | Minghua Liu, Xuanlin Li, Zhan Ling, Yangyan Li, Hao Su | Frame Mining: a Free Lunch for Learning Robotic Manipulation from 3D
Point Clouds | Conference on Robot Learning (CoRL) 2022; Project Website:
https://colin97.github.io/FrameMining/ | null | null | null | cs.RO cs.CV | http://creativecommons.org/licenses/by/4.0/ | We study how choices of input point cloud coordinate frames impact learning
of manipulation skills from 3D point clouds. There exist a variety of
coordinate frame choices to normalize captured robot-object-interaction point
clouds. We find that different frames have a profound effect on agent learning
performance, an... | [
{
"created": "Fri, 14 Oct 2022 01:05:44 GMT",
"version": "v1"
}
] | 2022-10-17 | [
[
"Liu",
"Minghua",
""
],
[
"Li",
"Xuanlin",
""
],
[
"Ling",
"Zhan",
""
],
[
"Li",
"Yangyan",
""
],
[
"Su",
"Hao",
""
]
] | We study how choices of input point cloud coordinate frames impact learning of manipulation skills from 3D point clouds. There exist a variety of coordinate frame choices to normalize captured robot-object-interaction point clouds. We find that different frames have a profound effect on agent learning performance, and ... |
1602.01925 | Waleed Ammar | Waleed Ammar, George Mulcaire, Yulia Tsvetkov, Guillaume Lample, Chris
Dyer, Noah A. Smith | Massively Multilingual Word Embeddings | null | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We introduce new methods for estimating and evaluating embeddings of words in
more than fifty languages in a single shared embedding space. Our estimation
methods, multiCluster and multiCCA, use dictionaries and monolingual data; they
do not require parallel data. Our new evaluation method, multiQVEC-CCA, is
shown to... | [
{
"created": "Fri, 5 Feb 2016 04:26:38 GMT",
"version": "v1"
},
{
"created": "Sat, 21 May 2016 08:08:21 GMT",
"version": "v2"
}
] | 2016-05-24 | [
[
"Ammar",
"Waleed",
""
],
[
"Mulcaire",
"George",
""
],
[
"Tsvetkov",
"Yulia",
""
],
[
"Lample",
"Guillaume",
""
],
[
"Dyer",
"Chris",
""
],
[
"Smith",
"Noah A.",
""
]
] | We introduce new methods for estimating and evaluating embeddings of words in more than fifty languages in a single shared embedding space. Our estimation methods, multiCluster and multiCCA, use dictionaries and monolingual data; they do not require parallel data. Our new evaluation method, multiQVEC-CCA, is shown to c... |
1705.01507 | Joerg Evermann | Joerg Evermann and Jana-Rebecca Rehse and Peter Fettke | XES Tensorflow - Process Prediction using the Tensorflow Deep-Learning
Framework | null | null | null | null | cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Predicting the next activity of a running process is an important aspect of
process management. Recently, artificial neural networks, so called
deep-learning approaches, have been proposed to address this challenge. This
demo paper describes a software application that applies the Tensorflow
deep-learning framework t... | [
{
"created": "Wed, 3 May 2017 16:48:51 GMT",
"version": "v1"
}
] | 2017-05-04 | [
[
"Evermann",
"Joerg",
""
],
[
"Rehse",
"Jana-Rebecca",
""
],
[
"Fettke",
"Peter",
""
]
] | Predicting the next activity of a running process is an important aspect of process management. Recently, artificial neural networks, so called deep-learning approaches, have been proposed to address this challenge. This demo paper describes a software application that applies the Tensorflow deep-learning framework to ... |
1611.08315 | Sandor P. Fekete | S\'andor P. Fekete and Qian Li and Joseph S. B. Mitchell and Christian
Scheffer | Universal Guard Problems | 28 pages, 19 figures, full version of extended abstract that appeared
in the 27th International Symposium on Algorithms and Computation (ISAAC
2016), 32:1-32:13 | null | null | null | cs.CG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We provide a spectrum of results for the Universal Guard Problem, in which
one is to obtain a small set of points ("guards") that are "universal" in their
ability to guard any of a set of possible polygonal domains in the plane. We
give upper and lower bounds on the number of universal guards that are always
sufficie... | [
{
"created": "Thu, 24 Nov 2016 21:38:59 GMT",
"version": "v1"
},
{
"created": "Mon, 27 Mar 2017 07:19:12 GMT",
"version": "v2"
}
] | 2017-03-28 | [
[
"Fekete",
"Sándor P.",
""
],
[
"Li",
"Qian",
""
],
[
"Mitchell",
"Joseph S. B.",
""
],
[
"Scheffer",
"Christian",
""
]
] | We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points ("guards") that are "universal" in their ability to guard any of a set of possible polygonal domains in the plane. We give upper and lower bounds on the number of universal guards that are always sufficient... |
2406.02898 | Xiao Zheng | Xiao Zheng, Wenchi Cheng, Jingqing Wang, Wei Zhang | Location-Driven Beamforming for RIS-Assisted Near-Field Communications | 7 pages, 6 figures, accepted by IEEE Communication Magazine | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Future wireless communications are promising to support ubiquitous
connections and high data rates with cost-effective devices. Benefiting from
the energy-efficient elements with low cost, reconfigurable intelligent surface
(RIS) emerges as a potential solution to fulfill such demands, which has the
capability to fle... | [
{
"created": "Wed, 5 Jun 2024 03:36:38 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Jul 2024 02:47:59 GMT",
"version": "v2"
}
] | 2024-07-19 | [
[
"Zheng",
"Xiao",
""
],
[
"Cheng",
"Wenchi",
""
],
[
"Wang",
"Jingqing",
""
],
[
"Zhang",
"Wei",
""
]
] | Future wireless communications are promising to support ubiquitous connections and high data rates with cost-effective devices. Benefiting from the energy-efficient elements with low cost, reconfigurable intelligent surface (RIS) emerges as a potential solution to fulfill such demands, which has the capability to flexi... |
1805.05345 | Cristian Danescu-Niculescu-Mizil | Justine Zhang, Jonathan P. Chang, Cristian Danescu-Niculescu-Mizil,
Lucas Dixon, Yiqing Hua, Nithum Thain, Dario Taraborelli | Conversations Gone Awry: Detecting Early Signs of Conversational Failure | To appear in the Proceedings of ACL 2018, 15 pages, 1 figure. Data,
quiz, code and additional information at
http://www.cs.cornell.edu/~cristian/Conversations_gone_awry.html | null | null | null | cs.CL cs.AI cs.CY cs.HC physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the main challenges online social systems face is the prevalence of
antisocial behavior, such as harassment and personal attacks. In this work, we
introduce the task of predicting from the very start of a conversation whether
it will get out of hand. As opposed to detecting undesirable behavior after the
fact,... | [
{
"created": "Mon, 14 May 2018 18:00:03 GMT",
"version": "v1"
}
] | 2018-05-16 | [
[
"Zhang",
"Justine",
""
],
[
"Chang",
"Jonathan P.",
""
],
[
"Danescu-Niculescu-Mizil",
"Cristian",
""
],
[
"Dixon",
"Lucas",
""
],
[
"Hua",
"Yiqing",
""
],
[
"Thain",
"Nithum",
""
],
[
"Taraborelli",
"Dario",
... | One of the main challenges online social systems face is the prevalence of antisocial behavior, such as harassment and personal attacks. In this work, we introduce the task of predicting from the very start of a conversation whether it will get out of hand. As opposed to detecting undesirable behavior after the fact, t... |
1807.11655 | Ho Bae | Ho Bae, Jaehee Jang, Dahuin Jung, Hyemi Jang, Heonseok Ha, Hyungyu
Lee, Sungroh Yoon | Security and Privacy Issues in Deep Learning | null | null | null | null | cs.CR cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | To promote secure and private artificial intelligence (SPAI), we review
studies on the model security and data privacy of DNNs. Model security allows
system to behave as intended without being affected by malicious external
influences that can compromise its integrity and efficiency. Security attacks
can be divided b... | [
{
"created": "Tue, 31 Jul 2018 04:18:26 GMT",
"version": "v1"
},
{
"created": "Thu, 6 Dec 2018 07:35:31 GMT",
"version": "v2"
},
{
"created": "Sat, 23 Nov 2019 17:25:45 GMT",
"version": "v3"
},
{
"created": "Wed, 10 Mar 2021 00:55:18 GMT",
"version": "v4"
}
] | 2021-03-11 | [
[
"Bae",
"Ho",
""
],
[
"Jang",
"Jaehee",
""
],
[
"Jung",
"Dahuin",
""
],
[
"Jang",
"Hyemi",
""
],
[
"Ha",
"Heonseok",
""
],
[
"Lee",
"Hyungyu",
""
],
[
"Yoon",
"Sungroh",
""
]
] | To promote secure and private artificial intelligence (SPAI), we review studies on the model security and data privacy of DNNs. Model security allows system to behave as intended without being affected by malicious external influences that can compromise its integrity and efficiency. Security attacks can be divided bas... |
2009.01195 | Avishek Garain | Avishek Garain | Garain at SemEval-2020 Task 12: Sequence based Deep Learning for
Categorizing Offensive Language in Social Media | Preprint for SemEval-2020 Task 12 System description paper, 8 pages,
3 figures | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | SemEval-2020 Task 12 was OffenseEval: Multilingual Offensive Language
Identification in Social Media (Zampieri et al., 2020). The task was subdivided
into multiple languages and datasets were provided for each one. The task was
further divided into three sub-tasks: offensive language identification,
automatic categor... | [
{
"created": "Wed, 2 Sep 2020 17:09:29 GMT",
"version": "v1"
}
] | 2020-09-03 | [
[
"Garain",
"Avishek",
""
]
] | SemEval-2020 Task 12 was OffenseEval: Multilingual Offensive Language Identification in Social Media (Zampieri et al., 2020). The task was subdivided into multiple languages and datasets were provided for each one. The task was further divided into three sub-tasks: offensive language identification, automatic categoriz... |
1104.3348 | Nisarg Shah | Krishnendu Chatterjee and Monika Henzinger and Manas Joglekar and
Nisarg Shah | Symbolic Algorithms for Qualitative Analysis of Markov Decision
Processes with B\"uchi Objectives | null | In Formal Methods in System Design, 42(3):301-327, 2013 | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider Markov decision processes (MDPs) with \omega-regular
specifications given as parity objectives. We consider the problem of computing
the set of almost-sure winning states from where the objective can be ensured
with probability 1. The algorithms for the computation of the almost-sure
winning set for parit... | [
{
"created": "Sun, 17 Apr 2011 20:47:42 GMT",
"version": "v1"
},
{
"created": "Wed, 19 Nov 2014 20:48:12 GMT",
"version": "v2"
}
] | 2014-11-20 | [
[
"Chatterjee",
"Krishnendu",
""
],
[
"Henzinger",
"Monika",
""
],
[
"Joglekar",
"Manas",
""
],
[
"Shah",
"Nisarg",
""
]
] | We consider Markov decision processes (MDPs) with \omega-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning states from where the objective can be ensured with probability 1. The algorithms for the computation of the almost-sure winning set for parity ... |
2302.04116 | Yujin Huang | Yujin Huang, Terry Yue Zhuo, Qiongkai Xu, Han Hu, Xingliang Yuan,
Chunyang Chen | Training-free Lexical Backdoor Attacks on Language Models | Accepted to International World Wide Web Conference 2023, Security,
Privacy & Trust Track | null | 10.1145/3543507.3583348 | null | cs.CR cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large-scale language models have achieved tremendous success across various
natural language processing (NLP) applications. Nevertheless, language models
are vulnerable to backdoor attacks, which inject stealthy triggers into models
for steering them to undesirable behaviors. Most existing backdoor attacks,
such as d... | [
{
"created": "Wed, 8 Feb 2023 15:18:51 GMT",
"version": "v1"
}
] | 2023-02-09 | [
[
"Huang",
"Yujin",
""
],
[
"Zhuo",
"Terry Yue",
""
],
[
"Xu",
"Qiongkai",
""
],
[
"Hu",
"Han",
""
],
[
"Yuan",
"Xingliang",
""
],
[
"Chen",
"Chunyang",
""
]
] | Large-scale language models have achieved tremendous success across various natural language processing (NLP) applications. Nevertheless, language models are vulnerable to backdoor attacks, which inject stealthy triggers into models for steering them to undesirable behaviors. Most existing backdoor attacks, such as dat... |
1304.1881 | J\'er\'emie Lumbroso | Olivier Bodini and J\'er\'emie Lumbroso and Nicolas Rolin | Analytic Samplers and the Combinatorial Rejection Method | accepted at ANALCO 2015, 11 pages, 7 figures | null | null | null | cs.DM cs.DS math.CO math.PR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Boltzmann samplers, introduced by Duchon et al. in 2001, make it possible to
uniformly draw approximate size objects from any class which can be specified
through the symbolic method. This, through by evaluating the associated
generating functions to obtain the correct branching probabilities.
But these samplers re... | [
{
"created": "Sat, 6 Apr 2013 11:48:33 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Sep 2014 18:17:33 GMT",
"version": "v2"
},
{
"created": "Thu, 13 Nov 2014 02:09:58 GMT",
"version": "v3"
}
] | 2014-11-14 | [
[
"Bodini",
"Olivier",
""
],
[
"Lumbroso",
"Jérémie",
""
],
[
"Rolin",
"Nicolas",
""
]
] | Boltzmann samplers, introduced by Duchon et al. in 2001, make it possible to uniformly draw approximate size objects from any class which can be specified through the symbolic method. This, through by evaluating the associated generating functions to obtain the correct branching probabilities. But these samplers requir... |
2306.00431 | Jovan Komatovic | Pierre Civit, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Matteo
Monti, Manuel Vidigueira | Every Bit Counts in Consensus | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | Consensus enables n processes to agree on a common valid L-bit value, despite
t < n/3 processes being faulty and acting arbitrarily. A long line of work has
been dedicated to improving the worst-case communication complexity of
consensus in partial synchrony. This has recently culminated in the worst-case
word comple... | [
{
"created": "Thu, 1 Jun 2023 08:18:16 GMT",
"version": "v1"
},
{
"created": "Mon, 7 Aug 2023 12:32:41 GMT",
"version": "v2"
}
] | 2023-08-09 | [
[
"Civit",
"Pierre",
""
],
[
"Gilbert",
"Seth",
""
],
[
"Guerraoui",
"Rachid",
""
],
[
"Komatovic",
"Jovan",
""
],
[
"Monti",
"Matteo",
""
],
[
"Vidigueira",
"Manuel",
""
]
] | Consensus enables n processes to agree on a common valid L-bit value, despite t < n/3 processes being faulty and acting arbitrarily. A long line of work has been dedicated to improving the worst-case communication complexity of consensus in partial synchrony. This has recently culminated in the worst-case word complexi... |
2207.11707 | Sungha Choi | Sungha Choi, Seunghan Yang, Seokeon Choi, Sungrack Yun | Improving Test-Time Adaptation via Shift-agnostic Weight Regularization
and Nearest Source Prototypes | Accepted to ECCV 2022 | null | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | This paper proposes a novel test-time adaptation strategy that adjusts the
model pre-trained on the source domain using only unlabeled online data from
the target domain to alleviate the performance degradation due to the
distribution shift between the source and target domains. Adapting the entire
model parameters u... | [
{
"created": "Sun, 24 Jul 2022 10:17:05 GMT",
"version": "v1"
}
] | 2022-07-26 | [
[
"Choi",
"Sungha",
""
],
[
"Yang",
"Seunghan",
""
],
[
"Choi",
"Seokeon",
""
],
[
"Yun",
"Sungrack",
""
]
] | This paper proposes a novel test-time adaptation strategy that adjusts the model pre-trained on the source domain using only unlabeled online data from the target domain to alleviate the performance degradation due to the distribution shift between the source and target domains. Adapting the entire model parameters usi... |
1302.4973 | Christopher Meek | Christopher Meek | Strong Completeness and Faithfulness in Bayesian Networks | Appears in Proceedings of the Eleventh Conference on Uncertainty in
Artificial Intelligence (UAI1995) | null | null | UAI-P-1995-PG-411-418 | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A completeness result for d-separation applied to discrete Bayesian networks
is presented and it is shown that in a strong measure-theoretic sense almost
all discrete distributions for a given network structure are faithful; i.e. the
independence facts true of the distribution are all and only those entailed by
the n... | [
{
"created": "Wed, 20 Feb 2013 15:22:46 GMT",
"version": "v1"
}
] | 2013-02-21 | [
[
"Meek",
"Christopher",
""
]
] | A completeness result for d-separation applied to discrete Bayesian networks is presented and it is shown that in a strong measure-theoretic sense almost all discrete distributions for a given network structure are faithful; i.e. the independence facts true of the distribution are all and only those entailed by the net... |
2012.03449 | Zhaoting Li | Zhaoting Li, Jiankun Wang and Max Q.-H. Meng | Efficient Heuristic Generation for Robot Path Planning with Recurrent
Generative Model | null | null | null | null | cs.RO cs.AI | http://creativecommons.org/licenses/by/4.0/ | Robot path planning is difficult to solve due to the contradiction between
optimality of results and complexity of algorithms, even in 2D environments. To
find an optimal path, the algorithm needs to search all the state space, which
costs a lot of computation resource. To address this issue, we present a novel
recur... | [
{
"created": "Mon, 7 Dec 2020 05:03:03 GMT",
"version": "v1"
}
] | 2020-12-08 | [
[
"Li",
"Zhaoting",
""
],
[
"Wang",
"Jiankun",
""
],
[
"Meng",
"Max Q. -H.",
""
]
] | Robot path planning is difficult to solve due to the contradiction between optimality of results and complexity of algorithms, even in 2D environments. To find an optimal path, the algorithm needs to search all the state space, which costs a lot of computation resource. To address this issue, we present a novel recurre... |
1907.04383 | Joshua Brakensiek | Joshua Brakensiek, Venkatesan Guruswami, Marcin Wrochna, and Stanislav
\v{Z}ivn\'y | The Power of the Combined Basic LP and Affine Relaxation for Promise
CSPs | 17 pages, to appear in SICOMP | SIAM Journal on Computing 49(6) (2020) 1232-1248 | 10.1137/20M1312745 | null | cs.DS cs.CC cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the field of constraint satisfaction problems (CSP), promise CSPs are an
exciting new direction of study. In a promise CSP, each constraint comes in two
forms: "strict" and "weak," and in the associated decision problem one must
distinguish between being able to satisfy all the strict constraints versus not
being ... | [
{
"created": "Tue, 9 Jul 2019 19:54:36 GMT",
"version": "v1"
},
{
"created": "Thu, 16 Jan 2020 21:35:32 GMT",
"version": "v2"
},
{
"created": "Fri, 18 Sep 2020 14:35:12 GMT",
"version": "v3"
}
] | 2020-12-03 | [
[
"Brakensiek",
"Joshua",
""
],
[
"Guruswami",
"Venkatesan",
""
],
[
"Wrochna",
"Marcin",
""
],
[
"Živný",
"Stanislav",
""
]
] | In the field of constraint satisfaction problems (CSP), promise CSPs are an exciting new direction of study. In a promise CSP, each constraint comes in two forms: "strict" and "weak," and in the associated decision problem one must distinguish between being able to satisfy all the strict constraints versus not being ab... |
2103.14417 | Elena Burceanu | Emanuela Haller, Elena Burceanu, Marius Leordeanu | Self-Supervised Learning in Multi-Task Graphs through Iterative
Consensus Shift | Accepted at The British Machine Vision Conference (BMVC) 2021, 12
pages, 6 figures, 5 tables | null | null | null | cs.LG cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The human ability to synchronize the feedback from all their senses inspired
recent works in multi-task and multi-modal learning. While these works rely on
expensive supervision, our multi-task graph requires only pseudo-labels from
expert models. Every graph node represents a task, and each edge learns between
tasks... | [
{
"created": "Fri, 26 Mar 2021 11:57:42 GMT",
"version": "v1"
},
{
"created": "Tue, 28 Sep 2021 09:01:06 GMT",
"version": "v2"
},
{
"created": "Thu, 4 Nov 2021 17:59:14 GMT",
"version": "v3"
}
] | 2021-11-05 | [
[
"Haller",
"Emanuela",
""
],
[
"Burceanu",
"Elena",
""
],
[
"Leordeanu",
"Marius",
""
]
] | The human ability to synchronize the feedback from all their senses inspired recent works in multi-task and multi-modal learning. While these works rely on expensive supervision, our multi-task graph requires only pseudo-labels from expert models. Every graph node represents a task, and each edge learns between tasks t... |
2408.00724 | Yangzhen Wu | Yangzhen Wu, Zhiqing Sun, Shanda Li, Sean Welleck, Yiming Yang | An Empirical Analysis of Compute-Optimal Inference for Problem-Solving
with Language Models | null | null | null | null | cs.AI | http://creativecommons.org/licenses/by/4.0/ | The optimal training configurations of large language models (LLMs) with
respect to model sizes and compute budgets have been extensively studied. But
how to optimally configure LLMs during inference has not been explored in
sufficient depth. We study compute-optimal inference: designing models and
inference strategi... | [
{
"created": "Thu, 1 Aug 2024 17:16:04 GMT",
"version": "v1"
}
] | 2024-08-02 | [
[
"Wu",
"Yangzhen",
""
],
[
"Sun",
"Zhiqing",
""
],
[
"Li",
"Shanda",
""
],
[
"Welleck",
"Sean",
""
],
[
"Yang",
"Yiming",
""
]
] | The optimal training configurations of large language models (LLMs) with respect to model sizes and compute budgets have been extensively studied. But how to optimally configure LLMs during inference has not been explored in sufficient depth. We study compute-optimal inference: designing models and inference strategies... |
1109.5804 | Petr Hlin\v{e}n\'y | Robert Ganian and Petr Hlin\v{e}n\'y and Alexander Langer and Jan
Obdr\v{z}\'alek and Peter Rossmanith and Somnath Sikdar | Lower Bounds on the Complexity of MSO1 Model-Checking | null | null | null | null | cs.LO cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | One of the most important algorithmic meta-theorems is a famous result by
Courcelle, which states that any graph problem definable in monadic
second-order logic with edge-set quantifications (i.e., MSO2 model-checking) is
decidable in linear time on any class of graphs of bounded tree-width.
Recently, Kreutzer and Ta... | [
{
"created": "Tue, 27 Sep 2011 08:45:10 GMT",
"version": "v1"
},
{
"created": "Thu, 21 Jun 2012 21:20:13 GMT",
"version": "v2"
}
] | 2012-06-25 | [
[
"Ganian",
"Robert",
""
],
[
"Hliněný",
"Petr",
""
],
[
"Langer",
"Alexander",
""
],
[
"Obdržálek",
"Jan",
""
],
[
"Rossmanith",
"Peter",
""
],
[
"Sikdar",
"Somnath",
""
]
] | One of the most important algorithmic meta-theorems is a famous result by Courcelle, which states that any graph problem definable in monadic second-order logic with edge-set quantifications (i.e., MSO2 model-checking) is decidable in linear time on any class of graphs of bounded tree-width. Recently, Kreutzer and Taza... |
2310.13304 | Nan Gao | Nan Gao, Sam Nolan, Kaixin Ji, Shakila Khan Rumi, Judith Simone
Heinisch, Christoph Anderson, Klaus David, Flora D. Salim | "Living Within Four Walls": Exploring Emotional and Social Dynamics in
Mobile Usage During Home Confinement | null | null | null | null | cs.HC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Home confinement, a situation experienced by individuals for reasons ranging
from medical quarantines, rehabilitation needs, disability accommodations, and
remote working, is a common yet impactful aspect of modern life. While
essential in various scenarios, confinement within the home environment can
profoundly infl... | [
{
"created": "Fri, 20 Oct 2023 06:36:28 GMT",
"version": "v1"
},
{
"created": "Sat, 8 Jun 2024 10:16:36 GMT",
"version": "v2"
}
] | 2024-06-11 | [
[
"Gao",
"Nan",
""
],
[
"Nolan",
"Sam",
""
],
[
"Ji",
"Kaixin",
""
],
[
"Rumi",
"Shakila Khan",
""
],
[
"Heinisch",
"Judith Simone",
""
],
[
"Anderson",
"Christoph",
""
],
[
"David",
"Klaus",
""
],
[
... | Home confinement, a situation experienced by individuals for reasons ranging from medical quarantines, rehabilitation needs, disability accommodations, and remote working, is a common yet impactful aspect of modern life. While essential in various scenarios, confinement within the home environment can profoundly influe... |
2207.14072 | Chenning Li | Chenning Li, Li Liu, Zhichao Cao, Mi Zhang | WiVelo: Fine-grained Walking Velocity Estimation for Wi-Fi Passive
Tracking | Proceedings of IEEE SECON, 2022 | null | null | null | cs.HC eess.SP | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Passive human tracking via Wi-Fi has been researched broadly in the past
decade. Besides straight-forward anchor point localization, velocity is another
vital sign adopted by the existing approaches to infer user trajectory.
However, state-of-the-art Wi-Fi velocity estimation relies on
Doppler-Frequency-Shift (DFS) w... | [
{
"created": "Thu, 28 Jul 2022 13:24:07 GMT",
"version": "v1"
}
] | 2022-07-29 | [
[
"Li",
"Chenning",
""
],
[
"Liu",
"Li",
""
],
[
"Cao",
"Zhichao",
""
],
[
"Zhang",
"Mi",
""
]
] | Passive human tracking via Wi-Fi has been researched broadly in the past decade. Besides straight-forward anchor point localization, velocity is another vital sign adopted by the existing approaches to infer user trajectory. However, state-of-the-art Wi-Fi velocity estimation relies on Doppler-Frequency-Shift (DFS) whi... |
2102.12013 | Jianfeng Chi | Jianfeng Chi, Yuan Tian, Geoffrey J. Gordon, Han Zhao | Understanding and Mitigating Accuracy Disparity in Regression | ICML 2021 | null | null | null | cs.LG cs.CY stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | With the widespread deployment of large-scale prediction systems in
high-stakes domains, e.g., face recognition, criminal justice, etc., disparity
in prediction accuracy between different demographic subgroups has called for
fundamental understanding on the source of such disparity and algorithmic
intervention to mit... | [
{
"created": "Wed, 24 Feb 2021 01:24:50 GMT",
"version": "v1"
},
{
"created": "Sun, 13 Jun 2021 01:41:56 GMT",
"version": "v2"
}
] | 2021-06-15 | [
[
"Chi",
"Jianfeng",
""
],
[
"Tian",
"Yuan",
""
],
[
"Gordon",
"Geoffrey J.",
""
],
[
"Zhao",
"Han",
""
]
] | With the widespread deployment of large-scale prediction systems in high-stakes domains, e.g., face recognition, criminal justice, etc., disparity in prediction accuracy between different demographic subgroups has called for fundamental understanding on the source of such disparity and algorithmic intervention to mitig... |
2103.06546 | Li Fan | Fan Li, Yongming Li, Pin Wang, Jie Xiao, Fang Yan, Xinke Li | Integrated Age Estimation Mechanism | null | null | null | null | cs.CV cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Machine-learning-based age estimation has received lots of attention.
Traditional age estimation mechanism focuses estimation age error, but ignores
that there is a deviation between the estimated age and real age due to
disease. Pathological age estimation mechanism the author proposed before
introduces age deviatio... | [
{
"created": "Thu, 11 Mar 2021 09:14:10 GMT",
"version": "v1"
}
] | 2021-03-12 | [
[
"Li",
"Fan",
""
],
[
"Li",
"Yongming",
""
],
[
"Wang",
"Pin",
""
],
[
"Xiao",
"Jie",
""
],
[
"Yan",
"Fang",
""
],
[
"Li",
"Xinke",
""
]
] | Machine-learning-based age estimation has received lots of attention. Traditional age estimation mechanism focuses estimation age error, but ignores that there is a deviation between the estimated age and real age due to disease. Pathological age estimation mechanism the author proposed before introduces age deviation ... |
2209.03726 | Gabriel Kasmi | Gabriel Kasmi, Yves-Marie Saint-Drenan, David Trebosc, Rapha\"el
Jolivet, Jonathan Leloux, Babacar Sarr, Laurent Dubus | A crowdsourced dataset of aerial images with annotated solar
photovoltaic arrays and installation metadata | 12 pages, 3 figures, 7 tables, revised preprint resubmitted to
Scientific Data | null | 10.1038/s41597-023-01951-4 | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Photovoltaic (PV) energy generation plays a crucial role in the energy
transition. Small-scale PV installations are deployed at an unprecedented pace,
and their integration into the grid can be challenging since public authorities
often lack quality data about them. Overhead imagery is increasingly used to
improve th... | [
{
"created": "Thu, 8 Sep 2022 11:42:53 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Dec 2022 13:38:57 GMT",
"version": "v2"
}
] | 2023-02-01 | [
[
"Kasmi",
"Gabriel",
""
],
[
"Saint-Drenan",
"Yves-Marie",
""
],
[
"Trebosc",
"David",
""
],
[
"Jolivet",
"Raphaël",
""
],
[
"Leloux",
"Jonathan",
""
],
[
"Sarr",
"Babacar",
""
],
[
"Dubus",
"Laurent",
""
... | Photovoltaic (PV) energy generation plays a crucial role in the energy transition. Small-scale PV installations are deployed at an unprecedented pace, and their integration into the grid can be challenging since public authorities often lack quality data about them. Overhead imagery is increasingly used to improve the ... |
2311.13538 | Zhicheng Yang | Zhicheng Yang, Yinya Huang, Jing Xiong, Liang Feng, Xiaodan Liang,
Yiwei Wang, Jing Tang | AlignedCoT: Prompting Large Language Models via Native-Speaking
Demonstrations | 8 pages, 6 figures | null | null | null | cs.AI cs.LG | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Large Language Models prompting, such as using in-context demonstrations, is
a mainstream technique for invoking LLMs to perform high-performance and solid
complex reasoning (e.g., mathematical reasoning, commonsense reasoning), and
has the potential for further human-machine collaborative scientific findings.
Howeve... | [
{
"created": "Wed, 22 Nov 2023 17:24:21 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Jan 2024 14:16:41 GMT",
"version": "v2"
},
{
"created": "Sat, 27 Jan 2024 10:10:20 GMT",
"version": "v3"
},
{
"created": "Sat, 13 Jul 2024 13:36:09 GMT",
"version": "v4"
}
] | 2024-07-16 | [
[
"Yang",
"Zhicheng",
""
],
[
"Huang",
"Yinya",
""
],
[
"Xiong",
"Jing",
""
],
[
"Feng",
"Liang",
""
],
[
"Liang",
"Xiaodan",
""
],
[
"Wang",
"Yiwei",
""
],
[
"Tang",
"Jing",
""
]
] | Large Language Models prompting, such as using in-context demonstrations, is a mainstream technique for invoking LLMs to perform high-performance and solid complex reasoning (e.g., mathematical reasoning, commonsense reasoning), and has the potential for further human-machine collaborative scientific findings. However,... |
1904.10885 | Martino Borello | Martino Borello and Wolfgang Willems | Group codes over fields are asymptotically good | 8 pages | null | null | null | cs.IT math.CO math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Group codes are right or left ideals in a group algebra of a finite group
over a finite field. Following ideas of Bazzi and Mitter on group codes over
the binary field, we prove that group codes over finite fields of any
characteristic are asymptotically good.
| [
{
"created": "Wed, 24 Apr 2019 15:53:46 GMT",
"version": "v1"
},
{
"created": "Mon, 20 Jan 2020 13:53:40 GMT",
"version": "v2"
}
] | 2020-01-22 | [
[
"Borello",
"Martino",
""
],
[
"Willems",
"Wolfgang",
""
]
] | Group codes are right or left ideals in a group algebra of a finite group over a finite field. Following ideas of Bazzi and Mitter on group codes over the binary field, we prove that group codes over finite fields of any characteristic are asymptotically good. |
2211.06344 | Wenjun Jiang | Wenjun Jiang and Xiaojun Yuan | Simultaneous Active and Passive Information Transfer for RIS-Aided MIMO
Systems: Iterative Decoding and Evolution Analysis | 15 pages, 7 figures | null | 10.1109/TSP.2023.3272728 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper investigates the potential of reconfigurable intelligent surface
(RIS) for passive information transfer in a RIS-aided multiple-input
multiple-output (MIMO) system. We propose a novel simultaneous active and
passive information transfer (SAPIT) scheme. In SAPIT, the transmitter (Tx) and
the RIS deliver inf... | [
{
"created": "Fri, 11 Nov 2022 16:45:01 GMT",
"version": "v1"
},
{
"created": "Thu, 27 Apr 2023 03:46:23 GMT",
"version": "v2"
},
{
"created": "Mon, 1 May 2023 02:59:29 GMT",
"version": "v3"
}
] | 2023-05-31 | [
[
"Jiang",
"Wenjun",
""
],
[
"Yuan",
"Xiaojun",
""
]
] | This paper investigates the potential of reconfigurable intelligent surface (RIS) for passive information transfer in a RIS-aided multiple-input multiple-output (MIMO) system. We propose a novel simultaneous active and passive information transfer (SAPIT) scheme. In SAPIT, the transmitter (Tx) and the RIS deliver infor... |
1303.6541 | Kai Su | Kai Su, Dan Zhang, Narayan B. Mandayam | Dynamic Radio Resource Management for Random Network Coding: Power
Control and CSMA Backoff Control | 28 pages, 9 figures. Submitted to IEEE Transactions on Wireless
Communications | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Resource allocation in wireless networks typically occurs at PHY/MAC layers,
while random network coding (RNC) is a network layer strategy. An interesting
question is how resource allocation mechanisms can be tuned to improve RNC
performance. By means of a differential equation framework which models RNC
throughput i... | [
{
"created": "Tue, 26 Mar 2013 16:17:07 GMT",
"version": "v1"
}
] | 2013-03-27 | [
[
"Su",
"Kai",
""
],
[
"Zhang",
"Dan",
""
],
[
"Mandayam",
"Narayan B.",
""
]
] | Resource allocation in wireless networks typically occurs at PHY/MAC layers, while random network coding (RNC) is a network layer strategy. An interesting question is how resource allocation mechanisms can be tuned to improve RNC performance. By means of a differential equation framework which models RNC throughput in ... |
1904.04620 | Jiwoong Choi | Jiwoong Choi, Dayoung Chun, Hyun Kim, Hyuk-Jae Lee | Gaussian YOLOv3: An Accurate and Fast Object Detector Using Localization
Uncertainty for Autonomous Driving | ICCV 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The use of object detection algorithms is becoming increasingly important in
autonomous vehicles, and object detection at high accuracy and a fast inference
speed is essential for safe autonomous driving. A false positive (FP) from a
false localization during autonomous driving can lead to fatal accidents and
hinder ... | [
{
"created": "Tue, 9 Apr 2019 12:23:55 GMT",
"version": "v1"
},
{
"created": "Mon, 12 Aug 2019 11:11:02 GMT",
"version": "v2"
}
] | 2019-08-13 | [
[
"Choi",
"Jiwoong",
""
],
[
"Chun",
"Dayoung",
""
],
[
"Kim",
"Hyun",
""
],
[
"Lee",
"Hyuk-Jae",
""
]
] | The use of object detection algorithms is becoming increasingly important in autonomous vehicles, and object detection at high accuracy and a fast inference speed is essential for safe autonomous driving. A false positive (FP) from a false localization during autonomous driving can lead to fatal accidents and hinder sa... |
2310.12131 | Dwaipayan Roy | Subinay Adhikary, Sagnik Das, Sagnik Saha, Procheta Sen, Dwaipayan
Roy, Kripabandhu Ghosh | Automated Attribute Extraction from Legal Proceedings | Presented in Mining and Learning in the Legal Domain (MLLD) workshop
2023 | null | null | null | cs.IR | http://creativecommons.org/licenses/by/4.0/ | The escalating number of pending cases is a growing concern world-wide.
Recent advancements in digitization have opened up possibilities for leveraging
artificial intelligence (AI) tools in the processing of legal documents.
Adopting a structured representation for legal documents, as opposed to a mere
bag-of-words f... | [
{
"created": "Wed, 18 Oct 2023 17:41:28 GMT",
"version": "v1"
}
] | 2023-10-19 | [
[
"Adhikary",
"Subinay",
""
],
[
"Das",
"Sagnik",
""
],
[
"Saha",
"Sagnik",
""
],
[
"Sen",
"Procheta",
""
],
[
"Roy",
"Dwaipayan",
""
],
[
"Ghosh",
"Kripabandhu",
""
]
] | The escalating number of pending cases is a growing concern world-wide. Recent advancements in digitization have opened up possibilities for leveraging artificial intelligence (AI) tools in the processing of legal documents. Adopting a structured representation for legal documents, as opposed to a mere bag-of-words fla... |
2107.11777 | Yujie Tang | Yujie Tang, Liang Hu, Qingrui Zhang and Wei Pan | Reinforcement Learning Compensated Extended Kalman Filter for Attitude
Estimation | This paper has been accepted by IROS 2021 | null | null | null | cs.RO | http://creativecommons.org/licenses/by/4.0/ | Inertial measurement units are widely used in different fields to estimate
the attitude. Many algorithms have been proposed to improve estimation
performance. However, most of them still suffer from 1) inaccurate initial
estimation, 2) inaccurate initial filter gain, and 3) non-Gaussian process
and/or measurement noi... | [
{
"created": "Sun, 25 Jul 2021 10:39:32 GMT",
"version": "v1"
},
{
"created": "Tue, 27 Jul 2021 16:14:29 GMT",
"version": "v2"
}
] | 2021-07-28 | [
[
"Tang",
"Yujie",
""
],
[
"Hu",
"Liang",
""
],
[
"Zhang",
"Qingrui",
""
],
[
"Pan",
"Wei",
""
]
] | Inertial measurement units are widely used in different fields to estimate the attitude. Many algorithms have been proposed to improve estimation performance. However, most of them still suffer from 1) inaccurate initial estimation, 2) inaccurate initial filter gain, and 3) non-Gaussian process and/or measurement noise... |
0912.5079 | Travis Gagie | Travis Gagie | A Lower Bound on the Complexity of Approximating the Entropy of a Markov
Source | null | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Suppose that, for any (k \geq 1), (\epsilon > 0) and sufficiently large
$\sigma$, we are given a black box that allows us to sample characters from a
$k$th-order Markov source over the alphabet (\{0, ..., \sigma - 1\}). Even if
we know the source has entropy either 0 or at least (\log (\sigma - k)), there
is still no... | [
{
"created": "Sun, 27 Dec 2009 14:39:30 GMT",
"version": "v1"
}
] | 2009-12-31 | [
[
"Gagie",
"Travis",
""
]
] | Suppose that, for any (k \geq 1), (\epsilon > 0) and sufficiently large $\sigma$, we are given a black box that allows us to sample characters from a $k$th-order Markov source over the alphabet (\{0, ..., \sigma - 1\}). Even if we know the source has entropy either 0 or at least (\log (\sigma - k)), there is still no a... |
1310.5474 | Safeeullah Soomro | Syed Asif Ali, Safeeullah Soomro, Abdul Ghafoor Memon and Abdul Baqi | Implementation of Automata Theory to Improve the Learning Disability | null | Sindh Univ. Res. Jour. (Sci. Ser.) Vol. 45 (1):1193-196 (2013) | null | null | cs.CY | http://creativecommons.org/licenses/by/3.0/ | There are various types of disability egress in world like blindness,
deafness, and Physical disabilities. It is quite difficult to deal with people
with disability. Learning disability (LD) is types of disability totally
different from general disability. To deal children with learning disability is
difficult for bo... | [
{
"created": "Mon, 21 Oct 2013 09:25:19 GMT",
"version": "v1"
}
] | 2013-10-22 | [
[
"Ali",
"Syed Asif",
""
],
[
"Soomro",
"Safeeullah",
""
],
[
"Memon",
"Abdul Ghafoor",
""
],
[
"Baqi",
"Abdul",
""
]
] | There are various types of disability egress in world like blindness, deafness, and Physical disabilities. It is quite difficult to deal with people with disability. Learning disability (LD) is types of disability totally different from general disability. To deal children with learning disability is difficult for both... |
1410.4954 | Mohammad Mansour | Mohammad M. Mansour | Pruned Bit-Reversal Permutations: Mathematical Characterization, Fast
Algorithms and Architectures | 31 pages | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A mathematical characterization of serially-pruned permutations (SPPs)
employed in variable-length permuters and their associated fast pruning
algorithms and architectures are proposed. Permuters are used in many signal
processing systems for shuffling data and in communication systems as an
adjunct to coding for err... | [
{
"created": "Sat, 18 Oct 2014 13:03:19 GMT",
"version": "v1"
}
] | 2014-10-21 | [
[
"Mansour",
"Mohammad M.",
""
]
] | A mathematical characterization of serially-pruned permutations (SPPs) employed in variable-length permuters and their associated fast pruning algorithms and architectures are proposed. Permuters are used in many signal processing systems for shuffling data and in communication systems as an adjunct to coding for error... |
2405.16064 | Kaituo Feng | Kaituo Feng, Changsheng Li, Xiaolu Zhang, Jun Zhou, Ye Yuan, Guoren
Wang | Keypoint-based Progressive Chain-of-Thought Distillation for LLMs | Accepted by ICML 2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Chain-of-thought distillation is a powerful technique for transferring
reasoning abilities from large language models (LLMs) to smaller student
models. Previous methods typically require the student to mimic the
step-by-step rationale produced by LLMs, often facing the following challenges:
(i) Tokens within a ration... | [
{
"created": "Sat, 25 May 2024 05:27:38 GMT",
"version": "v1"
}
] | 2024-05-28 | [
[
"Feng",
"Kaituo",
""
],
[
"Li",
"Changsheng",
""
],
[
"Zhang",
"Xiaolu",
""
],
[
"Zhou",
"Jun",
""
],
[
"Yuan",
"Ye",
""
],
[
"Wang",
"Guoren",
""
]
] | Chain-of-thought distillation is a powerful technique for transferring reasoning abilities from large language models (LLMs) to smaller student models. Previous methods typically require the student to mimic the step-by-step rationale produced by LLMs, often facing the following challenges: (i) Tokens within a rational... |
2211.15602 | Ritesh Goenka | Ritesh Goenka, Eashan Gupta, Sushil Khyalia, Pratyush Agarwal, Mulinti
Shaik Wajid, Shivaram Kalyanakrishnan | Upper Bounds for All and Max-gain Policy Iteration Algorithms on
Deterministic MDPs | Added new bounds for two state MDPs | null | null | null | cs.DM cs.CC math.CO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Policy Iteration (PI) is a widely used family of algorithms to compute
optimal policies for Markov Decision Problems (MDPs). We derive upper bounds on
the running time of PI on Deterministic MDPs (DMDPs): the class of MDPs in
which every state-action pair has a unique next state. Our results include a
non-trivial upp... | [
{
"created": "Mon, 28 Nov 2022 17:56:30 GMT",
"version": "v1"
},
{
"created": "Sun, 8 Oct 2023 20:19:31 GMT",
"version": "v2"
}
] | 2023-10-10 | [
[
"Goenka",
"Ritesh",
""
],
[
"Gupta",
"Eashan",
""
],
[
"Khyalia",
"Sushil",
""
],
[
"Agarwal",
"Pratyush",
""
],
[
"Wajid",
"Mulinti Shaik",
""
],
[
"Kalyanakrishnan",
"Shivaram",
""
]
] | Policy Iteration (PI) is a widely used family of algorithms to compute optimal policies for Markov Decision Problems (MDPs). We derive upper bounds on the running time of PI on Deterministic MDPs (DMDPs): the class of MDPs in which every state-action pair has a unique next state. Our results include a non-trivial upper... |
2401.04334 | Yiwei Li | Jiaqi Wang, Zihao Wu, Yiwei Li, Hanqi Jiang, Peng Shu, Enze Shi,
Huawen Hu, Chong Ma, Yiheng Liu, Xuhui Wang, Yincheng Yao, Xuan Liu, Huaqin
Zhao, Zhengliang Liu, Haixing Dai, Lin Zhao, Bao Ge, Xiang Li, Tianming Liu,
and Shu Zhang | Large Language Models for Robotics: Opportunities, Challenges, and
Perspectives | null | null | null | null | cs.RO cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Large language models (LLMs) have undergone significant expansion and have
been increasingly integrated across various domains. Notably, in the realm of
robot task planning, LLMs harness their advanced reasoning and language
comprehension capabilities to formulate precise and efficient action plans
based on natural l... | [
{
"created": "Tue, 9 Jan 2024 03:22:16 GMT",
"version": "v1"
}
] | 2024-01-10 | [
[
"Wang",
"Jiaqi",
""
],
[
"Wu",
"Zihao",
""
],
[
"Li",
"Yiwei",
""
],
[
"Jiang",
"Hanqi",
""
],
[
"Shu",
"Peng",
""
],
[
"Shi",
"Enze",
""
],
[
"Hu",
"Huawen",
""
],
[
"Ma",
"Chong",
""
],
... | Large language models (LLMs) have undergone significant expansion and have been increasingly integrated across various domains. Notably, in the realm of robot task planning, LLMs harness their advanced reasoning and language comprehension capabilities to formulate precise and efficient action plans based on natural lan... |
2110.06135 | Marc-Andre Schulz | Marc-Andre Schulz, Bertrand Thirion, Alexandre Gramfort, Ga\"el
Varoquaux, Danilo Bzdok | Label scarcity in biomedicine: Data-rich latent factor discovery
enhances phenotype prediction | Accepted at NIPS 2017 Workshop on Machine Learning for Health | null | null | null | cs.LG q-bio.NC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | High-quality data accumulation is now becoming ubiquitous in the health
domain. There is increasing opportunity to exploit rich data from normal
subjects to improve supervised estimators in specific diseases with notorious
data scarcity. We demonstrate that low-dimensional embedding spaces can be
derived from the UK ... | [
{
"created": "Tue, 12 Oct 2021 16:25:50 GMT",
"version": "v1"
}
] | 2021-10-13 | [
[
"Schulz",
"Marc-Andre",
""
],
[
"Thirion",
"Bertrand",
""
],
[
"Gramfort",
"Alexandre",
""
],
[
"Varoquaux",
"Gaël",
""
],
[
"Bzdok",
"Danilo",
""
]
] | High-quality data accumulation is now becoming ubiquitous in the health domain. There is increasing opportunity to exploit rich data from normal subjects to improve supervised estimators in specific diseases with notorious data scarcity. We demonstrate that low-dimensional embedding spaces can be derived from the UK Bi... |
2205.06356 | Kabir Ahuja | Kabir Ahuja, Sandipan Dandapat, Sunayana Sitaram, Monojit Choudhury | Beyond Static Models and Test Sets: Benchmarking the Potential of
Pre-trained Models Across Tasks and Languages | NLP Power! Workshop, ACL 2022 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Although recent Massively Multilingual Language Models (MMLMs) like mBERT and
XLMR support around 100 languages, most existing multilingual NLP benchmarks
provide evaluation data in only a handful of these languages with little
linguistic diversity. We argue that this makes the existing practices in
multilingual eval... | [
{
"created": "Thu, 12 May 2022 20:42:48 GMT",
"version": "v1"
},
{
"created": "Mon, 14 Nov 2022 16:10:01 GMT",
"version": "v2"
}
] | 2022-11-15 | [
[
"Ahuja",
"Kabir",
""
],
[
"Dandapat",
"Sandipan",
""
],
[
"Sitaram",
"Sunayana",
""
],
[
"Choudhury",
"Monojit",
""
]
] | Although recent Massively Multilingual Language Models (MMLMs) like mBERT and XLMR support around 100 languages, most existing multilingual NLP benchmarks provide evaluation data in only a handful of these languages with little linguistic diversity. We argue that this makes the existing practices in multilingual evalua... |
2401.13905 | Thomas Lippincott | Hale Sirin, Tom Lippincott | Dynamic embedded topic models and change-point detection for exploring
literary-historical hypotheses | Accepted to LaTeCH@EACL2024 | null | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a novel combination of dynamic embedded topic models and
change-point detection to explore diachronic change of lexical semantic
modality in classical and early Christian Latin. We demonstrate several methods
for finding and characterizing patterns in the output, and relating them to
traditional scholarshi... | [
{
"created": "Thu, 25 Jan 2024 02:50:03 GMT",
"version": "v1"
}
] | 2024-01-26 | [
[
"Sirin",
"Hale",
""
],
[
"Lippincott",
"Tom",
""
]
] | We present a novel combination of dynamic embedded topic models and change-point detection to explore diachronic change of lexical semantic modality in classical and early Christian Latin. We demonstrate several methods for finding and characterizing patterns in the output, and relating them to traditional scholarship ... |
2311.14136 | Ana Fern\'andez Vilas | Carlos Beis-Penedo and Francisco Troncoso-Pastoriza and Rebeca P.
D\'iaz-Redondo and Ana Fern\'andez-Vilas and Manuel Fern\'andez-Veiga and
Mart\'in Gonz\'alez Soto | A Blockchain Solution for Collaborative Machine Learning over IoT | null | null | null | null | cs.LG cs.CR cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The rapid growth of Internet of Things (IoT) devices and applications has led
to an increased demand for advanced analytics and machine learning techniques
capable of handling the challenges associated with data privacy, security, and
scalability. Federated learning (FL) and blockchain technologies have emerged
as pr... | [
{
"created": "Thu, 23 Nov 2023 18:06:05 GMT",
"version": "v1"
}
] | 2023-11-27 | [
[
"Beis-Penedo",
"Carlos",
""
],
[
"Troncoso-Pastoriza",
"Francisco",
""
],
[
"Díaz-Redondo",
"Rebeca P.",
""
],
[
"Fernández-Vilas",
"Ana",
""
],
[
"Fernández-Veiga",
"Manuel",
""
],
[
"Soto",
"Martín González",
""
]
] | The rapid growth of Internet of Things (IoT) devices and applications has led to an increased demand for advanced analytics and machine learning techniques capable of handling the challenges associated with data privacy, security, and scalability. Federated learning (FL) and blockchain technologies have emerged as prom... |
2002.07775 | Jeena Kleenankandy | Jeena Kleenankandy, K. A. Abdul Nazeer (Department of Computer Science
and Engineering, National Institute of Technology Calicut, Kerala, India) | An enhanced Tree-LSTM architecture for sentence semantic modeling using
typed dependencies | Accepted manuscript submitted to Journal of Information Processing
and Management ( Elsevier ) on June 11, 2020 | Information Processing & Management, Elsevier (2020) | 10.1016/j.ipm.2020.102362 | null | cs.CL cs.AI cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Tree-based Long short term memory (LSTM) network has become state-of-the-art
for modeling the meaning of language texts as they can effectively exploit the
grammatical syntax and thereby non-linear dependencies among words of the
sentence. However, most of these models cannot recognize the difference in
meaning cause... | [
{
"created": "Tue, 18 Feb 2020 18:10:03 GMT",
"version": "v1"
},
{
"created": "Fri, 25 Sep 2020 09:45:26 GMT",
"version": "v2"
}
] | 2020-09-28 | [
[
"Kleenankandy",
"Jeena",
"",
"Department of Computer Science\n and Engineering, National Institute of Technology Calicut, Kerala, India"
],
[
"Nazeer",
"K. A. Abdul",
"",
"Department of Computer Science\n and Engineering, National Institute of Technology Calicut, Kerala, Indi... | Tree-based Long short term memory (LSTM) network has become state-of-the-art for modeling the meaning of language texts as they can effectively exploit the grammatical syntax and thereby non-linear dependencies among words of the sentence. However, most of these models cannot recognize the difference in meaning caused ... |
1410.0277 | Christian H\"ager | Christian H\"ager, Alexandre Graell i Amat, Fredrik Br\"annstr\"om,
Alex Alvarado, Erik Agrell | Terminated and Tailbiting Spatially-Coupled Codes with Optimized Bit
Mappings for Spectrally Efficient Fiber-Optical Systems | This paper has been accepted for publication in the IEEE/OSA Journal
of Lightwave Technology | IEEE/OSA Journal of Lightwave Technology, vol. 33, no. 7, pp.
1275-1285 Apr. 2015 [invited] | 10.1109/JLT.2015.2390596 | null | cs.IT math.IT physics.optics | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the design of spectrally efficient fiber-optical communication
systems based on different spatially coupled (SC) forward error correction
(FEC) schemes. In particular, we optimize the allocation of the coded bits from
the FEC encoder to the modulation bits of the signal constellation. Two SC code
classes are... | [
{
"created": "Wed, 1 Oct 2014 16:30:21 GMT",
"version": "v1"
},
{
"created": "Thu, 8 Jan 2015 16:19:29 GMT",
"version": "v2"
}
] | 2024-01-30 | [
[
"Häger",
"Christian",
""
],
[
"Amat",
"Alexandre Graell i",
""
],
[
"Brännström",
"Fredrik",
""
],
[
"Alvarado",
"Alex",
""
],
[
"Agrell",
"Erik",
""
]
] | We study the design of spectrally efficient fiber-optical communication systems based on different spatially coupled (SC) forward error correction (FEC) schemes. In particular, we optimize the allocation of the coded bits from the FEC encoder to the modulation bits of the signal constellation. Two SC code classes are c... |
1705.07807 | Piotr Mardziel | Anupam Datta, Matthew Fredrikson, Gihyuk Ko, Piotr Mardziel, Shayak
Sen | Use Privacy in Data-Driven Systems: Theory and Experiments with Machine
Learnt Programs | extended CCS 2017 camera-ready: several new discussions, and
complexity results added to appendix | null | null | null | cs.CR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper presents an approach to formalizing and enforcing a class of use
privacy properties in data-driven systems. In contrast to prior work, we focus
on use restrictions on proxies (i.e. strong predictors) of protected
information types. Our definition relates proxy use to intermediate
computations that occur in... | [
{
"created": "Mon, 22 May 2017 15:28:43 GMT",
"version": "v1"
},
{
"created": "Wed, 24 May 2017 03:46:13 GMT",
"version": "v2"
},
{
"created": "Thu, 7 Sep 2017 06:36:33 GMT",
"version": "v3"
}
] | 2017-09-08 | [
[
"Datta",
"Anupam",
""
],
[
"Fredrikson",
"Matthew",
""
],
[
"Ko",
"Gihyuk",
""
],
[
"Mardziel",
"Piotr",
""
],
[
"Sen",
"Shayak",
""
]
] | This paper presents an approach to formalizing and enforcing a class of use privacy properties in data-driven systems. In contrast to prior work, we focus on use restrictions on proxies (i.e. strong predictors) of protected information types. Our definition relates proxy use to intermediate computations that occur in a... |
2405.17329 | Wei Xu | Yaqiong Zhao, Jindan Xu, Wei Xu,Kezhi Wang, Xinquan Ye, Chau Yuen and
Xiaohu You | Joint MIMO Transceiver and Reflector Design for Reconfigurable
Intelligent Surface-Assisted Communication | 14 pages, 12 figures | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we consider a reconfigurable intelligent surface
(RIS)-assisted multiple-input multiple-output communication system with
multiple antennas at both the base station (BS) and the user. We plan to
maximize the achievable rate through jointly optimizing the transmit precoding
matrix, the receive combining ... | [
{
"created": "Mon, 27 May 2024 16:28:37 GMT",
"version": "v1"
}
] | 2024-05-28 | [
[
"Zhao",
"Yaqiong",
""
],
[
"Xu",
"Jindan",
""
],
[
"Xu",
"Wei",
""
],
[
"Wang",
"Kezhi",
""
],
[
"Ye",
"Xinquan",
""
],
[
"Yuen",
"Chau",
""
],
[
"You",
"Xiaohu",
""
]
] | In this paper, we consider a reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output communication system with multiple antennas at both the base station (BS) and the user. We plan to maximize the achievable rate through jointly optimizing the transmit precoding matrix, the receive combining ma... |
1312.7570 | Stefan Mathe | Stefan Mathe, Cristian Sminchisescu | Actions in the Eye: Dynamic Gaze Datasets and Learnt Saliency Models for
Visual Recognition | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Systems based on bag-of-words models from image features collected at maxima
of sparse interest point operators have been used successfully for both
computer visual object and action recognition tasks. While the sparse,
interest-point based approach to recognition is not inconsistent with visual
processing in biologi... | [
{
"created": "Sun, 29 Dec 2013 18:49:04 GMT",
"version": "v1"
}
] | 2013-12-31 | [
[
"Mathe",
"Stefan",
""
],
[
"Sminchisescu",
"Cristian",
""
]
] | Systems based on bag-of-words models from image features collected at maxima of sparse interest point operators have been used successfully for both computer visual object and action recognition tasks. While the sparse, interest-point based approach to recognition is not inconsistent with visual processing in biologica... |
2106.14274 | Zhiqin Chen | Zhiqin Chen, Andrea Tagliasacchi, Hao Zhang | Learning Mesh Representations via Binary Space Partitioning Tree
Networks | Accepted to TPAMI. This is the extended journal version of BSP-Net
(arXiv:1911.06971) from CVPR 2020 | null | 10.1109/TPAMI.2021.3093440 | null | cs.CV cs.GR cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Polygonal meshes are ubiquitous, but have only played a relatively minor role
in the deep learning revolution. State-of-the-art neural generative models for
3D shapes learn implicit functions and generate meshes via expensive
iso-surfacing. We overcome these challenges by employing a classical spatial
data structure ... | [
{
"created": "Sun, 27 Jun 2021 16:37:54 GMT",
"version": "v1"
},
{
"created": "Fri, 2 Jul 2021 00:24:22 GMT",
"version": "v2"
}
] | 2021-07-05 | [
[
"Chen",
"Zhiqin",
""
],
[
"Tagliasacchi",
"Andrea",
""
],
[
"Zhang",
"Hao",
""
]
] | Polygonal meshes are ubiquitous, but have only played a relatively minor role in the deep learning revolution. State-of-the-art neural generative models for 3D shapes learn implicit functions and generate meshes via expensive iso-surfacing. We overcome these challenges by employing a classical spatial data structure fr... |
2301.11899 | Shvetank Prakash | Shvetank Prakash, Matthew Stewart, Colby Banbury, Mark Mazumder, Pete
Warden, Brian Plancher, Vijay Janapa Reddi | Is TinyML Sustainable? Assessing the Environmental Impacts of Machine
Learning on Microcontrollers | Communications of the ACM (CACM) November 2023 Issue | null | null | null | cs.LG cs.AR cs.CY | http://creativecommons.org/licenses/by/4.0/ | The sustained growth of carbon emissions and global waste elicits significant
sustainability concerns for our environment's future. The growing Internet of
Things (IoT) has the potential to exacerbate this issue. However, an emerging
area known as Tiny Machine Learning (TinyML) has the opportunity to help
address the... | [
{
"created": "Fri, 27 Jan 2023 18:23:10 GMT",
"version": "v1"
},
{
"created": "Fri, 19 May 2023 17:54:49 GMT",
"version": "v2"
},
{
"created": "Tue, 21 Nov 2023 11:24:29 GMT",
"version": "v3"
}
] | 2023-11-22 | [
[
"Prakash",
"Shvetank",
""
],
[
"Stewart",
"Matthew",
""
],
[
"Banbury",
"Colby",
""
],
[
"Mazumder",
"Mark",
""
],
[
"Warden",
"Pete",
""
],
[
"Plancher",
"Brian",
""
],
[
"Reddi",
"Vijay Janapa",
""
]
] | The sustained growth of carbon emissions and global waste elicits significant sustainability concerns for our environment's future. The growing Internet of Things (IoT) has the potential to exacerbate this issue. However, an emerging area known as Tiny Machine Learning (TinyML) has the opportunity to help address these... |
2312.13558 | Dipendra Misra | Pratyusha Sharma, Jordan T. Ash and Dipendra Misra | The Truth is in There: Improving Reasoning in Language Models with
Layer-Selective Rank Reduction | null | null | null | null | cs.LG cs.AI cs.CL cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Transformer-based Large Language Models (LLMs) have become a fixture in
modern machine learning. Correspondingly, significant resources are allocated
towards research that aims to further advance this technology, typically
resulting in models of increasing size that are trained on increasing amounts
of data. This wor... | [
{
"created": "Thu, 21 Dec 2023 03:51:08 GMT",
"version": "v1"
}
] | 2023-12-22 | [
[
"Sharma",
"Pratyusha",
""
],
[
"Ash",
"Jordan T.",
""
],
[
"Misra",
"Dipendra",
""
]
] | Transformer-based Large Language Models (LLMs) have become a fixture in modern machine learning. Correspondingly, significant resources are allocated towards research that aims to further advance this technology, typically resulting in models of increasing size that are trained on increasing amounts of data. This work,... |
2112.13023 | Miroslav Fil | Miroslav Fil, Binxin Ru, Clare Lyle, Yarin Gal | DARTS without a Validation Set: Optimizing the Marginal Likelihood | Presented at the 5th Workshop on Meta-Learning at NeurIPS 2021 | null | null | null | cs.LG cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The success of neural architecture search (NAS) has historically been limited
by excessive compute requirements. While modern weight-sharing NAS methods such
as DARTS are able to finish the search in single-digit GPU days, extracting the
final best architecture from the shared weights is notoriously unreliable.
Train... | [
{
"created": "Fri, 24 Dec 2021 10:16:38 GMT",
"version": "v1"
}
] | 2021-12-28 | [
[
"Fil",
"Miroslav",
""
],
[
"Ru",
"Binxin",
""
],
[
"Lyle",
"Clare",
""
],
[
"Gal",
"Yarin",
""
]
] | The success of neural architecture search (NAS) has historically been limited by excessive compute requirements. While modern weight-sharing NAS methods such as DARTS are able to finish the search in single-digit GPU days, extracting the final best architecture from the shared weights is notoriously unreliable. Trainin... |
1711.06841 | Eli (Omid) David | Eli David, Moshe Koppel, Nathan S. Netanyahu | Expert-Driven Genetic Algorithms for Simulating Evaluation Functions | arXiv admin note: substantial text overlap with arXiv:1711.06839,
arXiv:1711.06840 | Genetic Programming and Evolvable Machines, Vol. 12, No. 1, pp.
5-22, March 2011 | 10.1007/s10710-010-9103-4 | null | cs.NE cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we demonstrate how genetic algorithms can be used to reverse
engineer an evaluation function's parameters for computer chess. Our results
show that using an appropriate expert (or mentor), we can evolve a program that
is on par with top tournament-playing chess programs, outperforming a two-time
World C... | [
{
"created": "Sat, 18 Nov 2017 10:22:49 GMT",
"version": "v1"
}
] | 2017-11-21 | [
[
"David",
"Eli",
""
],
[
"Koppel",
"Moshe",
""
],
[
"Netanyahu",
"Nathan S.",
""
]
] | In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function's parameters for computer chess. Our results show that using an appropriate expert (or mentor), we can evolve a program that is on par with top tournament-playing chess programs, outperforming a two-time World Com... |
1409.8580 | Udo Schilcher | Udo Schilcher, Stavros Toumpis, Martin Haenggi, Alessandro Crismani,
G\"unther Brandner, Christian Bettstetter | Interference Functionals in Poisson Networks | null | IEEE Transactions on Information Theory, vol. 62, no. 1, pp.
370-383, Jan. 2016 | 10.1109/TIT.2015.2501799 | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose and prove a theorem that allows the calculation of a class of
functionals on Poisson point processes that have the form of expected values of
sum-products of functions. In proving the theorem, we present a variant of the
Campbell-Mecke theorem from stochastic geometry. We proceed to apply our result
in the... | [
{
"created": "Tue, 30 Sep 2014 15:00:22 GMT",
"version": "v1"
},
{
"created": "Mon, 8 Jun 2015 09:35:03 GMT",
"version": "v2"
}
] | 2018-06-05 | [
[
"Schilcher",
"Udo",
""
],
[
"Toumpis",
"Stavros",
""
],
[
"Haenggi",
"Martin",
""
],
[
"Crismani",
"Alessandro",
""
],
[
"Brandner",
"Günther",
""
],
[
"Bettstetter",
"Christian",
""
]
] | We propose and prove a theorem that allows the calculation of a class of functionals on Poisson point processes that have the form of expected values of sum-products of functions. In proving the theorem, we present a variant of the Campbell-Mecke theorem from stochastic geometry. We proceed to apply our result in the c... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.