Adolfo Escobedo

Adolfo Escobedo
Arizona State University | ASU · School of Computing and Augmented Intelligence

Doctor of Philosophy

About

27
Publications
1,146
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
141
Citations

Publications

Publications (27)
Article
Full-text available
This work investigates how different forms of input elicitation obtained from crowdsourcing can be utilized to improve the quality of inferred labels for image classification tasks, where an image must be labeled as either positive or negative depending on the presence/absence of a specified object. Five types of input elicitation methods are teste...
Conference Paper
Full-text available
Top-k lists are being increasingly utilized in various fields and applications including information retrieval, machine learning, and recommendation systems. Since multiple top-k lists may be generated by different algorithms to evaluate the same set of entities or system of interest, there is often a need to consolidate this collection of heteroge...
Article
Full-text available
This paper seeks to solve the long-term transmission expansion planning problem in power systems more effectively by reducing the solution search space and the computational effort. The proposed methodology finds and adds cutting planes based on structural insights about bus angle differences along paths. Two lemmas and a theorem are proposed which...
Preprint
LU and Cholesky matrix factorization algorithms are core subroutines used to solve systems of linear equations (SLEs) encountered while solving an optimization problem. Standard factorization algorithms are highly efficient but remain susceptible to the accumulation roundoff errors, which can lead solvers to return feasibility and optimality certif...
Article
Full-text available
This work introduces a multimodal data aggregation methodology featuring optimization models and algorithms for jointly aggregating heterogeneous ordinal and cardinal evaluation inputs into a consensus evaluation. Specifically, this work derives mathematical modeling components to enforce three types of logical couplings between the collective ordi...
Conference Paper
Full-text available
Rank aggregation has many applications in computer science, operations research, and group decision-making. This paper introduces lower bounds on the Kemeny aggregation problem when the input rankings are non-strict (with and without ties). It generalizes some of the existing lower bounds for strict rankings to the case of non-strict rankings, and...
Conference Paper
Full-text available
This study investigates how different forms of input elicitation obtained from crowdsourcing can be utilized to improve the quality of inferred labels for image classification tasks, where an image must be labeled as either positive or negative depending on the presence/absence of a specified object. Three types of input elicitation methods are tes...
Article
The fields of power system engineering and operations research are growing rapidly and becoming increasingly entwined. This survey aims to strengthen the connections between the two communities by introducing specific power systems problems and the theoretical operations research approaches implemented to address them in recent years. It discusses...
Article
Rank aggregation is widely used in group decision making and many other applications, where it is of interest to consolidate heterogeneous ordered lists. Oftentimes, these rankings may involve a large number of alternatives, contain ties, and/or be incomplete, all of which complicate the use of robust aggregation methods. In particular, these chara...
Preprint
Full-text available
The stable and efficient operation of the transmission network is fundamental to the power system's ability to deliver electricity reliably and cheaply. As average temperatures continue to rise, the ability of the transmission network to meet demand is diminished. Higher temperatures lead to congestion by reducing thermal limits of lines while simu...
Article
Full-text available
One of the main desired capabilities of the smart grid is 'self-healing', which is the ability to quickly restore power after a disturbance. Due to critical outage events, customer demand or load is at times disconnected or shed temporarily. While deterministic optimisation models have been devised to help operators expedite load shed recovery by h...
Preprint
Full-text available
Rank aggregation is widely used in group decision-making and many other applications where it is of interest to consolidate heterogeneous ordered lists. Oftentimes, these rankings may involve a large number of alternatives , contain ties, and/or be incomplete, all of which complicate the use of robust aggregation methods. In particular, these chara...
Preprint
Full-text available
We introduce a correlation coefficient that is designed to deal with a variety of ranking formats including those containing non-strict (i.e., with-ties) and incomplete (i.e., unknown) preferences. The correlation coefficient is designed to enforce a neutral treatment of incompleteness whereby no assumptions are made about individual preferences in...
Preprint
Full-text available
There are many factors that affect the quality of data received from crowdsourcing, including cognitive biases, varying levels of expertise, and varying subjective scales. This work investigates how the elicitation and integration of multiple modalities of input can enhance the quality of collective estimations. We create a crowdsourced experiment...
Preprint
Full-text available
Wireless sensor networks are a cost-effective means of data collection, especially in areas which may not have significant infrastructure. There are significant challenges associated with the reliability of measurements, in particular due to their distributed nature. As such, it is important to develop methods that can extract reliable state estima...
Preprint
Full-text available
The study of ordering polytopes has been essential to the solution of various challenging combinatorial optimization problems. For instance, the incorporation of facet defining inequalities (FDIs) from these polytopes in branch-and-cut approaches represents among the most effective solution methodologies known to date for some of these problems. Th...
Preprint
Full-text available
This paper seeks to solve the long-term transmission expansion planning problem more effectively by reducing the solution search space and the computational effort. The proposed methodology finds and adds cutting planes based on structural insights about bus angle-differences along paths. Several theorems are proposed which show the validity of the...
Article
Full-text available
Exact solving of systems of linear equations (SLEs) is a fundamental subroutine within number theory, formal verification of mathematical proofs, and exact-precision mathematical programming. Moreover, efficient exact SLE solution methods could be valuable for a growing body of science and engineering applications where current fixed-precision stan...
Article
Full-text available
We introduce a correlation coefficient that is specifically designed to deal with a variety of ranking formats including those containing non-strict (i.e., with-ties) and incomplete (i.e., null) preferences. The new measure, which can be regarded as a generalization of the seminal Kendall tau correlation coefficient, is proven to be equivalent to a...
Article
Full-text available
The roundoff-error-free (REF) LU and Cholesky factorizations, combined with the REF substitution algorithms, allow rational systems of linear equations to be solved exactly and efficiently by working entirely in integer arithmetic. These REF computational tools share two key properties: their constituent divisions are exact, and their matrix entrie...
Article
In many different applications of group decision-making, individual ranking agents or judges are able to rank only a small subset of all available candidates. However, as we argue in this article, the aggregation of these incomplete ordinal rankings into a group consensus has not been adequately addressed. We propose an axiomatic method to aggregat...
Article
Full-text available
In many different applications of group decision-making, individual ranking agents or judges are able to rank only a small subset of all available candidates. However, as we argue in this article, the aggregation of these incomplete ordinal rankings into a group consensus has not been adequately addressed. We propose an axiomatic method to aggregat...
Article
Full-text available
LU and Cholesky factorizations are computational tools for efficiently solving linear systems that play a central role in solving linear programs and several other classes of mathematical programs. In many documented cases, however, the roundoff errors accrued during the construction and implementation of these factorizations lead to the misclassif...
Article
This paper introduces load shed recovery actions for transmission networks by presenting the dc optimal load shed recovery with transmission switching model (DCOLSR-TS). The model seeks to reduce the amount of load shed, which may result due to transmission line and/or generator contingencies, by modifying the bulk power system topology. Since solv...