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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2206.05454 | Arezou Rezazadeh | Arezou Rezazadeh | A General framework for PAC-Bayes Bounds for Meta-Learning | null | null | null | null | cs.LG stat.ML | http://creativecommons.org/publicdomain/zero/1.0/ | Meta learning automatically infers an inductive bias, that includes the
hyperparameter of the base-learning algorithm, by observing data from a finite
number of related tasks. This paper studies PAC-Bayes bounds on meta
generalization gap. The meta-generalization gap comprises two sources of
generalization gaps: the ... | [
{
"created": "Sat, 11 Jun 2022 07:45:25 GMT",
"version": "v1"
}
] | 2022-06-14 | [
[
"Rezazadeh",
"Arezou",
""
]
] | Meta learning automatically infers an inductive bias, that includes the hyperparameter of the base-learning algorithm, by observing data from a finite number of related tasks. This paper studies PAC-Bayes bounds on meta generalization gap. The meta-generalization gap comprises two sources of generalization gaps: the en... |
1509.06035 | Karim Afdel | H.Ouahi and K.Afdel and M.Machkour | Image Retrieval Based on LBP Pyramidal Multiresolution using Reversible
Watermarking | null | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the medical field, images are increasingly used to facilitate diagnosis of
diseases. These images are stored in multimedia databases accompanied by doctor
s prescriptions and other information related to patients.Search for medical
images has become for clinical applications an essential tool to bring
effective ai... | [
{
"created": "Sun, 20 Sep 2015 18:14:04 GMT",
"version": "v1"
}
] | 2015-09-22 | [
[
"Ouahi",
"H.",
""
],
[
"Afdel",
"K.",
""
],
[
"Machkour",
"M.",
""
]
] | In the medical field, images are increasingly used to facilitate diagnosis of diseases. These images are stored in multimedia databases accompanied by doctor s prescriptions and other information related to patients.Search for medical images has become for clinical applications an essential tool to bring effective aid ... |
1510.09193 | Leslie Ann Goldberg | Ivona Bezakova, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel
Stefankovic | Approximation via Correlation Decay when Strong Spatial Mixing Fails | To appear in SICOMP | null | null | null | cs.CC cs.DM | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Approximate counting via correlation decay is the core algorithmic technique
used in the sharp delineation of the computational phase transition that arises
in the approximation of the partition function of anti-ferromagnetic two-spin
models.
Previous analyses of correlation-decay algorithms implicitly depended on ... | [
{
"created": "Fri, 30 Oct 2015 18:38:48 GMT",
"version": "v1"
},
{
"created": "Mon, 2 Nov 2015 14:45:46 GMT",
"version": "v2"
},
{
"created": "Wed, 17 Feb 2016 20:52:34 GMT",
"version": "v3"
},
{
"created": "Fri, 8 Jul 2016 13:02:30 GMT",
"version": "v4"
},
{
"cre... | 2019-02-04 | [
[
"Bezakova",
"Ivona",
""
],
[
"Galanis",
"Andreas",
""
],
[
"Goldberg",
"Leslie Ann",
""
],
[
"Guo",
"Heng",
""
],
[
"Stefankovic",
"Daniel",
""
]
] | Approximate counting via correlation decay is the core algorithmic technique used in the sharp delineation of the computational phase transition that arises in the approximation of the partition function of anti-ferromagnetic two-spin models. Previous analyses of correlation-decay algorithms implicitly depended on the ... |
1906.00784 | Paul Wild | Paul Wild and Lutz Schr\"oder and Dirk Pattinson and Barbara K\"onig | A Modal Characterization Theorem for a Probabilistic Fuzzy Description
Logic | arXiv admin note: text overlap with arXiv:1810.04722 | null | null | null | cs.LO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The fuzzy modality `probably` is interpreted over probabilistic type spaces
by taking expected truth values. The arising probabilistic fuzzy description
logic is invariant under probabilistic bisimilarity; more informatively, it is
non-expansive wrt. a suitable notion of behavioural distance. In the present
paper, we... | [
{
"created": "Fri, 31 May 2019 04:37:45 GMT",
"version": "v1"
},
{
"created": "Tue, 4 Jun 2019 12:57:53 GMT",
"version": "v2"
}
] | 2019-06-05 | [
[
"Wild",
"Paul",
""
],
[
"Schröder",
"Lutz",
""
],
[
"Pattinson",
"Dirk",
""
],
[
"König",
"Barbara",
""
]
] | The fuzzy modality `probably` is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is non-expansive wrt. a suitable notion of behavioural distance. In the present paper, we p... |
1701.07666 | Bogdan Groza | Bogdan Groza | Traffic models with adversarial vehicle behaviour | 14 pages | null | null | null | cs.CR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We examine the impact of adversarial actions on vehicles in traffic. Current
advances in assisted/autonomous driving technologies are supposed to reduce the
number of casualties, but this seems to be desired despite the recently proved
insecurity of in-vehicle communication buses or components. Fortunately to some
ex... | [
{
"created": "Thu, 26 Jan 2017 11:57:48 GMT",
"version": "v1"
}
] | 2017-01-27 | [
[
"Groza",
"Bogdan",
""
]
] | We examine the impact of adversarial actions on vehicles in traffic. Current advances in assisted/autonomous driving technologies are supposed to reduce the number of casualties, but this seems to be desired despite the recently proved insecurity of in-vehicle communication buses or components. Fortunately to some exte... |
2108.00171 | Min Ren | Min Ren and Lingxiao He and Xingyu Liao and Wu Liu and Yunlong Wang
and Tieniu Tan | Learning Instance-level Spatial-Temporal Patterns for Person
Re-identification | Accepted by ICCV 2021 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Person re-identification (Re-ID) aims to match pedestrians under dis-joint
cameras. Most Re-ID methods formulate it as visual representation learning and
image search, and its accuracy is consequently affected greatly by the search
space. Spatial-temporal information has been proven to be efficient to filter
irreleva... | [
{
"created": "Sat, 31 Jul 2021 07:44:47 GMT",
"version": "v1"
}
] | 2021-08-03 | [
[
"Ren",
"Min",
""
],
[
"He",
"Lingxiao",
""
],
[
"Liao",
"Xingyu",
""
],
[
"Liu",
"Wu",
""
],
[
"Wang",
"Yunlong",
""
],
[
"Tan",
"Tieniu",
""
]
] | Person re-identification (Re-ID) aims to match pedestrians under dis-joint cameras. Most Re-ID methods formulate it as visual representation learning and image search, and its accuracy is consequently affected greatly by the search space. Spatial-temporal information has been proven to be efficient to filter irrelevant... |
1002.3238 | Benjamin Piwowarski | Benjamin Piwowarski and Ingo Frommholz and Mounia Lalmas and Keith van
Rijsbergen | Exploring a Multidimensional Representation of Documents and Queries
(extended version) | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In Information Retrieval (IR), whether implicitly or explicitly, queries and
documents are often represented as vectors. However, it may be more beneficial
to consider documents and/or queries as multidimensional objects. Our belief is
this would allow building "truly" interactive IR systems, i.e., where
interaction ... | [
{
"created": "Wed, 17 Feb 2010 10:25:57 GMT",
"version": "v1"
},
{
"created": "Thu, 18 Feb 2010 13:45:17 GMT",
"version": "v2"
}
] | 2010-02-18 | [
[
"Piwowarski",
"Benjamin",
""
],
[
"Frommholz",
"Ingo",
""
],
[
"Lalmas",
"Mounia",
""
],
[
"van Rijsbergen",
"Keith",
""
]
] | In Information Retrieval (IR), whether implicitly or explicitly, queries and documents are often represented as vectors. However, it may be more beneficial to consider documents and/or queries as multidimensional objects. Our belief is this would allow building "truly" interactive IR systems, i.e., where interaction is... |
2102.01241 | Bernard Mans | Dalia Popescu, Philippe Jacquet, Bernard Mans and Bartomiej
Blaszczyszyn | Characterizing the Energy Trade-Offs of End-to-End Vehicular
Communications using an Hyperfractal Urban Modelling | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | We characterize trade-offs between the end-to-end communication delay and the
energy in urban vehicular communications with infrastructure assistance. Our
study exploits the self-similarity of the location of communication entities in
cities by modeling them with an innovative model called "hyperfractal". We show
tha... | [
{
"created": "Tue, 2 Feb 2021 00:53:17 GMT",
"version": "v1"
}
] | 2021-02-03 | [
[
"Popescu",
"Dalia",
""
],
[
"Jacquet",
"Philippe",
""
],
[
"Mans",
"Bernard",
""
],
[
"Blaszczyszyn",
"Bartomiej",
""
]
] | We characterize trade-offs between the end-to-end communication delay and the energy in urban vehicular communications with infrastructure assistance. Our study exploits the self-similarity of the location of communication entities in cities by modeling them with an innovative model called "hyperfractal". We show that ... |
2307.15678 | Charles Assaad | Ali A\"it-Bachir, Charles K. Assaad, Christophe de Bignicourt, Emilie
Devijver, Simon Ferreira, Eric Gaussier, Hosein Mohanna, Lei Zan | Case Studies of Causal Discovery from IT Monitoring Time Series | Accepted to the UAI 2023 Workshop on The History and Development of
Search Methods for Causal Structure | null | null | null | cs.LG cs.AI stat.AP stat.ME | http://creativecommons.org/licenses/by/4.0/ | Information technology (IT) systems are vital for modern businesses, handling
data storage, communication, and process automation. Monitoring these systems
is crucial for their proper functioning and efficiency, as it allows collecting
extensive observational time series data for analysis. The interest in causal
disc... | [
{
"created": "Fri, 28 Jul 2023 17:13:00 GMT",
"version": "v1"
}
] | 2023-07-31 | [
[
"Aït-Bachir",
"Ali",
""
],
[
"Assaad",
"Charles K.",
""
],
[
"de Bignicourt",
"Christophe",
""
],
[
"Devijver",
"Emilie",
""
],
[
"Ferreira",
"Simon",
""
],
[
"Gaussier",
"Eric",
""
],
[
"Mohanna",
"Hosein",
... | Information technology (IT) systems are vital for modern businesses, handling data storage, communication, and process automation. Monitoring these systems is crucial for their proper functioning and efficiency, as it allows collecting extensive observational time series data for analysis. The interest in causal discov... |
2303.08396 | Suyash Mahar | Suyash Mahar (UC San Diego), Hao Wang (NVIDIA), Wei Shu (Tenstorrent),
Abhishek Dhanotia (Meta Inc.) | Workload Behavior Driven Memory Subsystem Design for Hyperscale | null | null | null | null | cs.DC cs.AR | http://creativecommons.org/licenses/by/4.0/ | Hyperscalars run services across a large fleet of servers, serving billions
of users worldwide. These services, however, behave differently than commonly
available benchmark suites, resulting in server architectures that are not
optimized for cloud workloads. With datacenters becoming a primary server
processor marke... | [
{
"created": "Wed, 15 Mar 2023 06:55:29 GMT",
"version": "v1"
},
{
"created": "Tue, 2 May 2023 13:47:23 GMT",
"version": "v2"
}
] | 2023-05-03 | [
[
"Mahar",
"Suyash",
"",
"UC San Diego"
],
[
"Wang",
"Hao",
"",
"NVIDIA"
],
[
"Shu",
"Wei",
"",
"Tenstorrent"
],
[
"Dhanotia",
"Abhishek",
"",
"Meta Inc."
]
] | Hyperscalars run services across a large fleet of servers, serving billions of users worldwide. These services, however, behave differently than commonly available benchmark suites, resulting in server architectures that are not optimized for cloud workloads. With datacenters becoming a primary server processor market,... |
2203.14572 | Xiaotong Cheng | Xiaotong Cheng and Setareh Maghsudi | Distributed Task Management in Fog Computing: A Socially Concave Bandit
Game | null | null | 10.1109/TGCN.2023.3276415 | null | cs.MA cs.GT cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Fog computing leverages the task offloading capabilities at the network's
edge to improve efficiency and enable swift responses to application demands.
However, the design of task allocation strategies in a fog computing network is
still challenging because of the heterogeneity of fog nodes and uncertainties
in syste... | [
{
"created": "Mon, 28 Mar 2022 08:26:14 GMT",
"version": "v1"
},
{
"created": "Fri, 9 Jun 2023 15:15:14 GMT",
"version": "v2"
}
] | 2023-06-12 | [
[
"Cheng",
"Xiaotong",
""
],
[
"Maghsudi",
"Setareh",
""
]
] | Fog computing leverages the task offloading capabilities at the network's edge to improve efficiency and enable swift responses to application demands. However, the design of task allocation strategies in a fog computing network is still challenging because of the heterogeneity of fog nodes and uncertainties in system ... |
1504.01207 | Usman Khan | Sam Safavi and Usman A. Khan | Localization in mobile networks via virtual convex hulls | null | null | null | null | cs.SY | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we develop a \textit{distributed} algorithm to localize an
arbitrary number of agents moving in a bounded region of interest. We assume
that the network contains \textit{at least one} agent with known location
(hereinafter referred to as an anchor), and each agent measures a noisy version
of its motion... | [
{
"created": "Mon, 6 Apr 2015 05:15:19 GMT",
"version": "v1"
},
{
"created": "Sat, 21 Jan 2017 05:01:56 GMT",
"version": "v2"
}
] | 2017-01-24 | [
[
"Safavi",
"Sam",
""
],
[
"Khan",
"Usman A.",
""
]
] | In this paper, we develop a \textit{distributed} algorithm to localize an arbitrary number of agents moving in a bounded region of interest. We assume that the network contains \textit{at least one} agent with known location (hereinafter referred to as an anchor), and each agent measures a noisy version of its motion a... |
2301.10233 | Andre Holzapfel | Andre Holzapfel | Introducing Political Ecology of Creative-Ai | null | null | null | null | cs.CY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This chapter introduces the perspective of political ecology to the
application of artificial intelligence to artistic processes (Creative-Ai).
Hence, the environmental and social impact of the development and employment of
Creative-Ai are the focus of this text, when we consider them as part of an
economic system th... | [
{
"created": "Wed, 21 Dec 2022 15:16:22 GMT",
"version": "v1"
}
] | 2023-01-25 | [
[
"Holzapfel",
"Andre",
""
]
] | This chapter introduces the perspective of political ecology to the application of artificial intelligence to artistic processes (Creative-Ai). Hence, the environmental and social impact of the development and employment of Creative-Ai are the focus of this text, when we consider them as part of an economic system that... |
1609.06804 | Zhouyuan Huo | Zhouyuan Huo, Bin Gu, Heng Huang | Decoupled Asynchronous Proximal Stochastic Gradient Descent with
Variance Reduction | null | null | null | null | cs.LG math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In the era of big data, optimizing large scale machine learning problems
becomes a challenging task and draws significant attention. Asynchronous
optimization algorithms come out as a promising solution. Recently, decoupled
asynchronous proximal stochastic gradient descent (DAP-SGD) is proposed to
minimize a composit... | [
{
"created": "Thu, 22 Sep 2016 02:50:09 GMT",
"version": "v1"
},
{
"created": "Thu, 29 Sep 2016 01:54:25 GMT",
"version": "v2"
}
] | 2016-09-30 | [
[
"Huo",
"Zhouyuan",
""
],
[
"Gu",
"Bin",
""
],
[
"Huang",
"Heng",
""
]
] | In the era of big data, optimizing large scale machine learning problems becomes a challenging task and draws significant attention. Asynchronous optimization algorithms come out as a promising solution. Recently, decoupled asynchronous proximal stochastic gradient descent (DAP-SGD) is proposed to minimize a composite ... |
1907.04058 | Peter Fasogbon O. | Peter O. Fasogbon | Depth from Small Motion using Rank-1 Initialization | 8 pages, 6 figures | 14th International Conference on Computer Vision Theory and
Applications, February 2019 | null | null | cs.CV | http://creativecommons.org/licenses/by/4.0/ | Depth from Small Motion (DfSM) (Ha et al., 2016) is particularly interesting
for commercial handheld devices because it allows the possibility to get depth
information with minimal user effort and cooperation. Due to speed and memory
issue on these devices, the self calibration optimization of the method using
Bundle... | [
{
"created": "Tue, 9 Jul 2019 09:50:04 GMT",
"version": "v1"
}
] | 2019-07-10 | [
[
"Fasogbon",
"Peter O.",
""
]
] | Depth from Small Motion (DfSM) (Ha et al., 2016) is particularly interesting for commercial handheld devices because it allows the possibility to get depth information with minimal user effort and cooperation. Due to speed and memory issue on these devices, the self calibration optimization of the method using Bundle A... |
2104.04695 | Ou Deng | Ou Deng, Kiichi Tago, Qun Jin | An Extended Epidemic Model on Interconnected Networks for COVID-19 to
Explore the Epidemic Dynamics | 9 pages, 6 figures | null | null | null | cs.CY | http://creativecommons.org/licenses/by-nc-sa/4.0/ | COVID-19 has resulted in a public health global crisis. The pandemic control
necessitates epidemic models that capture the trends and impacts on infectious
individuals. Many exciting models can implement this but they lack practical
interpretability. This study combines the epidemiological and network theories
and pr... | [
{
"created": "Sat, 10 Apr 2021 06:46:01 GMT",
"version": "v1"
}
] | 2021-04-13 | [
[
"Deng",
"Ou",
""
],
[
"Tago",
"Kiichi",
""
],
[
"Jin",
"Qun",
""
]
] | COVID-19 has resulted in a public health global crisis. The pandemic control necessitates epidemic models that capture the trends and impacts on infectious individuals. Many exciting models can implement this but they lack practical interpretability. This study combines the epidemiological and network theories and prop... |
2010.02613 | Neha Das | Neha Das, Jonas Umlauft, Armin Lederer, Thomas Beckers, Sandra Hirche | Deep Learning based Uncertainty Decomposition for Real-time Control | Accepted at IFAC World Congress 2023 | null | null | null | cs.LG cs.AI cs.RO cs.SY eess.SY | http://creativecommons.org/licenses/by-nc-nd/4.0/ | Data-driven control in unknown environments requires a clear understanding of
the involved uncertainties for ensuring safety and efficient exploration. While
aleatoric uncertainty that arises from measurement noise can often be
explicitly modeled given a parametric description, it can be harder to model
epistemic unc... | [
{
"created": "Tue, 6 Oct 2020 10:46:27 GMT",
"version": "v1"
},
{
"created": "Tue, 24 Nov 2020 18:12:06 GMT",
"version": "v2"
},
{
"created": "Wed, 12 Jul 2023 10:00:51 GMT",
"version": "v3"
}
] | 2023-07-13 | [
[
"Das",
"Neha",
""
],
[
"Umlauft",
"Jonas",
""
],
[
"Lederer",
"Armin",
""
],
[
"Beckers",
"Thomas",
""
],
[
"Hirche",
"Sandra",
""
]
] | Data-driven control in unknown environments requires a clear understanding of the involved uncertainties for ensuring safety and efficient exploration. While aleatoric uncertainty that arises from measurement noise can often be explicitly modeled given a parametric description, it can be harder to model epistemic uncer... |
2212.07818 | Bernhard Klein | Torben Krieger, Bernhard Klein, Holger Fr\"oning | Towards Hardware-Specific Automatic Compression of Neural Networks | To be published at the AAAI Conference on Artificial Intelligence
2023, at the 2nd International Workshop on Practical Deep Learning in the
Wild | null | null | null | cs.LG cs.PF stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compressing neural network architectures is important to allow the deployment
of models to embedded or mobile devices, and pruning and quantization are the
major approaches to compress neural networks nowadays. Both methods benefit
when compression parameters are selected specifically for each layer. Finding
good com... | [
{
"created": "Thu, 15 Dec 2022 13:34:02 GMT",
"version": "v1"
}
] | 2022-12-16 | [
[
"Krieger",
"Torben",
""
],
[
"Klein",
"Bernhard",
""
],
[
"Fröning",
"Holger",
""
]
] | Compressing neural network architectures is important to allow the deployment of models to embedded or mobile devices, and pruning and quantization are the major approaches to compress neural networks nowadays. Both methods benefit when compression parameters are selected specifically for each layer. Finding good combi... |
2103.02143 | Hao Peng | Hao Peng, Nikolaos Pappas, Dani Yogatama, Roy Schwartz, Noah A. Smith,
Lingpeng Kong | Random Feature Attention | ICLR 2021 | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | Transformers are state-of-the-art models for a variety of sequence modeling
tasks. At their core is an attention function which models pairwise
interactions between the inputs at every timestep. While attention is powerful,
it does not scale efficiently to long sequences due to its quadratic time and
space complexity... | [
{
"created": "Wed, 3 Mar 2021 02:48:56 GMT",
"version": "v1"
},
{
"created": "Fri, 19 Mar 2021 21:24:06 GMT",
"version": "v2"
}
] | 2021-03-23 | [
[
"Peng",
"Hao",
""
],
[
"Pappas",
"Nikolaos",
""
],
[
"Yogatama",
"Dani",
""
],
[
"Schwartz",
"Roy",
""
],
[
"Smith",
"Noah A.",
""
],
[
"Kong",
"Lingpeng",
""
]
] | Transformers are state-of-the-art models for a variety of sequence modeling tasks. At their core is an attention function which models pairwise interactions between the inputs at every timestep. While attention is powerful, it does not scale efficiently to long sequences due to its quadratic time and space complexity i... |
2208.09363 | Syver D{\o}ving Agdestein | Syver D{\o}ving Agdestein and Benjamin Sanderse | Learning filtered discretization operators: non-intrusive versus
intrusive approaches | Submitted to Eccomas 2022 proceedings. Contains 12 pages, 19
references, 4 figures, and 1 table | null | null | null | cs.CE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Simulating multi-scale phenomena such as turbulent fluid flows is typically
computationally very expensive. Filtering the smaller scales allows for using
coarse discretizations, however, this requires closure models to account for
the effects of the unresolved on the resolved scales. The common approach is to
filter ... | [
{
"created": "Fri, 19 Aug 2022 14:17:57 GMT",
"version": "v1"
}
] | 2022-08-22 | [
[
"Agdestein",
"Syver Døving",
""
],
[
"Sanderse",
"Benjamin",
""
]
] | Simulating multi-scale phenomena such as turbulent fluid flows is typically computationally very expensive. Filtering the smaller scales allows for using coarse discretizations, however, this requires closure models to account for the effects of the unresolved on the resolved scales. The common approach is to filter th... |
2202.12438 | Tom\'a\v{s} Masa\v{r}\'ik | Pavel Dvo\v{r}\'ak, Monika Krawczyk, Tom\'a\v{s} Masa\v{r}\'ik, Jana
Novotn\'a, Pawe{\l} Rz\k{a}\.zewski, Aneta \.Zuk | List Locally Surjective Homomorphisms in Hereditary Graph Classes | 26 pages, 8 figures | Proceedings: International Symposium on Algorithms and
Computation, ISAAC 2022 | 10.4230/LIPIcs.ISAAC.2022.30 | null | cs.DS cs.CC | http://creativecommons.org/licenses/by/4.0/ | A locally surjective homomorphism from a graph $G$ to a graph $H$ is an
edge-preserving mapping from $V(G)$ to $V(H)$ that is surjective in the
neighborhood of each vertex in $G$. In the list locally surjective homomorphism
problem, denoted by LLSHom($H$), the graph $H$ is fixed and the instance
consists of a graph $... | [
{
"created": "Fri, 25 Feb 2022 00:17:08 GMT",
"version": "v1"
}
] | 2024-01-11 | [
[
"Dvořák",
"Pavel",
""
],
[
"Krawczyk",
"Monika",
""
],
[
"Masařík",
"Tomáš",
""
],
[
"Novotná",
"Jana",
""
],
[
"Rzążewski",
"Paweł",
""
],
[
"Żuk",
"Aneta",
""
]
] | A locally surjective homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$ that is surjective in the neighborhood of each vertex in $G$. In the list locally surjective homomorphism problem, denoted by LLSHom($H$), the graph $H$ is fixed and the instance consists of a graph $G$... |
2402.11639 | Advait Parulekar | Liam Collins, Advait Parulekar, Aryan Mokhtari, Sujay Sanghavi, Sanjay
Shakkottai | In-Context Learning with Transformers: Softmax Attention Adapts to
Function Lipschitzness | null | null | null | null | cs.LG cs.AI cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | A striking property of transformers is their ability to perform in-context
learning (ICL), a machine learning framework in which the learner is presented
with a novel context during inference implicitly through some data, and tasked
with making a prediction in that context. As such, that learner must adapt to
the con... | [
{
"created": "Sun, 18 Feb 2024 16:37:32 GMT",
"version": "v1"
},
{
"created": "Tue, 28 May 2024 05:15:53 GMT",
"version": "v2"
}
] | 2024-05-29 | [
[
"Collins",
"Liam",
""
],
[
"Parulekar",
"Advait",
""
],
[
"Mokhtari",
"Aryan",
""
],
[
"Sanghavi",
"Sujay",
""
],
[
"Shakkottai",
"Sanjay",
""
]
] | A striking property of transformers is their ability to perform in-context learning (ICL), a machine learning framework in which the learner is presented with a novel context during inference implicitly through some data, and tasked with making a prediction in that context. As such, that learner must adapt to the conte... |
1309.0563 | James Lee | Siu On Chan and James R. Lee and Prasad Raghavendra and David Steurer | Approximate Constraint Satisfaction Requires Large LP Relaxations | 29 pages; significant revisions, new references, simpler proofs | null | null | null | cs.CC cs.DS math.CO math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We prove super-polynomial lower bounds on the size of linear programming
relaxations for approximation versions of constraint satisfaction problems. We
show that for these problems, polynomial-sized linear programs are exactly as
powerful as programs arising from a constant number of rounds of the
Sherali-Adams hiera... | [
{
"created": "Tue, 3 Sep 2013 00:30:03 GMT",
"version": "v1"
},
{
"created": "Sun, 22 Feb 2015 14:56:25 GMT",
"version": "v2"
},
{
"created": "Mon, 8 Feb 2016 08:11:10 GMT",
"version": "v3"
}
] | 2016-02-09 | [
[
"Chan",
"Siu On",
""
],
[
"Lee",
"James R.",
""
],
[
"Raghavendra",
"Prasad",
""
],
[
"Steurer",
"David",
""
]
] | We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are exactly as powerful as programs arising from a constant number of rounds of the Sherali-Adams hierarc... |
1910.09578 | Zhe Dong | Zhe Dong, Deniz Oktay, Ben Poole, Alexander A. Alemi | On Predictive Information in RNNs | null | null | null | null | cs.LG cs.IT math.IT stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Certain biological neurons demonstrate a remarkable capability to optimally
compress the history of sensory inputs while being maximally informative about
the future. In this work, we investigate if the same can be said of artificial
neurons in recurrent neural networks (RNNs) trained with maximum likelihood.
Empiric... | [
{
"created": "Mon, 21 Oct 2019 18:12:43 GMT",
"version": "v1"
},
{
"created": "Mon, 10 Feb 2020 20:53:42 GMT",
"version": "v2"
}
] | 2020-02-12 | [
[
"Dong",
"Zhe",
""
],
[
"Oktay",
"Deniz",
""
],
[
"Poole",
"Ben",
""
],
[
"Alemi",
"Alexander A.",
""
]
] | Certain biological neurons demonstrate a remarkable capability to optimally compress the history of sensory inputs while being maximally informative about the future. In this work, we investigate if the same can be said of artificial neurons in recurrent neural networks (RNNs) trained with maximum likelihood. Empirical... |
2107.11526 | Uri Stemmer | Menachem Sadigurschi, Uri Stemmer | On the Sample Complexity of Privately Learning Axis-Aligned Rectangles | null | null | null | null | cs.LG cs.CR cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We revisit the fundamental problem of learning Axis-Aligned-Rectangles over a
finite grid $X^d\subseteq{\mathbb{R}}^d$ with differential privacy. Existing
results show that the sample complexity of this problem is at most $\min\left\{
d{\cdot}\log|X| \;,\; d^{1.5}{\cdot}\left(\log^*|X| \right)^{1.5}\right\}$.
That is... | [
{
"created": "Sat, 24 Jul 2021 04:06:11 GMT",
"version": "v1"
}
] | 2021-07-27 | [
[
"Sadigurschi",
"Menachem",
""
],
[
"Stemmer",
"Uri",
""
]
] | We revisit the fundamental problem of learning Axis-Aligned-Rectangles over a finite grid $X^d\subseteq{\mathbb{R}}^d$ with differential privacy. Existing results show that the sample complexity of this problem is at most $\min\left\{ d{\cdot}\log|X| \;,\; d^{1.5}{\cdot}\left(\log^*|X| \right)^{1.5}\right\}$. That is, ... |
2002.10670 | Eric Hulburd | Eric Hulburd | Exploring BERT Parameter Efficiency on the Stanford Question Answering
Dataset v2.0 | 11 pages, 5 figures, 3 tables | null | null | null | cs.CL cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper we explore the parameter efficiency of BERT arXiv:1810.04805 on
version 2.0 of the Stanford Question Answering dataset (SQuAD2.0). We evaluate
the parameter efficiency of BERT while freezing a varying number of final
transformer layers as well as including the adapter layers proposed in
arXiv:1902.00751... | [
{
"created": "Tue, 25 Feb 2020 05:09:48 GMT",
"version": "v1"
},
{
"created": "Tue, 3 Mar 2020 05:16:37 GMT",
"version": "v2"
}
] | 2020-03-04 | [
[
"Hulburd",
"Eric",
""
]
] | In this paper we explore the parameter efficiency of BERT arXiv:1810.04805 on version 2.0 of the Stanford Question Answering dataset (SQuAD2.0). We evaluate the parameter efficiency of BERT while freezing a varying number of final transformer layers as well as including the adapter layers proposed in arXiv:1902.00751. ... |
2012.15533 | David Lorenz | Ofir T. Erlich and David H. Lorenz | Optimal Software Architecture From Initial Requirements: An End-to-End
Approach | null | null | null | null | cs.SE | http://creativecommons.org/licenses/by/4.0/ | A software architect turns system requirements into a suitable software
architecture through an architecture optimization process. However, how should
the architect decide which quality improvement to prioritize, e.g., security or
reliability? In software product line, should a small improvement in multiple
products ... | [
{
"created": "Thu, 31 Dec 2020 10:35:43 GMT",
"version": "v1"
}
] | 2021-01-01 | [
[
"Erlich",
"Ofir T.",
""
],
[
"Lorenz",
"David H.",
""
]
] | A software architect turns system requirements into a suitable software architecture through an architecture optimization process. However, how should the architect decide which quality improvement to prioritize, e.g., security or reliability? In software product line, should a small improvement in multiple products be... |
2210.10191 | Changhan Wang | Changhan Wang, Hirofumi Inaguma, Peng-Jen Chen, Ilia Kulikov, Yun
Tang, Wei-Ning Hsu, Michael Auli, Juan Pino | Simple and Effective Unsupervised Speech Translation | null | null | null | null | cs.CL cs.SD eess.AS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The amount of labeled data to train models for speech tasks is limited for
most languages, however, the data scarcity is exacerbated for speech
translation which requires labeled data covering two different languages. To
address this issue, we study a simple and effective approach to build speech
translation systems ... | [
{
"created": "Tue, 18 Oct 2022 22:26:13 GMT",
"version": "v1"
}
] | 2022-10-20 | [
[
"Wang",
"Changhan",
""
],
[
"Inaguma",
"Hirofumi",
""
],
[
"Chen",
"Peng-Jen",
""
],
[
"Kulikov",
"Ilia",
""
],
[
"Tang",
"Yun",
""
],
[
"Hsu",
"Wei-Ning",
""
],
[
"Auli",
"Michael",
""
],
[
"Pino",... | The amount of labeled data to train models for speech tasks is limited for most languages, however, the data scarcity is exacerbated for speech translation which requires labeled data covering two different languages. To address this issue, we study a simple and effective approach to build speech translation systems wi... |
2202.13041 | Wensheng Gan | Wensheng Gan, Guoting Chen, Hongzhi Yin, Philippe Fournier-Viger,
Chien-Ming Chen, and Philip S. Yu | Towards Revenue Maximization with Popular and Profitable Products | ACM/IMS Transactions on Data Science. 4 figures, 5 tables | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Economic-wise, a common goal for companies conducting marketing is to
maximize the return revenue/profit by utilizing the various effective marketing
strategies. Consumer behavior is crucially important in economy and targeted
marketing, in which behavioral economics can provide valuable insights to
identify the bias... | [
{
"created": "Sat, 26 Feb 2022 02:07:25 GMT",
"version": "v1"
}
] | 2022-03-01 | [
[
"Gan",
"Wensheng",
""
],
[
"Chen",
"Guoting",
""
],
[
"Yin",
"Hongzhi",
""
],
[
"Fournier-Viger",
"Philippe",
""
],
[
"Chen",
"Chien-Ming",
""
],
[
"Yu",
"Philip S.",
""
]
] | Economic-wise, a common goal for companies conducting marketing is to maximize the return revenue/profit by utilizing the various effective marketing strategies. Consumer behavior is crucially important in economy and targeted marketing, in which behavioral economics can provide valuable insights to identify the biases... |
1705.04544 | Karl D\"aubel | Aaron Bernstein, Karl D\"aubel, Yann Disser, Max Klimm, Torsten
M\"utze, Frieder Smolny | Distance-preserving graph contractions | An extended abstract of this work has appeared in the Proceedings of
the 9th Innovations in Theoretical Computer Science Conference (ITCS) 2018 | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Compression and sparsification algorithms are frequently applied in a
preprocessing step before analyzing or optimizing large networks/graphs. In
this paper we propose and study a new framework contracting edges of a graph
(merging vertices into super-vertices) with the goal of preserving pairwise
distances as accura... | [
{
"created": "Fri, 12 May 2017 12:52:49 GMT",
"version": "v1"
},
{
"created": "Tue, 12 Sep 2017 17:00:39 GMT",
"version": "v2"
},
{
"created": "Mon, 5 Feb 2018 16:37:42 GMT",
"version": "v3"
},
{
"created": "Wed, 13 Feb 2019 13:51:48 GMT",
"version": "v4"
}
] | 2019-02-14 | [
[
"Bernstein",
"Aaron",
""
],
[
"Däubel",
"Karl",
""
],
[
"Disser",
"Yann",
""
],
[
"Klimm",
"Max",
""
],
[
"Mütze",
"Torsten",
""
],
[
"Smolny",
"Frieder",
""
]
] | Compression and sparsification algorithms are frequently applied in a preprocessing step before analyzing or optimizing large networks/graphs. In this paper we propose and study a new framework contracting edges of a graph (merging vertices into super-vertices) with the goal of preserving pairwise distances as accurate... |
2303.16109 | Sajjad Mozaffari | Sajjad Mozaffari, Mreza Alipour Sormoli, Konstantinos Koufos, and
Mehrdad Dianati | Multimodal Manoeuvre and Trajectory Prediction for Automated Driving on
Highways Using Transformer Networks | 8 pages, 3 figures, submitted to IEEE RAL | null | null | null | cs.LG cs.RO | http://creativecommons.org/licenses/by/4.0/ | Predicting the behaviour (i.e., manoeuvre/trajectory) of other road users,
including vehicles, is critical for the safe and efficient operation of
autonomous vehicles (AVs), a.k.a., automated driving systems (ADSs). Due to the
uncertain future behaviour of vehicles, multiple future behaviour modes are
often plausible... | [
{
"created": "Tue, 28 Mar 2023 16:25:16 GMT",
"version": "v1"
},
{
"created": "Wed, 26 Jul 2023 16:58:06 GMT",
"version": "v2"
}
] | 2023-07-27 | [
[
"Mozaffari",
"Sajjad",
""
],
[
"Sormoli",
"Mreza Alipour",
""
],
[
"Koufos",
"Konstantinos",
""
],
[
"Dianati",
"Mehrdad",
""
]
] | Predicting the behaviour (i.e., manoeuvre/trajectory) of other road users, including vehicles, is critical for the safe and efficient operation of autonomous vehicles (AVs), a.k.a., automated driving systems (ADSs). Due to the uncertain future behaviour of vehicles, multiple future behaviour modes are often plausible f... |
1601.00543 | Xiangming Meng | Xiangming Meng and Sheng Wu and Linling Kuang and Defeng (David) Huang
and Jianhua Lu | Approximate Message Passing with Nearest Neighbor Sparsity Pattern
Learning | 5 pages, 4 figures | null | null | null | cs.IT cs.LG math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We consider the problem of recovering clustered sparse signals with no prior
knowledge of the sparsity pattern. Beyond simple sparsity, signals of interest
often exhibits an underlying sparsity pattern which, if leveraged, can improve
the reconstruction performance. However, the sparsity pattern is usually
unknown a ... | [
{
"created": "Mon, 4 Jan 2016 15:43:49 GMT",
"version": "v1"
}
] | 2016-01-05 | [
[
"Meng",
"Xiangming",
"",
"David"
],
[
"Wu",
"Sheng",
"",
"David"
],
[
"Kuang",
"Linling",
"",
"David"
],
[
"Defeng",
"",
"",
"David"
],
[
"Huang",
"",
""
],
[
"Lu",
"Jianhua",
""
]
] | We consider the problem of recovering clustered sparse signals with no prior knowledge of the sparsity pattern. Beyond simple sparsity, signals of interest often exhibits an underlying sparsity pattern which, if leveraged, can improve the reconstruction performance. However, the sparsity pattern is usually unknown a pr... |
2303.10145 | Sudarshan Ambasamudram Rajagopalan | Kitty Varghese, Sudarshan Rajagopalan, Mohit Lamba, Kaushik Mitra | Spectrum-inspired Low-light Image Translation for Saliency Detection | Presented at The Indian Conference on Computer Vision, Graphics and
Image Processing (ICVGIP) 2022 | null | 10.1145/3571600.3571634 | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | Saliency detection methods are central to several real-world applications
such as robot navigation and satellite imagery. However, the performance of
existing methods deteriorate under low-light conditions because training
datasets mostly comprise of well-lit images. One possible solution is to
collect a new dataset ... | [
{
"created": "Fri, 17 Mar 2023 17:30:42 GMT",
"version": "v1"
}
] | 2023-03-20 | [
[
"Varghese",
"Kitty",
""
],
[
"Rajagopalan",
"Sudarshan",
""
],
[
"Lamba",
"Mohit",
""
],
[
"Mitra",
"Kaushik",
""
]
] | Saliency detection methods are central to several real-world applications such as robot navigation and satellite imagery. However, the performance of existing methods deteriorate under low-light conditions because training datasets mostly comprise of well-lit images. One possible solution is to collect a new dataset fo... |
2111.02354 | Sapana Chaudhary | Sapana Chaudhary, Balaraman Ravindran | Smooth Imitation Learning via Smooth Costs and Smooth Policies | To appear in the Proceedings of the Fifth Joint International
Conference on Data Science and Management of Data (CoDS-COMAD 2022). Research
Track. ACM DL | null | 10.1145/3493700.3493716 | null | cs.LG cs.AI | http://creativecommons.org/licenses/by/4.0/ | Imitation learning (IL) is a popular approach in the continuous control
setting as among other reasons it circumvents the problems of reward
mis-specification and exploration in reinforcement learning (RL). In IL from
demonstrations, an important challenge is to obtain agent policies that are
smooth with respect to t... | [
{
"created": "Wed, 3 Nov 2021 17:12:47 GMT",
"version": "v1"
}
] | 2021-11-04 | [
[
"Chaudhary",
"Sapana",
""
],
[
"Ravindran",
"Balaraman",
""
]
] | Imitation learning (IL) is a popular approach in the continuous control setting as among other reasons it circumvents the problems of reward mis-specification and exploration in reinforcement learning (RL). In IL from demonstrations, an important challenge is to obtain agent policies that are smooth with respect to the... |
2405.10457 | Kristin Denlinger | Kristie Denlinger, Stephen Wechsler and Kyle Mahowald | Participle-Prepended Nominals Have Lower Entropy Than Nominals Appended
After the Participle | Accepted to CogSci 2024, 6 pages, 2 figures | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | English allows for both compounds (e.g., London-made) and phrasal paraphrases
(e.g., made in London). While these constructions have roughly the same
truth-conditional meaning, we hypothesize that the compound allows less freedom
to express the nature of the semantic relationship between the participle and
the pre-pa... | [
{
"created": "Thu, 16 May 2024 22:05:45 GMT",
"version": "v1"
}
] | 2024-05-20 | [
[
"Denlinger",
"Kristie",
""
],
[
"Wechsler",
"Stephen",
""
],
[
"Mahowald",
"Kyle",
""
]
] | English allows for both compounds (e.g., London-made) and phrasal paraphrases (e.g., made in London). While these constructions have roughly the same truth-conditional meaning, we hypothesize that the compound allows less freedom to express the nature of the semantic relationship between the participle and the pre-part... |
1006.2682 | Eswar Karthikeyan | S. S. Sonavane, B. P. Patil, V. Kumar | Experimentation for Packet Loss on MSP430 and nRF24L01 Based Wireless
Sensor Network | 5 Pages IJANA | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper,a new design of wireless sensor network (WSN)node is discussed
which is based on components with ultra low power.We ha e de eloped a Low cost
and low power WSN Node using MSP430 and nRF24L01.The architectural circuit
details are presented.This architecture fulfils the requirements like low
cost,low powe... | [
{
"created": "Mon, 14 Jun 2010 11:59:38 GMT",
"version": "v1"
}
] | 2010-06-15 | [
[
"Sonavane",
"S. S.",
""
],
[
"Patil",
"B. P.",
""
],
[
"Kumar",
"V.",
""
]
] | In this paper,a new design of wireless sensor network (WSN)node is discussed which is based on components with ultra low power.We ha e de eloped a Low cost and low power WSN Node using MSP430 and nRF24L01.The architectural circuit details are presented.This architecture fulfils the requirements like low cost,low power,... |
1901.06915 | Xiangliang Kong | Xiangliang Kong, Jingxue Ma and Gennian Ge | New Bounds on the Field Size for Maximally Recoverable Codes
Instantiating Grid-like Topologies | 18 pages. arXiv admin note: text overlap with arXiv:1605.05412 by
other authors | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In recent years, the rapidly increasing amounts of data created and processed
through the internet resulted in distributed storage systems employing erasure
coding based schemes. Aiming to balance the tradeoff between data recovery for
correlated failures and efficient encoding and decoding, distributed storage
syste... | [
{
"created": "Mon, 21 Jan 2019 13:02:16 GMT",
"version": "v1"
},
{
"created": "Tue, 19 Feb 2019 12:13:07 GMT",
"version": "v2"
}
] | 2019-02-21 | [
[
"Kong",
"Xiangliang",
""
],
[
"Ma",
"Jingxue",
""
],
[
"Ge",
"Gennian",
""
]
] | In recent years, the rapidly increasing amounts of data created and processed through the internet resulted in distributed storage systems employing erasure coding based schemes. Aiming to balance the tradeoff between data recovery for correlated failures and efficient encoding and decoding, distributed storage systems... |
2203.12677 | Kyle Hsu | Kyle Hsu, Moo Jin Kim, Rafael Rafailov, Jiajun Wu, Chelsea Finn | Vision-Based Manipulators Need to Also See from Their Hands | First two authors contributed equally. ICLR 2022 (oral) camera-ready.
30 pages, 20 figures. Project website:
https://sites.google.com/view/seeing-from-hands | null | null | null | cs.RO cs.CV cs.LG | http://creativecommons.org/licenses/by/4.0/ | We study how the choice of visual perspective affects learning and
generalization in the context of physical manipulation from raw sensor
observations. Compared with the more commonly used global third-person
perspective, a hand-centric (eye-in-hand) perspective affords reduced
observability, but we find that it cons... | [
{
"created": "Tue, 15 Mar 2022 18:46:18 GMT",
"version": "v1"
}
] | 2022-03-25 | [
[
"Hsu",
"Kyle",
""
],
[
"Kim",
"Moo Jin",
""
],
[
"Rafailov",
"Rafael",
""
],
[
"Wu",
"Jiajun",
""
],
[
"Finn",
"Chelsea",
""
]
] | We study how the choice of visual perspective affects learning and generalization in the context of physical manipulation from raw sensor observations. Compared with the more commonly used global third-person perspective, a hand-centric (eye-in-hand) perspective affords reduced observability, but we find that it consis... |
1304.1836 | arXiv Admin | Tairen Sun | A Simulation and Modeling of Access Points with Definition Language | Withdrawn by arXiv admins | null | null | null | cs.OH | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This submission has been withdrawn by arXiv administrators because it
contains fictitious content and was submitted under a pseudonym, which is
against arXiv policy.
| [
{
"created": "Sat, 6 Apr 2013 00:18:59 GMT",
"version": "v1"
},
{
"created": "Thu, 11 Apr 2013 19:06:01 GMT",
"version": "v2"
}
] | 2015-01-22 | [
[
"Sun",
"Tairen",
""
]
] | This submission has been withdrawn by arXiv administrators because it contains fictitious content and was submitted under a pseudonym, which is against arXiv policy. |
2402.08267 | Kei Iino | Kei Iino, Shunsuke Akamatsu, Hiroshi Watanabe, Shohei Enomoto, Akira
Sakamoto, Takeharu Eda | Improving Image Coding for Machines through Optimizing Encoder via
Auxiliary Loss | This version has been removed by arXiv administrators as the
submitter did not have the right to agree to the license at the time of
submission | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | Image coding for machines (ICM) aims to compress images for machine analysis
using recognition models rather than human vision. Hence, in ICM, it is
important for the encoder to recognize and compress the information necessary
for the machine recognition task. There are two main approaches in learned ICM;
optimizatio... | [
{
"created": "Tue, 13 Feb 2024 07:45:25 GMT",
"version": "v1"
}
] | 2024-03-07 | [
[
"Iino",
"Kei",
""
],
[
"Akamatsu",
"Shunsuke",
""
],
[
"Watanabe",
"Hiroshi",
""
],
[
"Enomoto",
"Shohei",
""
],
[
"Sakamoto",
"Akira",
""
],
[
"Eda",
"Takeharu",
""
]
] | Image coding for machines (ICM) aims to compress images for machine analysis using recognition models rather than human vision. Hence, in ICM, it is important for the encoder to recognize and compress the information necessary for the machine recognition task. There are two main approaches in learned ICM; optimization ... |
1907.07818 | Manash Pratim Barman | Manash Pratim Barman, Amit Awekar, Sambhav Kothari | Decoding the Style and Bias of Song Lyrics | Accepted for ACM SIGIR 2019 | null | null | null | cs.IR cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The central idea of this paper is to gain a deeper understanding of song
lyrics computationally. We focus on two aspects: style and biases of song
lyrics. All prior works to understand these two aspects are limited to manual
analysis of a small corpus of song lyrics. In contrast, we analyzed more than
half a million ... | [
{
"created": "Wed, 17 Jul 2019 23:57:46 GMT",
"version": "v1"
}
] | 2019-07-19 | [
[
"Barman",
"Manash Pratim",
""
],
[
"Awekar",
"Amit",
""
],
[
"Kothari",
"Sambhav",
""
]
] | The central idea of this paper is to gain a deeper understanding of song lyrics computationally. We focus on two aspects: style and biases of song lyrics. All prior works to understand these two aspects are limited to manual analysis of a small corpus of song lyrics. In contrast, we analyzed more than half a million so... |
2402.05605 | Andrew Fuchs | Andrew Fuchs, Andrea Passarella, and Marco Conti | Optimizing Delegation in Collaborative Human-AI Hybrid Teams | null | null | null | null | cs.AI cs.HC cs.LG | http://creativecommons.org/licenses/by/4.0/ | When humans and autonomous systems operate together as what we refer to as a
hybrid team, we of course wish to ensure the team operates successfully and
effectively. We refer to team members as agents. In our proposed framework, we
address the case of hybrid teams in which, at any time, only one team member
(the cont... | [
{
"created": "Thu, 8 Feb 2024 12:04:43 GMT",
"version": "v1"
}
] | 2024-02-09 | [
[
"Fuchs",
"Andrew",
""
],
[
"Passarella",
"Andrea",
""
],
[
"Conti",
"Marco",
""
]
] | When humans and autonomous systems operate together as what we refer to as a hybrid team, we of course wish to ensure the team operates successfully and effectively. We refer to team members as agents. In our proposed framework, we address the case of hybrid teams in which, at any time, only one team member (the contro... |
1312.7354 | Md. Selim Al Mamun | Md. Selim Al Mamun, Syed Monowar Hossain | Design of Reversible Random Access Memory | null | International Journal of Computer Applications,Volume 56 - Number
15 , Year of Publication: 2012 | 10.5120/8967-3182 | null | cs.ET cs.AR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Reversible logic has become immensely popular research area and its
applications have spread in various technologies for their low power
consumption. In this paper we proposed an efficient design of random access
memory using reversible logic. In the way of designing the reversible random
access memory we proposed a ... | [
{
"created": "Sun, 22 Dec 2013 15:13:12 GMT",
"version": "v1"
}
] | 2013-12-31 | [
[
"Mamun",
"Md. Selim Al",
""
],
[
"Hossain",
"Syed Monowar",
""
]
] | Reversible logic has become immensely popular research area and its applications have spread in various technologies for their low power consumption. In this paper we proposed an efficient design of random access memory using reversible logic. In the way of designing the reversible random access memory we proposed a re... |
2211.11186 | Zhiyi Xue | Yiting Wu, Zhaodi Zhang, Zhiyi Xue, Si Liu, Min Zhang | DualApp: Tight Over-Approximation for Neural Network Robustness
Verification via Under-Approximation | 13 pages, 9 fugures, 3 tables | null | null | null | cs.SE cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The robustness of neural networks is fundamental to the hosting system's
reliability and security. Formal verification has been proven to be effective
in providing provable robustness guarantees. To improve the verification
scalability, over-approximating the non-linear activation functions in neural
networks by line... | [
{
"created": "Mon, 21 Nov 2022 05:09:34 GMT",
"version": "v1"
}
] | 2022-11-22 | [
[
"Wu",
"Yiting",
""
],
[
"Zhang",
"Zhaodi",
""
],
[
"Xue",
"Zhiyi",
""
],
[
"Liu",
"Si",
""
],
[
"Zhang",
"Min",
""
]
] | The robustness of neural networks is fundamental to the hosting system's reliability and security. Formal verification has been proven to be effective in providing provable robustness guarantees. To improve the verification scalability, over-approximating the non-linear activation functions in neural networks by linear... |
2203.07990 | Abhishek Dhankar | Abhishek Dhankar, Osmar R. Za\"iane and Francois Bolduc | UofA-Truth at Factify 2022 : Transformer And Transfer Learning Based
Multi-Modal Fact-Checking | null | null | null | null | cs.MM cs.AI cs.CL | http://creativecommons.org/licenses/by/4.0/ | Identifying fake news is a very difficult task, especially when considering
the multiple modes of conveying information through text, image, video and/or
audio. We attempted to tackle the problem of automated
misinformation/disinformation detection in multi-modal news sources (including
text and images) through our s... | [
{
"created": "Fri, 28 Jan 2022 18:13:03 GMT",
"version": "v1"
}
] | 2022-03-16 | [
[
"Dhankar",
"Abhishek",
""
],
[
"Zaïane",
"Osmar R.",
""
],
[
"Bolduc",
"Francois",
""
]
] | Identifying fake news is a very difficult task, especially when considering the multiple modes of conveying information through text, image, video and/or audio. We attempted to tackle the problem of automated misinformation/disinformation detection in multi-modal news sources (including text and images) through our sim... |
2403.00434 | Zhouxiang Zhao | Zhouxiang Zhao, Zhaohui Yang, Ye Hu, Qianqian Yang, Wei Xu, Zhaoyang
Zhang | Probabilistic Semantic Communication over Wireless Networks with Rate
Splitting | null | null | null | null | cs.IT eess.SP math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, the problem of joint transmission and computation resource
allocation for probabilistic semantic communication (PSC) system with rate
splitting multiple access (RSMA) is investigated. In the considered model, the
base station (BS) needs to transmit a large amount of data to multiple users
with RSMA. Du... | [
{
"created": "Fri, 1 Mar 2024 10:36:04 GMT",
"version": "v1"
}
] | 2024-03-04 | [
[
"Zhao",
"Zhouxiang",
""
],
[
"Yang",
"Zhaohui",
""
],
[
"Hu",
"Ye",
""
],
[
"Yang",
"Qianqian",
""
],
[
"Xu",
"Wei",
""
],
[
"Zhang",
"Zhaoyang",
""
]
] | In this paper, the problem of joint transmission and computation resource allocation for probabilistic semantic communication (PSC) system with rate splitting multiple access (RSMA) is investigated. In the considered model, the base station (BS) needs to transmit a large amount of data to multiple users with RSMA. Due ... |
2201.04913 | Laurent Mertens | Laurent Mertens, Joost Vennekens | Compressing Word Embeddings Using Syllables | 19 pages 3 figures 11 tables | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | This work examines the possibility of using syllable embeddings, instead of
the often used $n$-gram embeddings, as subword embeddings. We investigate this
for two languages: English and Dutch. To this end, we also translated two
standard English word embedding evaluation datasets, WordSim353 and
SemEval-2017, to Dutc... | [
{
"created": "Thu, 13 Jan 2022 12:09:44 GMT",
"version": "v1"
}
] | 2022-01-14 | [
[
"Mertens",
"Laurent",
""
],
[
"Vennekens",
"Joost",
""
]
] | This work examines the possibility of using syllable embeddings, instead of the often used $n$-gram embeddings, as subword embeddings. We investigate this for two languages: English and Dutch. To this end, we also translated two standard English word embedding evaluation datasets, WordSim353 and SemEval-2017, to Dutch.... |
2406.04470 | Haokun Zhou | Haokun Zhou, Yipeng Hong | DiffuSyn Bench: Evaluating Vision-Language Models on Real-World
Complexities with Diffusion-Generated Synthetic Benchmarks | null | null | null | null | cs.CV cs.AI | http://creativecommons.org/licenses/by/4.0/ | This study assesses the ability of Large Vision-Language Models (LVLMs) to
differentiate between AI-generated and human-generated images. It introduces a
new automated benchmark construction method for this evaluation. The experiment
compared common LVLMs with human participants using a mixed dataset of AI and
human-... | [
{
"created": "Thu, 6 Jun 2024 19:50:33 GMT",
"version": "v1"
},
{
"created": "Thu, 13 Jun 2024 16:46:22 GMT",
"version": "v2"
}
] | 2024-06-14 | [
[
"Zhou",
"Haokun",
""
],
[
"Hong",
"Yipeng",
""
]
] | This study assesses the ability of Large Vision-Language Models (LVLMs) to differentiate between AI-generated and human-generated images. It introduces a new automated benchmark construction method for this evaluation. The experiment compared common LVLMs with human participants using a mixed dataset of AI and human-cr... |
cs/0508053 | Peter Turney | Peter D. Turney (National Research Council of Canada) | Measuring Semantic Similarity by Latent Relational Analysis | 6 pages, related work available at http://purl.org/peter.turney/ | Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence (IJCAI-05), (2005), Edinburgh, Scotland, 1136-1141 | null | NRC-48255 | cs.LG cs.CL cs.IR | null | This paper introduces Latent Relational Analysis (LRA), a method for
measuring semantic similarity. LRA measures similarity in the semantic
relations between two pairs of words. When two pairs have a high degree of
relational similarity, they are analogous. For example, the pair cat:meow is
analogous to the pair dog:... | [
{
"created": "Wed, 10 Aug 2005 19:35:57 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Turney",
"Peter D.",
"",
"National Research Council of Canada"
]
] | This paper introduces Latent Relational Analysis (LRA), a method for measuring semantic similarity. LRA measures similarity in the semantic relations between two pairs of words. When two pairs have a high degree of relational similarity, they are analogous. For example, the pair cat:meow is analogous to the pair dog:ba... |
2305.03624 | Yitong Ji | Yitong Ji, Aixin Sun, Jie Zhang | Retraining A Graph-based Recommender with Interests Disentanglement | null | null | null | null | cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In a practical recommender system, new interactions are continuously
observed. Some interactions are expected, because they largely follow users'
long-term preferences. Some other interactions are indications of recent trends
in user preference changes or marketing positions of new items. Accordingly,
the recommender... | [
{
"created": "Fri, 5 May 2023 15:36:33 GMT",
"version": "v1"
}
] | 2023-05-08 | [
[
"Ji",
"Yitong",
""
],
[
"Sun",
"Aixin",
""
],
[
"Zhang",
"Jie",
""
]
] | In a practical recommender system, new interactions are continuously observed. Some interactions are expected, because they largely follow users' long-term preferences. Some other interactions are indications of recent trends in user preference changes or marketing positions of new items. Accordingly, the recommender n... |
2304.05483 | Lasse Peters | Lasse Peters, Andrea Bajcsy, Chih-Yuan Chiu, David Fridovich-Keil,
Forrest Laine, Laura Ferranti, Javier Alonso-Mora | Contingency Games for Multi-Agent Interaction | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Contingency planning, wherein an agent generates a set of possible plans
conditioned on the outcome of an uncertain event, is an increasingly popular
way for robots to act under uncertainty. In this work we take a game-theoretic
perspective on contingency planning, tailored to multi-agent scenarios in which
a robot's... | [
{
"created": "Tue, 11 Apr 2023 20:30:17 GMT",
"version": "v1"
},
{
"created": "Fri, 14 Apr 2023 10:01:38 GMT",
"version": "v2"
},
{
"created": "Fri, 18 Aug 2023 13:58:36 GMT",
"version": "v3"
},
{
"created": "Thu, 21 Dec 2023 18:52:18 GMT",
"version": "v4"
}
] | 2023-12-22 | [
[
"Peters",
"Lasse",
""
],
[
"Bajcsy",
"Andrea",
""
],
[
"Chiu",
"Chih-Yuan",
""
],
[
"Fridovich-Keil",
"David",
""
],
[
"Laine",
"Forrest",
""
],
[
"Ferranti",
"Laura",
""
],
[
"Alonso-Mora",
"Javier",
""
... | Contingency planning, wherein an agent generates a set of possible plans conditioned on the outcome of an uncertain event, is an increasingly popular way for robots to act under uncertainty. In this work we take a game-theoretic perspective on contingency planning, tailored to multi-agent scenarios in which a robot's a... |
2305.16750 | Anna Wr\'oblewska | Anna Wr\'oblewska, Bartosz Pieli\'nski, Karolina Seweryn, Sylwia
Sysko-Roma\'nczuk, Karol Saputa, Aleksandra Wichrowska, Hanna Schreiber | Automating the Analysis of Institutional Design in International
Agreements | 11 pages, 8 figures, accepted to ICCS 2023. arXiv admin note:
substantial text overlap with arXiv:2209.00944 | null | 10.1007/978-3-031-36024-4_5 | null | cs.CL cs.IR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | This paper explores the automatic knowledge extraction of formal
institutional design - norms, rules, and actors - from international
agreements. The focus was to analyze the relationship between the visibility
and centrality of actors in the formal institutional design in regulating
critical aspects of cultural heri... | [
{
"created": "Fri, 26 May 2023 08:57:11 GMT",
"version": "v1"
}
] | 2023-09-08 | [
[
"Wróblewska",
"Anna",
""
],
[
"Pieliński",
"Bartosz",
""
],
[
"Seweryn",
"Karolina",
""
],
[
"Sysko-Romańczuk",
"Sylwia",
""
],
[
"Saputa",
"Karol",
""
],
[
"Wichrowska",
"Aleksandra",
""
],
[
"Schreiber",
"Han... | This paper explores the automatic knowledge extraction of formal institutional design - norms, rules, and actors - from international agreements. The focus was to analyze the relationship between the visibility and centrality of actors in the formal institutional design in regulating critical aspects of cultural herita... |
0709.0259 | Chien-Hwa Hwang | Chien-Hwa Hwang and Shih-Chang Chen | Spectrum Sensing in Wideband OFDM Cognitive Radios | 30 pages, 7 figures, submitted to IEEE Transactions on Signal
Processing, Aug. 2007 | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, detection of the primary user (PU) signal in an orthogonal
frequency division multiplexing (OFDM) based cognitive radio (CR) system is
addressed. According to the prior knowledge of the PU signal known to the
detector, three detection algorithms based on the Neyman-Pearson philosophy are
proposed. In t... | [
{
"created": "Mon, 3 Sep 2007 15:16:20 GMT",
"version": "v1"
},
{
"created": "Mon, 6 Oct 2008 05:04:22 GMT",
"version": "v2"
}
] | 2008-10-06 | [
[
"Hwang",
"Chien-Hwa",
""
],
[
"Chen",
"Shih-Chang",
""
]
] | In this paper, detection of the primary user (PU) signal in an orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) system is addressed. According to the prior knowledge of the PU signal known to the detector, three detection algorithms based on the Neyman-Pearson philosophy are proposed. In the... |
2310.11344 | Murilo Varges da Silva | Lucca de Freitas Santos, Murilo Varges da Silva | The effect of stemming and lemmatization on Portuguese fake news text
classification | null | null | null | null | cs.CL cs.AI | http://creativecommons.org/licenses/by/4.0/ | With the popularization of the internet, smartphones and social media,
information is being spread quickly and easily way, which implies bigger
traffic of information in the world, but there is a problem that is harming
society with the dissemination of fake news. With a bigger flow of information,
some people are tr... | [
{
"created": "Tue, 17 Oct 2023 15:26:40 GMT",
"version": "v1"
}
] | 2023-10-18 | [
[
"Santos",
"Lucca de Freitas",
""
],
[
"da Silva",
"Murilo Varges",
""
]
] | With the popularization of the internet, smartphones and social media, information is being spread quickly and easily way, which implies bigger traffic of information in the world, but there is a problem that is harming society with the dissemination of fake news. With a bigger flow of information, some people are tryi... |
2308.08873 | Mahyar Jahaninasab | Mahyar Jahaninasab, Mohamad Ali Bijarchi | Enhancing Convergence Speed with Feature-Enforcing Physics-Informed
Neural Networks: Utilizing Boundary Conditions as Prior Knowledge for Faster
Convergence | 26 pages, 10 figures, 6 tables | null | null | null | cs.LG | http://creativecommons.org/licenses/by-nc-nd/4.0/ | This study introduces an accelerated training method for Vanilla
Physics-Informed-Neural-Networks (PINN) addressing three factors that imbalance
the loss function: initial weight state of a neural network, domain to boundary
points ratio, and loss weighting factor. We propose a novel two-stage training
method. During... | [
{
"created": "Thu, 17 Aug 2023 09:10:07 GMT",
"version": "v1"
},
{
"created": "Fri, 15 Sep 2023 17:13:59 GMT",
"version": "v2"
},
{
"created": "Wed, 27 Sep 2023 07:43:29 GMT",
"version": "v3"
},
{
"created": "Sat, 6 Apr 2024 12:30:26 GMT",
"version": "v4"
}
] | 2024-04-09 | [
[
"Jahaninasab",
"Mahyar",
""
],
[
"Bijarchi",
"Mohamad Ali",
""
]
] | This study introduces an accelerated training method for Vanilla Physics-Informed-Neural-Networks (PINN) addressing three factors that imbalance the loss function: initial weight state of a neural network, domain to boundary points ratio, and loss weighting factor. We propose a novel two-stage training method. During t... |
2209.05603 | Zhenishbek Zhakypov | Zhenishbek Zhakypov, Yimeng Qin, and Allison Okamura | Hoxels: Fully 3-D Printed Soft Multi-Modal & Multi-Contact Haptic Voxel
Displays for Enriched Tactile Information Transfer | The extended abstract paper was presented in the LEVERAGING
ADVANCEMENTS IN SMART MATERIALS SCIENCE: SOFT ROBOTS GAINING NEW ABILITIES
THROUGH SMART AND FUNCTIONAL MATERIALS workshop at the 2022 IEEE
International Conference on Robotics and Automation | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Wrist-worn haptic interfaces can deliver a wide range of tactile cues for
communication of information and interaction with virtual objects. Unlike
fingertips, the wrist and forearm provide a considerably large area of skin
that allows the placement of multiple haptic actuators as a display for
enriching tactile info... | [
{
"created": "Mon, 12 Sep 2022 20:38:03 GMT",
"version": "v1"
}
] | 2022-09-14 | [
[
"Zhakypov",
"Zhenishbek",
""
],
[
"Qin",
"Yimeng",
""
],
[
"Okamura",
"Allison",
""
]
] | Wrist-worn haptic interfaces can deliver a wide range of tactile cues for communication of information and interaction with virtual objects. Unlike fingertips, the wrist and forearm provide a considerably large area of skin that allows the placement of multiple haptic actuators as a display for enriching tactile inform... |
2305.00646 | Ziwei Yu | Ziwei Yu, Chen Li, Linlin Yang, Xiaoxu Zheng, Michael Bi Mi, Gim Hee
Lee, Angela Yao | Overcoming the Trade-off Between Accuracy and Plausibility in 3D Hand
Shape Reconstruction | CVPR 2023 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Direct mesh fitting for 3D hand shape reconstruction is highly accurate.
However, the reconstructed meshes are prone to artifacts and do not appear as
plausible hand shapes. Conversely, parametric models like MANO ensure plausible
hand shapes but are not as accurate as the non-parametric methods. In this
work, we int... | [
{
"created": "Mon, 1 May 2023 03:38:01 GMT",
"version": "v1"
}
] | 2023-05-02 | [
[
"Yu",
"Ziwei",
""
],
[
"Li",
"Chen",
""
],
[
"Yang",
"Linlin",
""
],
[
"Zheng",
"Xiaoxu",
""
],
[
"Mi",
"Michael Bi",
""
],
[
"Lee",
"Gim Hee",
""
],
[
"Yao",
"Angela",
""
]
] | Direct mesh fitting for 3D hand shape reconstruction is highly accurate. However, the reconstructed meshes are prone to artifacts and do not appear as plausible hand shapes. Conversely, parametric models like MANO ensure plausible hand shapes but are not as accurate as the non-parametric methods. In this work, we intro... |
1807.01745 | Tianze Shi | Carlos G\'omez-Rodr\'iguez and Tianze Shi and Lillian Lee | Global Transition-based Non-projective Dependency Parsing | Proceedings of ACL 2018. 13 pages | Proceedings of ACL 2018 | null | null | cs.CL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Shi, Huang, and Lee (2017) obtained state-of-the-art results for English and
Chinese dependency parsing by combining dynamic-programming implementations of
transition-based dependency parsers with a minimal set of bidirectional LSTM
features. However, their results were limited to projective parsing. In this
paper, w... | [
{
"created": "Wed, 4 Jul 2018 19:09:40 GMT",
"version": "v1"
}
] | 2018-07-06 | [
[
"Gómez-Rodríguez",
"Carlos",
""
],
[
"Shi",
"Tianze",
""
],
[
"Lee",
"Lillian",
""
]
] | Shi, Huang, and Lee (2017) obtained state-of-the-art results for English and Chinese dependency parsing by combining dynamic-programming implementations of transition-based dependency parsers with a minimal set of bidirectional LSTM features. However, their results were limited to projective parsing. In this paper, we ... |
2305.09974 | Kai Wang | Kai Wang and Siqiang Luo and Dan Lin | River of No Return: Graph Percolation Embeddings for Efficient Knowledge
Graph Reasoning | 9 pages, 2 figures | null | null | null | cs.AI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study Graph Neural Networks (GNNs)-based embedding techniques for
knowledge graph (KG) reasoning. For the first time, we link the path redundancy
issue in the state-of-the-art KG reasoning models based on path encoding and
message passing to the transformation error in model training, which brings us
new theoretic... | [
{
"created": "Wed, 17 May 2023 06:13:28 GMT",
"version": "v1"
}
] | 2023-05-18 | [
[
"Wang",
"Kai",
""
],
[
"Luo",
"Siqiang",
""
],
[
"Lin",
"Dan",
""
]
] | We study Graph Neural Networks (GNNs)-based embedding techniques for knowledge graph (KG) reasoning. For the first time, we link the path redundancy issue in the state-of-the-art KG reasoning models based on path encoding and message passing to the transformation error in model training, which brings us new theoretical... |
2205.03525 | Yuhan Xie | Yuhan Xie, Kexin Jiang, Zhiyong Zhang, Shaolong Chen, Xiaodong Zhang
and Changzhen Qiu | Automatic segmentation of meniscus based on MAE self-supervision and
point-line weak supervision paradigm | 8 pages,10 figures | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Medical image segmentation based on deep learning is often faced with the
problems of insufficient datasets and long time-consuming labeling. In this
paper, we introduce the self-supervised method MAE(Masked Autoencoders) into
knee joint images to provide a good initial weight for the segmentation model
and improve t... | [
{
"created": "Sat, 7 May 2022 02:57:50 GMT",
"version": "v1"
}
] | 2022-05-10 | [
[
"Xie",
"Yuhan",
""
],
[
"Jiang",
"Kexin",
""
],
[
"Zhang",
"Zhiyong",
""
],
[
"Chen",
"Shaolong",
""
],
[
"Zhang",
"Xiaodong",
""
],
[
"Qiu",
"Changzhen",
""
]
] | Medical image segmentation based on deep learning is often faced with the problems of insufficient datasets and long time-consuming labeling. In this paper, we introduce the self-supervised method MAE(Masked Autoencoders) into knee joint images to provide a good initial weight for the segmentation model and improve the... |
cs/0205067 | Ted Pedersen | Ted Pedersen | Evaluating the Effectiveness of Ensembles of Decision Trees in
Disambiguating Senseval Lexical Samples | Appears in the Proceedings of the ACL-02 Workshop on Word Sense
Disambiguation: Recent Successes and Future Directions, July 11, 2002,
Philadelphia, PA | null | null | null | cs.CL | null | This paper presents an evaluation of an ensemble--based system that
participated in the English and Spanish lexical sample tasks of Senseval-2. The
system combines decision trees of unigrams, bigrams, and co--occurrences into a
single classifier. The analysis is extended to include the Senseval-1 data.
| [
{
"created": "Mon, 27 May 2002 18:42:10 GMT",
"version": "v1"
}
] | 2007-05-23 | [
[
"Pedersen",
"Ted",
""
]
] | This paper presents an evaluation of an ensemble--based system that participated in the English and Spanish lexical sample tasks of Senseval-2. The system combines decision trees of unigrams, bigrams, and co--occurrences into a single classifier. The analysis is extended to include the Senseval-1 data. |
1810.01223 | Max A. Deppert | Max A. Deppert, Klaus Jansen | Near-Linear Approximation Algorithms for Scheduling Problems with Batch
Setup Times | null | null | 10.1145/3323165.3323200 | null | cs.DS cs.CC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We investigate the scheduling of $n$ jobs divided into $c$ classes on $m$
identical parallel machines. For every class there is a setup time which is
required whenever a machine switches from the processing of one class to
another class. The objective is to find a schedule that minimizes the makespan.
We give near-li... | [
{
"created": "Tue, 2 Oct 2018 13:14:46 GMT",
"version": "v1"
},
{
"created": "Wed, 1 May 2019 17:01:08 GMT",
"version": "v2"
}
] | 2019-05-02 | [
[
"Deppert",
"Max A.",
""
],
[
"Jansen",
"Klaus",
""
]
] | We investigate the scheduling of $n$ jobs divided into $c$ classes on $m$ identical parallel machines. For every class there is a setup time which is required whenever a machine switches from the processing of one class to another class. The objective is to find a schedule that minimizes the makespan. We give near-line... |
1906.09384 | Mayank Agarwal | Sohini Upadhyay, Mayank Agarwal, Djallel Bounneffouf, Yasaman Khazaeni | A Bandit Approach to Posterior Dialog Orchestration Under a Budget | 2nd Conversational AI Workshop, NeurIPS 2018 | null | null | null | cs.AI cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Building multi-domain AI agents is a challenging task and an open problem in
the area of AI. Within the domain of dialog, the ability to orchestrate
multiple independently trained dialog agents, or skills, to create a unified
system is of particular significance. In this work, we study the task of online
posterior di... | [
{
"created": "Sat, 22 Jun 2019 04:02:26 GMT",
"version": "v1"
}
] | 2019-06-25 | [
[
"Upadhyay",
"Sohini",
""
],
[
"Agarwal",
"Mayank",
""
],
[
"Bounneffouf",
"Djallel",
""
],
[
"Khazaeni",
"Yasaman",
""
]
] | Building multi-domain AI agents is a challenging task and an open problem in the area of AI. Within the domain of dialog, the ability to orchestrate multiple independently trained dialog agents, or skills, to create a unified system is of particular significance. In this work, we study the task of online posterior dial... |
2303.17328 | Vanessa Wirth | Vanessa Wirth, Vanessa Wirth | Author-Unification: Name-, Institution-, and Career-Sharing Co-authors | SIGBOVIK 2023 | null | null | null | cs.DL | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this work, we investigate the phenomenon of Author-UnificAtion (AUA),
which describes the high structural similarity of two co-authoring engineers
that share the same forename, surname, institution, and academic career without
being related by blood. So far, prior work has only explored similar surnames
and instit... | [
{
"created": "Tue, 28 Mar 2023 11:55:45 GMT",
"version": "v1"
},
{
"created": "Sat, 1 Apr 2023 09:08:34 GMT",
"version": "v2"
}
] | 2023-04-04 | [
[
"Wirth",
"Vanessa",
""
],
[
"Wirth",
"Vanessa",
""
]
] | In this work, we investigate the phenomenon of Author-UnificAtion (AUA), which describes the high structural similarity of two co-authoring engineers that share the same forename, surname, institution, and academic career without being related by blood. So far, prior work has only explored similar surnames and institut... |
2310.14065 | Durgakant Pushp | Durgakant Pushp, Zheng Chen, Chaomin Luo, Jason M. Gregory and Lantao
Liu | POVNav: A Pareto-Optimal Mapless Visual Navigator | null | null | null | null | cs.RO | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Mapless navigation has emerged as a promising approach for enabling
autonomous robots to navigate in environments where pre-existing maps may be
inaccurate, outdated, or unavailable. In this work, we propose an image-based
local representation of the environment immediately around a robot to parse
navigability. We fu... | [
{
"created": "Sat, 21 Oct 2023 16:56:02 GMT",
"version": "v1"
}
] | 2023-10-24 | [
[
"Pushp",
"Durgakant",
""
],
[
"Chen",
"Zheng",
""
],
[
"Luo",
"Chaomin",
""
],
[
"Gregory",
"Jason M.",
""
],
[
"Liu",
"Lantao",
""
]
] | Mapless navigation has emerged as a promising approach for enabling autonomous robots to navigate in environments where pre-existing maps may be inaccurate, outdated, or unavailable. In this work, we propose an image-based local representation of the environment immediately around a robot to parse navigability. We furt... |
1612.05474 | Michael Holzhauser | Michael Holzhauser and Sven O. Krumke | A Generalized Approximation Framework for Fractional Network Flow and
Packing Problems | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We generalize the fractional packing framework of Garg and Koenemann to the
case of linear fractional packing problems over polyhedral cones. More
precisely, we provide approximation algorithms for problems of the form
$\max\{c^T x : Ax \leq b, x \in C \}$, where the matrix $A$ contains no
negative entries and $C$ is... | [
{
"created": "Fri, 16 Dec 2016 14:12:07 GMT",
"version": "v1"
}
] | 2016-12-19 | [
[
"Holzhauser",
"Michael",
""
],
[
"Krumke",
"Sven O.",
""
]
] | We generalize the fractional packing framework of Garg and Koenemann to the case of linear fractional packing problems over polyhedral cones. More precisely, we provide approximation algorithms for problems of the form $\max\{c^T x : Ax \leq b, x \in C \}$, where the matrix $A$ contains no negative entries and $C$ is a... |
1904.03597 | Jiangliu Wang | Jiangliu Wang, Jianbo Jiao, Linchao Bao, Shengfeng He, Yunhui Liu and
Wei Liu | Self-supervised Spatio-temporal Representation Learning for Videos by
Predicting Motion and Appearance Statistics | CVPR 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We address the problem of video representation learning without
human-annotated labels. While previous efforts address the problem by designing
novel self-supervised tasks using video data, the learned features are merely
on a frame-by-frame basis, which are not applicable to many video analytic
tasks where spatio-te... | [
{
"created": "Sun, 7 Apr 2019 07:27:37 GMT",
"version": "v1"
}
] | 2019-04-09 | [
[
"Wang",
"Jiangliu",
""
],
[
"Jiao",
"Jianbo",
""
],
[
"Bao",
"Linchao",
""
],
[
"He",
"Shengfeng",
""
],
[
"Liu",
"Yunhui",
""
],
[
"Liu",
"Wei",
""
]
] | We address the problem of video representation learning without human-annotated labels. While previous efforts address the problem by designing novel self-supervised tasks using video data, the learned features are merely on a frame-by-frame basis, which are not applicable to many video analytic tasks where spatio-temp... |
2403.13918 | Henri Casanova | Jesse McDonald, Maximilian Horzela, Fr\'ed\'eric Suter, Henri Casanova | Automated Calibration of Parallel and Distributed Computing Simulators:
A Case Study | In Proc. of the 25th IEEE International Workshop on Parallel and
Distributed Scientific and Engineering Computing (PDSEC 2024) | null | null | null | cs.DC cs.PF | http://creativecommons.org/licenses/by/4.0/ | Many parallel and distributed computing research results are obtained in
simulation, using simulators that mimic real-world executions on some target
system. Each such simulator is configured by picking values for parameters that
define the behavior of the underlying simulation models it implements. The main
concern ... | [
{
"created": "Wed, 20 Mar 2024 18:39:47 GMT",
"version": "v1"
},
{
"created": "Mon, 1 Jul 2024 20:34:35 GMT",
"version": "v2"
}
] | 2024-07-03 | [
[
"McDonald",
"Jesse",
""
],
[
"Horzela",
"Maximilian",
""
],
[
"Suter",
"Frédéric",
""
],
[
"Casanova",
"Henri",
""
]
] | Many parallel and distributed computing research results are obtained in simulation, using simulators that mimic real-world executions on some target system. Each such simulator is configured by picking values for parameters that define the behavior of the underlying simulation models it implements. The main concern fo... |
2112.05415 | Soheil Behnezhad | Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan | Stochastic Vertex Cover with Few Queries | null | null | null | null | cs.DS | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the minimum vertex cover problem in the following stochastic
setting. Let $G$ be an arbitrary given graph, $p \in (0, 1]$ a parameter of the
problem, and let $G_p$ be a random subgraph that includes each edge of $G$
independently with probability $p$. We are unaware of the realization $G_p$,
but can learn if... | [
{
"created": "Fri, 10 Dec 2021 09:46:12 GMT",
"version": "v1"
}
] | 2021-12-13 | [
[
"Behnezhad",
"Soheil",
""
],
[
"Blum",
"Avrim",
""
],
[
"Derakhshan",
"Mahsa",
""
]
] | We study the minimum vertex cover problem in the following stochastic setting. Let $G$ be an arbitrary given graph, $p \in (0, 1]$ a parameter of the problem, and let $G_p$ be a random subgraph that includes each edge of $G$ independently with probability $p$. We are unaware of the realization $G_p$, but can learn if a... |
1509.02470 | Jianguo Li | Jianwei Luo and Jianguo Li and Jun Wang and Zhiguo Jiang and Yurong
Chen | Deep Attributes from Context-Aware Regional Neural Codes | 10 pages, 8 figures | null | null | null | cs.CV cs.LG cs.NE | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Recently, many researches employ middle-layer output of convolutional neural
network models (CNN) as features for different visual recognition tasks.
Although promising results have been achieved in some empirical studies, such
type of representations still suffer from the well-known issue of semantic gap.
This paper... | [
{
"created": "Tue, 8 Sep 2015 17:53:54 GMT",
"version": "v1"
}
] | 2015-09-09 | [
[
"Luo",
"Jianwei",
""
],
[
"Li",
"Jianguo",
""
],
[
"Wang",
"Jun",
""
],
[
"Jiang",
"Zhiguo",
""
],
[
"Chen",
"Yurong",
""
]
] | Recently, many researches employ middle-layer output of convolutional neural network models (CNN) as features for different visual recognition tasks. Although promising results have been achieved in some empirical studies, such type of representations still suffer from the well-known issue of semantic gap. This paper p... |
0901.3580 | Changho Suh | Changho Suh, David Tse | Feedback Capacity of the Gaussian Interference Channel to Within 1.7075
Bits: the Symmetric Case | submitted to the International Symposium and Information Theory | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We characterize the symmetric capacity to within 1.7075 bits/s/Hz for the
two-user Gaussian interference channel with feedback. The result makes use of a
deterministic model to provide insights into the Gaussian channel. We derive a
new outer bound to show that a proposed achievable scheme can achieve the
symmetric c... | [
{
"created": "Fri, 23 Jan 2009 00:37:49 GMT",
"version": "v1"
}
] | 2009-01-26 | [
[
"Suh",
"Changho",
""
],
[
"Tse",
"David",
""
]
] | We characterize the symmetric capacity to within 1.7075 bits/s/Hz for the two-user Gaussian interference channel with feedback. The result makes use of a deterministic model to provide insights into the Gaussian channel. We derive a new outer bound to show that a proposed achievable scheme can achieve the symmetric cap... |
2209.08740 | Christopher Meiklejohn | Christopher S. Meiklejohn, Rohan Padhye, Heather Miller | Distributed Execution Indexing | null | null | null | null | cs.DC | http://creativecommons.org/licenses/by/4.0/ | This work-in-progress report presents both the design and partial evaluation
of distributed execution indexing, a technique for microservice applications
that precisely identifies dynamic instances of inter-service remote procedure
calls (RPCs). Such an indexing scheme is critical for request-level fault
injection te... | [
{
"created": "Mon, 19 Sep 2022 03:24:46 GMT",
"version": "v1"
}
] | 2022-09-20 | [
[
"Meiklejohn",
"Christopher S.",
""
],
[
"Padhye",
"Rohan",
""
],
[
"Miller",
"Heather",
""
]
] | This work-in-progress report presents both the design and partial evaluation of distributed execution indexing, a technique for microservice applications that precisely identifies dynamic instances of inter-service remote procedure calls (RPCs). Such an indexing scheme is critical for request-level fault injection tech... |
2306.14251 | Kai Gao | Andy Xu, Kai Gao, Si Wei Feng, Jingjin Yu | Optimal and Stable Multi-Layer Object Rearrangement on a Tabletop | Accepted by 2023 IROS - IEEE/RSJ International Conference on
Intelligent Robots | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Object rearrangement is a fundamental sub-task in accomplishing a great many
physical tasks. As such, effectively executing rearrangement is an important
skill for intelligent robots to master. In this study, we conduct the first
algorithmic study on optimally solving the problem of Multi-layer Object
Rearrangement o... | [
{
"created": "Sun, 25 Jun 2023 13:52:01 GMT",
"version": "v1"
},
{
"created": "Fri, 30 Jun 2023 04:18:28 GMT",
"version": "v2"
}
] | 2023-07-03 | [
[
"Xu",
"Andy",
""
],
[
"Gao",
"Kai",
""
],
[
"Feng",
"Si Wei",
""
],
[
"Yu",
"Jingjin",
""
]
] | Object rearrangement is a fundamental sub-task in accomplishing a great many physical tasks. As such, effectively executing rearrangement is an important skill for intelligent robots to master. In this study, we conduct the first algorithmic study on optimally solving the problem of Multi-layer Object Rearrangement on ... |
1502.05886 | Emilio Ferrara | Lei Le, Emilio Ferrara, Alessandro Flammini | On predictability of rare events leveraging social media: a machine
learning perspective | 10 pages, 10 tables, 8 figures | Proceedings of the 2015 ACM on Conference on Online Social
Networks (pp. 3-13). ACM. 2015 | 10.1145/2817946.2817949 | null | cs.SI cs.LG physics.data-an physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Information extracted from social media streams has been leveraged to
forecast the outcome of a large number of real-world events, from political
elections to stock market fluctuations. An increasing amount of studies
demonstrates how the analysis of social media conversations provides cheap
access to the wisdom of t... | [
{
"created": "Fri, 20 Feb 2015 14:42:26 GMT",
"version": "v1"
}
] | 2017-03-07 | [
[
"Le",
"Lei",
""
],
[
"Ferrara",
"Emilio",
""
],
[
"Flammini",
"Alessandro",
""
]
] | Information extracted from social media streams has been leveraged to forecast the outcome of a large number of real-world events, from political elections to stock market fluctuations. An increasing amount of studies demonstrates how the analysis of social media conversations provides cheap access to the wisdom of the... |
1909.12919 | Madhura Ingalhalikar | Sumeet Shinde, Tanay Chougule, Jitender Saini and Madhura Ingalhalikar | HR-CAM: Precise Localization of Pathology Using Multi-level Learning in
CNNs | Medical Image Computing and Computer Assisted Intervention, 2019 | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We propose a CNN based technique that aggregates feature maps from its
multiple layers that can localize abnormalities with greater details as well as
predict pathology under consideration. Existing class activation mapping (CAM)
techniques extract feature maps from either the final layer or a single
intermediate lay... | [
{
"created": "Mon, 23 Sep 2019 13:47:12 GMT",
"version": "v1"
}
] | 2019-10-01 | [
[
"Shinde",
"Sumeet",
""
],
[
"Chougule",
"Tanay",
""
],
[
"Saini",
"Jitender",
""
],
[
"Ingalhalikar",
"Madhura",
""
]
] | We propose a CNN based technique that aggregates feature maps from its multiple layers that can localize abnormalities with greater details as well as predict pathology under consideration. Existing class activation mapping (CAM) techniques extract feature maps from either the final layer or a single intermediate layer... |
1603.09660 | Benjamin Marussig | Benjamin Marussig, J\"urgen Zechner, Gernot Beer and Thomas-Peter
Fries | Stable Isogeometric Analysis of Trimmed Geometries | null | null | 10.1016/j.cma.2016.07.040 | null | cs.NA math.NA | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We explore extended B-splines as a stable basis for isogeometric analysis
with trimmed parameter spaces. The stabilization is accomplished by an
appropriate substitution of B-splines that may lead to ill-conditioned system
matrices. The construction for non-uniform knot vectors is presented. The
properties of extende... | [
{
"created": "Thu, 31 Mar 2016 16:19:05 GMT",
"version": "v1"
},
{
"created": "Fri, 22 Jul 2016 16:43:01 GMT",
"version": "v2"
}
] | 2017-04-05 | [
[
"Marussig",
"Benjamin",
""
],
[
"Zechner",
"Jürgen",
""
],
[
"Beer",
"Gernot",
""
],
[
"Fries",
"Thomas-Peter",
""
]
] | We explore extended B-splines as a stable basis for isogeometric analysis with trimmed parameter spaces. The stabilization is accomplished by an appropriate substitution of B-splines that may lead to ill-conditioned system matrices. The construction for non-uniform knot vectors is presented. The properties of extended ... |
2406.11737 | Clinton Wang | Clinton Wang, Peter Hedman, Polina Golland, Jonathan T. Barron, Daniel
Duckworth | InterNeRF: Scaling Radiance Fields via Parameter Interpolation | Presented at CVPR 2024 Neural Rendering Intelligence Workshop | null | null | null | cs.CV cs.GR | http://creativecommons.org/licenses/by/4.0/ | Neural Radiance Fields (NeRFs) have unmatched fidelity on large, real-world
scenes. A common approach for scaling NeRFs is to partition the scene into
regions, each of which is assigned its own parameters. When implemented
naively, such an approach is limited by poor test-time scaling and inconsistent
appearance and ... | [
{
"created": "Mon, 17 Jun 2024 16:55:22 GMT",
"version": "v1"
}
] | 2024-06-18 | [
[
"Wang",
"Clinton",
""
],
[
"Hedman",
"Peter",
""
],
[
"Golland",
"Polina",
""
],
[
"Barron",
"Jonathan T.",
""
],
[
"Duckworth",
"Daniel",
""
]
] | Neural Radiance Fields (NeRFs) have unmatched fidelity on large, real-world scenes. A common approach for scaling NeRFs is to partition the scene into regions, each of which is assigned its own parameters. When implemented naively, such an approach is limited by poor test-time scaling and inconsistent appearance and ge... |
1706.00339 | Raffaella Carloni | Ludo C. Visser, Stefano Stramigioli, and Raffaella Carloni | Bipedal locomotion using variable stiffness actuation | null | null | null | null | cs.RO | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Robust and energy-efficient bipedal locomotion in robotics is still a
challenging topic. In order to address issues in this field, we can take
inspiration from nature, by studying human locomotion. The Spring-Loaded
Inverted Pendulum (SLIP) model has shown to be a good model for this purpose.
However, the human muscu... | [
{
"created": "Thu, 1 Jun 2017 15:18:07 GMT",
"version": "v1"
}
] | 2017-06-02 | [
[
"Visser",
"Ludo C.",
""
],
[
"Stramigioli",
"Stefano",
""
],
[
"Carloni",
"Raffaella",
""
]
] | Robust and energy-efficient bipedal locomotion in robotics is still a challenging topic. In order to address issues in this field, we can take inspiration from nature, by studying human locomotion. The Spring-Loaded Inverted Pendulum (SLIP) model has shown to be a good model for this purpose. However, the human musculo... |
1807.07711 | Minseok Choi Dr. | Minseok Choi, Daejung Yoon, and Joongheon Kim | Blind Signal Classification for Non-Orthogonal Multiple Access in
Vehicular Networks | 13 pages, 15 figures | null | null | null | cs.IT math.IT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | For downlink multiple-user (MU) transmission based on non-orthogonal multiple
access (NOMA), the advanced receiver strategy is required to cancel the
inter-user interference, e.g., successive interference cancellation (SIC). The
SIC process can be applicable only when information about the co-scheduled
signal is know... | [
{
"created": "Fri, 20 Jul 2018 06:25:47 GMT",
"version": "v1"
},
{
"created": "Sat, 2 Mar 2019 03:29:37 GMT",
"version": "v2"
},
{
"created": "Fri, 24 Jan 2020 22:37:55 GMT",
"version": "v3"
}
] | 2020-01-28 | [
[
"Choi",
"Minseok",
""
],
[
"Yoon",
"Daejung",
""
],
[
"Kim",
"Joongheon",
""
]
] | For downlink multiple-user (MU) transmission based on non-orthogonal multiple access (NOMA), the advanced receiver strategy is required to cancel the inter-user interference, e.g., successive interference cancellation (SIC). The SIC process can be applicable only when information about the co-scheduled signal is known ... |
2006.16180 | Wenye Li | Wenye Li, Shuzhong Zhang | Binary Random Projections with Controllable Sparsity Patterns | 19 pages, 15 figures | null | null | null | cs.LG cs.IR stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Random projection is often used to project higher-dimensional vectors onto a
lower-dimensional space, while approximately preserving their pairwise
distances. It has emerged as a powerful tool in various data processing tasks
and has attracted considerable research interest. Partly motivated by the
recent discoveries... | [
{
"created": "Mon, 29 Jun 2020 16:45:26 GMT",
"version": "v1"
}
] | 2020-06-30 | [
[
"Li",
"Wenye",
""
],
[
"Zhang",
"Shuzhong",
""
]
] | Random projection is often used to project higher-dimensional vectors onto a lower-dimensional space, while approximately preserving their pairwise distances. It has emerged as a powerful tool in various data processing tasks and has attracted considerable research interest. Partly motivated by the recent discoveries i... |
2402.13153 | Simon D. Fink | Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper | Clustered Planarity Variants for Level Graphs | null | null | null | null | cs.CG cs.DS | http://creativecommons.org/licenses/by/4.0/ | We consider variants of the clustered planarity problem for level-planar
drawings. So far, only convex clusters have been studied in this setting. We
introduce two new variants that both insist on a level-planar drawing of the
input graph but relax the requirements on the shape of the clusters. In
unrestricted Cluste... | [
{
"created": "Tue, 20 Feb 2024 17:10:42 GMT",
"version": "v1"
}
] | 2024-02-21 | [
[
"Fink",
"Simon D.",
""
],
[
"Pfretzschner",
"Matthias",
""
],
[
"Rutter",
"Ignaz",
""
],
[
"Sieper",
"Marie Diana",
""
]
] | We consider variants of the clustered planarity problem for level-planar drawings. So far, only convex clusters have been studied in this setting. We introduce two new variants that both insist on a level-planar drawing of the input graph but relax the requirements on the shape of the clusters. In unrestricted Clustere... |
1901.07497 | Jiaxiao Zheng | Jiaxiao Zheng, Gustavo de Veciana | Elastic Multi-resource Network Slicing: Can Protection Lead to Improved
Performance? | null | null | null | null | cs.NI cs.DC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In order to meet the performance/privacy requirements of future
data-intensive mobile applications, e.g., self-driving cars, mobile data
analytics, and AR/VR, service providers are expected to draw on shared
storage/computation/connectivity resources at the network "edge". To be
cost-effective, a key functional requi... | [
{
"created": "Tue, 22 Jan 2019 18:16:25 GMT",
"version": "v1"
}
] | 2019-01-23 | [
[
"Zheng",
"Jiaxiao",
""
],
[
"de Veciana",
"Gustavo",
""
]
] | In order to meet the performance/privacy requirements of future data-intensive mobile applications, e.g., self-driving cars, mobile data analytics, and AR/VR, service providers are expected to draw on shared storage/computation/connectivity resources at the network "edge". To be cost-effective, a key functional require... |
2406.01581 | Denny Wu | Jason D. Lee and Kazusato Oko and Taiji Suzuki and Denny Wu | Neural network learns low-dimensional polynomials with SGD near the
information-theoretic limit | 34 pages | null | null | null | cs.LG stat.ML | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We study the problem of gradient descent learning of a single-index target
function $f_*(\boldsymbol{x}) =
\textstyle\sigma_*\left(\langle\boldsymbol{x},\boldsymbol{\theta}\rangle\right)$
under isotropic Gaussian data in $\mathbb{R}^d$, where the link function
$\sigma_*:\mathbb{R}\to\mathbb{R}$ is an unknown degree $... | [
{
"created": "Mon, 3 Jun 2024 17:56:58 GMT",
"version": "v1"
}
] | 2024-06-04 | [
[
"Lee",
"Jason D.",
""
],
[
"Oko",
"Kazusato",
""
],
[
"Suzuki",
"Taiji",
""
],
[
"Wu",
"Denny",
""
]
] | We study the problem of gradient descent learning of a single-index target function $f_*(\boldsymbol{x}) = \textstyle\sigma_*\left(\langle\boldsymbol{x},\boldsymbol{\theta}\rangle\right)$ under isotropic Gaussian data in $\mathbb{R}^d$, where the link function $\sigma_*:\mathbb{R}\to\mathbb{R}$ is an unknown degree $q$... |
2205.10138 | J\'an Koloda | J\'an Koloda, J\"urgen Seiler and Andr\'e Kaup | Reliability-based Mesh-to-Grid Image Reconstruction | null | 2016 IEEE 18th International Workshop on Multimedia Signal
Processing (MMSP), 2016, pp. 1-5 | 10.1109/MMSP.2016.7813344 | null | cs.CV eess.IV | http://creativecommons.org/licenses/by/4.0/ | This paper presents a novel method for the reconstruction of images from
samples located at non-integer positions, called mesh. This is a common
scenario for many image processing applications, such as super-resolution,
warping or virtual view generation in multi-camera systems. The proposed method
relies on a set of... | [
{
"created": "Fri, 20 May 2022 12:32:52 GMT",
"version": "v1"
}
] | 2022-05-23 | [
[
"Koloda",
"Ján",
""
],
[
"Seiler",
"Jürgen",
""
],
[
"Kaup",
"André",
""
]
] | This paper presents a novel method for the reconstruction of images from samples located at non-integer positions, called mesh. This is a common scenario for many image processing applications, such as super-resolution, warping or virtual view generation in multi-camera systems. The proposed method relies on a set of i... |
1802.08275 | Hang Su | Hang Su, Varun Jampani, Deqing Sun, Subhransu Maji, Evangelos
Kalogerakis, Ming-Hsuan Yang, and Jan Kautz | SPLATNet: Sparse Lattice Networks for Point Cloud Processing | Camera-ready, accepted to CVPR 2018 (oral); project website:
http://vis-www.cs.umass.edu/splatnet/ | null | null | null | cs.CV cs.GR | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We present a network architecture for processing point clouds that directly
operates on a collection of points represented as a sparse set of samples in a
high-dimensional lattice. Naively applying convolutions on this lattice scales
poorly, both in terms of memory and computational cost, as the size of the
lattice i... | [
{
"created": "Thu, 22 Feb 2018 19:30:09 GMT",
"version": "v1"
},
{
"created": "Mon, 26 Feb 2018 22:16:31 GMT",
"version": "v2"
},
{
"created": "Thu, 29 Mar 2018 18:36:16 GMT",
"version": "v3"
},
{
"created": "Wed, 9 May 2018 14:22:41 GMT",
"version": "v4"
}
] | 2018-05-10 | [
[
"Su",
"Hang",
""
],
[
"Jampani",
"Varun",
""
],
[
"Sun",
"Deqing",
""
],
[
"Maji",
"Subhransu",
""
],
[
"Kalogerakis",
"Evangelos",
""
],
[
"Yang",
"Ming-Hsuan",
""
],
[
"Kautz",
"Jan",
""
]
] | We present a network architecture for processing point clouds that directly operates on a collection of points represented as a sparse set of samples in a high-dimensional lattice. Naively applying convolutions on this lattice scales poorly, both in terms of memory and computational cost, as the size of the lattice inc... |
1902.10224 | Richa Tripathi | Richa Tripathi, Amit Reza and Dinesh Garg | Prediction of the disease controllability in a complex network using
machine learning algorithms | null | null | null | null | cs.SI physics.soc-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | The application of machine learning (ML) techniques span a vast spectrum
ranging from speech, face and character recognition, medical diagnosis, anomaly
detection in data to the general classification, prediction, and regression
problems. In the present work, we solve the problem of predicting R_0 for
disease spreadi... | [
{
"created": "Tue, 26 Feb 2019 21:12:50 GMT",
"version": "v1"
},
{
"created": "Fri, 1 May 2020 19:58:31 GMT",
"version": "v2"
}
] | 2020-05-05 | [
[
"Tripathi",
"Richa",
""
],
[
"Reza",
"Amit",
""
],
[
"Garg",
"Dinesh",
""
]
] | The application of machine learning (ML) techniques span a vast spectrum ranging from speech, face and character recognition, medical diagnosis, anomaly detection in data to the general classification, prediction, and regression problems. In the present work, we solve the problem of predicting R_0 for disease spreading... |
2010.12305 | Lukas Lange | Lukas Lange, Heike Adel, Jannik Str\"otgen, Dietrich Klakow | FAME: Feature-Based Adversarial Meta-Embeddings for Robust Input
Representations | Accepted at EMNLP 2021 | null | null | null | cs.CL cs.LG | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Combining several embeddings typically improves performance in downstream
tasks as different embeddings encode different information. It has been shown
that even models using embeddings from transformers still benefit from the
inclusion of standard word embeddings. However, the combination of embeddings
of different ... | [
{
"created": "Fri, 23 Oct 2020 11:16:53 GMT",
"version": "v1"
},
{
"created": "Fri, 29 Oct 2021 14:05:41 GMT",
"version": "v2"
}
] | 2021-11-01 | [
[
"Lange",
"Lukas",
""
],
[
"Adel",
"Heike",
""
],
[
"Strötgen",
"Jannik",
""
],
[
"Klakow",
"Dietrich",
""
]
] | Combining several embeddings typically improves performance in downstream tasks as different embeddings encode different information. It has been shown that even models using embeddings from transformers still benefit from the inclusion of standard word embeddings. However, the combination of embeddings of different ty... |
2101.12169 | Navneet Garg | Navneet Garg, Junkai Zhang, Tharmalingam Ratnarajah | Rate-Energy Balanced Precoding Design for SWIPT based Two-Way Relay
Systems | arXiv admin note: text overlap with arXiv:2101.12161 | null | null | null | cs.IT math.IT | http://creativecommons.org/licenses/by/4.0/ | Simultaneous wireless information and power transfer (SWIPT) technique is a
popular strategy to convey both information and RF energy for harvesting at
receivers. In this regard, we consider a two-way relay system with multiple
users and a multi-antenna relay employing SWIPT strategy, where splitting the
received sig... | [
{
"created": "Thu, 28 Jan 2021 18:23:47 GMT",
"version": "v1"
},
{
"created": "Sun, 6 Jun 2021 02:27:47 GMT",
"version": "v2"
}
] | 2021-06-08 | [
[
"Garg",
"Navneet",
""
],
[
"Zhang",
"Junkai",
""
],
[
"Ratnarajah",
"Tharmalingam",
""
]
] | Simultaneous wireless information and power transfer (SWIPT) technique is a popular strategy to convey both information and RF energy for harvesting at receivers. In this regard, we consider a two-way relay system with multiple users and a multi-antenna relay employing SWIPT strategy, where splitting the received signa... |
1301.3457 | Marcelo Cicconet | Marcelo Cicconet, Italo Lima, Davi Geiger, Kris Gunsalus | A Geometric Descriptor for Cell-Division Detection | This paper has been withdrawn by the author since the review process
for the conference to which it was applied ended | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | We describe a method for cell-division detection based on a geometric-driven
descriptor that can be represented as a 5-layers processing network, based
mainly on wavelet filtering and a test for mirror symmetry between pairs of
pixels. After the centroids of the descriptors are computed for a sequence of
frames, the ... | [
{
"created": "Tue, 15 Jan 2013 19:18:52 GMT",
"version": "v1"
},
{
"created": "Wed, 10 Apr 2013 18:32:07 GMT",
"version": "v2"
}
] | 2013-04-11 | [
[
"Cicconet",
"Marcelo",
""
],
[
"Lima",
"Italo",
""
],
[
"Geiger",
"Davi",
""
],
[
"Gunsalus",
"Kris",
""
]
] | We describe a method for cell-division detection based on a geometric-driven descriptor that can be represented as a 5-layers processing network, based mainly on wavelet filtering and a test for mirror symmetry between pairs of pixels. After the centroids of the descriptors are computed for a sequence of frames, the tw... |
2405.01857 | Seonyeong Heo | Byungchul Chae and Jiae Kim and Seonyeong Heo | TinySeg: Model Optimizing Framework for Image Segmentation on Tiny
Embedded Systems | LCTES 2024 | null | 10.1145/3652032.3657576 | null | cs.NE cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Image segmentation is one of the major computer vision tasks, which is
applicable in a variety of domains, such as autonomous navigation of an
unmanned aerial vehicle. However, image segmentation cannot easily materialize
on tiny embedded systems because image segmentation models generally have high
peak memory usage... | [
{
"created": "Fri, 3 May 2024 05:18:35 GMT",
"version": "v1"
}
] | 2024-05-06 | [
[
"Chae",
"Byungchul",
""
],
[
"Kim",
"Jiae",
""
],
[
"Heo",
"Seonyeong",
""
]
] | Image segmentation is one of the major computer vision tasks, which is applicable in a variety of domains, such as autonomous navigation of an unmanned aerial vehicle. However, image segmentation cannot easily materialize on tiny embedded systems because image segmentation models generally have high peak memory usage d... |
2209.09022 | Sean Wilkinson | Sean R. Wilkinson, Greg Eisenhauer, Anuj J. Kapadia, Kathryn Knight,
Jeremy Logan, Patrick Widener, and Matthew Wolf | F*** workflows: when parts of FAIR are missing | 6 pages, 0 figures, accepted to ERROR 2022 workshop (see
https://error-workshop.org/ for more information), to be published in
proceedings of IEEE eScience 2022 | null | 10.1109/eScience55777.2022.00090 | null | cs.DL cs.SE | http://creativecommons.org/licenses/by/4.0/ | The FAIR principles for scientific data (Findable, Accessible, Interoperable,
Reusable) are also relevant to other digital objects such as research software
and scientific workflows that operate on scientific data. The FAIR principles
can be applied to the data being handled by a scientific workflow as well as
the pr... | [
{
"created": "Mon, 19 Sep 2022 13:58:51 GMT",
"version": "v1"
}
] | 2022-12-16 | [
[
"Wilkinson",
"Sean R.",
""
],
[
"Eisenhauer",
"Greg",
""
],
[
"Kapadia",
"Anuj J.",
""
],
[
"Knight",
"Kathryn",
""
],
[
"Logan",
"Jeremy",
""
],
[
"Widener",
"Patrick",
""
],
[
"Wolf",
"Matthew",
""
]
] | The FAIR principles for scientific data (Findable, Accessible, Interoperable, Reusable) are also relevant to other digital objects such as research software and scientific workflows that operate on scientific data. The FAIR principles can be applied to the data being handled by a scientific workflow as well as the proc... |
2212.03340 | Geoffrey Ramseyer | Mohak Goyal and Geoffrey Ramseyer and Ashish Goel and David Mazi\`eres | Finding the Right Curve: Optimal Design of Constant Function Market
Makers | 31 pages | null | null | null | cs.GT | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Constant Function Market Makers (CFMMs) are a tool for creating exchange
markets, have been deployed effectively in prediction markets, and are now
especially prominent in the Decentralized Finance ecosystem. We show that for
any set of beliefs about future asset prices, an optimal CFMM trading function
exists that m... | [
{
"created": "Tue, 6 Dec 2022 21:43:06 GMT",
"version": "v1"
},
{
"created": "Thu, 2 Mar 2023 23:17:02 GMT",
"version": "v2"
}
] | 2023-03-06 | [
[
"Goyal",
"Mohak",
""
],
[
"Ramseyer",
"Geoffrey",
""
],
[
"Goel",
"Ashish",
""
],
[
"Mazières",
"David",
""
]
] | Constant Function Market Makers (CFMMs) are a tool for creating exchange markets, have been deployed effectively in prediction markets, and are now especially prominent in the Decentralized Finance ecosystem. We show that for any set of beliefs about future asset prices, an optimal CFMM trading function exists that max... |
2210.09428 | Thomas Effland | Thomas Effland and Michael Collins | Improving Low-Resource Cross-lingual Parsing with Expected Statistic
Regularization | Accepted in TACL 2022, pre-MIT Press publication version | null | null | null | cs.CL | http://creativecommons.org/licenses/by/4.0/ | We present Expected Statistic Regularization (ESR), a novel regularization
technique that utilizes low-order multi-task structural statistics to shape
model distributions for semi-supervised learning on low-resource datasets. We
study ESR in the context of cross-lingual transfer for syntactic analysis (POS
tagging an... | [
{
"created": "Mon, 17 Oct 2022 20:44:57 GMT",
"version": "v1"
}
] | 2022-10-19 | [
[
"Effland",
"Thomas",
""
],
[
"Collins",
"Michael",
""
]
] | We present Expected Statistic Regularization (ESR), a novel regularization technique that utilizes low-order multi-task structural statistics to shape model distributions for semi-supervised learning on low-resource datasets. We study ESR in the context of cross-lingual transfer for syntactic analysis (POS tagging and ... |
1301.6176 | Thijs Laarhoven | Thijs Laarhoven and Michele Mosca and Joop van de Pol | Solving the Shortest Vector Problem in Lattices Faster Using Quantum
Search | 19 pages | 5th International Workshop on Post-Quantum Cryptography
(PQCrypto), pp. 83-101, 2013 | 10.1007/978-3-642-38616-9_6 | null | cs.CR quant-ph | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | By applying Grover's quantum search algorithm to the lattice algorithms of
Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and
Stehl\'{e}, we obtain improved asymptotic quantum results for solving the
shortest vector problem. With quantum computers we can provably find a shortest
vector in time $2... | [
{
"created": "Fri, 25 Jan 2013 21:15:55 GMT",
"version": "v1"
}
] | 2013-06-12 | [
[
"Laarhoven",
"Thijs",
""
],
[
"Mosca",
"Michele",
""
],
[
"van de Pol",
"Joop",
""
]
] | By applying Grover's quantum search algorithm to the lattice algorithms of Micciancio and Voulgaris, Nguyen and Vidick, Wang et al., and Pujol and Stehl\'{e}, we obtain improved asymptotic quantum results for solving the shortest vector problem. With quantum computers we can provably find a shortest vector in time $2^{... |
2009.00146 | Ioannis Kordonis | Ioannis Kordonis, Athanasios-Rafail Lagos, George P. Papavassilopoulos | Nash Social Distancing Games with Equity Constraints: How Inequality
Aversion Affects the Spread of Epidemics | null | null | null | null | cs.GT cs.SY eess.SY math.OC | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | In this paper, we present a game-theoretic model describing voluntary social
distancing during the spread of an epidemic. The payoffs of the agents depend
on the social distancing they practice and on the probability of getting
infected. We consider two types of agents, the non-vulnerable agents who have a
small cost... | [
{
"created": "Mon, 31 Aug 2020 23:28:52 GMT",
"version": "v1"
},
{
"created": "Sat, 3 Apr 2021 17:42:18 GMT",
"version": "v2"
}
] | 2021-04-06 | [
[
"Kordonis",
"Ioannis",
""
],
[
"Lagos",
"Athanasios-Rafail",
""
],
[
"Papavassilopoulos",
"George P.",
""
]
] | In this paper, we present a game-theoretic model describing voluntary social distancing during the spread of an epidemic. The payoffs of the agents depend on the social distancing they practice and on the probability of getting infected. We consider two types of agents, the non-vulnerable agents who have a small cost i... |
2101.10897 | Yunxiang Zhao | Yunxiang Zhao, Qiuhong Ke, Flip Korn, Jianzhong Qi, Rui Zhang | HexCNN: A Framework for Native Hexagonal Convolutional Neural Networks | null | null | null | null | cs.CV | http://creativecommons.org/licenses/by-nc-sa/4.0/ | Hexagonal CNN models have shown superior performance in applications such as
IACT data analysis and aerial scene classification due to their better rotation
symmetry and reduced anisotropy. In order to realize hexagonal processing,
existing studies mainly use the ZeroOut method to imitate hexagonal processing,
which ... | [
{
"created": "Mon, 25 Jan 2021 08:23:39 GMT",
"version": "v1"
}
] | 2021-01-27 | [
[
"Zhao",
"Yunxiang",
""
],
[
"Ke",
"Qiuhong",
""
],
[
"Korn",
"Flip",
""
],
[
"Qi",
"Jianzhong",
""
],
[
"Zhang",
"Rui",
""
]
] | Hexagonal CNN models have shown superior performance in applications such as IACT data analysis and aerial scene classification due to their better rotation symmetry and reduced anisotropy. In order to realize hexagonal processing, existing studies mainly use the ZeroOut method to imitate hexagonal processing, which ca... |
2109.01386 | Rodothea Myrsini Tsoupidi | Rodothea Myrsini Tsoupidi and Musard Balliu and Benoit Baudry | Vivienne: Relational Verification of Cryptographic Implementations in
WebAssembly | null | null | null | null | cs.CR cs.PL cs.SC | http://creativecommons.org/licenses/by-nc-sa/4.0/ | This paper explores the use of relational symbolic execution to counter
timing side channels in WebAssembly programs. We design and implement Vivienne,
an open-source tool to automatically analyze WebAssembly cryptographic
libraries for constant-time violations. Our approach features various
optimizations that levera... | [
{
"created": "Fri, 3 Sep 2021 09:11:08 GMT",
"version": "v1"
}
] | 2021-09-06 | [
[
"Tsoupidi",
"Rodothea Myrsini",
""
],
[
"Balliu",
"Musard",
""
],
[
"Baudry",
"Benoit",
""
]
] | This paper explores the use of relational symbolic execution to counter timing side channels in WebAssembly programs. We design and implement Vivienne, an open-source tool to automatically analyze WebAssembly cryptographic libraries for constant-time violations. Our approach features various optimizations that leverage... |
2101.01043 | Estefania Recayte | Estefan\'ia Recayte and Andrea Munari | Caching at the Edge: Outage Probability | null | null | null | null | cs.NI | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Caching at the edge of wireless networks is a keytechnology to reduce traffic
in the backhaul link. However, aconcentrated amount of requests during
peak-periods may causethe outage of the system, meaning that the network is not
ableto serve the whole set of demands. The outage probability is afundamental
metric to t... | [
{
"created": "Mon, 4 Jan 2021 16:07:53 GMT",
"version": "v1"
}
] | 2021-01-05 | [
[
"Recayte",
"Estefanía",
""
],
[
"Munari",
"Andrea",
""
]
] | Caching at the edge of wireless networks is a keytechnology to reduce traffic in the backhaul link. However, aconcentrated amount of requests during peak-periods may causethe outage of the system, meaning that the network is not ableto serve the whole set of demands. The outage probability is afundamental metric to tak... |
2105.05130 | Li Wang | Li Wang | Towards a Model for LSH | arXiv admin note: text overlap with arXiv:2103.01888 | null | null | null | cs.DB cs.DS cs.LG | http://creativecommons.org/publicdomain/zero/1.0/ | As data volumes continue to grow, clustering and outlier detection algorithms
are becoming increasingly time-consuming. Classical index structures for
neighbor search are no longer sustainable due to the "curse of dimensionality".
Instead, approximated index structures offer a good opportunity to
significantly accele... | [
{
"created": "Tue, 11 May 2021 15:39:55 GMT",
"version": "v1"
}
] | 2021-05-12 | [
[
"Wang",
"Li",
""
]
] | As data volumes continue to grow, clustering and outlier detection algorithms are becoming increasingly time-consuming. Classical index structures for neighbor search are no longer sustainable due to the "curse of dimensionality". Instead, approximated index structures offer a good opportunity to significantly accelera... |
2403.10884 | Nibaran Das | Soumyajyoti Dey, Sukanta Chakraborty, Utso Guha Roy, Nibaran Das | Fuzzy Rank-based Late Fusion Technique for Cytology image Segmentation | Accept at International Conference on Data, Electronics and Computing
(ICDEC-2023) | null | null | null | cs.CV | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ | Cytology image segmentation is quite challenging due to its complex cellular
structure and multiple overlapping regions. On the other hand, for supervised
machine learning techniques, we need a large amount of annotated data, which is
costly. In recent years, late fusion techniques have given some promising
performan... | [
{
"created": "Sat, 16 Mar 2024 10:33:02 GMT",
"version": "v1"
}
] | 2024-03-19 | [
[
"Dey",
"Soumyajyoti",
""
],
[
"Chakraborty",
"Sukanta",
""
],
[
"Roy",
"Utso Guha",
""
],
[
"Das",
"Nibaran",
""
]
] | Cytology image segmentation is quite challenging due to its complex cellular structure and multiple overlapping regions. On the other hand, for supervised machine learning techniques, we need a large amount of annotated data, which is costly. In recent years, late fusion techniques have given some promising performance... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.