To apply a solution of the optimal control problem directly to the control object for which model this problem was solved, it is necessary to build a system of motion stabilization along the obtained optimal trajector...
详细信息
Generating natural language descriptions from structured tabular data is a crucial challenge with high-impact applications across diverse domains, including business intelligence, scientific communication, and data an...
详细信息
ISBN:
(纸本)9783031683084;9783031683091
Generating natural language descriptions from structured tabular data is a crucial challenge with high-impact applications across diverse domains, including business intelligence, scientific communication, and data analytics. Traditional rule-based and machine learning approaches have faced limitations in reusability, vocabulary coverage, and handling complex table layouts. Recent advances in LLMs pre-trained on vast corpora offer an opportunity to overcome these limitations by leveraging their strong language understanding and generation capabilities in a flexible learning setup. In this paper, We conduct a comprehensive evaluation of two LLMs - GPT-3.5 and LLaMa2-7B - on table-to-text generation across three diverse public datasets: WebNLG, NumericNLG, and ToTTo. Our experiments investigate both zero-shot prompting techniques and finetuning using the parameter-efficient LoRA method. Results demonstrate GPT-3.5's impressive capabilities, outperforming LLaMa2 in zero-shot settings. However, finetuning LLaMa2 on a subset of data significantly bridges this performance gap and produces generations much closer to ground truth and comparable to SOTA approaches. Our findings highlight LLMs' promising potential for data-to-text while identifying key areas for future research.
Genetic programming is a method to generate computerprograms automatically for a given set of input/output examples that define the user's intent. In real-world software development this method could also be used...
详细信息
ISBN:
(数字)9783031020568
ISBN:
(纸本)9783031020568;9783031020551
Genetic programming is a method to generate computerprograms automatically for a given set of input/output examples that define the user's intent. In real-world software development this method could also be used, as a programmer could first define the input/output examples for a certain problem and then let genetic programming generate the functional source code. However, a prerequisite for using genetic programming as support system in real-world software development is a highperformance and generalizability of the generated programs. For some program synthesis benchmark problems, however, the generalizability to previously unseen test cases is low especially when lexicase is used as parent selection method. Therefore, we combine in this paper lexicase selection with small batches of training cases and study the influence of different batch sizes on the program synthesis performance and the generalizability of programs generated with genetic programming For evaluation, we use three common program synthesis benchmark problems. We find that the selection pressure can be reduced even when small batch sizes are used. Moreover, we find that, compared to standard lexicase selection, the obtained success rates on the test set are similar or even better when combining lexicase with small batches. Furthermore, also the generalizability of the found solutions can often be improved.
Integral imaging based light field display reproduces vivid 3D images by reconstructing the light ray distributions of 3D scenes and is considered as one of the most promising true 3D display techniques due to its adv...
详细信息
ISBN:
(纸本)9781510685246;9781510685253
Integral imaging based light field display reproduces vivid 3D images by reconstructing the light ray distributions of 3D scenes and is considered as one of the most promising true 3D display techniques due to its advantages of compact form factor and viewing comfort. However, integral imaging still faces challenges such as complex light field data acquisition and generation, and unsatisfactory display effects. We proposed a high-performance integral imaging 3D display method that included optimal voxel space selection, design of anisotropic backlighting, and error correction. In the display space, the distribution characteristics of voxel space in integral imaging were revealed, and a display scheme based on optimal voxel space was proposed. In terms of hardware structure, a display system with sub-pixel anisotropic backlighting was designed to address voxel aliasing and separation issues. For error correction, a sub-pixel marking technology was proposed to measure the axial position error of lenses with high precision, and a depth-based sub-pixel correction technology was employed to eliminate voxel drift. The proposed method eliminated the problems of voxel separation and aliasing, fully considered the performance of display devices, corrected the axial position errors of lenses, and effectively enhanced the quality of 3D images. These proposed methods make the integral imaging display device have high display performance, and has broad application prospects in many fields such as human-computer interaction, commercial displays, and medical applications.
The Relational Hyper-Graph Neural Network (R-HyGNN) was introduced in [1] to learn domain-specific knowledge from program verification problems encoded in Constrained Horn Clauses (CHCs). It exhibits high accuracy in ...
详细信息
ISBN:
(纸本)9783031505232;9783031505249
The Relational Hyper-Graph Neural Network (R-HyGNN) was introduced in [1] to learn domain-specific knowledge from program verification problems encoded in Constrained Horn Clauses (CHCs). It exhibits high accuracy in predicting the occurrence of CHCs in counterexamples. In this research, we present an R-HyGNN-based framework called MUSHyperNet. The goal is to predict the Minimal Unsatisfiable Subsets (MUSes) (i.e., unsat core) of a set of CHCs to guide an abstract symbolic model checking algorithm. In MUSHyperNet, we can predict the MUSes once and use them in different instances of the abstract symbolic model checking algorithm. We demonstrate the efficacy of MUSHyperNet using two instances of the abstract symbolic modelchecking algorithm: Counter-Example Guided Abstraction Refinement (CEGAR) and symbolic model-checking-based (SymEx) algorithms. Our framework enhances performance on a uniform selection of benchmarks across all categories from CHC-COMP, solving more problems (6.1% increase for SymEx, 4.1% for CEGAR) and reducing average solving time (13.3% for SymEx, 7.1% for CEGAR).
Quantifying the discrepancy between point sets is a critical component for point cloud learning tasks. The mainstream point cloud learning tasks utilize Chamfer distance and Earth-Mover's distance. Chamfer distanc...
详细信息
ISBN:
(纸本)9798350362466;9798350362459
Quantifying the discrepancy between point sets is a critical component for point cloud learning tasks. The mainstream point cloud learning tasks utilize Chamfer distance and Earth-Mover's distance. Chamfer distance is computationally efficient but may not fully capture differences between sets of points. Earth-Mover's distance, while precise, is computationally expensive and can be impractical to use with high-definition data. Several variants of SlicedWasserstein distances (SW) are introduced to reduce the computation cost, but bring new problems to the situation: The vanilla SW treats sampled slices equally, resulting in redundant projections;Distributional SlicedWasserstein distance requires gradient-based optimization, offsetting its benefits. To overcome this limitation and leverage the advantages of Sliced Wasserstein distance over EMD, we propose a novel metric, Select-Sliced Wasserstein distance. This new distance analyzes drawn samples of slices and quantifies their informativeness for each point in a single shot, which eliminates unnecessary projections as well as costly optimizations, but perpetuates the performance. Extensive experiments on various point cloud learning tasks to demonstrate the efficiency and effectiveness of the proposed distance metric. Our code is available at https://***/VideoProcessingLab/SSW_Distance
The call stack is a trace of function calls when a program is running. By analyzing the call stack, we can learn the execution path of the program, the relationship between functions and the number of function calls, ...
详细信息
This paper introduces novel attack primitives that enable adversaries to leak (read) and manipulate (write) the path history register (PHR) and the prediction history tables (PHTs) of the conditional branch predictor ...
详细信息
Identifying disease-associated genes (DAGs) is important for the research of complex diseases, and network-based methods have been a powerful and elegant strategy for this topic. Genes and their products perform biolo...
详细信息
Traditional multiple input multiple output (MIMO) detection algorithms encounter challenges with computational complexity and performance limitations when dealing with high-dimensional inputs and complex channel condi...
详细信息
暂无评论